Sammanfattning

2D grey-level images are interpreted as 3D binary images, where the grey-level plays the role of the third coordinate. In this way, algorithms devised for 3D binary images can be used to analyse 2D grey-level images. Here, we present three such algorithms. The first algorithm smoothes a 2D grey-level image by flattening its geometrical and grey-level peaks while simultaneously filling in geometrical and grey-level valleys, regarded as non significant in the problem domain. The second algorithm computes an approximation of the convex hull of a 2D grey-level object, by building a covering polyhedron closely fitting the corresponding object in a 3D binary image. The result obtained is convex both from the geometrical point of view and as concerns grey-levels. The third algorithm skeletonizes a 2D grey-level object by skeletonizing the top surface of the object in the corresponding 3D binary image

Publicerad i

Lecture Notes in Computer Science
2005, Volym: 3617, sidor: 229-236

Konferens

13th International Conference on Image Analysis and Processing - ICIAP 2005

SLU författare

• Borgefors, Gunilla

  • Centre for Image Analysis, Sveriges lantbruksuniversitet
    

Permanent länk till denna sida (URI)

https://res.slu.se/id/publ/8358