earticle

논문검색

Skeletonization Algorithm for Numeral Patterns

초록

영어

Skeletonization has been a part of morphological image processing for a wide variety of applications. Skeletonization algorithms have played an important role in the preprocessing phase of OCR systems. Many algorithms for vectorization by skeletonization have been devised and applied to a great variety of pictures and drawings for data compression, pattern recognition and raster-to-vector conversion. The vectorization algorithms often used in pattern recognition tasks also require one-pixel-wide lines as input. But parallel skeletonization algorithms which generate one-pixel-wide skeletons can have difficulty in preserving the connectivity of an image or generate spurious branches. In this paper an alternative parallel skeletonization algorithm has been developed and implemented. This algorithm is better than already existing algorithms in terms of connectivity and spurious branches. A few most common skeletonization algorithms have been implemented and evaluated on the basis of performance parameters and compared with newly developed algorithm.

목차

Abstract
 1 Introduction
  A 1.1 Why skeletonization
  A 1.2 Applications
  B. Some preliminary concepts
 2. Skeletonization Algorithms
  A. Parallel skeletonization algorithm 1
  B. Parallel skeletonization algorithm 2
 3. An Alternative Parallel Skeletonization Algorithm
 4. Performance Evaluation Parameters and comparison of Skeletonization Algorithms
  A. Measures of convergence to unit width
  B. Connectivity
  C.Spurious branches
 5. Conclusion
 6. References

저자정보

  • Gupta Rakesh Department. of CSE, SDDIET Barwala, Panchkula, India
  • Kaur Rajpreet Department of CSE / IT, BBSBEC, Fatehgarh Sahib, Punjab, India

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.