测绘通报 ›› 2018, Vol. 0 ›› Issue (5): 29-34.doi: 10.13474/j.cnki.11-2246.2018.0139

Previous Articles     Next Articles

Line Segment Matching Based on Geometric Constraints and Gradient Descriptor

WANG Jingxue, ZHANG Xue   

  1. School of Geometrics, Liaoning Technical University, Fuxin 123000, China
  • Received:2017-08-07 Online:2018-05-25 Published:2018-05-31

Abstract:

Aiming at the reliability of line segment matching under the condition of non-constraint,this paper proposed a line matching algorithm based on geometric constraints and gradient descriptor.Based on the corresponding points and straight line extraction results,the algorithm firstly determined the candidate lines by corresponding triangulations and epipolar constraints.Secondly,it determined the overlapping of the candidate line which corresponding the reference line based on the epipolar of reference line endpoints.Thirdly,based on corresponding overlapping segments,it established straight line parallel support region for reference line and candidate line respectively,and then constructed gradient magnitude mean-standard deviation descriptor with Gaussian convolution.Finally,the corresponding line was determined by Euclidean distance in descriptors and nearest neighbor distance ratio.Experimental studies are carried out with different kinds of images,and the results show that the proposed method is reliable for line matching.

Key words: gradient magnitude descriptor, triangulation constraint, epipolar constraint, straight line parallel support region, nearest neighbor distance ratio

CLC Number: