Multiresolution chain coding of contours

J. S. Lerman; S. R. Kulkarni; J. Koplowitz

doi:10.1109/ICIP.1994.413644

Multiresolution chain coding of contours

J. S. Lerman, S. R. Kulkarni, J. Koplowitz

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

A multiresolution chain coding scheme for contours is developed based on 4-connected chain codes at progressively more refined grid sizes. By taking advantage of a specific set of possible paths a contour can travel, the algorithm presented generates a multiresolution representation of a contour, with the final refinement representing the original contour with the same accuracy as conventional 4-connected chain coding. The technique described requires only a small overhead in comparison to 4-connected chain coding, so has the advantage of providing a hierarchical representation of a contour at little cost. The generation of a multi-scale representation allows the algorithm to perform well in the presence of storage or transmission limitations, as only a fraction of the data is required to obtain a detailed representation of the entire contour.

Original language	English (US)
Article number	413644
Pages (from-to)	615-619
Number of pages	5
Journal	Proceedings - International Conference on Image Processing, ICIP
Volume	2
DOIs	https://doi.org/10.1109/ICIP.1994.413644
State	Published - 1994
Event	The 1994 1st IEEE International Conference on Image Processing - Austin, TX, USA Duration: Nov 13 1994 → Nov 16 1994

All Science Journal Classification (ASJC) codes

Software
Computer Vision and Pattern Recognition
Signal Processing

Keywords

chain coding
hierarchical representation
multi-scale
multiresolution
progressive

Access to Document

10.1109/ICIP.1994.413644

Cite this

@article{791112dc7ded4e828a0b1d586288f711,

title = "Multiresolution chain coding of contours",

abstract = "A multiresolution chain coding scheme for contours is developed based on 4-connected chain codes at progressively more refined grid sizes. By taking advantage of a specific set of possible paths a contour can travel, the algorithm presented generates a multiresolution representation of a contour, with the final refinement representing the original contour with the same accuracy as conventional 4-connected chain coding. The technique described requires only a small overhead in comparison to 4-connected chain coding, so has the advantage of providing a hierarchical representation of a contour at little cost. The generation of a multi-scale representation allows the algorithm to perform well in the presence of storage or transmission limitations, as only a fraction of the data is required to obtain a detailed representation of the entire contour.",

keywords = "chain coding, hierarchical representation, multi-scale, multiresolution, progressive",

author = "Lerman, {J. S.} and Kulkarni, {S. R.} and J. Koplowitz",

note = "Publisher Copyright: {\textcopyright} 1994 IEEE.; The 1994 1st IEEE International Conference on Image Processing ; Conference date: 13-11-1994 Through 16-11-1994",

year = "1994",

doi = "10.1109/ICIP.1994.413644",

language = "English (US)",

volume = "2",

pages = "615--619",

journal = "Proceedings - International Conference on Image Processing, ICIP",

issn = "1522-4880",

}

TY - JOUR

T1 - Multiresolution chain coding of contours

AU - Lerman, J. S.

AU - Kulkarni, S. R.

AU - Koplowitz, J.

PY - 1994

Y1 - 1994

N2 - A multiresolution chain coding scheme for contours is developed based on 4-connected chain codes at progressively more refined grid sizes. By taking advantage of a specific set of possible paths a contour can travel, the algorithm presented generates a multiresolution representation of a contour, with the final refinement representing the original contour with the same accuracy as conventional 4-connected chain coding. The technique described requires only a small overhead in comparison to 4-connected chain coding, so has the advantage of providing a hierarchical representation of a contour at little cost. The generation of a multi-scale representation allows the algorithm to perform well in the presence of storage or transmission limitations, as only a fraction of the data is required to obtain a detailed representation of the entire contour.

AB - A multiresolution chain coding scheme for contours is developed based on 4-connected chain codes at progressively more refined grid sizes. By taking advantage of a specific set of possible paths a contour can travel, the algorithm presented generates a multiresolution representation of a contour, with the final refinement representing the original contour with the same accuracy as conventional 4-connected chain coding. The technique described requires only a small overhead in comparison to 4-connected chain coding, so has the advantage of providing a hierarchical representation of a contour at little cost. The generation of a multi-scale representation allows the algorithm to perform well in the presence of storage or transmission limitations, as only a fraction of the data is required to obtain a detailed representation of the entire contour.

KW - chain coding

KW - hierarchical representation

KW - multi-scale

KW - multiresolution

KW - progressive

UR - http://www.scopus.com/inward/record.url?scp=84997079911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84997079911&partnerID=8YFLogxK

U2 - 10.1109/ICIP.1994.413644

DO - 10.1109/ICIP.1994.413644

M3 - Conference article

AN - SCOPUS:84997079911

SN - 1522-4880

VL - 2

SP - 615

EP - 619

JO - Proceedings - International Conference on Image Processing, ICIP

JF - Proceedings - International Conference on Image Processing, ICIP

M1 - 413644

T2 - The 1994 1st IEEE International Conference on Image Processing

Y2 - 13 November 1994 through 16 November 1994

ER -

Multiresolution chain coding of contours

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this