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.
Mutual occlusions among targets can cause track loss or target position deviation, because the observation likelihood of an occluded target may vanish even when we have the estimated location of the target. This paper...
详细信息
ISBN:
(纸本)9781479951192
Mutual occlusions among targets can cause track loss or target position deviation, because the observation likelihood of an occluded target may vanish even when we have the estimated location of the target. This paper presents a novel probability framework for multitarget tracking with mutual occlusions. The primary contribution of this work is the introduction of a vectorial occlusion variable as part of the solution. The occlusion variable describes occlusion states of the targets. This forms the basis of the proposed probability framework, with the following further contributions: 1) Likelihood: A new observation likelihood model is presented, in which the likelihood of an occluded target is computed by referring to both of the occluded and occluding targets. 2) Priori: Markov random field (MRF) is used to model the occlusion priori such that less likely "circular" or "cascading" types of occlusions have lower priori probabilities. Both the occlusion priori and the motion priori take into consideration the state of occlusion. 3) Optimization: A realtime RJMCMC-based algorithm with a new move type called "occlusion state update" ispresented. Experimental results show that the proposed framework can handle occlusions well, even including long-duration full occlusions, which may cause tracking failures in the traditional methods.
In this paper, we try to deal with the problem of shadow detection from static images and video sequences. In instead to considering individual regions separately, we use relative illumination conditions between segme...
详细信息
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.
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...
详细信息
Chronic obstructive pulmonary disease (COPD) is a lung disease where early detection benefits the survival rate. COPD can be quantified by classifying patches of computed tomography images, and combining patch labels ...
详细信息
Chronic obstructive pulmonary disease (COPD) is a lung disease where early detection benefits the survival rate. COPD can be quantified by classifying patches of computed tomography images, and combining patch labels into an overall diagnosis for the image. As labeled patches are often not available, image labels are propagated to the patches, incorrectly labeling healthy patches in COPD patients as being affected by the disease. We approach quantification of COPD from lung images as a multiple instance learning (MIL) problem, which is more suitable for such weakly labeled data. We investigate various MIL assumptions in the context of COPD and show that although a concept region with COPD-related disease patterns is present, considering the whole distribution of lung tissue patches improves the performance. The best method is based on averaging instances and obtains an AUC of 0.742, which is higher than the previously reported best of 0.713 on the same dataset. Using the full training set further increases performance to 0.776, which is significantly higher (DeLong test) than previous results.
An image compression-encryption algorithm based on 2-D compressive sensing is proposed, which can accomplish encryption and compression simultaneously. The measurements are performed in two directi-ons and the measure...
详细信息
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 ...
详细信息
暂无评论