IMAGE RETRIEVAL WITH BINARY HAMMING DISTANCE

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

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

IMAGE RETRIEVAL WITH BINARY HAMMING DISTANCE

Topics: Object, Event and Scene Recognition, Retrieval and Indexing

In Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, 237-240, 2007 , Barcelona, Spain

Authors: Jérôme Landré ¹ and Frédéric Truchetet ²

Affiliations: ¹ CReSTIC, Université de Reims-Champagne-Ardenne, France ; ² Le2i, Université de Bourgogne, France

Keyword(s): Content-based image retrieval, binary signature, multiresolution analysis.

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.146.34.191

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 (VISIGRAPP 2007) - Volume 2: VISAPP; ISBN 978-972-8865-74-0; ISSN 2184-4321, SciTePress, pages 237-240. DOI: 10.5220/0002046002370240

@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 (VISIGRAPP 2007) - Volume 2: VISAPP},
year={2007},
pages={237-240},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002046002370240},
isbn={978-972-8865-74-0},
issn={2184-4321},
}

TY - CONF

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