| Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3308 |
An excellent tutorial on Moore Neighbor Tracing is provided here:
http://www.imageprocessingplace.com/downloads_V3/root_downloads/tutorials/contour_tracing_Abeer_George_Ghuneim/moore.html.
The code is available here:
https://github.com/daviddoria/MooreTracing
Review of Moore Neighbour Tracing
by Gordon Stevenson on 2011-09-20 12:30:45 for revision #1 



expertise: 3 sensitivity: 5 The author implements the moore neighbour tracing algorithm in order to produce an ordered list of the outline of a 2D blob or a contour presented as an image.
Hypothesis:The author's code has a number of examples, including a dummy square that is produced and then operated on by the algorithm to produce a working result. The author allows user files to be run on the algorithm also.
For the example that displays the ordered boundary element list as a color map from black through white using the 'hot' colourmap there is an assumption based on the datatype of itk::Image that is passed in that there will be up to 255 boundary elements, otherwise the colormap will be repeated.
Evidence:Evidence is shown in the examples of the algorithm running correctly. From brief observation it seems to run fine.
Open Science:The code is able to viewed, extended and the examples are also available.
Reproducibility:Code ran successfully for me using CMake 2.8 and Visual Studio 2008.
Resources
| Download Package | |
| Download Paper, View Paper | |
Statistics more
| Global rating: | ![]() ![]() ![]() ![]()
|
| Review rating: | ![]() ![]() ![]() ![]() [review]
|
| Paper Quality: |
|
Information more
| Categories: | Edge Detection, Mathematical Morphology, Neighborhood filters |
| Keywords: | Contour, Blob, Tracing, |
| Export citation: | |
Share
Associated Publications
| Closed Loop Simplification | ||
View license
Send a message to the author
