
Search

Morphological erosion and dilation filters employ a structuring function, with flat structuring functions being the most common example. This article will use the term ``parabolic'', but much of the literature uses ``quadratic'' structuring functions are less [...]

Binary morphological operations are fundamental tools in image processing but the processing time scales with the number of pixels thus making them expensive operations on the CPU for larger 3D datasets that typically appear in medical imaging. Since erosion [...]

Morphological area attribute openings and closingscite{Cheng92,Vincent93a} are connected set
operations that are able to remove parts of an image that meet certain
criteria without changing the rest of the image. This article describes a number of
classes [...]

In this document it is described the implementation of the flux driven automatic centerline extraction
algorithm proposed by Bouix et al. in 2004. This is based on a skeletonisation algorithm initially
proposed by Siddiqi et al. in 2002, using properties of [...]

It is sometimes useful to be able to apply binary morphological operations, such as erosions and dilations, to labelled images in a fashion that preserves the labels. This article introduces a specialised class implementing parallel methods described in beare [...]

Kernel based filtering is one of the fundamental tools of image
analysis and processing. A number of approaches have been developed
over the years that allow efficient implementation of such filters
even when the kernel size is large. This article reviews [...]

This document describes a filter called itkMultipleUnlabeledImagesToLabeledImageFilter, which takes multiple images as input and generates a single image of labeled pixels. Pixels to be labeled for each image are determined by an intensity threshold. [...]

This document presents an implementation of Moore Neighbor Tracing - an algorithm to find an ordered outline of a blob or contour in an image.
An excellent tutorial on Moore Neighbor Tracing is provided [...]

Richard Beare has recently introduced a new filter to efficiently labelize the connected components with ITK, and has also proposed to use the run-length encoding used in that filter to implement some of the most useful binary mathematical morphology [...]

ly in ITK, the only way to find the contour of the objects in a binary image is to use the BinaryErodeImageFilter, with a kernel of radius 1. This filter is a generic filter, made to support any shape and size of structuring element, and thus is not optimized [...]

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 [...]

Minimally Interactive Knowledge-based Coronary Tracking in CTA using a Minimal Cost Path
Published in The MIDAS Journal
Published in The MIDAS Journal
An algorithm for minimally interactive coronary artery tracking is presented. Tracking ability and accuracy results are demonstrated on 16 images CTA images.
First, a region of interest is automatically selected and a denoising filter applied. Then, for each [...]

An entropy based multi-thresholding method for semi-automatic segmentation of liver tumors
Published in The MIDAS Journal
Published in The MIDAS Journal
Liver cancer is the fifth most commonly diagnosed cancer and the third most common cause of death
from cancer worldwide. A precise analysis of the lesions would help in the staging of the tumor and
in the evaluation of the possible applicable therapies. In [...]
