Pruning and matching scheme for rotation invariant leaf image retrieval

Yoon Sik Tak, Een Jun Hwang

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf's center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

Original languageEnglish
Pages (from-to)280-298
Number of pages19
JournalKSII Transactions on Internet and Information Systems
Volume2
Issue number6
DOIs
Publication statusPublished - 2008 Dec 1

Fingerprint

Image retrieval
Invariance
Textures
Color

Keywords

  • Dynamic time warping
  • K-NN
  • Range search
  • Rotation invariance
  • Sequence matching
  • Shape-based image retrieval

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Pruning and matching scheme for rotation invariant leaf image retrieval. / Tak, Yoon Sik; Hwang, Een Jun.

In: KSII Transactions on Internet and Information Systems, Vol. 2, No. 6, 01.12.2008, p. 280-298.

Research output: Contribution to journalArticle

@article{26a538a8d26e4b7bbea1bba2fe25f652,
title = "Pruning and matching scheme for rotation invariant leaf image retrieval",
abstract = "For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf's center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.",
keywords = "Dynamic time warping, K-NN, Range search, Rotation invariance, Sequence matching, Shape-based image retrieval",
author = "Tak, {Yoon Sik} and Hwang, {Een Jun}",
year = "2008",
month = "12",
day = "1",
doi = "10.3837/tiis.2008.06.001",
language = "English",
volume = "2",
pages = "280--298",
journal = "KSII Transactions on Internet and Information Systems",
issn = "1976-7277",
publisher = "Korea Society of Internet Information",
number = "6",

}

TY - JOUR

T1 - Pruning and matching scheme for rotation invariant leaf image retrieval

AU - Tak, Yoon Sik

AU - Hwang, Een Jun

PY - 2008/12/1

Y1 - 2008/12/1

N2 - For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf's center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

AB - For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf's center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

KW - Dynamic time warping

KW - K-NN

KW - Range search

KW - Rotation invariance

KW - Sequence matching

KW - Shape-based image retrieval

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

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

U2 - 10.3837/tiis.2008.06.001

DO - 10.3837/tiis.2008.06.001

M3 - Article

VL - 2

SP - 280

EP - 298

JO - KSII Transactions on Internet and Information Systems

JF - KSII Transactions on Internet and Information Systems

SN - 1976-7277

IS - 6

ER -