Message Board

Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review,        editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!

Name
E-mail
Phone
Title
Content
Verification Code
Turn off MathJax
Article Contents

LIU Suyan, WANG Jingxue, SHEN Zhaoyu, WANG Qiang. Line Matching Algorithm Based on Pair-wise Geometric Features and Individual Line Descriptor Constraints[J]. Geomatics and Information Science of Wuhan University. doi: 10.13203/j.whugis20210147
Citation: LIU Suyan, WANG Jingxue, SHEN Zhaoyu, WANG Qiang. Line Matching Algorithm Based on Pair-wise Geometric Features and Individual Line Descriptor Constraints[J]. Geomatics and Information Science of Wuhan University. doi: 10.13203/j.whugis20210147

Line Matching Algorithm Based on Pair-wise Geometric Features and Individual Line Descriptor Constraints

doi: 10.13203/j.whugis20210147
Funds:

The National Natural Science Foundation of China (41871379, 42071343, 42001412)

  • Received Date: 2021-03-24
  • Objectives: In the field of line matching and checking, the geometric attributes of the individual line are weakly stable, and non one-to-one matching results are difficult to be checked. To address the problems above, a line matching algorithm based on pair-wise geometric features and individual line descriptor constraints was proposed. Methods: For matching process, firstly two line segments which satisfied certain geometric constraints in the neighborhood were grouped into a line pair and matched as a whole. Secondly, the epipolar constraint of the intersection in the line pair was used to determine the matching range. Then characteristic angles within line pairs, distance ratio between line segments and the radiation information of the neighborhood of line pairs were used to narrow the range of the matching candidates. Finally, the final matching pairs was obtained by caculating the gray similarity of triangle region. For checking process, initially according to the angle of line with epipolar and the slope of line, the corresponding relation between individual lines was established. Moreover, each corresponding line pair was split into two groups of corresponding individual lines. Then, descriptors were established for two single lines in each group and the similarity between the two line descriptors was calculated. Eventually, collinear geometry and descriptor similarity were combined to check the matching results, eliminate the false matches. Collinear lines in the results were merged and one-to-one matching results were obtained. Results: Aerial images with typical texture features and close-range images of different transformation types were selected for experiments. The results demonstrate that the proposed algorithm has a high matching accuracy. The matching accuracy rate is higher than 95% in complex scenes with similar texture, perspective change, rotation change, scale change and illumination change. Conclusions: The proposed algorithm has good robustness to different types of images, and also has advantages for complex line matching check.
  • [1] Wang H, Jia Z H, Zhang Y F. Aerial Image Matching Based on NSST and Quaternion Exponential Moment[J]. International Journal of Performability Engineering, 2018, 14(11).
    [2] Manuel H, Michael M, Horst B. Efficient 3D Scene Abstraction Using Line Segments[J]. Computer Vision and Image Understanding, 2017, 157:167-178.
    [3] Schmid C and Zisserman A. Automatic Line Matching Across Views[C]. IEEE International Conference on Computer Vision and Pattern Recognition, 1997, 666-671.
    [4] Schmid C, Zisserman A. The Geometry and Matching of Lines and Curves Over Multiple Views[J]. International Journal of Computer Vision, 2000, 40(3):199-233.
    [5] Jia Q, Fan X, Gao X K, et al. Line Matching Based on Line-Points Invariant and Local Homography[J]. Pattern Recognition,2018, 81:471-483.
    [6] Wang Z H, Wu F C, Hu Z Y. MSLD:A Robust Descriptor for Line Matching[J]. Pattern Recognition, 2009, 42(5):941-953.
    [7] Xing J, Wei Z, Zhang G. A Line Matching Method Based on Multiple Intensity Ordering with Uniformly Spaced Sampling[J]. Sensors (Basel, Switzerland), 2020, 20(6).
    [8] Wang L, Neumann U, You S. Wide-Baseline Image Matching Using Line Signatures[C]. 2009 IEEE 12th International Conference on Computer Vision. IEEE, 2010.
    [9] Al-Shahri M, Yilmaz A. Line Matching in Wide-Baseline Stereo:A Top-Down Approach[J]. IEEE Transactions on Image Processing, 2014, 23(9):4199-4210.
    [10] Li K, Yao J, Lu X, et al. Hierarchical Line Matching Based on Line-Junction-Line Structure Descriptor and Local Homography Estimation[J]. Neurocomputing, 2016, 184:207-220.
    [11] Li K, Yao J. Line Segment Matching And Reconstruction via Exploiting Coplanar Cues[J]. ISPRS Journal of Photogrammetry and Remote Sensing, 2017, 125:33-49.
    [12] Kim H, Lee S. A Novel Line Matching Method Based on Intersection Context[C]. IEEE International Conference on Robotics and Automation, 2010, 1014-1021.
    [13] Kim H, Lee S. Simultaneous Line Matching and Epipolar Geometry Estimation Based on the Intersection Context of Coplanar Line Pairs[J]. Pattern Recognition Letters, 2012, 33(10):1349-1363.
    [14] Li K, Yao J, Lu X. Robust Line Matching Based on Ray-Point-Ray Structure Descriptor[J]. Asian Conference on Computer Vision. Springer International Publishing. 2014.
    [15] OK A O, Wegner J D, Heipke C, et al. Matching of Straight Line Segments from Aerial Stereo Images of Urban Areas[J]. ISPRS Journal of Photogrammetry and Remote Sensing, 2012, 74(1):133-152.
    [16] Gioi R G V, Jakubowicz J, Morel J M, et al. LSD:A Fast Line Segment Detector with a False Detection Control[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(4):722-732.
    [17] Tola E, Lepetit V, Fua P. Daisy:An Efficient Dense Descriptor Applied to Wide-Baseline Stereo[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(5):815-816
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Article Metrics

Article views(309) PDF downloads(10) Cited by()

Related
Proportional views

Line Matching Algorithm Based on Pair-wise Geometric Features and Individual Line Descriptor Constraints

doi: 10.13203/j.whugis20210147
Funds:

The National Natural Science Foundation of China (41871379, 42071343, 42001412)

Abstract: Objectives: In the field of line matching and checking, the geometric attributes of the individual line are weakly stable, and non one-to-one matching results are difficult to be checked. To address the problems above, a line matching algorithm based on pair-wise geometric features and individual line descriptor constraints was proposed. Methods: For matching process, firstly two line segments which satisfied certain geometric constraints in the neighborhood were grouped into a line pair and matched as a whole. Secondly, the epipolar constraint of the intersection in the line pair was used to determine the matching range. Then characteristic angles within line pairs, distance ratio between line segments and the radiation information of the neighborhood of line pairs were used to narrow the range of the matching candidates. Finally, the final matching pairs was obtained by caculating the gray similarity of triangle region. For checking process, initially according to the angle of line with epipolar and the slope of line, the corresponding relation between individual lines was established. Moreover, each corresponding line pair was split into two groups of corresponding individual lines. Then, descriptors were established for two single lines in each group and the similarity between the two line descriptors was calculated. Eventually, collinear geometry and descriptor similarity were combined to check the matching results, eliminate the false matches. Collinear lines in the results were merged and one-to-one matching results were obtained. Results: Aerial images with typical texture features and close-range images of different transformation types were selected for experiments. The results demonstrate that the proposed algorithm has a high matching accuracy. The matching accuracy rate is higher than 95% in complex scenes with similar texture, perspective change, rotation change, scale change and illumination change. Conclusions: The proposed algorithm has good robustness to different types of images, and also has advantages for complex line matching check.

LIU Suyan, WANG Jingxue, SHEN Zhaoyu, WANG Qiang. Line Matching Algorithm Based on Pair-wise Geometric Features and Individual Line Descriptor Constraints[J]. Geomatics and Information Science of Wuhan University. doi: 10.13203/j.whugis20210147
Citation: LIU Suyan, WANG Jingxue, SHEN Zhaoyu, WANG Qiang. Line Matching Algorithm Based on Pair-wise Geometric Features and Individual Line Descriptor Constraints[J]. Geomatics and Information Science of Wuhan University. doi: 10.13203/j.whugis20210147
Reference (17)

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return