Rate-efficient visual correspondences using random projections

We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondences is a critical task before other vision tasks can be performed in a wireless camera network. We propose the use of coarse...

Full description

Saved in:
Bibliographic Details
Published in2008 15th IEEE International Conference on Image Processing pp. 217 - 220
Main Authors Chuohao Yeo, Ahammad, P., Ramchandran, K.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2008
Subjects
Bit rate
Broadcasting
Calibration
Cameras
Computer vision
Euclidean distance
Hamming distance
Layout
Principal component analysis
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondences is a critical task before other vision tasks can be performed in a wireless camera network. We propose the use of coarsely quantized random projections of descriptors to build binary hashes, and use the Hamming distance between binary hashes as the matching criterion. In this work, we derive the analytic relationship of Hamming distance between the binary hashes to Euclidean distance between the original descriptors. We present experimental verification of our result, and show that for the task of finding visual correspondences, sending binary hashes is more rate-efficient than prior approaches.
ISBN:9781424417650
1424417651
ISSN:1522-4880
2381-8549
DOI:10.1109/ICIP.2008.4711730