By Topic

Algorithm to decompose three-dimensional complex structures at the necks: tested on snow structures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Theile, T. ; SLF, WSL Inst. for Snow & Avalanche Res., Davos Dorf, Switzerland ; Schneebeli, M.

The separation of overlapping particles in three-dimensional images is an image processing task with many fields of application. However, commonly used image processing algorithms have difficulties to identify the single particles and their connections in certain structures. Here the authors present an alternative algorithm for part decomposition, which performs better on some structures than common algorithms. This algorithm is a special case of part decomposition, as it decomposes a structure at the necks into single particles. The necks are detected based on their characteristic negative Gaussian curvature. The algorithm itself consists of three steps: cutting at negative Gaussian curvature, region growing and intersecting plane minimisation. The authors tested the performance of the algorithm by comparison with two state-of-the-art algorithms for part decomposition, the watershed and a skeleton-based algorithm on strongly differing geometries, taken from natural snow samples. The two test algorithms are known for having difficulties to decompose certain structures. As the new algorithm uses a different characteristic to decompose the structure, the new algorithm is a good alternative to the existing algorithms. The new algorithm decomposes 72% of the reference structure correctly. This is a better performance than by the two other algorithms.

Published in:

Image Processing, IET  (Volume:5 ,  Issue: 2 )