Finding regional extrema - methods and performance

Beare, Richard1*,Lehmann, Gaetan
1.Monash University
Abstract

Abstract

Finding regional extrema of images is an important step in a number of morphological algorithms, such as some versions of the watershed transform\footnote{This work started because we were trying to compare different watershed algorithms}. Regional extrema may also be important cues of other tasks, such as splitting objects based on distance transform information. This report provides an overview of the methods available in ITK and compares the performance with a new filter.

Keywords

regional minimaperformancefloodingmathematical morphology
Manuscript
Source Code and Data

Source Code and Data

regionalExtremaCMakeLists.txt7.2 KBArticle.pdf104.5 KBESCells.hdr348 BESCells.img4.5 MBarticleArticle.tex14.3 KBInsightArticle.cls3.9 KBInsightJournal.bib155.8 KBInsightJournal.sty35 KBMakefile1 KBalgorithm.sty2.2 KBalgorithmic.sty5.4 KBRefnames.bib96.8 KBarticle.bib543 Bamssymb.sty14.9 KBfloatflt.sty10.8 KBfancyhdr.sty14.4 KBfncychap.sty10.1 KBreg_max_4_ov.png99.1 KBreg_max_8_ov.png88 KBreg_min_4_ov.png1.6 KBreg_min_8_ov.png1.6 KBreg_min_ov.png1.6 KBtimes.sty857 BIJMacros.txt3.1 KBcthead1.png192.6 KBblack.png122 Bfrmax.cxx1.9 KBexceptions.cxx1.2 KBitkConnectedComponentAlgorithm.h1.2 KBfrmin.cxx1.9 KBitkInvertIntensityImageFilter.txx1.8 KBitkInvertIntensityImageFilter.h3.7 KBitkRegionalMaximaImageFilter.h5 KBitkRegionalMaximaImageFilter.txx4.3 KBitkRegionalMinimaImageFilter.h5 KBitkRegionalMinimaImageFilter.txx4.3 KBitkValuedRegionalExtremaImageFilter.h5.6 KBitkValuedRegionalExtremaImageFilter.txx6.4 KBitkValuedRegionalMaximaImageFilter.h1.9 KBitkValuedRegionalMinimaImageFilter.h1.9 KBperf3D.cxx2 KBrmax.cxx2 KBrmax3D.cxx1.9 KBrmin.cxx2 KBrmin3D.cxx1.9 KBthreshold.png712 Bvrmax.cxx2.2 KBvrmin.cxx2.9 KBwhite.png133 B

Select a file to preview

Reviews

Reviews

Dan Mueller

Monday 9 January 2006

Summary: The authors discuss how to extract regional minima/maxima regions from binary/greyscale images. Two approaches are presented and compared: 1. the current ITK approach using the HConvexImageFilter and HConcaveImageFilter, and 2. a new approach using a simple flooding-based algorithm (referred to by the authors as ValuedRegionalExtremaImageFilter).

Hypothesis: The hypothesis is that the ValuedRegionalExtremaImageFilter approach is computational faster than the HConvexImageFilter/HConcaveImageFilter approach. Test results indicate that the proposed approach (ValuedRegionalExtremaImageFilter) is faster.

Evidence: Each approach has been implemented in ITK and execution times reported in the paper.

Open Science: Full open source for the filters, examples and tests, as well as input images, are provided.

Reproducibility: I was able to download, compile, and run the work. However, I had some minor problems compiling the code because I was using an older version of ITK (InsightToolkit-2.2.0). Compiling with InsightToolkit-2.4.1 was successful. I was also unable to run the tests because they rely on the DART Image Compare program. (Does anyone know how I can obtain the Image Compare program for testing Insight Journal articles? The IJ WIKI mentions that DART tests use Image Compare, but it does not explain how to obtain it for desktop testing/reproducibility.)

Use of Open Source Software: Uses ITK.

Open Source Contributions: The source code was relatively easy to get going (besides the minor unrelated issues listed above).

Code Quality: The code quality is fairly easy to read. However, I would like to see more comments within ValuedRegionalExtremaImageFilter::GenerateData() more fully explaining the algorithm - I find it hard to read what is being done and why.

Final Thoughts: Thanks for this addition to ITK. The speed increases for finding regional maxima/minima will help enhance various segmentation tasks. A comprehensive, well presented paper.