scholarly journals COMPREHENSIVE STUDY ON CONTENT BASED IMAGE RETRIEVAL WITH THEIR FEATURES

2017 ◽  
Vol 16 (6) ◽  
pp. 6962-6967
Author(s):  
Pritpal Kaur ◽  
Sukhvir Kaur

In current years, very huge collections of images and videos have grown swiftly. In parallel with this boom, content-based image retrieval and querying the indexed collections of images from the large database are required to access visible facts and visual information. Three of the principle additives of the visual images are texture, shape and color. Content based image retrieval from big sources has a wide scope in many application areas and software’s. To accelerate retrieval and similarity computation, the database images are analyzed and the extracted regions are clustered or grouped together with their characteristic feature vectors. As a result of latest improvements in digital storage technology, it's easy and possible to create and store the large quantity of images inside the image database. These collections may additionally comprise thousands and thousands of images and terabytes of visual information like their shape, texture and color. For users to make the most from those image databases, efficient techniques and mechanisms of searching should be devised. Having a computer to do the indexing primarily based on a CBIR scheme attempts to deal with the shortcomings of human-based indexing. Since an automated process on a computer can analyze and process the images at a very quick and efficient rate that human can never do alone. In this paper, we will discuss the structure of CBIR with their feature vectors.

2018 ◽  
Vol 17 (2) ◽  
pp. 7226-7235
Author(s):  
Bohar Singh ◽  
Mrs.Mehak Aggarwal

In current years, very huge collections of images and videos have grown swiftly. In parallel with this boom, content-based image retrieval and querying the indexed collections of images from the large database are required to access visible facts and visual information. Three of the principle additives of the visual images are texture, shape and color. Content based image retrieval from big sources has a wide scope in many application areas and software’s.  To accelerate retrieval and similarity computation, the database images are analyzed and the extracted regions are clustered or grouped together with their characteristic feature vectors. As a result of latest improvements in digital storage technology, it's easy and possible to create and store the large quantity of images inside the image database.  These collections may additionally comprise thousands and thousands of images and terabytes of visual information like their shape, texture and color.  For users to make the most from those image databases, efficient techniques and mechanisms of searching should be devised. Having a computer to do the indexing primarily based on a CBIR scheme attempts to deal with the shortcomings of human-based indexing.  Since anautomated process on a computer can analyze and process the images at a very quick and efficient rate that human can never do alone. In this paper, we will discuss the structure of CBIR with their feature vectors.


2016 ◽  
Vol 15 (13) ◽  
pp. 7342-7346
Author(s):  
Meenu Meenu ◽  
Sonika Jindal

In recent years, very large collections of images and videos have grown rapidly. In parallel with this growth, content-based retrieval and querying the indexed collections are required to access visual information. Two of the main components of the visual information are texture and color. In this thesis, a content-based image retrieval system is presented that computes texture and color similarity among images. Content based image retrieval from large resources has become an area of wide interest now a days in many applications.  To speed up retrieval and similarity computation, the database images are analysed and the extracted regions are clustered according to their feature vectors. This process is performed offline before query processing, therefore to answer a query our system does not need to search the entire database images; instead just a number of candidate images are required to be searched for image similarity.


2003 ◽  
Vol 03 (01) ◽  
pp. 171-208 ◽  
Author(s):  
ANASTASIOS DOULAMIS ◽  
NIKOLAOS DOULAMIS ◽  
THEODORA VARVARIGOU

The performance of a Content-Based Image Retrieval System (CBIR) depends on (a) the system's adaptability to the user's information needs, which permits different types of indexing and simultaneously reduces the subjectivity of human perception for the interpretation of the image visual content and (b) the efficient organization of the extracted descriptors, which represent the rich visual information. Both issues are addressed in this paper. Descriptor organization is performed using a fuzzy classification scheme fragmented into multidimensional classes, instead of the previous works where fuzzy histograms were created in one dimension using, for example, the feature vector norm. Multidimensionality relates the descriptors with one another and thus allows a compact and meaningful visual representation by mapping the elements of the resulted feature vectors with a physical visual interpretation. Furthermore, fuzzy classification is applied for all visual content descriptors, in contrast to the previous approaches where only color information is exploited. Two kinds of content descriptors are extracted in our case; global-based and region-based. The first refers to the global image characteristics, while the second exploits the region-based properties. Regions are obtained by applying a multiresolution implementation of the Recursive Shortest Spanning Tree (RSST) algorithm, called M-RSST in this paper. The second issue is addressed by proposing a computationally efficient relevance feedback mechanism based on an optimal weight updating strategy. The scheme relies on the cross-correlation measure, instead of the Euclidean distance which is mainly used in most relevance feedback algorithms. Cross-correlation is a normalized measure, which expresses how similar the two feature vectors are and thus it indicates a metric of their content similarity. The proposed scheme can be recursively implemented in the case of multiple feedback iterations, instead of the previous approaches. Furthermore, it provides reliable results regardless of the number of selected sample and the feature vector size improving relevance feedback performance, as compared to other approaches.


2018 ◽  
Vol 7 (``11) ◽  
pp. 24392-24396
Author(s):  
Gibson Kimutai ◽  
Prof. Wilson Cheruiyot ◽  
Dr. Calvins Otieno

In the last decade, large database of images have grown rapidly. This trend is expected to continue in to the future. Retrieval and querying of these image in efficient way is a challenge in order to access the visual content from large database. Content Based Image Retrieval (CBIR) provides the solution for efficient retrieval of image from these huge image database. Many research efforts have been directed to this area with color feature being the mostly used feature because of its ease of extraction. Although many research efforts have been directed to this area, precision  of majority of the developed models  are still at less than 80%. This is a challenge as it leads to unsatisfying search results. This paper proposes a Content Based Image Retrieval model for E-Commerce.


Biometrics ◽  
2017 ◽  
pp. 652-689
Author(s):  
Anupam Mukherjee

This chapter will focus on the concept of Content-based image retrieval. Searching of an image or video database based on text based description is a manual labor intensive process. Descriptions of the file are usually typed manually for each image by human operators because the automatic generation of keywords for the images is difficult without incorporation of visual information and feature extraction. This method is impractical in today's multimedia information era. “Content-based” means that the search will analyze the actual contents of the image rather than the metadata such as keywords, tags, and descriptions associated with the image. The term “content” in this context might refer to colors, shapes, textures, or any other information that can be derived from the image itself. Several important sections are highlighted in this chapter, like architectures, query techniques, multidimensional indexing, video retrieval and different application sections of CBIR.


Author(s):  
C. BHUVANESWARI ◽  
P. ARUNA ◽  
D. LOGANATHAN

Digital images are now the basis of visual information in medical applications. The advent of radiology which employs imaging for diagnosis generates great amount of images. Automatic retrieval of images based on features like color, shape and texture is termed Content Based Image Retrieval. The increasing dependence of modern medicine on diagnostic techniques such as radiology, computerized tomography has resulted in a sudden increase in the number and significance of medical images. Content Based Image Retrieval techniques are being extensively used to aid diagnosis by comparing with similar past cases and improvising Computer Aided Diagnosis. In this paper, it is proposed to extract features in the frequency domain using Walsh Hadamard transform and use FP-Growth association rule mining to extract features based on confidence. The extracted features are classified using Naïve Bayes and CART algorithms and the proposed method’s classification accuracy is evaluated. Experimental results show that classification accuracy for Naïve Bayes is 100 and 96.8 for CART on application of proposed method.


2017 ◽  
Vol 16 (1) ◽  
pp. 7515-7523
Author(s):  
Meenu Meenu ◽  
Sonika Jindal

Content Based Image Retrieval (CBIR) techniques are becoming an essential requirement in the multimedia systems with the widespread use of internet, declining cost of storage devices and the exponential growth of un-annotated digital image information available in recent years.  Therefore multi query systems have been used rather than a single query in order to bridge the semantic gaps and in order to understand user’s requirements. Moreover, query replacement algorithm has been used in the previous works in which user provides multiple images to the query image set referred as representative images. Feature vectors are extracted for each image in the representative image set and every image in the database. The centroid, Crep of the representative images is obtained by computing the mean of their feature vectors. Then every image in the representative image set is replaced with the same candidate image in the dataset one by one and new centroids are calculated for every replacement .The distance between each of the centroids resulting from the replacement and the representative image centroid Crep is calculated using Euclidean distance. The cumulative sum of these distances determines the similarity of the candidate image with the representative image set and is used for ranking the images. The smaller the distance, the similar will be the image with the representative image set. But it has some research gaps like it takes a lot of time to extract feature of each and every image from the database and compare our image with the database images and complexity as well as cost increases. So in our proposed work, the KNN algorithm is applied for classification of images in the database image set using the query images and the candidate images are reduced to images returned after classification mechanism which leads to decrease the execution time and reduce the number of iterations. Hence due to hybrid model of multi query and KNN, the effectiveness of image retrieval in CBIR system increases. The language used in this work is C /C++ with Open CV libraries and IDE is Visual studio 2015. The experimental results show that our method is more effective to improve the performance of the retrieval of images.


2005 ◽  
Vol 44 (02) ◽  
pp. 154-160 ◽  
Author(s):  
V. Breton ◽  
I. E. Magnin ◽  
J. Montagnat

Summary Objectives: In this paper we study the impact of executing a medical image database query application on the grid. For lowering the total computation time, the image database is partitioned into subsets to be processed on different grid nodes. Methods: A theoretical model of the application complexity and estimates of the grid execution overhead are used to efficiently partition the database. Results: We show results demonstrating that smart partitioning of the database can lead to significant improvements in terms of total computation time. Conclusions: Grids are promising for content-based image retrieval in medical databases.


Sign in / Sign up

Export Citation Format

Share Document