Sparse representation with geometric configuration constraint for line segment matching

Abstract

In the paper we propose a novel line segment matching method over multiple views based on sparse representation with geometric configuration constraint. The significant idea of the paper is that we transfer the issue of line correspondence into a sparsity based line recognition. At first, line segments are detected by a LSD (line segment detector) and clustered according to spatial proximity to form completed lines. For each point within a line, SIFT is extracted to represent the attribute of point and PHOG is also considered to describe the appearance of the patch centered at the point. SIFT and PHOG are simply concatenated as a single feature vector and then all these point features are put together by a max pooling function to form a distinctive line signature. Then, all line features extracted from training images are trained into a dictionary using sparse coding. Lines with the same similarity may fall together in the high-dimensional feature space. Finally, line segments in a test view are matched to their counterparts in other views by seeking maximal pulses from the coefficient vector. Under our framework, line segments are trained once and matched across all other views. Experimental results have validated the effectiveness of the approach for planar structured scenes under various transformations and degradation, such as viewpoint change, illumination, blur and compression corruption.