http://iet.metastore.ingenta.com
1887

Different non-linear diffusion filters combined with triangle method used for noise removal from polygonal shapes

Different non-linear diffusion filters combined with triangle method used for noise removal from polygonal shapes

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Image Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A two-step process for removing noise from polygonal shapes is presented in this study. The authors present a polygonal shape as its turning function and then apply a non-linear diffusion filter and a triangle method on it. In the first step the authors apply several different non-linear diffusion filters on the turning function and compare the performance of these filters later. Non-linear diffusion filters identify dominant vertices in a polygon and remove those vertices that are identified as noise or irrelevant features. The vertices in the turning function which diffuse until the sides that immediately surround them approach the same turning function are identified as noise and removed. The vertices that are enhanced are preserved without changing their coordinates and they are identified as dominant ones. After the authors carry this process as far as it will go without introducing noticeable shape distortion, and switch to the triangle method for further removal of vertices that are to be treated as noise. In the second step the authors remove the vertices that form the smallest area triangles. The authors submit experimental results of the tests that demonstrate that this two-step process successfully removes vertices that should be dismissed as noise while preserving dominant vertices that can be accepted as relevant features and give a faithful description of the shape of the polygon. In experimental tests of this procedure the authors demonstrate successful removal of noise and excellent preservation of shape, thanks to appropriate emphasis of dominant vertices.

References

    1. 1)
      • E.M. Arkin , L.P. Chew , D.P. Huttenlocher , K. Kedem , J.S.B. Mitchell . An efficiently computable metric for comparing polygonal shapes. IEEE Trans. Pattern Anal. Mach. Intell. , 3 , 209 - 216
    2. 2)
      • L. de Floriani , M. Spagnuolo . (2007) Shape analysis and structuring.
    3. 3)
      • F. Cao , J.-L. Lisani , J.-M. Morel , P. Musé , F. Sur . (2006) A theory of shape identification.
    4. 4)
      • H. Krim , A. Yezzi . (2006) Statistics and analysis of shapes (modeling and simulation in science, engineering and technology).
    5. 5)
      • R. Kimmel . (2004) Numerical geometry of images: theory, algorithms, and applications.
    6. 6)
      • Hong, J., Tan, X.: `The similarity between shapes under affine transformation', Proc. Second Int. Conf. Computer Vision, 1988, p. 489–493.
    7. 7)
      • Hong, J., Wolfson, H.J.: `An improved model-based matching method using footprints', Proc. Ninth Int. Conf. Pattern Recognition, 14–18 November 1988.
    8. 8)
      • Schwartz, J.T., Sharir, M.: `Some remarks on robot vision', April 1984, Technical Report 119, Robotics Report. 25, New York Univ., Courant Inst. Math. Sci..
    9. 9)
      • Wolfson, H.: `On curve matching', Proc. IEEE Workshop Computer Vision, 30 November–2 December 1987.
    10. 10)
      • D.H. Ballard , C.M. Brown . (1982) Computer vision.
    11. 11)
      • A. Rosenfeld , M. Thurston . Edge and curve detection for visual scene analysis. IEEE Trans. Comput. , 562 - 569
    12. 12)
      • A. Witkin . (1983) Scale-space filtering, Int. Joint Conf. Artificial Intelligence.
    13. 13)
      • J. Koenderink . The structure of images. Biol. Cyben. , 5 , 363 - 370
    14. 14)
      • J. Babaud , A. Witkin , M. Baudin , R. Duda . Uniqueness of the Gaussian kernel for scale-space filtering. IEEE Trans. Pattern Anal. Mach. Intell. , 1 , 26 - 33
    15. 15)
      • A. Yuille , T. Poggio . Scaling theorems for zero crossings. IEEE Trans. Pattern Anal. Mach. Intell. , 1 , 15 - 26
    16. 16)
      • A. Hummel , L. Uhr . (1987) The scale-space formulation of pyramid data structures, Parallel computer vision.
    17. 17)
      • Hummel, A.: `Representations based on zero-crossings in scalespace', Proc. IEEE Computer Vision and Pattern Recognition Conf., June 1986, p. 204–209.
    18. 18)
    19. 19)
    20. 20)
      • Tameze, C., Vincelette, R., Melikechi, N., Zeljković, V., Izquierdo, E.: `Empirical analysis of LIBS images for ovarian cancer detection', WIAMIS 2007.
    21. 21)
      • J. Munkres . (2000) Topology.
    22. 22)
      • M. Barnsley . (1988) Fractals everywhere.
    23. 23)
      • R.B. Vincelette , C. Tameze , M. Savic , V. Zeljkovic . (2007) Efficient shape recognition method using novel metric for complex polygonal shapes.
    24. 24)
      • J. O'Rourke , R. Washington , G. Toussaint . (1985) Curve similarity via signatures, Computational geometry.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ipr.2008.0233
Loading

Related content

content/journals/10.1049/iet-ipr.2008.0233
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address