IMAGE RETRIEVAL WITH BINARY HAMMING DISTANCE

Jérôme Landré, Frédéric Truchetet

2007

Abstract

This article proposes a content-based indexing and retrieval (CBIR) system based on query-by-visual-example using hierarchical binary signatures. Binary signatures are obtained through a described binarization process of classical features (color, texture and shape). The Hamming binary distance (based on binary XOR operation) is used for computing distances. This technique was tested on a real natural image collection containing 10 000 images and on a virtual collection of one million images. Results are very good both in terms of speed and accuracy allowing near real-time image retrieval in very large image collections.

Paper Citation

in Harvard Style

Landré J. and Truchetet F. (2007). IMAGE RETRIEVAL WITH BINARY HAMMING DISTANCE . In Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, ISBN 978-972-8865-74-0, pages 237-240. DOI: 10.5220/0002046002370240

in Bibtex Style

@conference{visapp07,
author={Jérôme Landré and Frédéric Truchetet},
title={IMAGE RETRIEVAL WITH BINARY HAMMING DISTANCE},
booktitle={Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP,},
year={2007},
pages={237-240},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002046002370240},
isbn={978-972-8865-74-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP,
TI - IMAGE RETRIEVAL WITH BINARY HAMMING DISTANCE
SN - 978-972-8865-74-0
AU - Landré J.
AU - Truchetet F.
PY - 2007
SP - 237
EP - 240
DO - 10.5220/0002046002370240