Point matching is an important component of image registration. Recent years, Coherent Point Drift (CPD) method becomes a very popular point matching approach. CPD treats point matching as a probability estimation pro...
详细信息
Point matching is an important component of image registration. Recent years, Coherent Point Drift (CPD) method becomes a very popular point matching approach. CPD treats point matching as a probability estimation problem and speeds up the process of matching a lot. In this method, one set of points are thought to be sampled from a Gaussian Mixture Model (GMM), which is centered by the other set of points. However, CPD is sensitive to outliers and noises, especially when the noise ratio increased or the number of outliers gets much high. To deal with this problem, we introduce shape context into the step of searching for matching points and then improve the form of prior probabilities of GMM in this paper. The main idea of our method is that if the most points in a data set are likely to be matched to a particular centroid, this Gaussian component should be have a more influence to GMM. Therefore, we set prior probability of GMM with the similarity between GMM components and the data set. And the computation of similarity is based on shape context. The experiments on 2D and 3D images show that when noise ratio is low, our method performs as well as CPD does, but as the ratio increased, our method is more robust and satisfactory than CPD.
Optimization in noisy environments is regard as a favorite application domains of genetic algorithms. Different methods for reducing the influence of noise are presented and discussed. A new fitness evaluation method ...
详细信息
ISBN:
(纸本)9781479969302
Optimization in noisy environments is regard as a favorite application domains of genetic algorithms. Different methods for reducing the influence of noise are presented and discussed. A new fitness evaluation method is proposed that reevaluates all survival individuals each generation. Compared with re-sampling and population sizing, the new evaluation approach shows higher probability of searching to the global extremum area and precision of convergence. These results demonstrate that the proposed method is effective for reducing noise effects.
In this paper, we investigate the efficiency and scalability of Gaussian mixture model based learning algorithm for the detection of Near-Earth objects in large scale astronomy image data. We propose an effective sche...
详细信息
ISBN:
(纸本)9781479938414
In this paper, we investigate the efficiency and scalability of Gaussian mixture model based learning algorithm for the detection of Near-Earth objects in large scale astronomy image data. We propose an effective scheme to reduce the computational complexity of current learning algorithm, this is achieved by adopting the perceptual image hashing method. Our proposed scheme is validated on raw astronomy image data. The experiment results illustrate that both efficiency and scalability are improved significantly in astronomical scenario and other scenario.
The photon mapping is one of the more widely used algorithms for rendering scenes with participating media. Currently, it suffers from two main problems: one is how to improve the rendering efficiency, and another is ...
详细信息
Local intensity order pattern feature descriptor is proposed to extract the feature of image recently. However, it did not provide the global information of an image. In this paper, a simple, efficient and robust feat...
详细信息
In this paper, we take the advantages of color contrast and color distribution to get high quality saliency maps. The overall procedure flow of our unified framework contains superpixel pre-segmentation, color contras...
详细信息
Sparse representation classification (SRC) is a new framework for classification and has been successfully applied to face recognition. However, SRC can not well classify the data when they are in the overlap feature ...
详细信息
In this paper, the Harmony Search (HS)-aided BP neural networks are used for the classification of the epileptic electroencephalogram (EEG) signals. It is well known that the gradient descent-based learning method can...
详细信息
In this paper we present a new content-based retrieval descriptor, density-based silhouette descriptor (DBS). It characterizes a 3D object with multivariate probability functions of its 2D silhouette features. The new...
详细信息
ISBN:
(纸本)9789898565419
In this paper we present a new content-based retrieval descriptor, density-based silhouette descriptor (DBS). It characterizes a 3D object with multivariate probability functions of its 2D silhouette features. The new descriptor is computationally efficient and induces a permutation property that guarantees invariance at the matching stage. Also, it is insensitive to small shape perturbations and mesh resolution. The retrieval performance on several 3D databases shows that the DBS provides state-of-art discrimination over a broad and heterogeneous set of shape categories.
Multiple kernel learning (MKL) is a widely used kernel learning method, but how to select kernel is lack of theoretical guidance. The performance of MKL is depend on the users' experience, which is difficult to ch...
详细信息
暂无评论