CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Robust and Efficient Fully Parallel 2D Thinning Algorithm

by Ananda Kumar Kinjarapu, Jagadeeswara Rao Enni, and Kamakshi Prasad Valurouthu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 85 - Number 5
Year of Publication: 2014
Authors: Ananda Kumar Kinjarapu, Jagadeeswara Rao Enni, and Kamakshi Prasad Valurouthu
10.5120/14834-3092

Ananda Kumar Kinjarapu, Jagadeeswara Rao Enni, and Kamakshi Prasad Valurouthu . Robust and Efficient Fully Parallel 2D Thinning Algorithm. International Journal of Computer Applications. 85, 5 ( January 2014), 1-6. DOI=10.5120/14834-3092

@article{ 10.5120/14834-3092,
author = { Ananda Kumar Kinjarapu, Jagadeeswara Rao Enni, and Kamakshi Prasad Valurouthu },
title = { Robust and Efficient Fully Parallel 2D Thinning Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { January 2014 },
volume = { 85 },
number = { 5 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume85/number5/14834-3092/ },
doi = { 10.5120/14834-3092 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:01:38.686711+05:30
%A Ananda Kumar Kinjarapu
%A Jagadeeswara Rao Enni
%A and Kamakshi Prasad Valurouthu
%T Robust and Efficient Fully Parallel 2D Thinning Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 85
%N 5
%P 1-6
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Thinning is a well-known iterative layer-by-layer reduction operator to obtain skeletons of the binary objects. These skeletons are used as shape descriptors in many image processing, image analysis and pattern recognition applications. Thus obtaining topology preserved, centrally aligned and connected single pixel thin skeleton, without spurs and excessive erosions, and noise tolerant at pre-processing stage is essential to the success of later processing stages. The end-point based algorithms preserve original shape but results in extra spurs due to the presence of unwanted endpoints. The isthmus-based algorithms produce less spurs but causes excessive erosions. Hence in this paper, we proposed an efficient fully parallel thinning algorithm for 2D binary images. we proposed a general methodology for removing noise prior to thinning. A comparison with recent algorithms by the proposed method showed the better skeleton quality, efficiency and robustness.

References
  1. Gabor Nemeth and Kalman Palagyi. 2d parallel thinning algorithms based on isthmus-preservation. In S. Loncaric, G. Ramponi, and D. Sersic, editors, Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA), pages 585–590, Dubrovnik, Croatia, September 2011. IEEE.
  2. Gabor Nemeth, Peter Kardos, and Kalman Palagyi. 2d parallel thinning and shrinking based on sufficient conditions for topology preservation. Acta Cybernetica, 20:125–144, 2011.
  3. Gabor Nemeth and Kalman Palagyi. Topology preserving parallel thinning algorithms. International Journal of Imaging Systems and Technology, 21:37–44, 2011.
  4. Peter Kardos and Kalman Palagyi. Isthmus-based order-independent sequential thinning. In M. Petrou, A. D. Sappa, and G. A. Triantafyllidis, editors, Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications (SPPRA 2012), pages 28–34, Crete, Greece, June 2012. IASTED.
  5. Wei Shen, Xiang Bai, Rong Hua, Hongyuan Wanga, and Longin Jan Latecki. Skeleton growing and pruning with bending potential ratio. Pattern Recognition, 44:196–209, 2011.
  6. Maher Ahmed and Rabab KreidiehWard. A rotation invariant rule-based thinning algorithm for character recognition. IEEE Trans. Pattern Anal. Mach. Intell. , 24(12):1672–1678, 2002.
  7. Peter I Rockett. An improved rotation-invariant thinning algorithm. IEEE Transactions Pattern Analysis and Machine Intelligence, 27(10):1671–1674, October 2005.
  8. N. H. Han, C. W. La, and P. K. Rhee. An efficient fully parallel thinning algorithm. In IEEE Computer Society, editor, Proceedings of IEEE International Conference on Document Analysis and Recognition (ICDAR), pages 137–141, Ulm, Germany, August 1997. IEEE.
  9. G. S. Ng, R. W. Zhou, and C. Quek. A noval single pass thinning algorithm. Pattern Recognition Letters, pages 1267–1275, 1995.
  10. M Couprie. Note on fifteen 2d parallel thinning algorithms, 2009.
  11. T. Y Kong. On topology preservation in 2-d and 3-d thinning. International Journal of Pattern Recognition and Artificial Intelligence, 9:813–844, 1995.
  12. T. Y Kong and A. Rosenfeld. Digital topology: Introduction and survey. IEEE Computer Vision, Graphics, and Image Processing, 48:357–393, 1989.
  13. L. O'Gorman. Image and document processing techniques for the rightpages electronic library system. In 11th IAPR International Conference on Patern Recognition. Conference B: Pattern Recognition Methodology and Systems, pages 260–263, The Hague, 1992.
Index Terms

Computer Science
Information Sciences

Keywords

Fully parallel 2D thinning Noise tolerant Topology preservation Geometry preservation Weight values

Powered by PhDFocusTM