Due to the recent technology development, the multimedia complexity is noticeably increased and new research areas are opened relying on similar multimedia content retrieval. Content-based image retrieval (CBIR) systems are used for the retrieval of images related to the Query Image (QI) from huge databases. The CBIR systems available today have confined efficiency as they extract only limited feature sets. This paper demonstrates the extraction of vast robust and important features from the images database and the storage of these features in the repository in the form of feature vectors. The feature repository contains color signature, the shape features and texture features. Here, features are extracted from specific QI. Accordingly, an innovative similarity evaluation with a metaheuristic algorithm (genetic algorithm with simulating annealing) has been attained between the QI features and those belonging to the database images. For an image entered as QI from a database, the distance metrics are used to search the related images, which is the main idea of CBIR. The proposed CBIR techniques are described and constructed based on RGB color with neutrosophic clustering algorithm and Canny edge method to extract shape features, YCbCr color with discrete wavelet transform and Canny edge histogram to extract color features, and gray-level co-occurrence matrix to extract texture features. The combination of these methods increases the image retrieval framework performance for content-based retrieval. Furthermore, the results’ precision–recall value is calculated to evaluate the system’s efficiency. The CBIR system proposed demonstrates better precision and recall values compared to other state-of-the-art CBIR systems.

Content-Based Image Retrieval Using Color, Shape and Texture Descriptors and Features

With the recent evolution of technology, the number of image archives has increased exponentially. In Content-Based Image Retrieval (CBIR), high-level visual information is represented in the form of low-level features. The semantic gap between the low-level features and the high-level image concepts is an open research problem. In this paper, we present a novel visual words integration of Scale Invariant Feature Transform (SIFT) and Speeded-Up Robust Features (SURF). The two local features representations are selected for image retrieval because SIFT is more robust to the change in scale and rotation, while SURF is robust to changes in illumination. The visual words integration of SIFT and SURF adds the robustness of both features to image retrieval. The qualitative and quantitative comparisons conducted on Corel-1000, Corel-1500, Corel-2000, Oliva and Torralba and Ground Truth image benchmarks demonstrate the effectiveness of the proposed visual words integration.

/pdf/a-novel-image-retrieval-based-on-visual-words-integration-of-4nkbztiyoi.pdf

A Novel Image Retrieval Based on Visual Words Integration of SIFT and SURF.

With the development of content-based image retrieval technology, the retrieval efficiency of image retrieval technology is getting higher and higher. For different data images, image retrieval based on color features and shape features can be used to improve retrieval efficiency. However, when a single image feature is retrieved, its retrieval efficiency still cannot meet people’s needs. In this paper, we propose an image retrieval algorithm based on the combination of color and shape features. The cumulative histogram method is used to calculate the color features of the image, and 7 Hu invariant moments are calculated as shape features. The color and shape features are combined with certain weights, and the Euclidean distance is used as the similarity measure. Finally, the image is retrieved, and the related experiments are passed. By comparing with related experiments, the algorithm effectively improves the accuracy of image retrieval.

Research on Image Retrieval Algorithm Based on Combination of Color and Shape Features

Superpixel segmentation partitions an image into perceptually coherent segments of similar size, namely, superpixels. It is becoming a fundamental preprocessing step for various computer vision tasks because superpixels significantly reduce the number of inputs and provide a meaningful representation for feature extraction. We present a pixel-related Gaussian mixture model (GMM) to segment images into superpixels. GMM is a weighted sum of Gaussian functions, each one corresponding to a superpixel, to describe the density of each pixel represented by a random variable. Different from previously proposed GMMs, our weights are constant, and Gaussian functions in the sums are subsets of all the Gaussian functions, resulting in segments of similar size and an algorithm of linear complexity with respect to the number of pixels. In addition to the linear complexity, our algorithm is inherently parallel and allows fast execution on multi-core systems. During the expectation-maximization iterations of estimating the unknown parameters in the Gaussian functions, we impose two lower bounds to truncate the eigenvalues of the covariance matrices, which enables the proposed algorithm to control the regularity of superpixels. Experiments on a well-known segmentation dataset show that our method can efficiently produce superpixels that adhere to object boundaries better than the current state-of-the-art methods.

Superpixel Segmentation Using Gaussian Mixture Model

Despite broad investigation in content-based image retrieval (CBIR), issue to lessen the semantic gap between high-level semantics and local attributes of the image is still an important issue. The local attributes of an image such as shape, color, and texture are not sufficient for effective CBIR. Visual similarity is a principal step in CBIR and in the baseline approach. In this article, we introduce a novel approach, which relies on the fusion of visual words of scale-invariant feature transform (SIFT) and binary robust invariant scalable keypoints (BRISK) descriptors based on the visual-bag-of-words approach. The two local feature descriptors are chosen as their fusion adds complementary improvement to CBIR. The SIFT descriptor is capable of detecting objects robustly under cluttering due to its invariance to scale, rotation, noise, and illumination variance.
 However, SIFT descriptor does not perform well at low illumination or poorly localized keypoints within an image. Due to this reason, the discriminative power of the SIFT descriptor is lost during the quantization process, which also reduces the performance of CBIR. However, the BRISK descriptor provides scale and rotation-invariant scale-space, high quality and adaptive performance in classification based applications. It also performs better at poorly localized keypoints along the edges of an object within an image as compared to the SIFT descriptor. The suggested approach based on the fusion of visual words achieves effective results on the Corel-1K, Corel-1.5K, Corel-5K, and Caltech-256 image repositories as equated to the feature fusion of both descriptors and latest CBIR approaches with the surplus assistances of scalability and fast indexing.

Scene analysis and search using local features and support vector machine for effective content-based image retrieval

Image retrieval using spatiograms of colors quantized by Gaussian Mixture Models

Image segmentation using spectral clustering of Gaussian mixture models

Hyperspectral imaging can simultaneously acquire spectral and spatial information of the samples and is, therefore, widely applied in the non-destructive detection of grain quality. Supervised learning is the mainstream method of hyperspectral imaging for pixel-level detection of mildew in corn kernels, which requires a large number of training samples to establish the prediction or classification models. This paper presents an unsupervised redundant co-clustering algorithm (FCM-SC) based on multi-center fuzzy c-means (FCM) clustering and spectral clustering (SC), which can effectively detect non-uniformly distributed mildew in corn kernels. This algorithm first carries out fuzzy c-means clustering of sample features, extracts redundant cluster centers, merges the cluster centers by spectral clustering, and finally finds the category of corresponding cluster centers for each sample. It effectively solves the problems of the poor ability of the traditional fuzzy c-means clustering algorithm to classify the data with complex structure distribution and the complex calculation of the traditional spectral clustering algorithm. The experimental results demonstrated that the proposed algorithm could describe the complex structure of mildew distribution in corn kernels and exhibits higher stability, better anti-interference ability, generalization ability, and accuracy than the supervised classification model.

/pdf/a-method-for-detection-of-corn-kernel-mildew-based-on-co-2x1cz4si.pdf

A Method for Detection of Corn Kernel Mildew Based on Co-Clustering Algorithm with Hyperspectral Image Technology

Self-supervised anomaly pattern detection for large scale industrial data

With the continuous development of hyperspectral image technology and deep learning methods in recent years, an increasing number of hyperspectral image classification models have been proposed. However, due to the numerous spectral dimensions of hyperspectral images, most classification models suffer from issues such as breaking spectral continuity and poor learning of spectral information. In this paper, we propose a new classification model called the enhanced spectral fusion network (ESFNet), which contains two parts: an optimized multi-scale fused spectral attention module (FsSE) and a 3D convolutional neural network (3D CNN) based on the fusion of different spectral strides (SSFCNN). Specifically, after sampling the hyperspectral images, our model first implements the weighting of the spectral information through the FsSE module to obtain spectral data with a higher degree of information richness. Then, the weighted spectral data are fed into the SSFCNN to realize the effective learning of spectral features. The new model can maximize the retention of spectral continuity and enhance the spectral information while being able to better utilize the enhanced information to improve the model’s ability to learn hyperspectral image features, thus improving the classification accuracy of the model. Experiment results on the Indian Pines and Pavia University datasets demonstrated that our method outperforms other relevant baselines in terms of classification accuracy and generalization performance.

/pdf/an-enhanced-spectral-fusion-3d-cnn-model-for-hyperspectral-2ht66pd9.pdf

Zhen Kang

Papers

Image retrieval using spatiograms of colors quantized by Gaussian Mixture Models

Image segmentation using spectral clustering of Gaussian mixture models

A Method for Detection of Corn Kernel Mildew Based on Co-Clustering Algorithm with Hyperspectral Image Technology

Self-supervised anomaly pattern detection for large scale industrial data

An Enhanced Spectral Fusion 3D CNN Model for Hyperspectral Image Classification