Pruning and Matching Scheme for Rotation Invariant Leaf Image Retrieval

• Published in: KSII transactions on Internet and information systems 2008, 2(6), , pp.280-298
• Main Authors: Tak, Yoon-Sik, Hwang, Eenjun
• Format: Article
• Language: English
• Subjects: Algorithms; Evaluation; Geometric figures; Image processing; Indexing; Methods; 컴퓨터학
• ISSN: 1976-7277; 1976-7277
• DOI: 10.3837/tiis.2008.06.001

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: Shape-based image retrieval, dynamic time warping, sequence matching, rotation invariance, K-NN, range search