Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
