Selection of an optimum patch for an area-based stereo matching algorithm

Taejung Kim, Soon Dal Choi

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper describes an approach to reduce the execution time of an area-based stereo matching technique by defining a patch (or window) carefully. It will be shown that conventional way of defining a patch contains redundancy and that a patch defined otherwise improves the performance in terms of coverage and speed while accuracy degradation is nominal. This paper also describes an attempt of defining optimal patch for stereo matching.

Original languageEnglish
Pages1492-1494
Number of pages3
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Geoscience and Remote Sensing Symposium, IGARSS'97. Part 3 (of 4) - Singapore, Singapore
Duration: 3 Aug 19978 Aug 1997

Conference

ConferenceProceedings of the 1997 IEEE International Geoscience and Remote Sensing Symposium, IGARSS'97. Part 3 (of 4)
CitySingapore, Singapore
Period3/08/978/08/97

Fingerprint

Dive into the research topics of 'Selection of an optimum patch for an area-based stereo matching algorithm'. Together they form a unique fingerprint.

Cite this