TY - GEN
T1 - An efficient geometric shape coding and representation approach to obtain both skeleton and contours
AU - Yoon, Ji Won
N1 - Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (NRF-2013R1A1A1012797). The author also thank to Professor S. J. Roberts and M. Brady of Oxford University for providing insightful comments and discussion for this paper.
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
T3 - ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication
BT - ACM IMCOM 2016
PB - Association for Computing Machinery, Inc
T2 - 10th International Conference on Ubiquitous Information Management and Communication, IMCOM 2016
Y2 - 4 January 2016 through 6 January 2016
ER -