A dynamic programming approach to line segment matching in stereo vision
Identifieur interne : 002F27 ( Main/Merge ); précédent : 002F26; suivant : 002F28A dynamic programming approach to line segment matching in stereo vision
Auteurs : Shing-Huan Lee [République populaire de Chine] ; Jin-Jang Leou [République populaire de Chine]Source :
- Pattern Recognition [ 0031-3203 ] ; 1994.
Abstract
The main purpose of stereo vision analysis is to recover the range (depth) information of objects in a three-dimensional (3D) scene based on a binocular image pair taken from two distinct views. Stereo matching (correspondence) is the key step in stereo vision analysis. There exist two general types of stereo matching, namely, intensity-based (area-based) matching and feature-based matching. In this study, by the use of the idea of searching relational graphs, a dynamic programming approach to line segment (feature-based) matching in stereo vision is proposed. Incorporating the divide-and-conquer strategy and the feature stability concept, the proposed approach is simple, but effective, as compared with the other existing approaches. In the proposed approach, by the use of the divide-and-conquer strategy, the line segments in the left image L are first partitioned, based on their orientations, into two sets: Lnh (nonhorizontal) and Lh (nearly horizontal), and then the nonhorizontal line segments in Lnh and their potential matching line segments in the right image R are clustered into K similar groups, Lnh (k) and Rnh (k), k = 1,2,..., K, respectively. The stereo matchings of the nonhorizontal line segments between Lnh(k) and Rnh(k) are determined by finding the maximal weighted path on the associated potential matching multistage graph PMMG. And by the use of the feature stability concept, the stereo matchings of the nearly horizontal line segments in Lh are similarly determined based on the structural relationships between the matched nonhorizontal line segments and the nearly horizontal line segments. Some experimental results show the feasibility of the proposed approach.
Url:
DOI: 10.1016/0031-3203(94)90138-4
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000476
- to stream Istex, to step Curation: 000469
- to stream Istex, to step Checkpoint: 002055
Links to Exploration step
ISTEX:13392A751E8703888B15A9C258C0566658EF4E62Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A dynamic programming approach to line segment matching in stereo vision</title><author><name sortKey="Lee, Shing Huan" sort="Lee, Shing Huan" uniqKey="Lee S" first="Shing-Huan" last="Lee">Shing-Huan Lee</name></author><author><name sortKey="Leou, Jin Jang" sort="Leou, Jin Jang" uniqKey="Leou J" first="Jin-Jang" last="Leou">Jin-Jang Leou</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:13392A751E8703888B15A9C258C0566658EF4E62</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1016/0031-3203(94)90138-4</idno><idno type="url">https://api.istex.fr/document/13392A751E8703888B15A9C258C0566658EF4E62/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000476</idno><idno type="wicri:Area/Istex/Curation">000469</idno><idno type="wicri:Area/Istex/Checkpoint">002055</idno><idno type="wicri:doubleKey">0031-3203:1994:Lee S:a:dynamic:programming</idno><idno type="wicri:Area/Main/Merge">002F27</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A dynamic programming approach to line segment matching in stereo vision</title><author><name sortKey="Lee, Shing Huan" sort="Lee, Shing Huan" uniqKey="Lee S" first="Shing-Huan" last="Lee">Shing-Huan Lee</name><affiliation wicri:level="1"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>UMAX Data System Company, Science-Based Industry Park, Hsinchu, Taiwan 30077</wicri:regionArea><wicri:noRegion>Taiwan 30077</wicri:noRegion></affiliation></author><author><name sortKey="Leou, Jin Jang" sort="Leou, Jin Jang" uniqKey="Leou J" first="Jin-Jang" last="Leou">Jin-Jang Leou</name><affiliation><wicri:noCountry code="no comma">Author to whom all correspondence should be addressed.</wicri:noCountry></affiliation><affiliation wicri:level="1"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>Institute of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan 62107</wicri:regionArea><wicri:noRegion>Taiwan 62107</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition</title><title level="j" type="abbrev">PR</title><idno type="ISSN">0031-3203</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1994">1994</date><biblScope unit="volume">27</biblScope><biblScope unit="issue">8</biblScope><biblScope unit="page" from="961">961</biblScope><biblScope unit="page" to="986">986</biblScope></imprint><idno type="ISSN">0031-3203</idno></series><idno type="istex">13392A751E8703888B15A9C258C0566658EF4E62</idno><idno type="DOI">10.1016/0031-3203(94)90138-4</idno><idno type="PII">0031-3203(94)90138-4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0031-3203</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The main purpose of stereo vision analysis is to recover the range (depth) information of objects in a three-dimensional (3D) scene based on a binocular image pair taken from two distinct views. Stereo matching (correspondence) is the key step in stereo vision analysis. There exist two general types of stereo matching, namely, intensity-based (area-based) matching and feature-based matching. In this study, by the use of the idea of searching relational graphs, a dynamic programming approach to line segment (feature-based) matching in stereo vision is proposed. Incorporating the divide-and-conquer strategy and the feature stability concept, the proposed approach is simple, but effective, as compared with the other existing approaches. In the proposed approach, by the use of the divide-and-conquer strategy, the line segments in the left image L are first partitioned, based on their orientations, into two sets: Lnh (nonhorizontal) and Lh (nearly horizontal), and then the nonhorizontal line segments in Lnh and their potential matching line segments in the right image R are clustered into K similar groups, Lnh (k) and Rnh (k), k = 1,2,..., K, respectively. The stereo matchings of the nonhorizontal line segments between Lnh(k) and Rnh(k) are determined by finding the maximal weighted path on the associated potential matching multistage graph PMMG. And by the use of the feature stability concept, the stereo matchings of the nearly horizontal line segments in Lh are similarly determined based on the structural relationships between the matched nonhorizontal line segments and the nearly horizontal line segments. Some experimental results show the feasibility of the proposed approach.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002F27 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002F27 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:13392A751E8703888B15A9C258C0566658EF4E62
|texte= A dynamic programming approach to line segment matching in stereo vision
}}
| This area was generated with Dilib version V0.6.32. |  |