Hilbert scan based tree representation for image search

Pengyi Hao, Seiichiro Kamata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, Hilbert scan based tree representation (HSBT) is presented for image search. Unlike common ways decreasing the number of interest points or reducing the dimensions of features or using searching methods to match interest points, the proposed method builds a tree for each image and gives a new distance measure to calculate the similarity between the query and images in database. In the proposed approach, Hilbert scan for arbitrarily-sized arrays is used to map the interest points from two-dimensional space to one-dimensional space at first. Then, interest points set is divided into several parts by a separation way, and a grouping strategy is given to build a tree for each image. Experimental results show that the proposed approach is space saving. That is because it only stores clustering center and relevant information of each node in the tree. It is also time saving since the similarity calculation is up to the nodes of tree rather than all the descriptors of image. At the same time, the retrieval precision is good, because Hilbert scanning preserves the correlation in two-dimensional image, so nodes of tree are shaped according to the compactness of interest points which can employ the local information as much as possible.

Original languageEnglish
Title of host publicationIEEE Region 10 Annual International Conference, Proceedings/TENCON
Pages499-504
Number of pages6
DOIs
Publication statusPublished - 2010
Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka
Duration: 2010 Nov 212010 Nov 24

Other

Other2010 IEEE Region 10 Conference, TENCON 2010
CityFukuoka
Period10/11/2110/11/24

Fingerprint

Scanning

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications

Cite this

Hao, P., & Kamata, S. (2010). Hilbert scan based tree representation for image search. In IEEE Region 10 Annual International Conference, Proceedings/TENCON (pp. 499-504). [5686710] https://doi.org/10.1109/TENCON.2010.5686710

Hilbert scan based tree representation for image search. / Hao, Pengyi; Kamata, Seiichiro.

IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 499-504 5686710.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hao, P & Kamata, S 2010, Hilbert scan based tree representation for image search. in IEEE Region 10 Annual International Conference, Proceedings/TENCON., 5686710, pp. 499-504, 2010 IEEE Region 10 Conference, TENCON 2010, Fukuoka, 10/11/21. https://doi.org/10.1109/TENCON.2010.5686710
Hao P, Kamata S. Hilbert scan based tree representation for image search. In IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. p. 499-504. 5686710 https://doi.org/10.1109/TENCON.2010.5686710
Hao, Pengyi ; Kamata, Seiichiro. / Hilbert scan based tree representation for image search. IEEE Region 10 Annual International Conference, Proceedings/TENCON. 2010. pp. 499-504
@inproceedings{da313704bfed4b5cbb85e94d96754bf0,
title = "Hilbert scan based tree representation for image search",
abstract = "In this paper, Hilbert scan based tree representation (HSBT) is presented for image search. Unlike common ways decreasing the number of interest points or reducing the dimensions of features or using searching methods to match interest points, the proposed method builds a tree for each image and gives a new distance measure to calculate the similarity between the query and images in database. In the proposed approach, Hilbert scan for arbitrarily-sized arrays is used to map the interest points from two-dimensional space to one-dimensional space at first. Then, interest points set is divided into several parts by a separation way, and a grouping strategy is given to build a tree for each image. Experimental results show that the proposed approach is space saving. That is because it only stores clustering center and relevant information of each node in the tree. It is also time saving since the similarity calculation is up to the nodes of tree rather than all the descriptors of image. At the same time, the retrieval precision is good, because Hilbert scanning preserves the correlation in two-dimensional image, so nodes of tree are shaped according to the compactness of interest points which can employ the local information as much as possible.",
author = "Pengyi Hao and Seiichiro Kamata",
year = "2010",
doi = "10.1109/TENCON.2010.5686710",
language = "English",
isbn = "9781424468904",
pages = "499--504",
booktitle = "IEEE Region 10 Annual International Conference, Proceedings/TENCON",

}

TY - GEN

T1 - Hilbert scan based tree representation for image search

AU - Hao, Pengyi

AU - Kamata, Seiichiro

PY - 2010

Y1 - 2010

N2 - In this paper, Hilbert scan based tree representation (HSBT) is presented for image search. Unlike common ways decreasing the number of interest points or reducing the dimensions of features or using searching methods to match interest points, the proposed method builds a tree for each image and gives a new distance measure to calculate the similarity between the query and images in database. In the proposed approach, Hilbert scan for arbitrarily-sized arrays is used to map the interest points from two-dimensional space to one-dimensional space at first. Then, interest points set is divided into several parts by a separation way, and a grouping strategy is given to build a tree for each image. Experimental results show that the proposed approach is space saving. That is because it only stores clustering center and relevant information of each node in the tree. It is also time saving since the similarity calculation is up to the nodes of tree rather than all the descriptors of image. At the same time, the retrieval precision is good, because Hilbert scanning preserves the correlation in two-dimensional image, so nodes of tree are shaped according to the compactness of interest points which can employ the local information as much as possible.

AB - In this paper, Hilbert scan based tree representation (HSBT) is presented for image search. Unlike common ways decreasing the number of interest points or reducing the dimensions of features or using searching methods to match interest points, the proposed method builds a tree for each image and gives a new distance measure to calculate the similarity between the query and images in database. In the proposed approach, Hilbert scan for arbitrarily-sized arrays is used to map the interest points from two-dimensional space to one-dimensional space at first. Then, interest points set is divided into several parts by a separation way, and a grouping strategy is given to build a tree for each image. Experimental results show that the proposed approach is space saving. That is because it only stores clustering center and relevant information of each node in the tree. It is also time saving since the similarity calculation is up to the nodes of tree rather than all the descriptors of image. At the same time, the retrieval precision is good, because Hilbert scanning preserves the correlation in two-dimensional image, so nodes of tree are shaped according to the compactness of interest points which can employ the local information as much as possible.

UR - http://www.scopus.com/inward/record.url?scp=79951617283&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951617283&partnerID=8YFLogxK

U2 - 10.1109/TENCON.2010.5686710

DO - 10.1109/TENCON.2010.5686710

M3 - Conference contribution

AN - SCOPUS:79951617283

SN - 9781424468904

SP - 499

EP - 504

BT - IEEE Region 10 Annual International Conference, Proceedings/TENCON

ER -