An Efficient Algorithm for Improved Shape Context Feature's Cost Matrix Computation

Article Preview

Abstract:

Shape context is not rotation invariant as a local visual feature. To solve this problem, 2-D and 1-D Fourier Transformation has been performed on the feature. Based on the property of Fourier Transformation, a fast and efficient method is presented in the cost matrix computation of these improved shape context feature. The analysis shows the time complexity is much lower and the experiments show effective and efficiency of this new algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1631-1635

Citation:

Online since:

June 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] David G. Lowe, Object recognition from local scale-invariant features,. Proceedings of the International Conference on Computer Vision. September 1999. pp.1150-1157.

DOI: 10.1109/iccv.1999.790410

Google Scholar

[2] Serge Belongie, Greg Mori and Jitendra Malik, Matching with Shape Contexts,. IEEE Workshop on Content based Access of Image and Video Libraries (CBAIVL-2000).

DOI: 10.1109/ivl.2000.853834

Google Scholar

[3] Su Yang, Yuanyuan Wang, Rotation Invariant Shape Contexts based on Feature-space Fourier Transformation, IEEE Fourth International Conference on Image and Graphs, 2007, pp.575-579.

DOI: 10.1109/icig.2007.18

Google Scholar

[4] Shanshan Li, Xiuqing Wu, Improved shape context based on 1-D Fourier transformation, Journal of University of Science and Technology of China, Oct. 2010, Vol. 40, No. 10, pp: 1065-1073.

Google Scholar

[5] Haili Chui, Anand Rangarajan, A New Algorithm for Non-Rigid Point Matching, IEEE Conference on Computer Vision and Pattern Recognition(CVPR), 2000, volume II, pp.44-51.

DOI: 10.1109/cvpr.2000.854733

Google Scholar