A Method of Line Matching Based on Feature Points

This paper proposes a method for line matching based on invariance of feature points. Firstly, feature points are roughly matched by Normalized Cross Correlation (NNC) and Average of Square Difference (ASD). Additionally, feature points obtained from the two views are grouped into matched point pairs. Finally, curve segments between matched point pairs are matched by dynamic programming algorithm with edge potential functions (EPF) taken as the measure. The proposed method makes full use of feature points, the relationship between feature points and the curve, and space information of the gray image.

[1]  Cordelia Schmid,et al.  The Geometry and Matching of Lines and Curves Over Multiple Views , 2000, International Journal of Computer Vision.

[2]  Zhiheng Wang,et al.  HLD: A robust descriptor for line matching , 2009, 2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics.

[3]  Marko Heikkilä,et al.  Description of interest regions with local binary patterns , 2009, Pattern Recognit..

[4]  Hai Tao,et al.  A novel feature descriptor invariant to complex brightness changes , 2009, CVPR.

[5]  Pascal Vasseur,et al.  Central catadioptric line matching for robotic applications , 2010, 2010 IEEE International Conference on Robotics and Automation.

[6]  Gang Hua,et al.  Picking the best DAISY , 2009, CVPR.

[7]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[8]  Cordelia Schmid,et al.  Automatic line matching across views , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  Zhanyi Hu,et al.  MSLD: A robust descriptor for line matching , 2009, Pattern Recognit..

[10]  Raj Gupta,et al.  SMD: A Locally Stable Monotonic Change Invariant Feature Descriptor , 2008, ECCV.

[11]  Francesco G. B. De Natale,et al.  Edge Potential Functions (EPF) and Genetic Algorithms (GA) for Edge-Based Matching of Visual Objects , 2007, IEEE Transactions on Multimedia.

[12]  Dong-Min Woo,et al.  2D Line Matching Using Geometric and Intensity Data , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[13]  Yi Deng,et al.  A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming , 2006, ECCV.

[14]  Qingsheng Zhu,et al.  Auto-Corner Detection Based on the Eigenvalues Product of Covariance Matrices over Multi-Regions of Support , 2010, J. Softw..

[15]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[16]  Luc Van Gool,et al.  Wide-baseline stereo matching with line segments , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[17]  Sukhan Lee,et al.  A novel line matching method based on intersection context , 2010, 2010 IEEE International Conference on Robotics and Automation.

[18]  Dong-Chul Park,et al.  Stereo line matching based on the combination of geometric and intensity data , 2009, 2009 24th International Symposium on Computer and Information Sciences.