Image Processing Projects

Related to the Euclidean distance transform

• W. H. Hesselink, J. B. T. M. Roerdink: Euclidean skeletons of digital image and volume data in linear time by integer medial axis transform. IEEE Trans. Pattern Anal. Machine Intell. 30 (2008) 2204--2217. Some code is available.
  See also W. H. Hesselink, M. Visser, J. B. T. M. Roerdink: Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform. In Mathematical Morphology: 40 Years On (Proc. 7th Intern. Symp. on Mathematical Morphology, April 2005), pages 259-268. Springer V. 2005.
• W. H. Hesselink: A linear-time algorithm for Euclidean feature transform sets. Information Processing Letters 102 (2007) 181-186.
  Also available: Distance transforms and feature transform sets, an extension and modification of the IPL paper.

Mintrees and attribute filters

• M. H. F. Wilkinson, H. Gao, W. H. Hesselink, J.-E. Jonker, A. Meijster: Concurrent computation of attribute filters on shared memory parallel machines. IEEE Trans. Pattern Anal. Machine Intell. 30 (2008) 1800-1813. PDF preprint(364 kB) available.
• W. H. Hesselink: Salembier's Min-tree algorithm turned into breadth first search. Information Processing Letters 88 (2003) 225-229.

Comments and questions are welcome.
Back to my home page.
Wim H. Hesselink