Experimental analogy of different texture feature extraction techniques in image retrieval systems

Interpreting medical images is certainly a complex task which requires extensive knowledge [1]. According to Computer Aided Diagnosis (CAD) serves as a second opinion that will help radiologists in diagnosis and on the other hand Content-based Image Retrieval uses visual content to help users browse, search and retrieve similar medical images from a database based on the user’s interest [2-4]. The competency of the CBMIR system depends on feature extraction methods [5]. The textural features are very important to determine the content of a medical image. Textural features provide scenic depth, the spatial distribution of tonal variation, and surface orientation [6]. Therefore, this study seeks to compare and evaluate some of the hand-crafted texture feature extraction techniques in CBMIR. This is to help those concerned in enhancing CBIR systems to make informed decisions concerning the selection of the best textural feature extraction techniques. Since there is no clear indication of which of the various texture feature extraction techniques is best suited for a given performance metric when considering which of the techniques to choose for a particular study in CBMIR systems. The objective of this work, therefore, is to comparatively evaluate the performance of the following texture feature extraction techniques; Local Binary Pattern (LBP), Gabor Filter, Gray-Level Co-occurrence Matrix (GLCM), Haralick Descriptor, Features from Accelerated Segment Test (FAST) and Features from Accelerated Segment Test and Binary Robust Independent Elementary Features (FAST &BRIEF) using the metrics; precision, recall, f1-score, mean squared error (MSE), accuracy and time. These techniques are coupled with specific similarity measure to obtain results. The results showed that LBP, Haralick Descriptor, FAST, and GLCM had the best results in terms of (Precision and Accuracy), Time, F1-Score, and Recall respectively. LBP had 82.05% and 88.23% scores for precision and accuracy respectively. The following scores represent the performance of the Haralick descriptor, FAST, and GLCM models respectively; 0.88s, 38.7%, and 44.82%. These test scores are obtained from datasets ranging from 1k-10.5k. Aside from LBP outperforming the other 5 models mentioned, it still outperformed the following proposed models ' [7]’, ‘Tamura texture feature and wavelet transform combined with Hausdorff distance - [8]’, ‘ [9]’ in terms of (precision, accuracy, and recall) and (precision and recall) respectively and probably f1-score (since f1-score is the weighted average of precision and recall). It is believed that an ensemble of LBP, Haralick descriptors, and Support Vector Machine (SVM) can represent a robust system for both medical image retrieval and classification.

Image retrieval is one of the most interesting and fastest growing research areas in all fields. It is an effective and efficient tool for managing large image databases. In most Content-Based Image Retrieval (CBIR) systems, an image is represented by a set of low-level visual features; hence a direct correlation with high-level semantic information will be absent. Therefore, a gap exists between high-level information and low-level features, which is the main reason that hinders the improvement of the image retrieval accuracy. In this work, main focus is on the semantic based image retrieval system using Gray Level Co-occurrence Matrix (GLCM) for texture feature extraction. Based on the texture features, semantic interpretations are given to the extracted textures. The images are retrieved according to user satisfaction and thereby reduce the semantic gap between low level features and high level features.

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.

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.

Content based image retrieval is grievous need of present scenario in digital imaging world. This work presents a new multi-scale content based image retrieval system which leverages the multi-resolution property of discrete wavelet transform (DWT) and the local information attribute of local extrema patterns (LEPs). Two level DWT is applied on images and wavelet coefficients are obtained for images, further the LEPs are collected from wavelet coefficients to extract the feature vector. The proposed method abbreviated as DWT+LEP and tested on two benchmark databases for validation and compared with local extrema patterns (LEPs), discrete wavelet transform (DWT), center-symmetric local binary pattern (CS LBP), local edge pattern for image retrieval (LEPINV), local edge pattern for segmentation (LEPSEG), local binary pattern (LBP) and block based local binary pattern (BLK LBP).

This paper discusses the use of the clusterization to group palm trees in plantation areas using three categories, i.e. healthy, unhealthy, and non-plantation. Here, overhead images taken by an Unmanned Aerial Vehicle (UAV) were used to view a wider area. Images were divided into several smaller images using sliding windows and extracted using three color feature extraction techniques, i.e. 2D Wavelet Decomposition Color Energy, Principal Component Analysis, and t-Distributed Stochastic Neighbor Embedding (t-SNE). Texture feature extraction techniques used were Local Binary Pattern, Gray Level Co-occurrence Matrix and Segmentation-based Fractal Texture Analysis. Cluster results using the different techniques were compared to determine the optimal feature. Sliding windows were first implemented, and then cropped into small images with the same size as the windows. During clusterization, the K-Means clustering method was used to divide all smaller images into groups with high degrees of similarity. Feature extraction techniques were used individually to divide areas into three categories. The ground truth of the dataset was determined in advance, and results were compared to determine recognition rate. The study shows that dimensionality reduction using t-SNE in RGB color obtained the best clusterization results with 1135 correct patches.

This article proposes a content‐based image retrieval (CBIR) system that employs an informative pattern‐based descriptor. Recent literature has reported the development of efficient local‐pattern‐based descriptors, including the local vector pattern (LVP). This article extends the LVP formulation by making it more computationally efficient and informative. In the extended LVP‐based extraction process, the global index angles are determined using the mutual information between the patterns, which are obtained from a pair of indexed angles. Thus, the Proposed LVP (PLVP) no longer requires a step to identify patterns in every indexed angle found in the querying phase of the CBIR system. A CBIR system with the PLVP is developed in this article, and the system and its associated methods are tested using data from a benchmark texture database and a natural image database. A performance comparison of the PLVP and traditional patterns, such as the local binary pattern (LBP), completely modeled local binary pattern (CLBP) and local tetra pattern (LTrP), is conducted using the CBIR system. The experimental results reveal the superiority of the PLVP in terms of precision, recall, F‐score and computational efficiency.

Histogram refinement for texture descriptor based image retrieval

In the realm of computer vision, image processing, and image retrieval is one of the most rapidly growing disciplines. The image can be retrieved using the annotation and the content - based. CBIR (Content-based image retrieval) is becoming more popular in a range of areas, as well as data mining, education, diagnostic imaging, preventing crime, weather prediction and remote sensing. We can browse, search and retrieve images using an image retrieval system. This paper presents the CBIR using an orthogonal combination (OC) the Local Binary pattern (LBP), center-symmetric local binary pattern (CS-LBP) and PCA (Principal Component Analysis) of LBP. By computing the Gray-level difference, this approach connects the referenced pixel to its surrounding neighbors. Choosing the most appropriate images that correspond to the search image from the stored database is the paper’s primary objective. The proposed model has a combination of OC-LBP, CS-LBP, and PCA-LBP.

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.

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.

According to the recent literature, it is pragmatic that image storage and retrieval through the World Wide Web (WWW) has made impressive progress. Practical searching for image still confronts us with present retrieval systems. A Content Based Image Retrieval (CBIR) system provides an efficient way of retrieving related images from image collections. In this paper we present a new technique to extract the images from the database to achieve better performance and efficiency. The novel method uses an approach, which combines texture information and modified Block Truncation Coding (BTC) method to extract the color features from the image. The whole image is divided into a fixed block of size 4 × 4, 8 × 8, 16 × 16, 32 × 32, 64 × 64, 128 × 128 and 256 × 256 non overlapped blocks. For each block, we calculated the threshold as a mean of the pixel values and the number of pixels which are lower than threshold value and upper than the threshold value are counted and mean of these lower and upper values have been taken and these two are considered as features. Now this process is repeated for the all blocks to extract the features of the image. The second step will compute the four texture features using the Gray-Level Co-occurrence Matrix (GLCM) as a statistical approach to extract energy, contrast, entropy and uniformity. We have used this modified BTC and texture features of the image to retrieve images. Finally, we have conducted experiments on a ground truth image database that has 1000 images of different categories. A different block sizes have been used to demonstrate the experimental results and compared with tabulation. From this we have observed that the performance is better and efficiency is low with smaller block sizes and vice versa with higher block sizes. So we have to choose the middle ranges of block sizes for better performance with better efficiency. As we have observed from the results that the performance of the retrieval system is improved because of combination of texture and color features. The proposed system's performance has been improved by an average precision of 2.41% and recall of 8.22% when compared to existing systems.

This paper presents a content-based image retrieval (CBIR) system that incorporates real-valued multiple instance learning (MIL) into the user relevance feedback (RF) to learn the user's subjective visual concepts, especially where the user's most interested region and how to map the local feature vector of that region to the high-level concept pattern of the user. RF provides a way to obtain the subjectivity of the user's high-level visual concepts, and MIL enables the automatic learning of the user's high-level concepts. The user interacts with the CBIR system by relevance feedback in a way that the extent to which the image samples retrieved by the system are relevant to the user's intention is labeled. The system in turn applies the MIL method to find user's most interested image region from the feedback. A multilayer neural network that is trained progressively through the feedback and learning procedure is used to map the low-level image features to the high-level concepts.

Biometrics is the study of unique characteristics present in the human body such as fingerprint, palm-print, retina, iris, footprint, etc. While other traits have been explored widely, only a few people have been considered the foot-palm region, despite having unique properties. Prior work has explored the foot shape features using length, width, major axis, minor axis, centroid, etc. but they are not reliable for personal verification due to similarity in the physical composition of two persons. It increases the demand for more unique features based on the footprint. Footprint texture features coming from creases of foot palm are unique and permanent like palmprint texture features. Hence the main objective of the paper is to investigate various kinds of texture feature techniques. These techniques will be further used in correct extraction of footprint features. After extraction of footprint features a detailed experimental analysis is performed to discover the uniqueness in foot texture. It is further utilized to test its viability as a human recognition trait. We describe a detailed feature extraction and classification technique applied to a collected footprint data-set. For feature extraction, we use three techniques: Gray Level Co-occurrence Matrix (GLCM), Histogram Oriented Gradient (HOG), and Local Binary Patterns (LBP). Feature classification is performed using four techniques: Linear Discriminant Analysis (LDA), Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Ensemble Subspace Discriminant (ESD). GLCM provides less accuracy, while HOG generates a big feature vector which takes more execution time. LBP provides a trade-off between the accuracy and the execution time. Detailed quantitative experiments show: GLCM with LDA provides an accuracy of $$88.5\%$$ , HOG with Fine-KNN achieves $$86.5\%$$ accuracy and LBP with LDA achieves the accuracy of $$97.9\%$$ .

Recently, one of the authors proposed a new similarity measure, called weighted multidimensional Wald and Wolfowitz (MWW) runs test, for the content-based color image retrieval system. The algorithm outperforms conventional similarity measures for comparing two color images. In this paper, we propose a new content-based medical image retrieval system based on discrete wavelet transform (DWT) symlet and the weighted MWW runs test. The DWT is used to extracted texture features of the medical images. The weighted MWW runs test is used to compare distributions of texture features of two medical images. Our experiments were performed on 1,000 medical images from image retrieval in medical applications (IRMA). The experimental results show promisingly efficient to retrieve the medical images.