Multi-polyhedron reconstruction in a three-view system using relaxation

Jinn Kwei Guo, Chin-Hsing Chen, Jiann Der Lee

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, two stereo matching algorithms based on relaxation are proposed for finding the correspondences among multi-polyhedron objects in a three-view system. In the first algorithm, the feature points on the second image near the intersection of the two epipolar lines derived from the first and the third images are considered as possible correspondences. In the second algorithm, the features near either epipolar line, instead of the features near the intersection of the two crossing epipolar lines as in the first algorithm, are considered as possible correspondences. The initial probability for every triplet is assigned according to the distance from the intersection of the two crossing epipolar lines (or one of the two epipolar lines) to the feature location. Connection relationship between feature points is then used in the relaxation model to resolve the ambiguious correspondence triplets. Experimental results show that the first matching algorithm is faster and requires smaller memory, while the second matching algorithm is slower but more reliable. For acute angles smaller than 60°, the first algorithm becomes unreliable and one has to appeal to the second algorithm. By properly choosing one of the two algorithms proposed, 3D multiple polyhedra in a complex scence can be successfully reconstructed with arbitrary camera configurations in a three-view system.

Original languageEnglish
Pages (from-to)171-193
Number of pages23
JournalSignal Processing
Volume77
Issue number2
DOIs
Publication statusPublished - 1999 Jan 1

Fingerprint

Cameras
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Cite this

Guo, Jinn Kwei ; Chen, Chin-Hsing ; Lee, Jiann Der. / Multi-polyhedron reconstruction in a three-view system using relaxation. In: Signal Processing. 1999 ; Vol. 77, No. 2. pp. 171-193.
@article{0d1c4245258a4133b4d116ca9df05994,
title = "Multi-polyhedron reconstruction in a three-view system using relaxation",
abstract = "In this paper, two stereo matching algorithms based on relaxation are proposed for finding the correspondences among multi-polyhedron objects in a three-view system. In the first algorithm, the feature points on the second image near the intersection of the two epipolar lines derived from the first and the third images are considered as possible correspondences. In the second algorithm, the features near either epipolar line, instead of the features near the intersection of the two crossing epipolar lines as in the first algorithm, are considered as possible correspondences. The initial probability for every triplet is assigned according to the distance from the intersection of the two crossing epipolar lines (or one of the two epipolar lines) to the feature location. Connection relationship between feature points is then used in the relaxation model to resolve the ambiguious correspondence triplets. Experimental results show that the first matching algorithm is faster and requires smaller memory, while the second matching algorithm is slower but more reliable. For acute angles smaller than 60°, the first algorithm becomes unreliable and one has to appeal to the second algorithm. By properly choosing one of the two algorithms proposed, 3D multiple polyhedra in a complex scence can be successfully reconstructed with arbitrary camera configurations in a three-view system.",
author = "Guo, {Jinn Kwei} and Chin-Hsing Chen and Lee, {Jiann Der}",
year = "1999",
month = "1",
day = "1",
doi = "10.1016/S0165-1684(99)00031-6",
language = "English",
volume = "77",
pages = "171--193",
journal = "Signal Processing",
issn = "0165-1684",
publisher = "Elsevier",
number = "2",

}

Multi-polyhedron reconstruction in a three-view system using relaxation. / Guo, Jinn Kwei; Chen, Chin-Hsing; Lee, Jiann Der.

In: Signal Processing, Vol. 77, No. 2, 01.01.1999, p. 171-193.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multi-polyhedron reconstruction in a three-view system using relaxation

AU - Guo, Jinn Kwei

AU - Chen, Chin-Hsing

AU - Lee, Jiann Der

PY - 1999/1/1

Y1 - 1999/1/1

N2 - In this paper, two stereo matching algorithms based on relaxation are proposed for finding the correspondences among multi-polyhedron objects in a three-view system. In the first algorithm, the feature points on the second image near the intersection of the two epipolar lines derived from the first and the third images are considered as possible correspondences. In the second algorithm, the features near either epipolar line, instead of the features near the intersection of the two crossing epipolar lines as in the first algorithm, are considered as possible correspondences. The initial probability for every triplet is assigned according to the distance from the intersection of the two crossing epipolar lines (or one of the two epipolar lines) to the feature location. Connection relationship between feature points is then used in the relaxation model to resolve the ambiguious correspondence triplets. Experimental results show that the first matching algorithm is faster and requires smaller memory, while the second matching algorithm is slower but more reliable. For acute angles smaller than 60°, the first algorithm becomes unreliable and one has to appeal to the second algorithm. By properly choosing one of the two algorithms proposed, 3D multiple polyhedra in a complex scence can be successfully reconstructed with arbitrary camera configurations in a three-view system.

AB - In this paper, two stereo matching algorithms based on relaxation are proposed for finding the correspondences among multi-polyhedron objects in a three-view system. In the first algorithm, the feature points on the second image near the intersection of the two epipolar lines derived from the first and the third images are considered as possible correspondences. In the second algorithm, the features near either epipolar line, instead of the features near the intersection of the two crossing epipolar lines as in the first algorithm, are considered as possible correspondences. The initial probability for every triplet is assigned according to the distance from the intersection of the two crossing epipolar lines (or one of the two epipolar lines) to the feature location. Connection relationship between feature points is then used in the relaxation model to resolve the ambiguious correspondence triplets. Experimental results show that the first matching algorithm is faster and requires smaller memory, while the second matching algorithm is slower but more reliable. For acute angles smaller than 60°, the first algorithm becomes unreliable and one has to appeal to the second algorithm. By properly choosing one of the two algorithms proposed, 3D multiple polyhedra in a complex scence can be successfully reconstructed with arbitrary camera configurations in a three-view system.

UR - http://www.scopus.com/inward/record.url?scp=0032592789&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032592789&partnerID=8YFLogxK

U2 - 10.1016/S0165-1684(99)00031-6

DO - 10.1016/S0165-1684(99)00031-6

M3 - Article

VL - 77

SP - 171

EP - 193

JO - Signal Processing

JF - Signal Processing

SN - 0165-1684

IS - 2

ER -