BIP: A dimensionality reduction for image indexing

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...

Full description

Saved in:
Bibliographic Details
Published in:ICT express 2019, 5(3), , pp.187-191
Main Authors: R.I., Minu, G., Nagarajan, T., Prem Jacob, A., Pravin
Format: Article
Language:English
Subjects:
전자/정보통신공학
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Keywords: Image indexing, Gradient, GLCM, PCA, Texture
ISSN:2405-9595
2405-9595
DOI:10.1016/j.icte.2018.11.001