Abstract
Background: Image retrieval has a significant role in present and upcoming usage for different image processing applications where images within a desired range of similarity are retrieved for a query image. Representation of image feature, accuracy of feature selection, optimal storage size of feature vector and efficient methods for obtaining features plays a vital role in Image retrieval, where features are represented based on the content of an image such as color, texture or shape. In this work an optimal feature vector based on control points of a Bezier curve is proposed which is computation and storage efficient. Aim: To develop an effective and storage, computation efficient framework model for retrieval and classification of plant leaves.
Objectives: The primary objective of this work is developing a new algorithm for control point extraction based on the global monitoring of edge region. This observation will bring a minimization in false feature extraction. Further, computing a sub clustering feature value in finer and details component to enhance the classification performance. Finally, developing a new search mechanism using inter and intra mapping of feature value in selecting optimal feature values in the estimation process.
Methods: The work starts with the pre-processing stage that outputs the boundary coordinates of shape present in the input image. Gray scale input image is first converted into binary image using binarization then, the curvature coding is applied to extract the boundary of the leaf image. Gaussian Smoothening is then applied to the extracted boundary to remove the noise and false feature reduction. Further interpolation method is used to extract the control points of the boundary. From the extracted control points the Bezier curve points are estimated and then Fast Fourier Transform (FFT) is applied on the curve points to get the feature vector. Finally, the K-NN classifier is used to classify and retrieve the leaf images.
Results: The performance of proposed approach is compared with the existing state-of-the-artmethods (Contour and Curve based) using the evaluation parameters viz. accuracy, sensitivity, specificity, recall rate, and processing time. Proposed method has high accuracy with acceptable specificity and sensitivity. Other methods fall short in comparison to proposed method. In case of sensitivity and specificity Contour method out performs proposed method. But in case accuracy and specificity proposed method outperforms the state-of-the-art methods.
Conclusion: This work proposed a linear coding of Bezier curve control point computation for image retrieval. This approach minimizes the processing overhead and search delay by reducing feature vectors using a threshold-based selection approach. The proposed approach has an advantage of distortion suppression and dominant feature extraction simultaneously, minimizing the effort of additional filtration process. The accuracy of retrieval for the developed approach is observed to be improved as compared to the tangential Bezier curve method and conventional edge and contour-based coding. The approach signifies an advantage in low resource overhead in computing shape feature.
Keywords: Geometrical feature descriptor, linear bezier curve, control point extraction, image retrieval, distortion suppression, dominant feature extraction.
Graphical Abstract
[http://dx.doi.org/10.1109/TIP.2002.800896] [PMID: 18249692]
[http://dx.doi.org/10.1109/ICCVW.2009.5457691]
[http://dx.doi.org/10.1109/LSP.2009.2026119]
[http://dx.doi.org/10.1109/ICCV.2005.63]
[http://dx.doi.org/10.1109/IRC.2017.13]
[http://dx.doi.org/10.1109/ICPR.2004.1334371]
[http://dx.doi.org/10.1109/TPAMI.2007. 50] [PMID: 17224621]
[http://dx.doi.org/10.1007/978-3-642-36669-7_90]
[http://dx.doi.org/10.14257/astl.2014.45.04]
[http://dx.doi.org/10.1109/TIP.2009.2025923] [PMID: 19556195]
[http://dx.doi.org/10.12988/ces.2018.810538]
[http://dx.doi.org/10.1109/ICCSIT.2010.5565098]
[http://dx.doi.org/10.1109/ICIP.2017.8297128]
[http://dx.doi.org/10.1155/2018/4976372]
[http://dx.doi.org/10.18178/joig.6.2.127-136]
[http://dx.doi.org/10.1016/j.patcog.2003.07.008]
[http://dx.doi.org/10.1016/j.cad.2014.08.028]
[http://dx.doi.org/10.1109/TPAMI.2016.2613866] [PMID: 28114058]
[http://dx.doi.org/10.1016/j.cma.2011.09.004]
[http://dx.doi.org/10.1016/j.cagd.2012.03.025]
[http://dx.doi.org/10.1016/j.cagd.2012.12.005]
[http://dx.doi.org/10.1016/j.gmod.2008.03.001]
[http://dx.doi.org/10.1007/ s005300050147]