Projection filling based on contour structural points

Authors:
Donggang Yu;Haizhen Dong;Wei Lai;Yun Yang
Affiliations:
School of Information Technology, Swinburne University of Technology, Hawthorn, VIC, Australia;School of Information Technology, Swinburne University of Technology, Hawthorn, VIC, Australia;School of Information Technology, Swinburne University of Technology, Hawthorn, VIC, Australia;School of Information Technology, Swinburne University of Technology, Hawthorn, VIC, Australia
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Year:
2003

Citing 3
Cited 0

Representation of contours and regions for efficient computer search

Communications of the ACM
Contour filling in raster graphics

SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
Filling regions in binary raster images: A graph-theoretic approach

SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new method, called the projection filling, to fill any regions based on contour structure points. Four types of the structure points are detected based on the structure pattern models of chain codes of contours. The projection filling proceeds between each pair of the neighbouring structural points (filling section) parallelly. The new filling algorithm can fill any regions including some contours which can not be filled by traditional filling algorithms, such as the "seed" and the "even-odd" algorithms. The projection filling method can be used in image analysis, recognition and computer graphics.