Improved SURF Detection Combined with Dual FLANN Matching and Clustering Analysis

2014 ◽  
Vol 556-562 ◽  
pp. 2792-2796 ◽  
Author(s):  
Jun Fei Li ◽  
Geng Wang ◽  
Qiang Li

In this paper, an improved object detection method based on SURF (Speed-Up Robust Feature) is presented. SURF is a widely used method in computer vision. But it’s still not efficient enough to apply in real-time applications, such as real time object tracking. To reduce the time cost, the traditional descriptor of SURF is altered. Triangle and diagonal descriptor is adopted to replace the Haar wavelet calculation. Then dual matching approach based on FLANN is employed. Thus matching errors can be cut down. Besides, the traditional SURF does not give the accurate region of the target. To restrict the area, clustering analysis is used which is promoted from K-WMeans. Experimental work demonstrates the proposed approach achieve better effect than traditional SURF in real scenarios.

2014 ◽  
Vol 1064 ◽  
pp. 197-204
Author(s):  
Zhuo Yu ◽  
Li Xiong ◽  
Feng Shang

Mild-slope equation is usually used in many simulation applications. The equation has obviously benefit which based on physical method that can present the real status of water, but the shortcoming is also clearly that the calculations spending lots of times which not support some real-time applications. We use hyperbola to simple the equation calculation process, and use alternating directions implicit (ADI) way to solve this equation. The result shows that the ADI way can use less calculation and less time to accomplish the calculation. We also use the new features of GPU(graphics process unit) to speed up the calculation so that we can render the surface in real-time application.


2011 ◽  
Vol 135-136 ◽  
pp. 70-75
Author(s):  
Ming Xin Jiang ◽  
Hong Yu Wang ◽  
Chao Lin

As a basic aspect of computer vision, reliable tracking of multiple objects is still an open and challenging issue for both theory studies and real applications. A novel multi-object tracking algorithm based on multiple cameras is proposed in this paper. We obtain the foreground likelihood maps in each view by modeling the background using the codebook algorithm. The view-to-view homographies are computed using several landmarks on the chosen plane. Then, we achieve the location information of multi-target at chest layer and realize the tracking task. The proposed algorithm does not require detecting the vanishing points of cameras, which reduces the complexity and improves the accuracy of the algorithm. The experimental results show that our method is robust to the occlusion and could satisfy the real-time tracking requirement.


Author(s):  
Michael Sherer ◽  
Ebin Scaria

Many programs have a fixed directed graph structure in the way they are processed. In particular, computer vision systems often employ this kind of pipe-and-filter structure. It is desirable to take advantage of the inherent parallelism in such a system. Additionally, such systems need to run in real-time for robotics applications. In such applications, robotic platforms must make time-critical decisions, and so any additional performance gain would be beneficial. To further improve on this, the platform may need to make the best decision it can by a given time, so that newer data can be processed. Thus, having a timeout that would return a good result may be better than operating on outdated information.


Sign in / Sign up

Export Citation Format

Share Document