Earticle

초록

영어

As a key step in the visual inspection, image to appear particularly important. Compared with the traditional algorithm, graph cut algorithm overall high precision and faster convergence speed in discontinuous area. Based on adaptive algorithm on the basis of in-depth study, this paper proposes a three-dimensional adaptation algorithm based on graph cut theory in order to realize the image matching. Experimental results show that this algorithm can well meet the requirements of high precision and high real time capability, solve the problems such as large amount of calculation in the traditional algorithm.

목차

Abstract
 1. Introduction
 2. Related Works
  2.1. The Image Adaptation
  2.2. Image Segmentation
 3. Image Three Dimensional Adaptive Algorithm Based on Graph Cut Theory
  3.1. Graph Cut Theory Analysis
  3.2. The Template is Calculated
  3.3. The Grid Structure 
 4. Adaptive Strategy 
 5. The Simulation Experiment and Result Analysis
 6. Conclusion
 7. Fund Support (1)(2)
 References

키워드

저자

• Fengxian Tang [ College of Computer & Information Engineering, Hechi University, Yizhou, China ]
• Yunfeng Yang [ College of Computer & Information Engineering, Hechi University, Yizhou, China ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605