A food image recognition system with Multiple Kernel Learning

Identifying sandstone images and judging the types of minerals play an important role in oil and gas reservoir exploration and evaluation. Multiple kernel learning (MKL) method has shown high performance in solving some practical applications. While this method belongs to a shallow structure and cannot handle relatively complex problems well. With the development of deep learning in recent years, many researchers have proposed a deep multiple layer multiple kernel learning (DMLMKL) method based on deep structure. While the existing DMLMKL method only considers the deep representation of the data but ignores the shallow representation between the data. Therefore, this paper propose a multiple scale multiple layer multiple kernel learning (MS-DKL) method that “richer” feature data by fusing deep and shallow representations of mineral image features. Mineral recognition results show that MS-DKL algorithm is higher accuracy in mineral recognition than the MKL and DMLMKL methods.KeywordsMineral recognitionDeep kernel learningMultiple scaleSLIC

Recently, multiple kernel learning (MKL) methods have been developed to improve the flexibility of kernel-based learning machine. The MKL methods generally focus on determining key kernels to be preserved and their significance in optimal kernel combination. Unfortunately, computational demand of finding the optimal combination is prohibitive when the number of training samples and kernels increase rapidly, particularly for hyperspectral remote sensing data. In this paper, we address the MKL for classification in hyperspectral images by extracting the most variation from the space spanned by multiple kernels and propose a representative MKL (RMKL) algorithm. The core idea embedded in the algorithm is to determine the kernels to be preserved and their weights according to statistical significance instead of time-consuming search for optimal kernel combination. The noticeable merits of RMKL consist that it greatly reduces the computational load for searching optimal combination of basis kernels and has no limitation from strict selection of basis kernels like most MKL algorithms do; meanwhile, RMKL keeps excellent properties of MKL in terms of both good classification accuracy and interpretability. Experiments are conducted on different real hyperspectral data, and the corresponding experimental results show that RMKL algorithm provides the best performances to date among several the state-of-the-art algorithms while demonstrating satisfactory computational efficiency.

Multiple kernel learning (MKL) is a promising family of machine learning algorithms using multiple kernel functions for various challenging data mining tasks. Conventional MKL methods often formulate the problem as an optimization task of learning the optimal combinations of both kernels and classifiers, which usually results in some forms of challenging optimization tasks that are often difficult to be solved. Different from the existing MKL methods, in this paper, we investigate a boosting framework of MKL for classification tasks, i.e., we adopt boosting to solve a variant of MKL problem, which avoids solving the complicated optimization tasks. Specifically, we present a novel framework of Multiple kernel boosting (MKBoost), which applies the idea of boosting techniques to learn kernel-based classifiers with multiple kernels for classification problems. Based on the proposed framework, we propose several variants of MKBoost algorithms and extensively examine their empirical performance on a number of benchmark data sets in comparisons to various state-of-the-art MKL algorithms on classification tasks. Experimental results show that the proposed method is more effective and efficient than the existing MKL techniques.

A nonlinear subspace multiple kernel learning for financial distress prediction of Chinese listed companies

Currently, most of the classification studies of psychosis focused on chronic patients and employed single machine learning approaches. To overcome these limitations, we here compare, to our best knowledge for the first time, different classification methods of first-episode psychosis (FEP) using multi-modal imaging data exploited on several cortical and subcortical structures and white matter fiber bundles. 23 FEP patients and 23 age-, gender-, and race-matched healthy participants were included in the study. An innovative multivariate approach based on multiple kernel learning (MKL) methods was implemented on structural MRI and diffusion tensor imaging. MKL provides the best classification performances in comparison with the more widely used support vector machine, enabling the definition of a reliable automatic decisional system based on the integration of multi-modal imaging information. Our results show a discrimination accuracy greater than 90 % between healthy subjects and patients with FEP. Regions with an accuracy greater than 70 % on different imaging sources and measures were middle and superior frontal gyrus, parahippocampal gyrus, uncinate fascicles, and cingulum. This study shows that multivariate machine learning approaches integrating multi-modal and multisource imaging data can classify FEP patients with high accuracy. Interestingly, specific grey matter structures and white matter bundles reach high classification reliability when using different imaging modalities and indices, potentially outlining a prefronto-limbic network impaired in FEP with particular regard to the right hemisphere.

Using Multimodal MRI Data to Classify Patients with First Episode Psychosis

In recent years, with the popularity of the Internet, digital media has become an indispensable part of people's life. Image acquisition equipment is widely used in daily life and work. However, due to technical problems, it can not meet the performance requirements of users. At the same time, a large number of data and information are difficult to be effectively processed, which also reduces the image quality, reduces the storage space and increases the image distortion. Therefore, it is necessary to develop new algorithms to improve these defects. Therefore, this paper designs and develops an automatic digital media image recognition system based on mean clustering algorithm. Firstly, this paper describes the concept and characteristics of digital media. Then, this paper also studies the application of mean clustering algorithm. Based on this, an automatic digital media image recognition system is designed, and the performance of the system is tested by simulation. Finally, the test results show that the algorithm can accurately identify media images. In general, the performance of the digital media image automatic recognition system based on mean clustering algorithm can meet the needs of target users.

This paper presents an automatic fruit recognition system for classifying and identifying fruit types. The work exploits the fruit shape and color, to identify each image feature. The proposed system includes three phases namely: pre-processing, feature extraction, and classification phases. In the pre-processing phase, fruit images are resized to 90 x 90 pixels in order to reduce their color index. In feature extraction phase, the proposed system uses scale invariant feature transform (SIFT) and shape and color features to generate a feature vector for each image in the dataset. For classification phase, the proposed model applies K-Nearest Neighborhood (K-NN) algorithm classification, and support vector machine (SVM) algorithm of different kinds of fruits. A series of experiments were carried out using the proposed model on a dataset of 178 fruit images. The results of carrying out these experiments demonstrate that the proposed approach is capable of automatically recognize the fruit name with a high degree of accuracy.

Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) aims to learn a kernel from a combination of base kernel functions that perform optimally on the task. In this paper, we propose a novel MKL-themed approach to combine base kernels that are multiplicatively shaped with low-rank positive semidefinitve matrices. The proposed approach generalizes several popular MKL methods and thus provides more flexibility in modeling data. Computationally, we show how these low-rank matrices can be learned efficiently from data using convex quadratic programming. Empirical studies on several standard benchmark datasets for MKL show that the new approach often improves prediction accuracy statistically significantly over very competitive single kernel and other MKL methods.

It is challenging to use incomplete multimodality data for Alzheimer's Disease (AD) diagnosis. The current methods to address this challenge, such as low-rank matrix completion (i.e., imputing the missing values and unknown labels simultaneously) and multi-task learning (i.e., defining one regression task for each combination of modalities and then learning them jointly), are unable to model the complex data-to-label relationship in AD diagnosis and also ignore the heterogeneity among the modalities. In light of this, we propose a new Maximum Mean Discrepancy (MMD) based Multiple Kernel Learning (MKL) method for AD diagnosis using incomplete multimodality data. Specifically, we map all the samples from different modalities into a Reproducing Kernel Hilbert Space (RKHS), by devising a new MMD algorithm. The proposed MMD method incorporates data distribution matching, pair-wise sample matching and feature selection in an unified formulation, thus alleviating the modality heterogeneity issue and making all the samples comparable to share a common classifier in the RKHS. The resulting classifier obviously captures the nonlinear data-to-label relationship. We have tested our method using MRI and PET data from Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset for AD diagnosis. The experimental results show that our method outperforms other methods.

Multiple Kernel Based Transfer Learning for the Few-Shot Recognition Task in Smart Home Scene

Kernel methods have become a standard solution for a large number of data analysis, and extensively utilized in the field of signal processing including analysis of speech, image, time series, and DNA sequences. The main difficulty in applying the kernel method is in designing the appropriate kernel for the specific data, and multiple kernel learning (MKL) is one of the principled approaches for kernel design problem. In this paper, a novel multiple kernel learning method based on the notion of Gaussianity evaluated by entropy power inequality is proposed. The notable characteristics of the proposed method are in utilizing the entropy power inequality for kernel learning, and in realizing an MKL algorithm which only optimizes the kernel combination coefficients, while the conventional methods need optimizing both combination coefficients and classifier parameters. The proposed MKL algorithm is experimentally shown to have good classification accuracy.

There is good evidence that eating a healthy diet can reduce your risk of obesity and illnesses such as diabetes, heart disease, stroke, osteoporosis and some types of cancer. The food you eat contains different types of nutrients, which are all required for the many vital processes in our body. Our approach is to capture food and fed to Dense SIFT method, this method extract keypoint and visual vector from an image. Extracted visual vector are clustered using K-means clustering technique. Finally support vector machine classifier is used in this work, classifies the food image and measures the carbohydrate level from food image. Our proposed system is based on Bag of Feature (BoF) model.

The image-recipe cross-modal retrieval task, which retrieves the relevant recipes according to food images and vice versa, is now attracting widespread attention. There are two main challenges for image-recipe cross-modal retrieval task. Firstly, a recipe’s different components (words in a sentence, sentences in an entity, and entities in a recipe) have different weight values. If a recipe’s different components own the same weight, the recipe embeddings cannot pay more attention to the important components. As a result, the important components make less contribution to the retrieval task. Secondly, the food images have obvious properties of locality and only the local food regions matter. There are still difficulties in enhancing the discriminative local region features in the food images. To address these two problems, we propose a novel framework named Dual Cross Attention Encoders for Cross-modal Food Retrieval (DCA-Food). The proposed framework consists of a hierarchical cross attention recipe encoder (HCARE) and a cross attention image encoder (CAIE). HCARE consists of three types of cross attention modules to capture the important words in a sentence, the important sentences in an entity and the important entities in a recipe, respectively. CAIE extracts global and local region features. Then, it calculates cross attention between them to enhance the discriminative local features in the food images. We conduct the ablation studies to validate our design choices. Our proposed approach outperforms the existing approaches by a large margin on the Recipe1M dataset. Specifically, we improve the R@1 performance by +2.7 and +1.9 on the 1k and 10k testing sets, respectively.

Automatic action recognition in videos is a challenging computer vision task that has become an active research area in recent years. Existing strategies usually use kernel-based learning algorithms that considers a simple combination of different features completely disregarding how such features should be integrated to fit the given problem. Since a given feature is most suitable to describe a given image/video property, the adaptive weighting of such features can improve the performance of the learning algorithm. In this paper, we investigated the use of the Multiple Kernel Learning (MKL) algorithm to adaptive search for the best linear relation among the considered features. MKL is an extension of the support vector machines (SVMs) to work with a weighted linear combination of several single kernels. This approach allows to simultaneously estimate the weights for the multiple kernels combination as well as the underlying SVM parameters. In order to prove the validity of the MKL approach, we considered a descriptor composed of multiple features aligned with dense trajectories. We experimented our approach on a database containing 36 cooking actions. Results confirm that the use of MKL improves the classification performance.