A Fast Feature Matching Algorithm Based on Multi Scale Spatial Segmentation Technology

Shu Rong Li; Yuan Yuan Huang; Zuo Jin Hu

doi:10.4028/www.scientific.net/AMM.490-491.1217

Paper Titles

Electronic Nose Based on Conducting Polymers for the Discrimination of Medicinal Plants
p.1194

A Comparison of Sandbox Technologies Used in Online Judge Systems
p.1201

The Performance Analysis of CDMA Traffic Access Self-Similar Equalization Protocol
p.1205

A Microclimate Monitor Sensor Network with an Effective Data Aggression Algorithm
p.1209

A Fast Feature Matching Algorithm Based on Multi Scale Spatial Segmentation Technology
p.1217

Block-Wise Background Subtraction Based on Gaussian Mixture Models
p.1221

Analysis and Simulation of Meteorological Wind Fields Based on Wavelet Transform
p.1228

A Scalable Distributed System for Multi-User Virtual Environments
p.1237

Research on Natural Ventilation Effect Based on Ventilation Network Model - Case Study of an Office Building in Chongqing, China
p.1243

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 490-491A Fast Feature Matching Algorithm Based on Multi...

A Fast Feature Matching Algorithm Based on Multi Scale Spatial Segmentation Technology

Abstract:

SIFT (Scale invariant feature transform) and correlative algorithms are now widely used in content based image retrieval technology. They compute distance and use neighbor algorithm to look for the optimal matching couples. The disadvantage of such way is high complexity, especially when huge amount of images need to be retrieved or recognized. To solve this problem, a new matching way based on feature space division under multi-scale is proposed. The algorithm will divide the feature space under multiple scales, so that those feature points which are located in somewhere can use a code to represent, and finally realize the matching through the code. Without calculating distance, the algorithm complexity is greatly reduced. Experiments show that, the algorithm keeps the matching accuracy and greatly enhance the efficiency of the matching at the same time.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 490-491)

Pages:

1217-1220

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.490-491.1217

Citation:

Cite this paper

Online since:

January 2014

Authors:

Shu Rong Li, Yuan Yuan Huang, Zuo Jin Hu

Keywords:

Binary Coding, Feature Matching, Multi Scale, Space Division

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Yue Sicong, Wang Qing, Zhao Rongchun. Robust Wide Baseline Point Matching Based on Scale Invariant Feature Descriptor. Chinese Journal of Aeronautics, 2009, 22(2009): 70~74.

DOI: 10.1016/s1000-9361(08)60070-9

Google Scholar

[2] Ke, Y., Sukthankar. PCA-SIFT: A more distinctive representation for local image descriptors. Proc of the IEEE 1997 Computer Society Conference on Computer Vision and Pattern Recognition, 2004: 506–513.

DOI: 10.1109/cvpr.2004.1315206

Google Scholar

[3] H. Bay, T. Tuytelaars, L. Van Gool. Speeded up robust features. Proc of European Conference on Computer Vision, 2006, 1: 404-417.

DOI: 10.1007/11744023_32

Google Scholar

[4] ShaoLi Huang, Cheng Cai, FengFu Zhao. An efficient wood image retrieval using SURF descriptor. Proc of 2009 International Conference on Test and Measurement, 2009, vol (2): 55 – 58.

DOI: 10.1109/ictm.2009.5413007

Google Scholar

[5] Liu Yu, Xiong Youlun. Algorithm for searching nearest-neighbor based on the bounded k-d tree. Journal of Huazhong University of Science and Technology (Nature Science), 2008, 36(7): 73-76.

Google Scholar

[6] K. Grauman, T. Darrell. The Pyramid Match Kernel: Efficient Learning with Sets of Features. Journal of Machine Learning Research, 2007, 8(Apr): 725-760.

Google Scholar