Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arnold RD, Binford TO (1980) Geometric constraints in stereo vision. Proc SPIE (238) — Image Processing for Missile Guidance
Barnard ST, Thompson WB (1980) Disparity analysis of images. IEEE Trans Pattern Anal Mach Intell 2(4):333–340
Barnard ST, Fischler MA (1982) Computational stereo. ACM Comput Surv 14(4):553–572
Boyer KL, Kak AC (1988) Structural stereopsis for 3-D vision. IEEE Trans Pattern Anal Mach Intell 10(2): 144–166
Chou SL, Tsai WH (1991) Recognizing handwritten Chinese characters by stroke segment matching using an iteration scheme. Int J Pattern Recog Artif Intell 5(1,2)
Davis LS (1979) Shape matching using relaxation techniques. IEEE Trans Pattern Anal Mach Intell 1(1):66–72
Garey MR, Johnson D (1979) Computers and intractability — a guide to the theory of NP-completeness. Freeman, San Francisco
Hancock ER, Kittler J (1990) Edge-labeling using dictionary-based relaxation. IEEE Trans Pattern Anal Mach Intell 12(2): 165–180
Horaud R, Skordas T (1989) Stereo correspondence through feature grouping and maximal cliques. IEEE Trans Pattern Anal Mach Intell 11(11):1168–1180
Ibison MC, Zapalowski L (1986) On the use of relaxation labeling in the correspondence problem. Pattern Recog Lett 4(4): 103–109
Marr D, Poggio T (1977) A theory of human stereo vision. MIT AI Lab Tech Rep AI Memo 451
Matsuyama T, Arita H, Nagao M (1984) Structural matching of line drawing using the geometric relationship between line segments. Comput Vision Graph Image Proc 27:177–194
Mcintosh JH, Mutch KM (1988) Matching straight lines. Comput Vision Graph Image Proc 43:386–408
Medioni G, Nevatia R (1984) Matching images using linear features. IEEE Trans Pattern Anal Mach Intell 6(6):675–685
Medioni G, Nevatia R (1985) Segment-based stereo matching. Comput Vision Graph Image Proc 31:2–18
Nevatia R, Babu KR (1980) Linear feature extraction and description. Comput Vision Graph Image Proc 13:257–269
Ohta Y, Kanade T (1985) Stereo by intra- and inter-scanline search using dynamic programming. IEEE Trans Pattern Anal Mach Intell 7(2): 139–154
Price K (1985) Relaxation matching techniques — a comparison. IEEE Trans Pattern Anal Mach Intell 7(5):617–623
Price K (1986) Hierarchical matching using relaxation. Comput Vision Graph Image Proc 34:66–75
Wang CY, Sun H, Rosenfeld A (1983) Some experiments in relaxation image matching using corner features. Pattern Recog 16(2):167–182
Yamamoto K, Yamada H, Saito T, Sakaga I (1986) Recognition of handprinted characters in the first level of JIS Chinese characters. Proc Int Conf Pattern Recogn 8:570–572
Yuille AL, Poggio T (1984) A generalized ordering constraint for stereo correspondence. MIT AI Lab Tech Rep AI Memo 777
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chou, SL., Tsai, WH. Line segment matching for 3D computer vision using a new iteration scheme. Machine Vis. Apps. 6, 191–205 (1993). https://doi.org/10.1007/BF01212297
Issue Date:
DOI: https://doi.org/10.1007/BF01212297