[특허]Closest to optimal answer selection technique for single-ship geolocation

BAE Systems Information and Electronic Systems Integration Inc.

검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
검색연산자

검색도움말
검색연산자	기능	검색시 예
()	우선순위가 가장 높은 연산자	예1) (나노 (기계 \| machine))
공백	두 개의 검색어(식)을 모두 포함하고 있는 문서 검색	예1) (나노 기계) 예2) 나노 장영실
\|	두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색	예1) (줄기세포 \| 면역) 예2) 줄기세포 \| 장영실
!	NOT 이후에 있는 검색어가 포함된 문서는 제외	예1) (황금 !백금) 예2) !image
*	검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색	예) semi*
""	따옴표 내의 구문과 완전히 일치하는 문서만 검색	예) "Transform and Quantization"

과학기술 지식인프라 ScienceON

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

특허 상세정보

MyON담기

내보내기 페이스북 공유 트위터 공유 카카오톡 공유

Closest to optimal answer selection technique for single-ship geolocation

특허상세정보
국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	G01S-013/06 G01S-013/00 G01S-019/42 G01S-013/87
미국특허분류(USC)	342/140; 342/146; 342/147; 342/450; 342/463
출원번호	US-0523618 (2012-06-14)
등록번호	US-8963771 (2015-02-24)
발명자 / 주소	Schiffmiller, Richard
출원인 / 주소	BAE Systems Information and Electronic Systems Integration Inc.
대리인 / 주소	Finch & Maloney PLLC
인용정보	피인용 횟수 : 0 인용 특허 : 13

초록
▼

Techniques are disclosed for selecting a closest to optimal radar/emitter location for single-ship applications. In accordance with some embodiments, given single-ship geolocation estimates are organized so that clusters of those estimates can be identified, wherein optimal solutions may be found in consecutive, adjacent segments of distance (bins) along each axis of given a coordinate system. Once the clusters are identified in each axis, an optimal cluster can be selected for each. To determine the closest answer to optimal, the coordinate data points in each of the optimal clusters can be averaged (or other sound mathematical process) for each axis in the coordinate system, so as to provide an optimal 3-D coordinate in the given coordinate system. In other embodiments, the optimal 3-D coordinate can be further used to establish an origin in a second coordinate system (e.g., for conversion from 3-D to 2-D coordinate system).

대표
청구항
▼

1. A computer-implemented method for locating a radar emitter, comprising: identifying, by a processor, a plurality of clusters of radar emitter geolocation data in a first axis of a first coordinate system, wherein each cluster includes a population of geolocation data points and is bound by delimiters;identifying, by a processor, among the plurality of clusters, a main cluster having the largest population of geolocation data points; andcomputing, by a processor, an average coordinate value from the geolocation data points in the main cluster, thereby providing at least part of an optimal emitter geolocation coordinate. 2. The method of claim 1 further comprising at least one of: repeating the method for a second axis of the first coordinate system, thereby providing another part of the optimal emitter geolocation coordinate; andrepeating the method for a third axis of the first coordinate system, thereby providing another part of the optimal emitter geolocation coordinate. 3. The method of claim 1 wherein the delimiters that bound the clusters include at least one of bins having a count at or below a given threshold, a first distance specifying a beginning of a dynamic range reflected in the geolocation data points of the radar emitter geolocation data, and a second distance specifying an end of the dynamic range reflected in the geolocation data points of the radar emitter geolocation data. 4. The method of claim 3 wherein the count below a given threshold is zero. 5. The method of claim 1 wherein identifying a plurality of clusters comprises: determining a bin size for a histogram; andpopulating the histogram, using the bin size, with the geolocation data points of the radar emitter geolocation data. 6. The method of claim 5 wherein determining the bin size comprises: computing an average distance between the geolocation data points of the radar emitter geolocation data, when those data points are sequentially arranged in time; andcomputing the bin size based on the average distance and a total distance reflected in the geolocation data points of the radar emitter geolocation data. 7. The method of claim 5 wherein the bin size is determined empirically. 8. The method of claim 1 wherein the geolocation data points of the radar emitter geolocation data are earth-centered earth-fixed (ECEF) coordinates. 9. The method of claim 1 wherein if two or more clusters have the same largest population of geolocation data points, then the cluster associated with the smaller distance is chosen as the main cluster. 10. The method of claim 1 further comprising: identifying sub-clusters within the main cluster;combining spatially overlapping sub-clusters to form a sub-cluster having a larger population of geolocation data points; andidentifying a sub-cluster having the largest population and rejecting lower population sub-clusters, thereby providing a refined main cluster. 11. The method of claim 10 wherein if two or more sub-clusters have the same largest population of geolocation data points, then the sub-cluster that spans the longer distance is rejected. 12. The method of claim 10 wherein identifying sub-clusters within the main cluster comprises: identifying time gaps between the geolocation data points when those data points are sequentially arranged in time, wherein a time gap is a delimiter between distinct sub-clusters. 13. The method of claim 1 further comprising: converting the geolocation data points of the radar emitter geolocation data to a second coordinate system using the optimal emitter geolocation coordinate as an origin; andrepeating the method for each axis, or a subset of axes, of the second coordinate system. 14. The method of claim 1 further comprising the preliminary step of: receiving the geolocation data points of the radar emitter geolocation data. 15. A non-transient computer-readable medium storing instructions thereon that when executed by one or more processors, cause the following process for locating a radar emitter to be carried out: identifying a plurality of clusters of radar emitter geolocation data in a first axis of a first coordinate system, wherein each cluster includes a population of geolocation data points and is bound by delimiters;identifying, among the plurality of clusters, a main cluster having the largest population of geolocation data points; andcomputing an average coordinate value from the geolocation data points in the main cluster, thereby providing at least part of an optimal emitter geolocation coordinate. 16. The computer-readable medium of claim 15 wherein the process further comprises at least one of: repeating the method for a second axis of the first coordinate system, thereby providing another part of the optimal emitter geolocation coordinate; andrepeating the method for a third axis of the first coordinate system, thereby providing another part of the optimal emitter geolocation coordinate. 17. The computer-readable medium of claim 15 wherein identifying a plurality of clusters comprises: populating a histogram with the geolocation data points of the radar emitter geolocation data. 18. The computer-readable medium of claim 15 wherein if two or more clusters have the same largest population of geolocation data points, then the cluster associated with the smaller distance is chosen as the main cluster. 19. The computer-readable medium of claim 15 wherein the process further comprises: identifying sub-clusters within the main cluster;combining spatially overlapping sub-clusters to form a sub-cluster having a larger population of geolocation data points; andidentifying a sub-cluster having the largest population and rejecting lower population sub-clusters, thereby providing a refined main cluster. 20. A system for locating a radar emitter, comprising: a first module for identifying a plurality of clusters of radar emitter geolocation data in at least one axis of a coordinate system, wherein each cluster includes a population of geolocation data points and is bound by delimiters;a second module for identifying, among the plurality of clusters, a main cluster having the largest population of geolocation data points; anda third module for computing an average coordinate value from the geolocation data points in the main cluster, thereby providing at least part of an optimal emitter geolocation coordinate. 21. The system of claim 20 further comprising: a fourth module for identifying sub-clusters within the main cluster;a fifth module for combining spatially overlapping sub-clusters to form a sub-cluster having a larger population of geolocation data points; anda sixth module for identifying a sub-cluster having the largest population and rejecting lower population sub-clusters, thereby providing a refined main cluster. 22. The system of claim 20 wherein each of the first, second, and third modules are implemented in firmware embedded in a microcontroller having I/O capability for receiving the geolocation data and outputting the optimal emitter geolocation coordinate. 23. The system of claim 20 wherein each of the first, second, and third modules comprise gate-level logic. 24. The system of claim 20 wherein each of the first, second, and third modules are implemented in executable instructions stored in an electronic memory, the system further comprising one or more processors configured to execute the first, second, and third modules.

이 특허에 인용된 특허 (13)

IPC 상위 출원인

내보내기

상세정보
내보내기 구분	파일저장 인쇄 메일전송
구성항목	관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	> 총 건의 자료가 검색되었습니다. > 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) > 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. > 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) > 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오 > ~ > Text(ASCII format) Excel format

과학기술 지식인프라 ScienceON

ScienceON Chatbot

연합인증

특허 상세정보

Closest to optimal answer selection technique for single-ship geolocation

초록
▼

대표
청구항
▼

이 특허에 인용된 특허 (13)

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

ScienceON Chatbot

연합인증

특허 상세정보

Closest to optimal answer selection technique for single-ship geolocation

초록 ▼

대표청구항 ▼

이 특허에 인용된 특허 (13)

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

초록
▼

대표
청구항
▼