Line segment matching for 3D computer vision using a new iteration scheme

Sheng Lin Chou, Wen-Hsiang Tsai *

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


A new iteration scheme is proposed to solve the line segment matching problem in stereo vision analysis. A match function which directly reflects the requirements of the epipolar and disparity constraints is proposed for line segment matching. The information contained in the match function is used to determine line segment correspondences indirectly. After a match network is established according to the match function values, a new iteration algorithm is employed to tune the strengths of the match links in the match network so that the match network can converge to a stable state. No explicit compatibility coefficient need be defined for computing the support function values in the iterations, resulting in a faster computation speed than those of conventional relaxation matching techniques. The inherent anti-symmetric characteristic of relaxation matching for the image correspondence problem is also avoided naturally. The experimental results show that the proposed iteration scheme is effective and suitable for matching line segments even when images are complicated.

Original languageEnglish
Pages (from-to)191-205
Number of pages15
JournalMachine Vision and Applications
Issue number4
StatePublished - 1 Sep 1993


  • At-most-one-to-one mapping
  • Disparity constraint
  • Epipolar constraint
  • Line segment matching
  • Stereo vision analysis

Fingerprint Dive into the research topics of 'Line segment matching for 3D computer vision using a new iteration scheme'. Together they form a unique fingerprint.

Cite this