Image Processing


Length: 1733 words (5 double-spaced pages)
Rating: Excellent
Open Document
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Text Preview

More ↓

Continue reading...

Open Document

Adaptive Shape Contour Tracing Algorithm


ABSTRACT
In this paper we are going to present a new shape contour tracing algorithm called ¡§Adaptive Contour Tracing Algorithm¡¨. The algorithm can trace open and closed discontinuous digital shapes and return an ordered set of boundary points that represent the contour of the shape. Unlike other algorithms that return boundary points that are part of the traced shape, our algorithm returns background points that are adjacent to the shape¡¦s contour. Furthermore, the algorithm is not hindered by shapes that are noisy and ill-defined as it can adapt to interruptions in the shape¡¦s contour using a pre-set tolerance and is able to scan multiple neighbors of a given point. The algorithm has a low 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.

Categories and Subject Descriptors
I.4.6 [Image Processing and Computer Vision]: Segmentation ¡V Edge and feature detection, Pixel classification
General Terms
Algorithms.
Keywords
Image Processing; Contour Tracing; Shape Boundary Extraction.

1. INTRODUCTION
Contour tracing is an important process in boundary-based shape matching. All shapes are represented by a pattern of pixels and the contour pixels are usually a small subset of that pattern. 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 left 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 around 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.

How to Cite this Page

MLA Citation:
"Image Processing." 123HelpMe.com. 25 Jul 2017
    <http://www.123HelpMe.com/view.asp?id=71072>.
Title Length Color Rating  
Image Processing and Recognition Essay examples - ... Before getting to start with the feature selection, document representation has been done with the help of power point presentation. This includes a systematic approach to represent this research work. This gets start with the introduction, overall structure of the topic, previous researches done by others, reason behind my research, introduction of new features which are to be used in my research so that the accuracy can be enhanced. It was crystal clear that the complexity would be increased after including the new features in the measurement....   [tags: study, related topics, techniques] 727 words
(2.1 pages)
Research Papers [preview]
Essay about Facial Image Processing - Abstract Various applications have been proposed in the field of facial image processing throughout the last forty years or so, among which are face recognition, face detection, gender/age classification, facial expression, etc. However, no application related to the identification of similarity between family members has been introduced yet. This paper is the first experience, which considers this phenomenon and proposes a framework for clustering similar family members. Three features include: “The Whole Face,” “The Facial Feature Perimeters” and “The Ratio between Facial Features” have been used....   [tags: Medical Science] 1188 words
(3.4 pages)
Strong Essays [preview]
Image Processing is the Process of Converting an Image into Digital Form - ... The spatial domain is the normal image space where a change in position in image I projects to a change in scene S. In this transform the distances in Image I is in pixels which corresponds to distances in scene S which is real distance in metres. 1.2 PURPOSE OF IMAGE PROCESSING The purposes for the use of image processing is broadly divided into five groups. These are as follows: 1. Visualization. 2. Image sharpening and restoration. 3. Image retrieval. 4. Measurement of pattern. 5. Image recognition....   [tags: photography, computer, restoration] 2943 words
(8.4 pages)
Research Papers [preview]
Essay about General Review of Algorithms Presented for Image Segmentation - ... Hence there exists a major challenge of developing a single and unified approach of image segmentation that could be used for all sorts of images. There are multiple segmentation techniques that are available and can be used individually or in combination with others. These approaches can broadly be divided into two categories on the basis of following properties that an image possesses. In this the image is segmented based on the discontinuities or abrupt changes for example intensity that appears in a digital image....   [tags: image processing technique] 985 words
(2.8 pages)
Research Papers [preview]
Essay on New Wavelet Based Image Denoising Method - Image Processing is any form of signal processing for which the input is an image or video frame; the output of image processing is set of parameters related to the image. The goal of our research presents a new wavelet based image denoising method to be compared with curvelet denoising and contourlet denoising. The Multi resoulution Analysis (MRA) transformation is implemented using the three transforms, Wavelet Curvelet and Contourlet. The wavelet transformation algorithm is implemented to compresses the essential information in a signal into few, large coefficients with in time and frequency transformation....   [tags: SNR, image processing, contourlet]
:: 9 Works Cited
2098 words
(6 pages)
Term Papers [preview]
Image Processing in Iris Biometric Authentication System Essay - ... The iris image captured from 30 to 50 cm distance by using infrared sources of different wavelengths like 700 to 900 nm. Near-infrared is employed because the ability to highlight the textures structure and dark irises. The IR light is invisible for the human eye and the user should not embarrass with visible light when used as an illumination source. The iris measuring dimensions is recommended by ISO standard shown in Figure-3. Figure-3 At the time of authentication or verification his or her individual identity claims, then compare the previously stored signature and the new acquired signature (during enrollment) must performed....   [tags: computerized security and access systems] 1051 words
(3 pages)
Research Papers [preview]
Image Processing Essay - Adaptive Shape Contour Tracing Algorithm ABSTRACT In this paper we are going to present a new shape contour tracing algorithm called ¡§Adaptive Contour Tracing Algorithm¡¨. The algorithm can trace open and closed discontinuous digital shapes and return an ordered set of boundary points that represent the contour of the shape. Unlike other algorithms that return boundary points that are part of the traced shape, our algorithm returns background points that are adjacent to the shape¡¦s contour....   [tags: essays research papers] 1733 words
(5 pages)
Strong Essays [preview]
Physics of Image Processing Essay - Missing Figures Characteristics of Light There are a few fundamental characteristics of light that are useful to be aware of before proceeding with the discussion on how CCD's and Film can function to save a useful, meaningful image. One of these important fundamental qualities is the fact that visible light is electromagnetic radiation. Electromagnetic Radiation, Photons, and Energy Levels Electromagnetic radiation has many different classifications. Some such classifications include AM/FM Radio Waves, microwaves, visible light, x-rays, and gamma rays....   [tags: physics photo photograph digital camera film] 3235 words
(9.2 pages)
Powerful Essays [preview]
Computer Vision Technique and Its Application on Moving Object Tracking Essay examples - COMPUTER VISION TECHNIQUES Computer vision is the science that develops the theoretical and algorithmic basis by which useful information about the world can be automatically extracted and analysed from an observed image, image set, or image sequence from computations made by special-purpose or general purpose computers (notes). The main goal of computer vision application is to produce automated recognition systems that can equivalent or eventually better than human performance. Computer vision can be used to allow new relations techniques and tie both the physical and virtual worlds....   [tags: image processing, pixel operations]
:: 3 Works Cited
1702 words
(4.9 pages)
Powerful Essays [preview]
Image Processing Based Finger-Vein Biometric Recognition System Essay examples - A. Iris Recognition A large number of iris biometric identification techniques have been developed and there are several literatures available for Iris recognition. Iris recognition combines computer vision pattern recognition,statistics, and the human-machine interface[1]. The iris recognition system involves a number of steps: First, a camera acquires an image of an eye. Next,the iris is located within the image. The annular region of the iris is “unwrapped,” or transformed from raw image coordinates to normalized polar coordinates....   [tags: Voice Recognition, Periocular Biometrics]
:: 15 Works Cited
1872 words
(5.3 pages)
Powerful Essays [preview]

Related Searches






2. ADAPTIVE CONTOUR TRACING
Input Data: A square tessellation, Q, of Q-width x Q-height containing cells that belong to the shape and cells that belong to the background of the shape. A Tessellation is a group of cells (pixels in images) that has the same shape and size.
Definitions:
1- Each cell is represented by an x-y coordinate point p = (x, y)
2- The terms ¡§cell¡¨, ¡§point¡¨ and ¡§pixel¡¨ all refer to the same definition of a cell.
3- Define 8-neighbor(cell, direction) as Moore¡¦s neighborhood which is a common concept that defines the 8-neighboring cells of any cell as shown in
4- Define i-order neighbor of any cell i-order(cell, direction) as the set of (i*8) cells, where i > 0, that are i-1 cells away from that cell. Moore¡¦s Neighbor corresponds to our 1-order notation. The 2-order neighbor contains 16 cells and 3-order neighbor contains 24 cells as shown in Figure 2.
5- Define 4 orientations to read cells around any cell p: (LR-Direction, RL-Direction, DU-Direction and UD-Direction) as shown in Figure 3.
6- The top-left cell of Q has (x, y)= (1,1) and the x-axis increases from left to right and the y-axis increases from top to bottom.
7- Let s denotes any shape cell, p denotes any background cell, c and d denote any cell, C and D are the set of cells of i-order around cells c and d respectively.
8- When disregarding 1-pixel shapes, Define a stranded point s as a cell where all 8-neighbor or 1-order cells = p.
9- Define neighborhood tolerance factor T as the maximum i-order where the trace algorithm should keep looking for a contour boundary.
Output Data: An ordered sequence P (p1, p2, ¡K, pn) of n contour boundary points.
The Algorithm:
- Set P to be empty.
- From top to bottom and left to right scan the cells of Q until the leftmost shape pixel s1 with (x1, y1) coordinate is found as shown in figure 4.
- Insert p1=(x1-1,y1), left background cell next to s1, in P.
- Set startpoint = p1, previouspoint = p1, currentdirection = DU, i-order = 1
- Set p2 = getNextPoint (1, p1 , DU) and Insert p2 in P.
- Set n = 3
- While true do
(Comment: Scan all i-orders up to maximum tolerance T)
For i = 1 to T      
Set pn = getNext (i, pn-1 , pn-2)
If pn = p1 then exit while loop
If pn is not empty Then
Insert pn in P
Set n = n+1
Exit For Loop
End If
Next i
End While
Function getNext
Input Parameters: i-order i, currentpoint, previouspoint
Output Parameters: nextpoint
Begin
(Comment: the direction of movement is switched between the four directions depending on the increase and decrease in the x and y coordinate values of the previous and current points)
If currentpoint.x > previouspoint.x Then
nextpoint = getNextPoint (i, currentpoint, LR-direction)
Else If currentpoint.x < previouspoint.x Then
nextpoint = getNextPoint(i, currentpoint, RL-direction)
Else If currentpoint.x = previouspoint.x Then
If currentpoint.y > previouspoint.y Then
nextpoint = getNextPoint(i, currentpoint, UD-direction)
Else If currentpoint.y < previouspoint.y Then
nextpoint = getNextPoint(i, currentpoint, DU-direction)
End If
End If
End Function getNext
Function getNextPoint
Input Parameters: i-order i, currentpoint, currentdirection
Output Parameters: nextpoint
Set nextpoint=empty
Begin
Set C = i-order(currentpoint, currentdirection)
For n = 1 to (i*8) where cn „¡ C
(Comment: if cn is a background cell then in order to use it as a boundary point it must have an i-order background cell and the later must have an 8-neighbor shape cell that is not stranded - if stranded checking is enabled)
If (cn = p) Then                
Set D = 8-neighbor(cn, currentdirection)
For m = 1 to 8 where dm „¡ D
If (dm = s) and (s is not stranded) and (cn not traced before) Then
Set nextpoint = cn
Set cn to be traced
Exit For
End If
Next m
End If
Next n
End Function getNextPoint

3. COMPARISONS WITH OTHERS
There were many contour tracing algorithms proposed in the literature such as the Square Tracing Algorithm [1][2], Moore-Neighbor Tracing [3], Radial Sweep [4] and Pavlidis Algorithm [5]. All of the available contour tracing algorithms return contour points that belong to the shape rather than the surroundings of the shape. They are also concerned with continuos contours where all contour pixels need to have a an 8-neighbor shape pixel. Our algorithm does not look for a shape contour cell in the 8-neighbor cells of the current cell like other algorithms but rather it looks in the 8-neighbor cells of each of the i-order cells of the current cell in the current direction (Figure 5) and tries to find an adjacent shape contour cell to a potential background cell. In other words, we look in the 1-order and 2-order cells of the current cell at the same time. This concept is what makes it immune to discontinuities in the shape¡¦s contour as it can jump over openings in the contour. The current pixel does not belong to the shape¡¦s contour but rather to its surroundings.

The selected direction depends on the x-y coordinates of the current and previous background cells traced as defined in getNext function. The start up direction of the start point is DU-direction as there is no prior point. Our algorithm can handle discontinuous contours by adapting to a specified neighborhood tolerance as shown in the traced shape of Figure 6.

The neighborhood tolerance specifies how far to look for a contour pixel from the current position. The algorithm is not restricted to the 8-neighbor pixels of a pixel but rather it can look forward to other neighbors as the 16-neighbor and 24-neighbor pixels. This algorithm has the power to trace shapes such as a thin line that is 1-pixel wide or shapes that contain only 1 pixel or 2 pixels as shown in Figure 7.



To trace a 1 pixel shape, the check for stranded point has to be disabled. Stranded points are pixels in the background that are cut off from the shape pattern.. Tracing 1-pixel is possible due to tracing the surroundings of the shape rather that the contour of the shape. Figure 8 shows a variety of shapes traced with our algorithm. The algorithm is robust and not calculation intensive. The time complexity of the algorithm is O(n) where n is the number of shape contour pixels.


4. SUMMARY AND CONCLUSION
The adaptive contour tracing algorithm presented the new concept of tracing the surrounding of the shape rather than the contour itself. This concept has the advantage of tracing any closed or open shape even if it was a single pixel. The algorithm can also trace distorted and disconnected boundaries since it is not using the surrounding 8-neighbors of pixels but rather the 8-neighbors of each of the 8-neighbors of the current pixel. This concept needs to be enhanced to resolve these 2 issues:
1) The failure to differentiate between open gaps and actual contour convex as shown in figure 9 as the 1 pixel gap in the contour of the camel was not a discontinuity but the algorithm did not have any logic to differentiate between an opening in the contour and following the contour. One solution to this might be to use a contour extraction algorithm like the Canny Algorithm and the addition of logic to insure that all the contour pixels returned by the Canny Algorithm has been traced.


2) The failure to trace very small shapes of around 10 pixels as the returned trace could be coarse and may not reflect the actual shape as shown in figure 10.


5. REFERENCES
[1] A. Rosenfeld, ¡§Digital Topology,¡¨ American Mathematical Monthly, pp. 621-630, vol. 86, 1979.
[2] A. Rosenfeld, R. A. Melter, ¡§Digital Geometry,¡¨ The Mathematical Intelligencer, pp 69-72, vol. 11, No. 3, 1989.
[3] R. C. Gonzalez and R. E. Woods. Digital Image Processing, 2nd ed., Prentice Hall, Upper Saddle River, NJ. 2002.
[4] F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
[5] T. Pavlidis. Algorithms for graphics and image processing. Computer Science Press, Rockville, MD, 1982.




Return to 123HelpMe.com