Earticle

초록

영어

In order to solve the issues like the feature detection algorithm surface design too sensitive to the presence of noise, this thesis proposes the grid processing algorithm. Firstly, the constrained smoothing model is used to smooth the grid, in which the bound terms are the sparse constraint terms of the error term of l2 norm and l1 norm. In the process of smoothing, the points of the smooth location move less, while the there is a greater movement of feature points. And then through the anglicizing the movement distances the initial feature points are extracted; finally, after the generating of the initial feature points, the feature points are more complete. Experimental results show that: the proposed algorithm can handle the noise of too sensitive.

목차

Abstract
 1. Introduction
 2.Grid Smoothing
 3. Grid Processing Noise Algorithm
  A. Smoothing Model of Grid Characteristics
  B. Feature Point Extraction
  c. After Tratment
  D. Extraction of Feature Line
 4. Experimental Simulation and Analysis
  A. Experimental Environment and Setting
  B. Result Analysis
  c. Comparison of Algorithms
 5. Conclusion
 References

키워드

저자

• Liu Hongping [ Educational Technology Center, Changsha Normal University, Changsha, China ]
• Chen Mingyi [ School of Information Science and Engineering, Central South University, Changsha, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605