A fast image matching method based on high-dimensional combined features

In recent years, image matching navigation technology has been developing rapidly, but it is hard to meet the actual requirement of real-time. In this paper, a fast image matching method based on high-dimensional combined features is proposed, and K-dimensional tree (KD-tree) and particle swarm opti...

Full description

Saved in:
Bibliographic Details
Main Authors: Gong Zhe, Leng Xuefei, Liu Yang
Format: Conference Proceeding
Language:English
Subjects:
frame matching
high-dimensional combined feature
image matching
navigation
particle swarm optimization
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 5999
container_issue
container_start_page 5993
container_title
container_volume
creator Gong Zhe
Leng Xuefei
Liu Yang
description In recent years, image matching navigation technology has been developing rapidly, but it is hard to meet the actual requirement of real-time. In this paper, a fast image matching method based on high-dimensional combined features is proposed, and K-dimensional tree (KD-tree) and particle swarm optimization (PSO) algorithm are introduced to improve the matching speed. At first we present a new concept of high-dimensional combined feature, and construct the features of two adjacent frames in sequence images as matching primitives. Then the position relation of two adjacent frame images can be determined according to the geometric constraints among the features. Finally, we introduce KD-tree and PSO algorithm to optimize the search process. The simulation results show that the matching is still completed at the rotation angle of -5 ° to 5 ° and the scale factor of 0.9 to 1.1, meanwhile, the time consumption is within 1 second. As a conclusion, the algorithm can effectively improve the real-time performance of image matching, and is robust to rotation and scale changes, which satisfies the requirements of navigation system.
doi_str_mv 10.23919/ChiCC.2017.8028309
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8028309</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8028309</ieee_id><sourcerecordid>8028309</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-1fcef9059d431e78a2bf5d7f4b4c61b4ea83807286dbd05c4870e8a832158c43</originalsourceid><addsrcrecordid>eNotj8tqwzAURNVCoUnaL8hGP2BXVw9LWgbTNoVAN9kHPa5sldgulrvo39fQrAbmwHCGkD2wmgsL9qXtc9vWnIGuDeNGMHtHttYYUI2wQtyTDYcGKm65fiTbUr4Ya5gFsSHHA02uLDQPrkM6uCX0eezogEs_RepdwUinkfa566uYBxxLnkZ3pWEafB5XmNAtPzOWJ_KQ3LXg8y135Pz2em6P1enz_aM9nKoMWi0VpIDJMmWjFIDaOO6TijpJL0MDXqIzwjDNTRN9ZCpIoxmateSgTJBiR_b_sxkRL9_z6j3_Xm6nxR81_Uvt</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A fast image matching method based on high-dimensional combined features</title><source>IEEE Xplore All Conference Series</source><creator>Gong Zhe ; Leng Xuefei ; Liu Yang</creator><creatorcontrib>Gong Zhe ; Leng Xuefei ; Liu Yang</creatorcontrib><description>In recent years, image matching navigation technology has been developing rapidly, but it is hard to meet the actual requirement of real-time. In this paper, a fast image matching method based on high-dimensional combined features is proposed, and K-dimensional tree (KD-tree) and particle swarm optimization (PSO) algorithm are introduced to improve the matching speed. At first we present a new concept of high-dimensional combined feature, and construct the features of two adjacent frames in sequence images as matching primitives. Then the position relation of two adjacent frame images can be determined according to the geometric constraints among the features. Finally, we introduce KD-tree and PSO algorithm to optimize the search process. The simulation results show that the matching is still completed at the rotation angle of -5 ° to 5 ° and the scale factor of 0.9 to 1.1, meanwhile, the time consumption is within 1 second. As a conclusion, the algorithm can effectively improve the real-time performance of image matching, and is robust to rotation and scale changes, which satisfies the requirements of navigation system.</description><identifier>EISSN: 2161-2927</identifier><identifier>EISBN: 9881563933</identifier><identifier>EISBN: 9789881563934</identifier><identifier>DOI: 10.23919/ChiCC.2017.8028309</identifier><language>eng</language><publisher>Technical Committee on Control Theory, CAA</publisher><subject>frame matching ; high-dimensional combined feature ; image matching ; navigation ; particle swarm optimization</subject><ispartof>2017 36th Chinese Control Conference (CCC), 2017, p.5993-5999</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8028309$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,23911,23912,25121,27906,54536,54913</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8028309$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gong Zhe</creatorcontrib><creatorcontrib>Leng Xuefei</creatorcontrib><creatorcontrib>Liu Yang</creatorcontrib><title>A fast image matching method based on high-dimensional combined features</title><title>2017 36th Chinese Control Conference (CCC)</title><addtitle>ChiCC</addtitle><description>In recent years, image matching navigation technology has been developing rapidly, but it is hard to meet the actual requirement of real-time. In this paper, a fast image matching method based on high-dimensional combined features is proposed, and K-dimensional tree (KD-tree) and particle swarm optimization (PSO) algorithm are introduced to improve the matching speed. At first we present a new concept of high-dimensional combined feature, and construct the features of two adjacent frames in sequence images as matching primitives. Then the position relation of two adjacent frame images can be determined according to the geometric constraints among the features. Finally, we introduce KD-tree and PSO algorithm to optimize the search process. The simulation results show that the matching is still completed at the rotation angle of -5 ° to 5 ° and the scale factor of 0.9 to 1.1, meanwhile, the time consumption is within 1 second. As a conclusion, the algorithm can effectively improve the real-time performance of image matching, and is robust to rotation and scale changes, which satisfies the requirements of navigation system.</description><subject>frame matching</subject><subject>high-dimensional combined feature</subject><subject>image matching</subject><subject>navigation</subject><subject>particle swarm optimization</subject><issn>2161-2927</issn><isbn>9881563933</isbn><isbn>9789881563934</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2017</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj8tqwzAURNVCoUnaL8hGP2BXVw9LWgbTNoVAN9kHPa5sldgulrvo39fQrAbmwHCGkD2wmgsL9qXtc9vWnIGuDeNGMHtHttYYUI2wQtyTDYcGKm65fiTbUr4Ya5gFsSHHA02uLDQPrkM6uCX0eezogEs_RepdwUinkfa566uYBxxLnkZ3pWEafB5XmNAtPzOWJ_KQ3LXg8y135Pz2em6P1enz_aM9nKoMWi0VpIDJMmWjFIDaOO6TijpJL0MDXqIzwjDNTRN9ZCpIoxmateSgTJBiR_b_sxkRL9_z6j3_Xm6nxR81_Uvt</recordid><startdate>201707</startdate><enddate>201707</enddate><creator>Gong Zhe</creator><creator>Leng Xuefei</creator><creator>Liu Yang</creator><general>Technical Committee on Control Theory, CAA</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201707</creationdate><title>A fast image matching method based on high-dimensional combined features</title><author>Gong Zhe ; Leng Xuefei ; Liu Yang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-1fcef9059d431e78a2bf5d7f4b4c61b4ea83807286dbd05c4870e8a832158c43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2017</creationdate><topic>frame matching</topic><topic>high-dimensional combined feature</topic><topic>image matching</topic><topic>navigation</topic><topic>particle swarm optimization</topic><toplevel>online_resources</toplevel><creatorcontrib>Gong Zhe</creatorcontrib><creatorcontrib>Leng Xuefei</creatorcontrib><creatorcontrib>Liu Yang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gong Zhe</au><au>Leng Xuefei</au><au>Liu Yang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A fast image matching method based on high-dimensional combined features</atitle><btitle>2017 36th Chinese Control Conference (CCC)</btitle><stitle>ChiCC</stitle><date>2017-07</date><risdate>2017</risdate><spage>5993</spage><epage>5999</epage><pages>5993-5999</pages><eissn>2161-2927</eissn><eisbn>9881563933</eisbn><eisbn>9789881563934</eisbn><abstract>In recent years, image matching navigation technology has been developing rapidly, but it is hard to meet the actual requirement of real-time. In this paper, a fast image matching method based on high-dimensional combined features is proposed, and K-dimensional tree (KD-tree) and particle swarm optimization (PSO) algorithm are introduced to improve the matching speed. At first we present a new concept of high-dimensional combined feature, and construct the features of two adjacent frames in sequence images as matching primitives. Then the position relation of two adjacent frame images can be determined according to the geometric constraints among the features. Finally, we introduce KD-tree and PSO algorithm to optimize the search process. The simulation results show that the matching is still completed at the rotation angle of -5 ° to 5 ° and the scale factor of 0.9 to 1.1, meanwhile, the time consumption is within 1 second. As a conclusion, the algorithm can effectively improve the real-time performance of image matching, and is robust to rotation and scale changes, which satisfies the requirements of navigation system.</abstract><pub>Technical Committee on Control Theory, CAA</pub><doi>10.23919/ChiCC.2017.8028309</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2161-2927
ispartof 2017 36th Chinese Control Conference (CCC), 2017, p.5993-5999
issn 2161-2927
language eng
recordid cdi_ieee_primary_8028309
source IEEE Xplore All Conference Series
subjects frame matching
high-dimensional combined feature
image matching
navigation
particle swarm optimization
title A fast image matching method based on high-dimensional combined features
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T19%3A55%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20fast%20image%20matching%20method%20based%20on%20high-dimensional%20combined%20features&rft.btitle=2017%2036th%20Chinese%20Control%20Conference%20(CCC)&rft.au=Gong%20Zhe&rft.date=2017-07&rft.spage=5993&rft.epage=5999&rft.pages=5993-5999&rft.eissn=2161-2927&rft_id=info:doi/10.23919/ChiCC.2017.8028309&rft.eisbn=9881563933&rft.eisbn_list=9789881563934&rft_dat=%3Cieee_CHZPO%3E8028309%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-1fcef9059d431e78a2bf5d7f4b4c61b4ea83807286dbd05c4870e8a832158c43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8028309&rfr_iscdi=true