论文信息 - A Novel Algorithm to Extract Connected Components in a Binary Image of Vehicle License Plates

A Novel Algorithm to Extract Connected Components in a Binary Image of Vehicle License Plates

This paper presents a simple and a novel sequential algorithm to find connected components in a binary image of vehicle license plate. Many classical algorithms have used the approach of equivalence classes and labels to find connected components that are both fast and efficient. Our algorithm extracts the connected components with 100% accuracy using “tree” data structure. The extraction is accomplished by forward scanning only.

Prakash Kumar | Kanchan Verma | Ganesh Rama Hegde | Saumya Rajan Giri

[1] M. Gorgon,et al. Handel-C implementation of classical component labelling algorithm , 2004 .

[2] Donald G. Bailey,et al. FPGA implementation of a Single Pass Connected Components Algorithm , 2008, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008).

[3] Xue Dong Yang,et al. An Improved Algorithm for Labeling Connected Components in a Binary Image , 1989 .

[4] Carl G. Looney,et al. Fast connected component labeling algorithm using a divide and conquer technique , 2000, CATA.

[5] Robert Tibshirani,et al. An Introduction to the Bootstrap , 1994 .

[6] Azriel Rosenfeld,et al. Sequential Operations in Digital Picture Processing , 1966, JACM.