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 | |
| Publication status | Published - 2007 May 1 |
Fingerprint
Keywords
- Content-based retrieval
- Image retrieval
- Subtree pruning
- Tree-structured hierarchy
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Efficient subtree pruning scheme in tree-structured hierarchy. / Kim, Jung R.; Chang, Hyun Sung; Lee, Sang U.; Sull, Sanghoon.
In: IEEE Transactions on Circuits and Systems for Video Technology, Vol. 17, No. 5, 01.05.2007, p. 635-638.Research output: Contribution to journal › Article
}
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/1
Y1 - 2007/5/1
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
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 -