A New Method for Line Matching
To exploit the existing mature technology of points matching and combine the concept of edge potential functions (EPF), proposing a new method to match curve segments. The method makes full of feature points, the relation between feature points and curves, and gray space, has matching accuracy, and narrows down the searching space and improves the speed of matching.
Unable to display preview. Download preview PDF.
This work is sponsored by Project No10XLB19 supported by Dr. Research Funds of Chongqing Normal University, Chongqing Education Committee (KJ090809) and Chongqing Higher Education Educational Reform (NO:102118).
- Cordelia Schmid, Andrew Zisserman. Automatic Line Matching across Views. International Conference on Computer Vision & Pattern Recognition (1997) 666–671.Google Scholar
- C. Schmid, A. Zisserman, Automatic line matching across views. IEEE International Conference on Computer Vision and Pattern Recognition (1997).Google Scholar
- C. Schmid, A. Zisserman, The geometry and matching of lines and curves over multiple views, Int. J. Comput. Vision 40 (3) (2000) 199–233.Google Scholar
- Y. Deng, X.Y. Lin, A fast line segment based dense stereo algorithm using tree dynamic programming, in: European Conference on Computer Vision (2006).Google Scholar
- Herbert Bay, Vittorio Ferrari, Luc Van Gool. Wide-Baseline Stereo Matching with Line Segments. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, San Diego, June (2005).Google Scholar
- Zhiheng Wang, Fuchao Wu, Zhanyi Hu. A robust descriptor for line matching Pattern. nt. J. Comput. Vision, (2002) 42 (3): 189–204.Google Scholar
- Minh-Son Dao, Francesco G. B., De Natale, Andrea Massa. Edge Potential Functions (EPF) and Genetic Algorithms (GA) for Edge-Based Matching of Visual Objects. IEEE Transactions on Multimedia, Vol.9, No. 1, January (2007).Google Scholar