Implementation of a 3D thinning algorithm
| Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/1292 |
Published in The Insight Journal - 2007 July - December.
Submitted by Hanno Homann on 10-12-2007.
ITK currently comes with a 2D binary thinning (skeletonisation) method, but does not support 3D or higher. This paper documents a new itkBinaryThinningImageFilter3D and recommends to rename the current filter as itkBinaryThinningImageFilter2D.
The 3D method suggested here is a direct implementation of the work of Lee et al. [2] who have demonstrated that their algorithm can find all deletable surface points at every iteration and is thus very fast. The code was tested on six clinical datasets.
The 3D method suggested here is a direct implementation of the work of Lee et al. [2] who have demonstrated that their algorithm can find all deletable surface points at every iteration and is thus very fast. The code was tested on six clinical datasets.
Data
1 File (1Mb)
Code
Reviews
A good candidate for introduction in ITK
by Anonymous on 2010-04-28 03:39:43 for revision #1 
expertise: 2 sensitivity: 4.5 
Summary:
The autor implements a algorithm for thinning in binary images based on decision trees that works with 3D images.
Hypothesis:Not Applicable
Evidence:Source code and a testing image are included.
Open Science:Sources are included, including a test image and its result, source of latex article and references to the original paper that explains the method.
Reproducibility:The code was downloaded and compiled without issues
Quality of the data :It's easy to reproduce and generate new skeletons.
Interest:Skeletons are widely used in several fields of computer visions.
ITK as a whole, could benefit of this addition to their libraries as it currently only 2D skeletons are supported
Free comment :The metod is fast and robust (could not find a volume that made the algorithm to crash).
Comment by : Rapid Advice Of ugg Examined
As for the wannabe ugg boots. Absolutely everyone had to see this one particular coming. I lived in Wisconsin for 12 years was bound to occur. However, the boots of UGG are the finest ones in the markets. In addition to, the lengths of UGG boots are virtually more than our ankles. As matter that most of them are higher.
Inside this scenario, feet and ankle could well be harm by the effect. The authentic UGG designer had viewed as about this dilemma and give some hang piece to boost this example, which would make them significantly greater but could also be not greatest suited to dress in for a outlet ugg boots
extended time. Meanwhile, authentic UGGs are seriously the "comfy" shoes, but never ever be the "outdoor purposeful shoes", which means they are not proper to worn when performing some sports or some exercising as climbing the mountains.
If you haven then you must know there a kind of boot that is nicely identified in Australia. The ugg boots bring you some of the most fashionable boots for guys and females right now. You also will uncover the ugg boots to be located on the internet and there is a lot in stock of all kinds of designs.
As the name recommend, these Ugg boots are brief and ends mid calf. They are plain looking and are specially opted for that expert look. You can outlet uggs
wear them below your bell boots, or your formal pants. It is hard to beddy-bye. Robert. Snow boots genuine comfy..
Australian Geographic shops have some great things - this is a link to the physical retailers, but they also sell factors on-line. I would also have a appear at the ABC shops, as they might have some very good Australian items (also Australian television shows on dvd, if they have a multi-area player). If you are flush with cash, how about ugg boots? Foreign city t-shirts are typically a hit as well, and agree with Tim Tams or chocolate bars that are not available outside Australia..
Accurate and fast skeletonizer
by Oleksandr Dzyubak on 2010-05-03 12:18:31 for revision #1 expertise: 3 sensitivity: 4.5
Summary:
This submission is related to the family of Binary thinning algorithms to ultimately extract the centerlines of the objects in an image. This is a 3D implementation that follows the decision tree based approach suggested by Ta-Chin Lee et al. The algorithm is fast and accurate. In addition to that it is very easy to use: No user-defined paramters are required except the input and output image type.
.
Hypothesis:In 3D this algorithm can correctly iteratively handle all possible binary combinations of object and background voxels in a 26-neighbourhood and find all deletable surface points at each iteration.
Evidence:The author explained the basis of the algorithms and provided the code along with "how-to-use-it" description and test images. Thus the user is able to test the code on the provided images and compare the results with ones provided by the author.
Open Science:This work follows the Open Science approach. The author does provide the source code that immediately can be tested on accompanying images.
Reproducibility:Compilation of the downloaded code was easy and did not make any troubles. After running the code on the provided images, the results were identical to the ones provided by the author. The accompanying paper/user manual was quite comprehensive and handy.
Quality of the data :Quality of the provided data was good and very easy to use.
Interest:This is a very good (fast and accurate) 3D skeltonazer which can be used in the object tracking software and/or as a building block in a morphological software.
Free comment :A very nice and handy toolbox for the object tracking applications. I would recommend including these classes from this submission to the ITK library.
Quick Comments
Resources
|
|
| Download All | |
Statistics more
|
|
| Global rating: | 
|
| Review rating: | [review]
|
| Code rating: | |
| Paper Quality: |
|
Information more
|
|
| Categories: | CMake, Code memory optimization, Code speed optimization, DART, Filtering, Generic Programming, Iterators, Mathematical Morphology, Parallelization, SMP, Programming, Surface extraction |
| Keywords: | 3D thinning, skeletonization |
| Toolkits: | ITK, CMake |
| Export citation: | |
Share
|
Linked Publications more
|
||
Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
by Weizman L., Freiman M., Joskowicz L.
|
||
Image Kernel Convolution
by Tustison N., Gee J.
|
||
View license
Loading license...
Send a message to the author
