Efficient face detection and recognition using block independent component analysis and clustering

Content Based Image Retrieval (CBIR) is a process in which for a given query image similar images will be retrieved based on the image content similarity. Image content refers to its visual features, which are mathematical representations of a digital image. The image retrieval task primarily depends on image feature extraction and similarity measurement between the feature vectors. The performance of CBIR process not only decided by the optimum features extracted from the image but also on the proper choice of the similarity/dissimilarity measures (distance metrics). As the image features broadly diversified in terms of color, texture and shape based, using the same distance metric may not work well for all of these features. In this paper, first we presented overview of geometric and statistical distance metrics used in CBIR along with the comparative analysis of these measures on color and texture features. Color features extracted by computing color histograms in HSV space and texture features by wavelet decompositions. Geometrical distances such as Manhattan, Chebyshev, Euclidean, statistical distance metrics such as Cosine Similarity, Chi-square, KullbackLeibler, Jeffrey and cumulative statistical distance metrics of Kolmogorov-Smirnov, Cramer von Mises and Earthmover's distances were analyzed for feature similarity. We gave certain conclusions on the performance of all these distance metrics in terms of Mean Average Precision (MAP) and Recall rates with color and texture features respectively.

In a content-based image retrieval (CBIR) system, indexing feature vectors and the similarity measure between feature vectors are two key factors for retrieval performance. We present a new CBIR system with statistical-model based image feature extraction in the wavelet domain and a Kullback divergence based similarity measure. A two component Gaussian mixture model (GMM) in the wavelet domain is employed and the model parameters are used to form features for image indexing. A new Kullback divergence based similarity measure is then presented for image retrieval. The experimental results demonstrate that the similarity measure based on the Kullback divergence is more effective than conventional similarity measures, such as the city-block distance and the Euclidean distance. It is shown that the new CBIR system, with the combination of the GMM and the new Kullback divergence based similarity measure, outperforms most other methods in retrieval performance for texture images, while keeping a comparable level of computational complexity.

PurposeContent‐based image retrieval (CBIR) technologies offer many advantages over purely text‐based image search. However, one of the drawbacks associated with CBIR is the increased computational cost arising from tasks such as image processing, feature extraction, image classification, and object detection and recognition. Consequently CBIR systems have suffered from a lack of scalability, which has greatly hampered their adoption for real‐world public and commercial image search. At the same time, paradigms for large‐scale heterogeneous distributed computing such as grid computing, cloud computing, and utility‐based computing are gaining traction as a way of providing more scalable and efficient solutions to large‐scale computing tasks.Design/methodology/approachThis paper presents an approach in which a large distributed processing grid has been used to apply a range of CBIR methods to a substantial number of images. By massively distributing the required computational task across thousands of grid nodes, very high through‐put has been achieved at relatively low overheads.FindingsThis has allowed one to analyse and index about 25 million high resolution images thus far, while using just two servers for storage and job submission. The CBIR system was developed by Imense Ltd and is based on automated analysis and recognition of image content using a semantic ontology. It features a range of image‐processing and analysis modules, including image segmentation, region classification, scene analysis, object detection, and face recognition methods.Originality/valueIn the case of content‐based image analysis, the primary performance criterion is the overall through‐put achieved by the system in terms of the number of images that can be processed over a given time frame, irrespective of the time taken to process any given image. As such, grid processing has great potential for massively parallel content‐based image retrieval and other tasks with similar performance requirements.

In the field of computer vision and image processing CBIR (Content based image retrieval) system become an active research area. The CBIR technique involves feature extraction based on image features (like color, shape and texture) and defining rules for comparing image. A classifier is also used by authors for image classification. For this purpose an image database taken from James Z. Wang research group website is used by many authors. Due to enormous increase in the size of database traditional methods of image retrieval by using keywords does not provide accurate result. Thus the concept of CBIR system is emerged. In last couple of years many method of feature extraction is developed but since now researcher are not able to develop a system which has gained high accuracy of human visual perception in distinguishing pictures. Therefore earlier researchers have concentrated to increase the retrieval accuracy of CBIR system by using different combination of features. The objective of this paper is to present review on a CBIR technique which combined four kinds of features set including every kind of feature for developing feature vector. Color based features (histogram), statistical features (mean, median and standard deviation), spatial features (Gabor feature and wavelet features) and texture features (GLCM) is used for forming feature vector. A SVM classifier is used with CBIR system to increase retrieval accuracy. SVM (support vector machine) is a machine learning classifier which provides good classification accuracy. Keywords: CBIR, SVM, NN, GLCM, HSV Color space, Euclidean distance matrix.

In the current years, advancements in medical imaging have prompted the rise of some massive databases, including the pictures from a different scope of modalities. Content based image retrieval (CBIR) is a kind of search that selects examples from an image set that have a similar content to an input query image. Each CBIR system consists of two substantial factors, feature extraction and similarity measure. Based on the type of these parts, many CBIR systems are proposed. In this paper we present not only how to design a CBIR system for MRI brain Tumor images, but also a comparison between the different implemented CBIR systems and ours. Furthermore, in this research, using a DML (Distance Metric Learning) instead of the rigid distance metric such as Euclidean distance as the Similarity measure has helped the researchers to obtain a better mAP (mean Average Precision) as the result. The experimental results of our CBIR system show that it has a better performance than other rivals in the field. The obtained mean average precision of our CBIR system is 92.41 that is significant in MRI brain tumor.

Content-Based Image Retrieval (CBIR) plays a vital role in various digital image processing fields such as image retrieval, classification, feature extraction, clustering, and indexing. In some cases, the high computational time as well the poor performance of similarity score makes the process of image retrieval an unsuitable one for CBIR having larger datasets. To overcome this trauma, the article presents a combined scheme to perform image retrieval and feature extraction using an eminent utilization of angular patterned wavelet Fourier descriptor with Randomized Robust Learning. With this prominent technique, both the local and the global feature descriptors are extracted to attain a maximum retrieval accuracy. Furthermore, the learning process is made prominent, owing to the unique extracted features. It makes the process of indexing similar images faster and the retrieval of relevant images with less computational time in an organized manner. Our proposed methodology is executed in MATLAB and is compared with the existing methodologies regarding retrieval accuracy and surfing time by fast indexed output.

As the use of digital media increases, effective retrieval and management techniques become more important. In order to extract useful information from this huge amount of data, many content based image retrieval (CBIR) systems have been developed. A typical CBIR system captures image features such as color, texture, or shape of objects in the query image and tries to retrieve images from the database with similar features. The main advantage of CBIR systems with relevance feedback is that these systems take into account the gap between the high-level concepts and low-level features and subjectivity of human perception of visual content. In this paper, a CBIR system based on color histogram has been presented and a new approach for image storage and retrieval called association-based image retrieval (ABIR) has been studied. The results of both systems have been shown.

In this paper, we present a novel approach for medical content based image retrieval (searching for images which are pathologically similar to a given example) and demonstrate its performance on a dataset containing maxillofacial lesions. Recently, distributed databases at hospitals and CT scanning centers are related through Picture Archiving and Communication Systems (PACS). Hence, a content based image retrieval system is helpful for radiologists in medical diagnosis. In our proposed framework, a feature vector is extracted for each image and SIFT sparse codes are employed in this step. After feature extraction based on sparse coding and maximum pooling, we have utilized different similarity measures such as Euclidean norm, Manhattan distance and SVM classifier to choose most relevant images to the query image. We have evaluated our proposed framework on a dataset containing 2023 images belonging to 5 different categories: cleft, impaction, fracture, maxillary sinus cyst and healthy. Classification rate of 97.3% and precision versus recall curve indicate the effectiveness of sparse coding in content-based medical image retrieval.

This paper presents an image representation and matching framework for image categorization in medical image archives. Categorization enables one to determine automatically, based on the image content, the examined body region and imaging modality. It is a basic step in content-based image retrieval (CBIR) systems, the goal of which is to augment text-based search with visual information analysis. CBIR systems are currently being integrated with picture archiving and communication systems for increasing the overall search capabilities and tools available to radiologists. The proposed methodology is comprised of a continuous and probabilistic image representation scheme using Gaussian mixture modeling (GMM) along with information-theoretic image matching via the Kullback-Leibler (KL) measure. The GMM-KL framework is used for matching and categorizing X-ray images by body regions. A multidimensional feature space is used to represent the image input, including intensity, texture, and spatial information. Unsupervised clustering via the GMM is used to extract coherent regions in feature space that are then used in the matching process. A dominant characteristic of the radiological images is their poor contrast and large intensity variations. This presents a challenge to matching among the images, and is handled via an illumination-invariant representation. The GMM-KL framework is evaluated for image categorization and image retrieval on a dataset of 1500 radiological images. A classification rate of 97.5% was achieved. The classification results compare favorably with reported global and local representation schemes. Precision versus recall curves indicate a strong retrieval result as compared with other state-of-the-art retrieval techniques. Finally, category models are learned and results are presented for comparing images to learned category models.

Content Based Image Retrieval (CBIR) becomes a very challenging taks due to the rapid growth in multimedia content and its visual complexity. From query by image to retrieval of relevant images, CBIR has different phases. However, features extraction of images is one of the important phases. Recently Convolutional Neural Network (CNN) shows good results in the field of computer vision due to the ability of extraction features from the images. This paper introduces CNN for features extraction from images, in CBIR system. Euclidean distance is used for association among query and stored images using the extracted features. Performance of the proposed work is evaluated using precision. The proposed work shows improved results as compared to the existing works.

As we all know, the content-based image retrieval (CBIR) is very time-consuming due to the extraction and matching of high dimensional and complex features. The traditional CBIR systems could not respond to a very large number of retrieval requests at mean time, which are submitted from the Internet. In this paper, we propose a content-based parallel image retrieval system to achieve high responding ability. Our system is developed on cluster architectures. It has several retrieval servers to supply the service of content-based image retrieval. Our system adopts the Browser/Server (B/S) mode. The users could visit our system though web pages. Our system uses the Symmetrical Color-Spatial Features (SCSF)[25] to represent the content of an image. The SCSF is effective and efficient for image matching because it is independent of image distortion such as rotation and flip as well as it increases the matching accuracy. The SCSF was organized by M-tree[16], which could speedup the searching procedure. Our experiments show that the image matching is quickly and efficiently with the use of SCSF. And with the support of several retrieval servers, the system could respond to many users at mean time. (Abstract)

Introduction: Content-based image retrieval (CBIR) retrieves the images from the vast image repositories. Research in the CBIR domain gets attention due to the massive number of images generated by the mobiles and various image-capturing machines. Objectives: Any image retrieval system’s primary goal is to reduce the semantic gap between low-level features and high-level perception. Methods: The CBIR techniques are classified into multiple categories based on the feature extraction and retrieval mechanism. These categories are feature-based, machine-learning-based, and deep-learning-based methods. The pioneer techniques for each category are explained in detail in this chapter. Results: The comparative analysis has been done to highlight the advantages of techniques over others. Conclusion: The various application area of the CBIR has been described. The most evolving application is the content-based medical image retrieval (CBMIR) system. The applicability of the CBMIR system in different medical science domains is explained in detail.

In this paper we propose a novel methodology for Web Image retrieval system that takes an image as the input query and retrieves images based on image content. Content Based Image Retrieval is an approach for retrieving semantically-relevant images from an image store based on algorithmically-derived image features. We propose an algorithm to represent images using divisive and partitioned based clustering approaches. The HSV color component and Haar wavelet transform has been used to extract image features. These features are taken to segment an image to obtain objects. For segmenting an image, modified k-means clustering algorithm was used to group similar pixel together into K groups with cluster centers. To modify K-means, a divisive based clustering algorithm has been proposed to determine the number of cluster and get back with number of cluster to k-means to obtain significant object groups. In addition, the similarity distance measure using threshold value and object uniqueness to quantify the results was also measured.

Content-Based Image retrieval (CBIR) has gained a magnificent deal of consideration because of the digital image data's epidemic growth. The advancement of deep learning has enabled Convolutional Neural Networks to become an influential technique for extraction of discriminative image features. In recent years, convolutional neural networks (CNNs) have proven extremely effective at extracting unique information from images. In contrast to text-based image retrieval, CBIR gathers comparable images based primarily on their visual content. The use of deep learning, especially CNNs, for feature extraction and image processing has been shown to perform better than other techniques. In the proposed study, we investigate CNNs for CBIR focusing on how well they extract discriminative visual features and facilitate accurate image retrieval. Also Principal Component Analysis and Linear Discriminant Analysis are combined for optimization of features resulting in boosting the retrieval results. Using hierarchical representations learned by CNNs, we aim to improve retrieval accuracy and efficiency. In comparison with conventional retrieval techniques, our proposed CBIR system shows superior performance on a benchmark dataset.

There is a growing trend for using content‐based image retrieval (CBIR) systems these days because of the constantly growing interest in digital content. Therefore, the ability of the CBIR to perform the CBIR process will depend on the feature extraction process and its basis, for the retrieval will be done on. Numerous researchers put forward various techniques for feature extraction to enhance the nature of the system. Since features play a very key role in enhancing performance, various features can be used collectively to attain the requisite goal. To retain this in mind, we present in this paper a multifeature fusion system, where three features are integrated and form one feature to improve the situation of retrieval. For this purpose, scale‐invariant feature transform (SIFT), speeded‐up robust features (SURF), and histogram of oriented gradients (HOG) features are adopted. These features are common features that deliver information about the shape of the object and for matching purposes, two techniques of distance matching such as Euclidean and Hausdrauff distance are adopted. To assess the performance of the proposed multifeature‐based CBIR approach, experiments were conducted with the usage of a MATLAB simulator. The Corel‐1000 dataset, consisting of 10,000 images in 100 semantic classes, turned into applied, with each magnificence containing 100 images. A subset of 2500 images across 50 semantic classes was used to train the system. This research aligns with industry, innovation, and infrastructure by contributing to advancements in image processing and retrieval systems. Key characteristic descriptors, along with SIFT, SURF, HOG, texture, and multicharacteristic combinations, were extracted for retrieval functions. The results display that the usage of the Hausdrauff distance as a similarity degree outperforms Euclidean distance, accomplishing retrieval accuracies of 80.02% for HOG, 77.9% for SIFT, 79. 8% for SURF, 77.2% for texture, and 84.2% for multicharacteristic combinations, surpassing Euclidean distance results via 1.7%–3.6% across capabilities. These findings underscore the effectiveness of Hausdrauff distance in enhancing retrieval precision within the CBIR framework.