Search

The main contributions of this paper are: A new method for recognition of non-deformable severe occluded objects.Local shape descriptor from the wavelet coefficients of the tangent angle signature.Most likely object retrieval based on an ensemble of Hidden Markov Models.Two new area restrictions for consistency checking between hypotheses and occlusion. Shape classification has multiple applications. In real scenes, shapes may contain severe occlusions, hardening the identification of objects. In this paper, a method for object recognition under severe occlusion is proposed. Occlusion is dealt with separating shapes into parts through high curvature points, then tangent angle signature is found for each part and continuous wavelet transform is calculated for each signature. Next, the best matching object is calculated for each part using Pearsons correlation coefficient as similarity measure between wavelets of the part and of the most probable objects in the database. For each probable class, a hidden Markov model is created in an ensemble through training with the one-class approach. For hypotheses validation, two area restrictions are set to enhance recognition performance. Experiments were conducted with 1500 test shape instances with different scenarios of object occlusion. Results showed the method not only was capable of identifying highly occluded shapes (60%80% overlapping) but also present several advantages over previous methods.

This paper proposes a unified framework for Active Constrained Clustering.The proposed method relies on a multiple kernels learning setting.Utilization of constraints is considered by clustering method in this paper.Constraints are queried based on confidence about center and boundary of clusters. This paper examines the issues of constrained clustering and active selection of clustering constraints in a unified approach. A fuzzy clustering method specially crafted to deal with non-spherical clusters and explicit pairwise constraints is proposed in this paper as a core clustering method. An active method for constraints selection is embedded into the core clustering method for querying beneficial constraints during clustering. The proposed approach has two major advantages relative to traditional methods. First, it considers the dependency of constraints effectiveness on the clustering algorithm by unifying both clustering and constraints selection in a uniform, principled framework. Second, a constraints selection method is embedded into the core clustering method based on the fact that constraints will be more useful if they are selected according to the current state of clustering. Experiments conducted on synthetic and real-world datasets show the effectiveness of the proposed method.

We propose a graph-based mode-seeking method to fit multi-structural data.The proposed method combines mode-seeking with preference analysis.The proposed method exploits the global structure of graphs by random walks.Experiments show the proposed method is superior to some other fitting methods. In this paper, we propose a novel graph-based mode-seeking fitting method to fit and segment multiple-structure data. Mode-seeking is a simple and effective data analysis technique for clustering and filtering. However, conventional mode-seeking based fitting methods are very sensitive to the proportion of good/bad hypotheses, while most of sampling techniques may generate a large proportion of bad hypotheses. In this paper, we show that the proposed graph-based mode-seeking method has significant superiority for geometric model fitting. We intrinsically combine mode seeking with preference analysis. This enables mode seeking to be beneficial for reducing the influence of bad hypotheses since bad hypotheses usually have larger residual values than good ones. In addition, the proposed method exploits the global structure of graphs by random walks to alleviate the sensitivity to unbalanced data. Experimental results on both synthetic data and real images demonstrate that the proposed method outperforms several other competing fitting methods especially for complex data.

Multi-scale PCA framework is proposed for filtering the virus images.A multi-scale CLBP descriptor is developed to extract the features.Images are classified by the SVM with polynomial kernel and the MPMC features.Experiments show that the proposed method is better than the conventional methods. Virus image classification is an important issue in clinical virology, highly accurate algorithm of automatic virus image classification is very helpful. In this paper, instead of extracting virus feature from the original image, we propose a novel method that extracts the virus feature from the filtered images by multi-scale principal component analysis (PCA). Firstly, multi-scale PCA filters are learned from all original images in the data set. Secondly, the original images are convolved with the learned filters. Therefore, the filtered images can capture the principal texture information from different perspectives. Then, the completed local binary pattern (CLBP) descriptor is firstly utilized to depict the features of all filtered virus images. The multi-scale CLBP features extracted from filtered images by multi-scale PCA are combined as the feature MPMC (Multi-scale PCA and Multi-scale CLBP), which is proposed in this paper. Finally, support vector machine (SVM) with polynomial kernel is used for classification. Experiments show that the classification accuracy based on MPMC outperforms the previous methods in the literature for the same virus image data set.

An unsupervised procedure to local symmetry detection in natural images is proposed.Achieved via a Hough-style voting approach made at different scales and coordinate spaces.A final denoising scheme aims at removing noise and spurious local symmetries.Experiments have been conducted on the recent extension of the Berkeley Segmentation Dataset.The proposed method performs well compared to the state-of-the-art algorithms. Display Omitted In this paper, we propose a new unsupervised and simple approach to local symmetry detection of ribbon-like structure in natural images. The proposed model consists in quantifying the presence of a partial medial axis segment, existing between each pair of (preliminary detected) line segments delineating the boundary of two textured regions, by a set of heuristics related both to the geometrical structure of each pair of line segments and its ability to locally delimit a homogeneous texture region in the image. This semi-local approach is finally embedded in a two-step algorithm with an amplification step, via a Hough-style voting approach achieved at different scales and coordinate spaces which aims at determining the dominant local symmetries present in the image and a final denoising step, via an averaging procedure, which aims at removing noise and spurious local symmetries. The experiments, reported in this paper and conducted on the recent extension of the Berkeley Segmentation Dataset for the local symmetry detection task, demonstrate that the proposed symmetry detector performs well compared to the best existing state-of-the-art algorithms recently proposed in the literature.

The paper presents a novel texture descriptor based on Local Binary Patterns.We address the problem of rotation invariance and feature selections.The experiments are performed on standard datasets and the results are compared with the state-of-the-art.The source code to reproduce the results is made publicly available. In this paper, we present a novel rotation-invariant and computationally efficient texture descriptor called Dominant Rotated Local Binary Pattern (DRLBP). A rotation invariance is achieved by computing the descriptor with respect to a reference in a local neighborhood. A reference is fast to compute maintaining the computational simplicity of the Local Binary Patterns (LBP). The proposed approach not only retains the complete structural information extracted by LBP, but it also captures the complimentary information by utilizing the magnitude information, thereby achieving more discriminative power. For feature selection, we learn a dictionary of the most frequently occurring patterns from the training images, and discard redundant and non-informative features. To evaluate the performance we conduct experiments on three standard texture datasets: Outex12, Outex 10 and KTH-TIPS. The performance is compared with the state-of-the-art rotation invariant texture descriptors and results show that the proposed method is superior to other approaches.

This paper introduces a kernel version of the Subspace Pursuit algorithm.The proposed method, KSP, is a new iterative method for sparse regression.KSP outperforms and is less computationally intensive than related kernel methods. Recently, results from sparse approximation theory have been considered as a means to improve the generalization performance of kernel-based machine learning algorithms. In this paper, we present Kernel Subspace Pursuit (KSP), a new method for sparse non-linear regression. KSP is a low-complexity method that iteratively approximates target functions in the least-squares sense as a linear combination of a limited number of elements selected from a kernel-based dictionary. Unlike other kernel methods, by virtue of KSP's algorithmic design, the number of KSP iterations needed to reach the final solution does not depend on the number of basis functions used nor that of elements in the dictionary. We experimentally show that, in many scenarios involving learning synthetic and real data, KSP is less complex computationally and outperforms other kernel methods that solve the same problem, namely, Kernel Matching Pursuit and Kernel Basis Pursuit.

The paper proposes a novel Multi-objective Genetic Algorithm for Data Imputation, called MOGAImp.This is the first method that applies a multi-objective approach to data imputation.MOGAImp presents a good tradeoff between the evaluation measures studied.The results confirm the MOGAImp prevalence for utilization over conflicting evaluation measures.MOGAImp codification scheme makes possible to adapt it to different application domains. A large number of techniques for data analyses have been developed in recent years, however most of them do not deal satisfactorily with a ubiquitous problem in the area: the missing data. In order to mitigate the bias imposed by this problem, several treatment methods have been proposed, highlighting the data imputation methods, which can be viewed as an optimization problem where the goal is to reduce the bias caused by the absence of information. Although most imputation methods are restricted to one type of variable whether categorical or continuous. To fill these gaps, this paper presents the multi-objective genetic algorithm for data imputation called MOGAImp, based on the NSGA-II, which is suitable for mixed-attribute datasets and takes into account information from incomplete instances and the modeling task. A set of tests for evaluating the performance of the algorithm were applied using 30 datasets with induced missing values; five classifiers divided into three classes: rule induction learning, lazy learning and approximate models; and were compared with three techniques presented in the literature. The results obtained confirm the MOGAImp outperforms some well-established missing data treatment methods. Furthermore, the proposed method proved to be flexible since it is possible to adapt it to different application domains.

We propose an unsupervised spatio-temporal image filtering method based on mean-shift.We adapt the spatial and feature range domains to handle temporal evolution.A constraint is added on the sample's evolution to select temporal neighbors.Our method outperforms standard mean-shift by adequately considering time information.Effectiveness is demonstrated on both synthetic and real brain MRI time-series data. A new spatio-temporal filtering scheme based on the mean-shift procedure, which computes unsupervised spatio-temporal filtering for univariate feature evolution, is proposed in this paper. Our main contributions are on one hand the modification of the spatial/range domains to appropriately integrate the temporal feature into the mean-shift iterative form and on the other hand the addition of a trajectory constraint in the feature space with the use of the infinity norm. Therefore, only the samples living the same life in the feature space will converge. Major assets of the standard mean-shift framework such as convergence and bandwidth parameters adjustment are preserved. In this paper, we study the relative importance of the bandwidth parameters and the efficiency of the proposed method is assessed on synthetic data and compared to the standard mean-shift framework for spatio-temporal data filtering. The obtained results have allowed us to undertake a first study on real data, which has led to encouraging results in identifying spatio-temporal evolution of multiple sclerosis lesions appearing on T2-weighted MR images.

We propose an extracting algorithm for k nearest neighbors searching.Vector inner product instead of distance calculation for distance comparison.Extracting algorithm can integrate with any other algorithm as plug-in.Two prominent algorithms and seven models are employed to experiment.Open source of proposed algorithm using dynamic memory allocation. k Nearest neighbors (kNN) searching algorithm is widely used for finding k nearest neighbors for each point in a point cloud model for noise removal and surface curvature computation. When the number of points and their density in a point cloud model increase significantly, the efficiency of a kNN searching algorithm becomes critical to various applications, thus, a better kNN approach is needed. In order to improve the efficiency of a kNN searching algorithm, in this paper, a new strategy and the corresponding algorithm are developed for reducing the amount of target points in a given data set by extracting nearest neighbors before the search begins. The nearest neighbors of a reverse nearest neighborhood are proposed to use in extracting nearest points of a query point, avoiding repetitive Euclidean distance calculation in an extracting process for saving time and memories. For any point in the model, its initial nearest neighbors can be extracted from its reverse neighborhood using an inner product of two related vectors other than direct Euclidean distance calculations and comparisons. The initial neighbors can be its full or partial set of the all nearest neighbors. If it is a partial set, the rest can be obtained by using other fast searching algorithms, which can be integrated with the proposed approach. Experimental results show that integrating extracting algorithm proposed in this paper with other excellent algorithms provides a better performance by comparing to their performances alone.