Efficient subtree pruning scheme in tree-structured hierarchy

Jung R. Kim; Hyun Sung Chang; Sang U. Lee; Sanghoon Sull

doi:10.1109/TCSVT.2007.894040

Efficient subtree pruning scheme in tree-structured hierarchy

Jung R. Kim, Hyun Sung Chang, Sang U. Lee, Sanghoon Sull

Research output: Contribution to journal › Article

1 Citation (Scopus)

Abstract

For efficient image retrieval, most existing methods that adopt a tree-structured hierarchy exploit a subtree pruning scheme, based on the triangle inequality of a distance metric, during the tree traversal. In this paper, we propose a refined pruning scheme for the tree-structured hierarchy by introducing a novel notion of the node distance to subcluster (NDS) and validate it in both theoretical and experimental aspects. Experimental results demonstrate that the proposed method outperforms the existing ones by 10%-25% in terms of retrieval efficiency at the negligible increase of storage for a retrieval system.

Original language	English
Pages (from-to)	635-638
Number of pages	4
Journal	IEEE Transactions on Circuits and Systems for Video Technology
Volume	17
Issue number	5
DOIs	https://doi.org/10.1109/TCSVT.2007.894040
Publication status	Published - 2007 May

Keywords

Content-based retrieval
Image retrieval
Subtree pruning
Tree-structured hierarchy

ASJC Scopus subject areas

Media Technology
Electrical and Electronic Engineering

Access to Document

10.1109/TCSVT.2007.894040

Fingerprint Dive into the research topics of 'Efficient subtree pruning scheme in tree-structured hierarchy'. Together they form a unique fingerprint.

Cite this

Kim, J. R., Chang, H. S., Lee, S. U., & Sull, S. (2007). Efficient subtree pruning scheme in tree-structured hierarchy. IEEE Transactions on Circuits and Systems for Video Technology, 17(5), 635-638. https://doi.org/10.1109/TCSVT.2007.894040

@article{6c36da5ab6c5457b953706a67596fcb0,

title = "Efficient subtree pruning scheme in tree-structured hierarchy",

abstract = "For efficient image retrieval, most existing methods that adopt a tree-structured hierarchy exploit a subtree pruning scheme, based on the triangle inequality of a distance metric, during the tree traversal. In this paper, we propose a refined pruning scheme for the tree-structured hierarchy by introducing a novel notion of the node distance to subcluster (NDS) and validate it in both theoretical and experimental aspects. Experimental results demonstrate that the proposed method outperforms the existing ones by 10%-25% in terms of retrieval efficiency at the negligible increase of storage for a retrieval system.",

keywords = "Content-based retrieval, Image retrieval, Subtree pruning, Tree-structured hierarchy",

author = "Kim, {Jung R.} and Chang, {Hyun Sung} and Lee, {Sang U.} and Sanghoon Sull",

year = "2007",

month = may,

doi = "10.1109/TCSVT.2007.894040",

language = "English",

volume = "17",

pages = "635--638",

journal = "IEEE Transactions on Circuits and Systems for Video Technology",

issn = "1051-8215",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Efficient subtree pruning scheme in tree-structured hierarchy

AU - Kim, Jung R.

AU - Chang, Hyun Sung

AU - Lee, Sang U.

AU - Sull, Sanghoon

PY - 2007/5

Y1 - 2007/5

N2 - For efficient image retrieval, most existing methods that adopt a tree-structured hierarchy exploit a subtree pruning scheme, based on the triangle inequality of a distance metric, during the tree traversal. In this paper, we propose a refined pruning scheme for the tree-structured hierarchy by introducing a novel notion of the node distance to subcluster (NDS) and validate it in both theoretical and experimental aspects. Experimental results demonstrate that the proposed method outperforms the existing ones by 10%-25% in terms of retrieval efficiency at the negligible increase of storage for a retrieval system.

AB - For efficient image retrieval, most existing methods that adopt a tree-structured hierarchy exploit a subtree pruning scheme, based on the triangle inequality of a distance metric, during the tree traversal. In this paper, we propose a refined pruning scheme for the tree-structured hierarchy by introducing a novel notion of the node distance to subcluster (NDS) and validate it in both theoretical and experimental aspects. Experimental results demonstrate that the proposed method outperforms the existing ones by 10%-25% in terms of retrieval efficiency at the negligible increase of storage for a retrieval system.

KW - Content-based retrieval

KW - Image retrieval

KW - Subtree pruning

KW - Tree-structured hierarchy

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

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

U2 - 10.1109/TCSVT.2007.894040

DO - 10.1109/TCSVT.2007.894040

M3 - Article

AN - SCOPUS:34247620423

VL - 17

SP - 635

EP - 638

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

SN - 1051-8215

IS - 5

ER -