Flight path association rapid clustering method based on improved OSPA distance index
The invention discloses a rapid clustering method based on an improved OSPA distance index, and aims to solve the problem of ship track association in a scene that three sensors monitor a plurality of ships in a VTS system of a maritime affair supervision department. The traditional OSPA distance in...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | WANG JIE LUO XINPENG LAI QIUYU ZHU XIANGYU |
description | The invention discloses a rapid clustering method based on an improved OSPA distance index, and aims to solve the problem of ship track association in a scene that three sensors monitor a plurality of ships in a VTS system of a maritime affair supervision department. The traditional OSPA distance index uses the Hungary algorithm to find the optimal matching, and in the method, the time complexity of the OSPA distance index to find the optimal matching is reduced by using the time unidirectivity, and the linear level of the track length is achieved. In one embodiment, according to the fast clustering algorithm, all tracks needing to be associated are added into a queue, then the head track of the queue and the remaining tracks are taken to calculate an OSPA distance index, if the numerical value is larger than a cut-off distance c, it is judged that the two tracks are not the tracks of the same ship, and otherwise, the two tracks are the monitoring tracks of the same ship. Compared with other clustering algori |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN114548312A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN114548312A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN114548312A3</originalsourceid><addsrcrecordid>eNqNyjEOwjAMQNEuDAi4gzkAQ2iRWKuKigmQgLkyiWkstUkUG8Tx6cABmP4f3ry4twP3XiGhekCRaBmVY4CMiR3Y4SVKmUMPI6mPDh4o5GACPKYc39Ofr5caHItisAQcHH2WxeyJg9Dq10Wxbg-35rihFDuShJYCadecjKl21b4027r8x3wByJc45w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Flight path association rapid clustering method based on improved OSPA distance index</title><source>esp@cenet</source><creator>WANG JIE ; LUO XINPENG ; LAI QIUYU ; ZHU XIANGYU</creator><creatorcontrib>WANG JIE ; LUO XINPENG ; LAI QIUYU ; ZHU XIANGYU</creatorcontrib><description>The invention discloses a rapid clustering method based on an improved OSPA distance index, and aims to solve the problem of ship track association in a scene that three sensors monitor a plurality of ships in a VTS system of a maritime affair supervision department. The traditional OSPA distance index uses the Hungary algorithm to find the optimal matching, and in the method, the time complexity of the OSPA distance index to find the optimal matching is reduced by using the time unidirectivity, and the linear level of the track length is achieved. In one embodiment, according to the fast clustering algorithm, all tracks needing to be associated are added into a queue, then the head track of the queue and the remaining tracks are taken to calculate an OSPA distance index, if the numerical value is larger than a cut-off distance c, it is judged that the two tracks are not the tracks of the same ship, and otherwise, the two tracks are the monitoring tracks of the same ship. Compared with other clustering algori</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; HANDLING RECORD CARRIERS ; PHYSICS ; PRESENTATION OF DATA ; RECOGNITION OF DATA ; RECORD CARRIERS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220527&DB=EPODOC&CC=CN&NR=114548312A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220527&DB=EPODOC&CC=CN&NR=114548312A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>WANG JIE</creatorcontrib><creatorcontrib>LUO XINPENG</creatorcontrib><creatorcontrib>LAI QIUYU</creatorcontrib><creatorcontrib>ZHU XIANGYU</creatorcontrib><title>Flight path association rapid clustering method based on improved OSPA distance index</title><description>The invention discloses a rapid clustering method based on an improved OSPA distance index, and aims to solve the problem of ship track association in a scene that three sensors monitor a plurality of ships in a VTS system of a maritime affair supervision department. The traditional OSPA distance index uses the Hungary algorithm to find the optimal matching, and in the method, the time complexity of the OSPA distance index to find the optimal matching is reduced by using the time unidirectivity, and the linear level of the track length is achieved. In one embodiment, according to the fast clustering algorithm, all tracks needing to be associated are added into a queue, then the head track of the queue and the remaining tracks are taken to calculate an OSPA distance index, if the numerical value is larger than a cut-off distance c, it is judged that the two tracks are not the tracks of the same ship, and otherwise, the two tracks are the monitoring tracks of the same ship. Compared with other clustering algori</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>HANDLING RECORD CARRIERS</subject><subject>PHYSICS</subject><subject>PRESENTATION OF DATA</subject><subject>RECOGNITION OF DATA</subject><subject>RECORD CARRIERS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyjEOwjAMQNEuDAi4gzkAQ2iRWKuKigmQgLkyiWkstUkUG8Tx6cABmP4f3ry4twP3XiGhekCRaBmVY4CMiR3Y4SVKmUMPI6mPDh4o5GACPKYc39Ofr5caHItisAQcHH2WxeyJg9Dq10Wxbg-35rihFDuShJYCadecjKl21b4027r8x3wByJc45w</recordid><startdate>20220527</startdate><enddate>20220527</enddate><creator>WANG JIE</creator><creator>LUO XINPENG</creator><creator>LAI QIUYU</creator><creator>ZHU XIANGYU</creator><scope>EVB</scope></search><sort><creationdate>20220527</creationdate><title>Flight path association rapid clustering method based on improved OSPA distance index</title><author>WANG JIE ; LUO XINPENG ; LAI QIUYU ; ZHU XIANGYU</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN114548312A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2022</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>HANDLING RECORD CARRIERS</topic><topic>PHYSICS</topic><topic>PRESENTATION OF DATA</topic><topic>RECOGNITION OF DATA</topic><topic>RECORD CARRIERS</topic><toplevel>online_resources</toplevel><creatorcontrib>WANG JIE</creatorcontrib><creatorcontrib>LUO XINPENG</creatorcontrib><creatorcontrib>LAI QIUYU</creatorcontrib><creatorcontrib>ZHU XIANGYU</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>WANG JIE</au><au>LUO XINPENG</au><au>LAI QIUYU</au><au>ZHU XIANGYU</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Flight path association rapid clustering method based on improved OSPA distance index</title><date>2022-05-27</date><risdate>2022</risdate><abstract>The invention discloses a rapid clustering method based on an improved OSPA distance index, and aims to solve the problem of ship track association in a scene that three sensors monitor a plurality of ships in a VTS system of a maritime affair supervision department. The traditional OSPA distance index uses the Hungary algorithm to find the optimal matching, and in the method, the time complexity of the OSPA distance index to find the optimal matching is reduced by using the time unidirectivity, and the linear level of the track length is achieved. In one embodiment, according to the fast clustering algorithm, all tracks needing to be associated are added into a queue, then the head track of the queue and the remaining tracks are taken to calculate an OSPA distance index, if the numerical value is larger than a cut-off distance c, it is judged that the two tracks are not the tracks of the same ship, and otherwise, the two tracks are the monitoring tracks of the same ship. Compared with other clustering algori</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | chi ; eng |
recordid | cdi_epo_espacenet_CN114548312A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING HANDLING RECORD CARRIERS PHYSICS PRESENTATION OF DATA RECOGNITION OF DATA RECORD CARRIERS |
title | Flight path association rapid clustering method based on improved OSPA distance index |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T21%3A19%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=WANG%20JIE&rft.date=2022-05-27&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN114548312A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |