Retrieval of Flower Based on Sketches

In this paper, we propose a model for representation and indexing of flower images for the purpose of retrieving flowers of interest based a query sketch. In several applications, where the size of a database is supposed to be very huge, then the retrieval procedure typically takes unacceptably a long response time. A standard way to speed up the retrieval procedure is to design an indexing scheme prior to retrieval, which results in the reduction of number of flowers considered for searching by the retrieval algorithm. In this work, we swot the correctness of Kd-tree indexing scheme for flower retrieval system based on shape descriptors viz., Scale Invariant Feature Transform (SIFT), Histogram of Gradients (HOG) and Edge Orientation Histograms (EOH). To uphold the efficacy of the proposed method, an experiment has been conducted on our own flower data set of 127 classes of flowers, consists of 13169 flower images. For querying the database we collected about 100 flower sketches from 20 different users. Experimental results reveal the success of the proposed method.

[1]  D. S. Guru,et al.  Whorl based Approach for Flower Segmentation , 2014 .

[2]  Gang Chen,et al.  A flower image retrieval method based on ROI feature , 2004, Journal of Zhejiang University. Science.

[3]  D. S. Guru,et al.  Textural features in flower classification , 2011, Math. Comput. Model..

[4]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[5]  D. S. Guru,et al.  Texture Features and KNN in Classification of Flower Images , 2010 .

[6]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[7]  Edward M. Riseman,et al.  Indexing Flower Patent Images Using Domain Knowledge , 1999, IEEE Intell. Syst..

[8]  Andrew Zisserman,et al.  Automated Flower Classification over a Large Number of Classes , 2008, 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing.

[9]  Ferran Marqués,et al.  Region Merging Techniques Using Information Theory Statistical Measures , 2010, IEEE Transactions on Image Processing.

[10]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.

[11]  Tony F. Chan,et al.  Active Contours without Edges for Vector-Valued Images , 2000, J. Vis. Commun. Image Represent..

[12]  Andrew Zisserman,et al.  A Visual Vocabulary for Flower Classification , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[13]  Takeshi Saitoh,et al.  Automatic recognition of blooming flowers , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[14]  V. Dixit,et al.  kd-tree based fingerprint identification system , 2008, 2008 2nd International Conference on Anti-counterfeiting, Security and Identification.

[15]  William T. Freeman,et al.  Orientation Histograms for Hand Gesture Recognition , 1995 .

[16]  Yair Weiss,et al.  Learning object detection from a small number of examples: the importance of good features , 2004, CVPR 2004.

[17]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[18]  Andrew Zisserman,et al.  Delving into the Whorl of Flower Segmentation , 2007, BMVC.

[19]  Yunyoung Nam,et al.  CLOVER: A Mobile Content-Based Leaf Image Retrieval System , 2005, ICADL.

[20]  D. S. Guru,et al.  Classification of Flowers based on Whorl Region , 2011, IICAI.

[21]  Yunyoung Nam,et al.  Utilizing venation features for efficient leaf image retrieval , 2008, J. Syst. Softw..

[22]  Bill Triggs,et al.  Histograms of oriented gradients for human detection , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[23]  Matthijs C. Dorst.  Distinctive Image Features from Scale-Invariant Keypoints , 2011 .