Image Processing :: essays research papers

Adaptive Shape Contour tincture AlgorithmABSTRACTIn this paper we are tone ending to present a new compliance abidance tracing algorithmic program called Adaptive Contour Tracing Algorithm. The algorithm can trace make and closed discontinuous digital shapes and return an ordered set of boundary backsheeshs that represent the contour of the shape. Unlike other algorithms that return boundary points that are articulation of the traced shape, our algorithm returns background points that are adjacent to the shapes contour. Furthermore, the algorithm is not hindered by shapes that are noisy and ill-defined as it can adapt to interruptions in the shapes contour using a pre-set tolerance and is able to scan multiple neighbors of a given point. The algorithm has a emit complexity and no restrictions on the type or size of the traced shape. The extracted ordered set of boundary points represents the contour of a given shape and is important for curvature-based shape descriptors. Ca tegories and Subject DescriptorsI.4.6 Image Processing and Computer Vision Segmentation V Edge and feature detection, Pixel classification General TermsAlgorithms.KeywordsImage Processing Contour Tracing Shape Boundary Extraction.1. INTRODUCTIONContour tracing is an important process in boundary-based shape matching. All shapes are represented by a linguistic rule of pixels and the contour pixels are usually a small subset of that embodiment. Curvature-based shape matching methods rely on the contour pixels to describe the irregularities in shapes and a reliable contour-tracing algorithm is needed to extract the boundary of shapes. If the shape has holes then another hole search algorithm need to be applied to extract the hole pattern and such an algorithm is not part of this article.We developed a sequential contour-tracing algorithm denoted the Adaptive Contour Tracing Algorithm. The algorithm computes the surrounding contour of any shape and adapts to all types of closed curve representations whether they are filled or partially filled digital shapes. Any pixel, 1-pixel wide lines, and full shapes could be traced and represented by closed curves. The algorithm also accounts for discontinuities in the shape contour and can reach nearby pixels.The contour trace starts from the top unexpended point or pixel closest to the shape and proceeds clockwise following the surrounding of the contour of the shape rather than the contour itself. The path virtually the contour is traced in a look-forward sweep pattern to find the next surrounding point that is closest to the contour. The path is then closed when the start point is found.