GA-based three-view matching algorithm for multi-polyhedron reconstruction

Jiann Der Lee

doi:10.1049/el:19980146

GA-based three-view matching algorithm for multi-polyhedron reconstruction

Jiann Der Lee^*

^*Corresponding author for this work

Department of Electrical Engineering

Research output: Contribution to journal › Journal Article › peer-review

Abstract

A GA-based stereo matching algorithm is proposed for finding the correspondences among multi-polyhedron objects in a three-view system. An optimal camera configuration is used to reduce the feature searching area and a genetic algorithm is employed to refine the matching results. Experimental results show that the 3D multiple polyhedra in a complex scene can be successfully reconstructed. The proposed algorithm is fast, requires little memory, and is noise tolerant.

Original language	English
Pages (from-to)	165-166
Number of pages	2
Journal	Electronics Letters
Volume	34
Issue number	2
DOIs	https://doi.org/10.1049/el:19980146
State	Published - 22 01 1998

Access to Document

10.1049/el:19980146

Cite this

@article{b0de04024e9747f281e50d267764a285,

title = "GA-based three-view matching algorithm for multi-polyhedron reconstruction",

abstract = "A GA-based stereo matching algorithm is proposed for finding the correspondences among multi-polyhedron objects in a three-view system. An optimal camera configuration is used to reduce the feature searching area and a genetic algorithm is employed to refine the matching results. Experimental results show that the 3D multiple polyhedra in a complex scene can be successfully reconstructed. The proposed algorithm is fast, requires little memory, and is noise tolerant.",

author = "Lee, \{Jiann Der\}",

year = "1998",

month = jan,

day = "22",

doi = "10.1049/el:19980146",

language = "英语",

volume = "34",

pages = "165--166",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley \& Sons Inc.",

number = "2",

}

TY - JOUR

T1 - GA-based three-view matching algorithm for multi-polyhedron reconstruction

AU - Lee, Jiann Der

PY - 1998/1/22

Y1 - 1998/1/22

N2 - A GA-based stereo matching algorithm is proposed for finding the correspondences among multi-polyhedron objects in a three-view system. An optimal camera configuration is used to reduce the feature searching area and a genetic algorithm is employed to refine the matching results. Experimental results show that the 3D multiple polyhedra in a complex scene can be successfully reconstructed. The proposed algorithm is fast, requires little memory, and is noise tolerant.

AB - A GA-based stereo matching algorithm is proposed for finding the correspondences among multi-polyhedron objects in a three-view system. An optimal camera configuration is used to reduce the feature searching area and a genetic algorithm is employed to refine the matching results. Experimental results show that the 3D multiple polyhedra in a complex scene can be successfully reconstructed. The proposed algorithm is fast, requires little memory, and is noise tolerant.

UR - https://www.scopus.com/pages/publications/0031698620

U2 - 10.1049/el:19980146

DO - 10.1049/el:19980146

M3 - 文章

AN - SCOPUS:0031698620

SN - 0013-5194

VL - 34

SP - 165

EP - 166

JO - Electronics Letters

JF - Electronics Letters

IS - 2

ER -

GA-based three-view matching algorithm for multi-polyhedron reconstruction

Abstract

Access to Document

Other files and links

Fingerprint

Cite this