BIP: A dimensionality reduction for image indexing
Author(s) -
R. I. Minu,
G. Nagarajan,
T. Prem Jacob,
A. Pravin
Publication year - 2018
Publication title -
ict express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.733
H-Index - 22
ISSN - 2405-9595
DOI - 10.1016/j.icte.2018.11.001
Subject(s) - search engine indexing , computer science , information retrieval , the internet , image (mathematics) , curse of dimensionality , key (lock) , globe , image retrieval , feature (linguistics) , dimensionality reduction , scheme (mathematics) , task (project management) , database index , database , data mining , artificial intelligence , mathematics , world wide web , medicine , mathematical analysis , linguistics , philosophy , computer security , management , ophthalmology , economics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom