BIP: A dimensionality reduction for image indexing

Abstract Searching on internet is one of the daily task done by millions of users around the Globe. There is an urge for effective indexing scheme for unstructured data, which provide better search results. The image, content report, and site pages are said to be unstructured database. These information are not sorted out so the recovery rates of these information are purposely low when contrasted with indexed database. These information are indexed concerning their cues is one of the challenging areas to be explored. For the client require, the data recovery segment endeavors to coordinate the client question with the indexed database will provide effective recovery rates. In this paper a new image indexing scheme called Basic intrinsic pattern (BIP) is elaborated, which uses the image intensity as the key variable for image indexing. The algorithm is evaluated with respect to the size of the feature vector and the retrieval rate.

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

[2]  Arnold W. M. Smeulders,et al.  Real-Time Visual Concept Classification , 2010, IEEE Transactions on Multimedia.

[3]  R.M. Haralick,et al.  Statistical and structural approaches to texture , 1979, Proceedings of the IEEE.

[4]  B. S. Manjunath,et al.  Color and texture descriptors , 2001, IEEE Trans. Circuits Syst. Video Technol..

[5]  Jean-Christophe Burie,et al.  Digital Comics Image Indexing Based on Deep Learning , 2018, J. Imaging.

[6]  S. Krishnaveni,et al.  Toward automatic quality detection of Jasmenum flower , 2017, ICT Express.

[7]  Andrew Zisserman,et al.  A Statistical Approach to Texture Classification from Single Images , 2005, International Journal of Computer Vision.