Abstract
We present a novel line segment matching method based on sparse representation with geometric configuration constraint. The significant idea is that we transfer the line matching issue into sparsity based line recognition. At first, line segments are detected by LSD detector and clustered according to spatial proximity to form completed lines. SIFT is used to represent points in the line segments and all point features are put together to form a distinctive descriptor. Line feature is then represented by a max pooling function. Features of all line segments are trained into a dictionary using sparse coding. Lines with the same similarity may fall together in the high dimensional feature space. Finally, lines in one view are matched to their counterparts in other views by seeking pulses from the coefficient vector. Under our framework, line segment is trained once and can be matched over all other views. When compared to matching approaches based on local invariant features, our method shows encouraging results with high efficiency. Experiment results have validated the effectiveness for planar structured scenes under various transformations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bay, H., Ferrari, V., Gool, L.V.: Wide-baseline stereo matching with line segments. In: CVPR (2005)
Wang, Z., Wu, F., Hu, Z.: MSLD: A robust descriptor for line matching. Pattern Recognition 39, 889–896 (2009)
Wang, L., Neumann, U., You, S.: Wide-baseline image matching using line signatures. In: ICCV (2009)
Fan, B., Wu, F., Hu, Z.: Line matching leveraged by point correspondences. In: CVPR, pp. 390–397 (2010)
Gioi, R., Jakubowicz, J., Morel, J., Randall, G.: LSD: A fast line segment detector with a false detection control. PAMI 32(4), 722–732 (2010)
Serre, T., Wolf, L., Poggio, T.: Object recognition with features inspired by visual cortex. In: CVPR (2005)
Basri, R., Jacobs, D.: Lambertian reflection and linear subspaces. PAMI 25(3), 218–233 (2003)
Donoho, D.L., Elad, M.: Optimal sparse representation in general (non-orthogonal) dictionaries via l1 minimization. Proc. of the National Academy of Sciences 100, 2197–2202 (2003)
Wright, J., Yang, A., Ganesh, A., Sastry, S., Ma, Y.: Robust face recognition via sparse representation. PAMI 31(2), 201–227 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Q., Chen, T. (2012). Sparse Representation with Geometric Configuration Constraint for Line Segment Matching. In: Zhang, Y., Zhou, ZH., Zhang, C., Li, Y. (eds) Intelligent Science and Intelligent Data Engineering. IScIDE 2011. Lecture Notes in Computer Science, vol 7202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31919-8_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-31919-8_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31918-1
Online ISBN: 978-3-642-31919-8
eBook Packages: Computer ScienceComputer Science (R0)