Digital topology and geometry in medical imaging: a survey

PK Saha, R Strand, G Borgefors - IEEE transactions on medical …, 2015 - ieeexplore.ieee.org
Digital topology and geometry refers to the use of topologic and geometric properties and
features for images defined in digital grids. Such methods have been widely used in many …

Linear time maximally stable extremal regions

D Nistér, H Stewénius - Computer Vision–ECCV 2008: 10th European …, 2008 - Springer
In this paper we present a new algorithm for computing Maximally Stable Extremal Regions
(MSER), as invented by Matas et al. The standard algorithm makes use of a union-find data …

Efficient maximally stable extremal region (MSER) tracking

M Donoser, H Bischof - 2006 IEEE computer society …, 2006 - ieeexplore.ieee.org
This paper introduces a tracking method for the well known local MSER (Maximally Stable
Extremal Region) detector. The component tree is used as an efficient data structure, which …

Power watershed: A unifying graph-based optimization framework

C Couprie, L Grady, L Najman… - IEEE transactions on …, 2010 - ieeexplore.ieee.org
In this work, we extend a common framework for graph-based image segmentation that
includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing …

Watershed cuts: Minimum spanning forests and the drop of water principle

J Cousty, G Bertrand, L Najman… - IEEE transactions on …, 2008 - ieeexplore.ieee.org
We study the watersheds in edge-weighted graphs. We define the watershed cuts following
the intuitive idea of drops of water flowing on a topographic surface. We first establish the …

Maximally stable colour regions for recognition and matching

PE Forssén - 2007 IEEE Conference on computer vision and …, 2007 - ieeexplore.ieee.org
This paper introduces a novel colour-based affine co-variant region detector. Our algorithm
is an extension of the maximally stable extremal region (MSER) to colour. The extension to …

Building the component tree in quasi-linear time

L Najman, M Couprie - IEEE Transactions on image processing, 2006 - ieeexplore.ieee.org
The level sets of a map are the sets of points with level above a given threshold. The
connected components of the level sets, thanks to the inclusion relation, can be organized in …

A graph-based mathematical morphology reader

L Najman, J Cousty - Pattern Recognition Letters, 2014 - Elsevier
A graph-based mathematical morphology reader - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Watershed cuts: Thinnings, shortest path forests, and topological watersheds

J Cousty, G Bertrand, L Najman… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
We recently introduced watershed cuts, a notion of watershed in edge-weighted graphs. In
this paper, our main contribution is a thinning paradigm from which we derive three …

An efficient approach to 3D single tree-crown delineation in LiDAR data

D Mongus, B Žalik - ISPRS Journal of Photogrammetry and Remote …, 2015 - Elsevier
This paper proposes a new method for 3D delineation of single tree-crowns in LiDAR data
by exploiting the complementaries of treetop and tree trunk detections. A unified …