An efficient geometric shape coding and representation approach to obtain both skeleton and contours

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a novel approach to the coding and representation of shapes using intersections. Our algorithm combines contour and region based approaches. After exploring hitherto unvisited regions of the shape, we find salient features on the boundary in that region. Our method has a number of attractive features. First, it is efficient to compute, since only small yet salient regions are retrieved and analysed. Second, our algorithm generates a contour and region analysis simultaneously. Third, the algorithm is fully adaptive, so we do not need to set parameters, such as the number of features to be found, in advance. Finally, the algorithm can be implemented using familiar data structures including the max heap, circular linked lists and trees. We demonstrate the stability of the algorithm with a few practical image sets and developed an extended version which deals with enclosed shapes.

Original languageEnglish
Title of host publicationACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication
PublisherAssociation for Computing Machinery, Inc
ISBN (Print)9781450341424
DOIs
Publication statusPublished - 2016 Jan 4
Event10th International Conference on Ubiquitous Information Management and Communication, IMCOM 2016 - Danang, Viet Nam
Duration: 2016 Jan 42016 Jan 6

Other

Other10th International Conference on Ubiquitous Information Management and Communication, IMCOM 2016
CountryViet Nam
CityDanang
Period16/1/416/1/6

Fingerprint

Data structures

Keywords

  • Descriptor
  • Image search
  • Representation
  • Shape

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Yoon, J. W. (2016). An efficient geometric shape coding and representation approach to obtain both skeleton and contours. In ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication [a4] Association for Computing Machinery, Inc. https://doi.org/10.1145/2857546.2857551

An efficient geometric shape coding and representation approach to obtain both skeleton and contours. / Yoon, Ji Won.

ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication. Association for Computing Machinery, Inc, 2016. a4.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yoon, JW 2016, An efficient geometric shape coding and representation approach to obtain both skeleton and contours. in ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication., a4, Association for Computing Machinery, Inc, 10th International Conference on Ubiquitous Information Management and Communication, IMCOM 2016, Danang, Viet Nam, 16/1/4. https://doi.org/10.1145/2857546.2857551
Yoon JW. An efficient geometric shape coding and representation approach to obtain both skeleton and contours. In ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication. Association for Computing Machinery, Inc. 2016. a4 https://doi.org/10.1145/2857546.2857551
Yoon, Ji Won. / An efficient geometric shape coding and representation approach to obtain both skeleton and contours. ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication. Association for Computing Machinery, Inc, 2016.
@inproceedings{183c3937561d46aa944f6c784f5756b0,
title = "An efficient geometric shape coding and representation approach to obtain both skeleton and contours",
abstract = "We present a novel approach to the coding and representation of shapes using intersections. Our algorithm combines contour and region based approaches. After exploring hitherto unvisited regions of the shape, we find salient features on the boundary in that region. Our method has a number of attractive features. First, it is efficient to compute, since only small yet salient regions are retrieved and analysed. Second, our algorithm generates a contour and region analysis simultaneously. Third, the algorithm is fully adaptive, so we do not need to set parameters, such as the number of features to be found, in advance. Finally, the algorithm can be implemented using familiar data structures including the max heap, circular linked lists and trees. We demonstrate the stability of the algorithm with a few practical image sets and developed an extended version which deals with enclosed shapes.",
keywords = "Descriptor, Image search, Representation, Shape",
author = "Yoon, {Ji Won}",
year = "2016",
month = "1",
day = "4",
doi = "10.1145/2857546.2857551",
language = "English",
isbn = "9781450341424",
booktitle = "ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - An efficient geometric shape coding and representation approach to obtain both skeleton and contours

AU - Yoon, Ji Won

PY - 2016/1/4

Y1 - 2016/1/4

N2 - We present a novel approach to the coding and representation of shapes using intersections. Our algorithm combines contour and region based approaches. After exploring hitherto unvisited regions of the shape, we find salient features on the boundary in that region. Our method has a number of attractive features. First, it is efficient to compute, since only small yet salient regions are retrieved and analysed. Second, our algorithm generates a contour and region analysis simultaneously. Third, the algorithm is fully adaptive, so we do not need to set parameters, such as the number of features to be found, in advance. Finally, the algorithm can be implemented using familiar data structures including the max heap, circular linked lists and trees. We demonstrate the stability of the algorithm with a few practical image sets and developed an extended version which deals with enclosed shapes.

AB - We present a novel approach to the coding and representation of shapes using intersections. Our algorithm combines contour and region based approaches. After exploring hitherto unvisited regions of the shape, we find salient features on the boundary in that region. Our method has a number of attractive features. First, it is efficient to compute, since only small yet salient regions are retrieved and analysed. Second, our algorithm generates a contour and region analysis simultaneously. Third, the algorithm is fully adaptive, so we do not need to set parameters, such as the number of features to be found, in advance. Finally, the algorithm can be implemented using familiar data structures including the max heap, circular linked lists and trees. We demonstrate the stability of the algorithm with a few practical image sets and developed an extended version which deals with enclosed shapes.

KW - Descriptor

KW - Image search

KW - Representation

KW - Shape

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

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

U2 - 10.1145/2857546.2857551

DO - 10.1145/2857546.2857551

M3 - Conference contribution

AN - SCOPUS:84965049896

SN - 9781450341424

BT - ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication

PB - Association for Computing Machinery, Inc

ER -