Fast Chain Coding of Connected-Component Boundaries

Yan Liu; You Guang Chen

doi:10.4028/www.scientific.net/AMM.513-517.1402

Paper Titles

A Research on the Web Services Composition Model and its Transformation Based on MDA
p.1382

Face Recognition Based on Maximum Spanning Tree Kernel and Gray Kernel
p.1387

An Application of T-S Model and Phase Based Quantum Genetic Algorithm in Oilfield
p.1392

Research of IHE-ITI-PIX Architecture Based on SOA System
p.1398

Fast Chain Coding of Connected-Component Boundaries
p.1402

Provable Data Possession in Cloud Computing
p.1406

A Novel and Robust Algorithm for License Plate Location Using Perceptual Salient Features
p.1414

Application on Selecting Simultaneous Factor of City Community Based on Data Mining
p.1421

A Study on Cloud Service with Information Resources
p.1425

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Fast Chain Coding of Connected-Component...

Fast Chain Coding of Connected-Component Boundaries

Abstract:

A new method to obtain connected component in binary images is presented. The method uses DFA automaton to obtain chain code and label the component boundary It is theoretically proved that the algorithm improves the image encoding efficiency closer to the lowest time consumption.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

1402-1405

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.1402

Citation:

Cite this paper

Online since:

February 2014

Authors:

Yan Liu*, You Guang Chen

Keywords:

Automaton, Boundary Processing, Boundary Tracing, Chain Code, Connected Component

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Rosenfeld A. Algorithms for image/vector conversion [J]. Computer Graphics, 1978(12): 135-139.

Google Scholar

[2] Hermilo S C, Bribiesca E, Ramon M R D. Efficiency of chain codes to represent binary objects [J]. Pattern Recognition, 2007, 40: 1660-1674.

DOI: 10.1016/j.patcog.2006.10.013

Google Scholar

[3] Merrill R D. Representation of contours and regions for efficient computer search [J]. Comm ACM, 1973, 16 (2): 69-82.

DOI: 10.1145/361952.361956

Google Scholar

[4] Pavlidis T, Algorithms for Graphics and Image Processing [M]. Rockville: Computer Science Press, (1982).

Google Scholar

[5] F. Chang, C.J. Chen, C.J. Lu, A linear-time component-labeling algorithm using contour tracing technique, Comput. Vis. Image Und. 93 (2004) 206–220.

DOI: 10.1016/j.cviu.2003.09.002

Google Scholar

[6] Kim S D, Lee J H, Kim J K, A new chain-coding algorithm for binary images using run-length codes [J]. CVGIP, 1988, 41: 114-128.

DOI: 10.1016/0734-189x(88)90121-1

Google Scholar

[7] H. Freeman, Computer processing of line drawing images, Computational Surveys 6 (1974) 57-97.

Google Scholar

[8] Bribiesca E, A new chain code [J]. Pattern Recognition, 1999, 32: 235-2.

Google Scholar

[9] Bribiesca E, A measure of tortuosity based on chain coding, Pattern Recognition , Volume 46, Issue 3, March 2013, Pages 716–724.

DOI: 10.1016/j.patcog.2012.09.017

Google Scholar

[10] Liu Y K, Wei W, Wang P J. Compressed vertex chain codes [J]. Pattern Recognition, 2007, 40: 2908–2913.

DOI: 10.1016/j.patcog.2007.03.001

Google Scholar

[11] Hermilo S C, Bribiesca E, Ramon M R D. Efficiency of chain codes to represent binary objects [J]. Pattern Recognition, 2007, 40: 1660-1674.

DOI: 10.1016/j.patcog.2006.10.013

Google Scholar

[12] Hermilo S C, Bribiesca E, Ramon M R D. Efficiency of chain codes to represent binary objects [J]. Pattern Recognition, 2007, 40: 1660-1674.

DOI: 10.1016/j.patcog.2006.10.013

Google Scholar

[13] Gu G Q, Chen K, Region-Labeling-Automata for Images in Square, Triangular and Hexagonal Lattice, Advances in Computer and Information Technology, The Journal of Three Dimensional Images, 17 (2003)161-165.

Google Scholar