Analysis of the efficiency of the census transform algorithm implemented on FPGA

Over the course of the last two decades, continuous advances in the stereo vision field have been documented. In this paper we present an analysis of the efficiency for the stereo vision algorithm of the Census Transform algorithm. In addition to the conventional correlation method based on Hamming...

Full description

Saved in:
Bibliographic Details
Published inMicroprocessors and microsystems Vol. 39; no. 7; pp. 494 - 503
Main Authors Tavera-Vaca, C.-A., Almanza-Ojeda, D.-L., Ibarra-Manzano, M.-A.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.10.2015
Subjects
Algorithms
Census
Census transform
Design parameters
Dixon Koehler distance
Field programmable gate arrays
Hamming distance
Hardware
Optimization
Similarity
Stereo vision
Tanimoto distance
Transforms
Vision
Tanimoto distance
Hamming distance
Stereo vision
Dixon Koehler distance
Field programmable gate arrays
Census transform
Online AccessGet full text

Cover

More Information
Summary:Over the course of the last two decades, continuous advances in the stereo vision field have been documented. In this paper we present an analysis of the efficiency for the stereo vision algorithm of the Census Transform algorithm. In addition to the conventional correlation method based on Hamming distance minimization, we use two similarity measures: the Tanimoto and the Dixon-Koehler distances. Then, we compare its performance in terms of accuracy and hardware resources needed for implementation. These comparisons are performed by introducing a generalized model for each hardware architecture, scalable depending on design parameters such as Census Transform window size and maximum disparity range.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0141-9331
1872-9436
DOI:10.1016/j.micpro.2015.08.002