D maximum entropy threshold segmentation-based SIFT for image target matching

2015 ◽  
pp. 223-228
2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Mu Zhou ◽  
Xia Hong ◽  
Zengshan Tian ◽  
Huining Dong ◽  
Mingchun Wang ◽  
...  

This paper proposes a 2-dimensional (2D) maximum entropy threshold segmentation (2DMETS) based speeded-up robust features (SURF) approach for image target matching. First of all, based on the gray level of each pixel and the average gray level of its neighboring pixels, we construct a 2D gray histogram. Second, by the target and background segmentation, we localize the feature points at the interest points which have the local extremum of box filter responses. Third, from the 2D Haar wavelet responses, we generate the 64-dimensional (64D) feature point descriptor vectors. Finally, we perform the target matching according to the comparisons of the 64D feature point descriptor vectors. Experimental results show that our proposed approach can effectively enhance the target matching performance, as well as preserving the real-time capacity.


Author(s):  
Wei Liu ◽  
Shuai Yang ◽  
Zhiwei Ye ◽  
Qian Huang ◽  
Yongkun Huang

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently.


2014 ◽  
Vol 989-994 ◽  
pp. 3649-3653 ◽  
Author(s):  
Ya Ti Lu ◽  
Wen Li Zhao ◽  
Xiao Bo Mao

Both maximum entropy method and Particle swarm optimization (PSO) are common threshold segmentation methods which have been used not only in image segmentation, but also in multi-threshold segmentation. Maximum entropy method is time-consuming, PSO may easily get trapped in a local optimum. In view of this concerning issue, we propose the PSO and maximum entropy are combined to make improvements on the PSO introduced in expansion model and opposition-based module. The objective functions of the maximum entropy as well as the PSO are obtained, which have improved to optimize them and search the optimal threshold combination, to achieve multi-threshold image segmentation. The results demonstrate that the new algorithm improved the segmentation speed and enhanced the robustness. And the optimizing results are stable.


Sign in / Sign up

Export Citation Format

Share Document