Learning to rank using privileged information

Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results

Multi-Resolution Feature Embedded Level Set Model for Crosshatched Texture Segmentation

In image processing applications, texture is the most important element utilized by human visual systems for distinguishing dissimilar objects in a scene. In this research article, a variational model based on the level set is implemented for crosshatched texture segmentation. In this study, the proposed model’s performance is validated on the Brodatz texture dataset. The cross-hatched texture segmentation in the lower resolution texture images is difficult, due to the computational and memory requirements. The aforementioned issue has been resolved by implementing a variational model based on the level set that enables efficient segmentation in both low and high-resolution images with automatic selection of the filter size. In the proposed model, the multi-resolution feature obtained from the frequency domain filters enhances the dissimilarity between the regions of crosshatched textures that have low-intensity variations. Then, the resultant images are integrated with a level set-based active contour model that addresses the segmentation of crosshatched texture images. The noise added during the segmentation process is eliminated by morphological processing. The experiments conducted on the Brodatz texture dataset demonstrated the effectiveness of the proposed model, and the obtained results are validated in terms of Intersection over the Union (IoU) index, accuracy, precision, f1-score and recall. The extensive experimental investigation shows that the proposed model effectively segments the region of interest in close correspondence with the original image. The proposed segmentation model with a multi-support vector machine has achieved a classification accuracy of 99.82%, which is superior to the comparative model (modified convolutional neural network with whale optimization algorithm). The proposed model almost showed a 0.11% improvement in classification accuracy related to the existing mode

IST Austria Thesis

The human ability to recognize objects in complex scenes has driven research in the computer vision field over couple of decades. This thesis focuses on the object recognition task in images. That is, given the image, we want the computer system to be able to predict the class of the object that appears in the image. A recent successful attempt to bridge semantic understanding of the image perceived by humans and by computers uses attribute-based models. Attributes are semantic properties of the objects shared across different categories, which humans and computers can decide on. To explore the attribute-based models we take a statistical machine learning approach, and address two key learning challenges in view of object recognition task: learning augmented attributes as mid-level discriminative feature representation, and learning with attributes as privileged information. Our main contributions are parametric and non-parametric models and algorithms to solve these frameworks. In the parametric approach, we explore an autoencoder model combined with the large margin nearest neighbor principle for mid-level feature learning, and linear support vector machines for learning with privileged information. In the non-parametric approach, we propose a supervised Indian Buffet Process for automatic augmentation of semantic attributes, and explore the Gaussian Processes classification framework for learning with privileged information. A thorough experimental analysis shows the effectiveness of the proposed models in both parametric and non-parametric views

Modified fuzzy rough set technique with stacked autoencoder model for magnetic resonance imaging based breast cancer detection

Breast cancer is the common cancer in women, where early detection reduces the mortality rate. The magnetic resonance imaging (MRI) images are efficient in analyzing breast cancer, but it is hard to identify the abnormalities. The manual breast cancer detection in MRI images is inefficient; therefore, a deep learning-based system is implemented in this manuscript. Initially, the visual quality improvement is done using region growing and adaptive histogram equalization (AHE), and then, the breast lesion is segmented by Otsu thresholding with morphological transform. Next, the features are extracted from the segmented lesion, and a modified fuzzy rough set technique is proposed to reduce the dimensions of the extracted features that decreases the system complexity and computational time. The active features are fed to the stacked autoencoder for classifying the benign and malignant classes. The results demonstrated that the proposed model attained 99% and 99.22% of classification accuracy on the benchmark datasets, which are higher related to the comparative classifiers: decision tree, naïve Bayes, random forest and k-nearest neighbor (KNN). The obtained results state that the proposed model superiorly screens and detects the breast lesions that assists clinicians in effective therapeutic intervention and timely treatment

A multilevel image thresholding based on Hybrid Salp Swarm algorithm and Fuzzy Entropy

The image segmentation techniques based on multi-level threshold value received lot of attention in recent years. It is because they can be used as a pre-processing step in complex image processing applications. The main problem in identifying the suitable threshold values occurs when classical image segmentation methods are employed. The swarm intelligence (SI) technique is used to improve multi-level threshold image (MTI) segmentation performance. SI technique simulates the social behaviors of swarm ecosystem, such as the behavior exhibited by different birds, animals etc. Based on SI techniques, we developed an alternative MTI segmentation method by using a modified version of the salp swarm algorithm (SSA). The modified algorithm improves the performance of various operators of the moth-flame optimization (MFO) algorithm to address the limitations of traditional SSA algorithm. This results in improved performance of SSA algorithm. In addition, the fuzzy entropy is used as objective function to determine the quality of the solutions. To evaluate the performance of the proposed methodology, we evaluated our techniques on CEC2005 benchmark and Berkeley dataset. Our evaluation results demonstrate that SSAMFO outperforms traditional SSA and MFO algorithms, in terms of PSNR, SSIM and fitness value

Image annotation and retrieval based on multi-modal feature clustering and similarity propagation.

The performance of content-based image retrieval systems has proved to be inherently constrained by the used low level features, and cannot give satisfactory results when the user\u27s high level concepts cannot be expressed by low level features. In an attempt to bridge this semantic gap, recent approaches started integrating both low level-visual features and high-level textual keywords. Unfortunately, manual image annotation is a tedious process and may not be possible for large image databases. In this thesis we propose a system for image retrieval that has three mains components. The first component of our system consists of a novel possibilistic clustering and feature weighting algorithm based on robust modeling of the Generalized Dirichlet (GD) finite mixture. Robust estimation of the mixture model parameters is achieved by incorporating two complementary types of membership degrees. The first one is a posterior probability that indicates the degree to which a point fits the estimated distribution. The second membership represents the degree of typicality and is used to indentify and discard noise points. Robustness to noisy and irrelevant features is achieved by transforming the data to make the features independent and follow Beta distribution, and learning optimal relevance weight for each feature subset within each cluster. We extend our algorithm to find the optimal number of clusters in an unsupervised and efficient way by exploiting some properties of the possibilistic membership function. We also outline a semi-supervised version of the proposed algorithm. In the second component of our system consists of a novel approach to unsupervised image annotation. Our approach is based on: (i) the proposed semi-supervised possibilistic clustering; (ii) a greedy selection and joining algorithm (GSJ); (iii) Bayes rule; and (iv) a probabilistic model that is based on possibilistic memebership degrees to annotate an image. The third component of the proposed system consists of an image retrieval framework based on multi-modal similarity propagation. The proposed framework is designed to deal with two data modalities: low-level visual features and high-level textual keywords generated by our proposed image annotation algorithm. The multi-modal similarity propagation system exploits the mutual reinforcement of relational data and results in a nonlinear combination of the different modalities. Specifically, it is used to learn the semantic similarities between images by leveraging the relationships between features from the different modalities. The proposed image annotation and retrieval approaches are implemented and tested with a standard benchmark dataset. We show the effectiveness of our clustering algorithm to handle high dimensional and noisy data. We compare our proposed image annotation approach to three state-of-the-art methods and demonstrate the effectiveness of the proposed image retrieval system