[BIC-announce] Seminar: Prof. Laurent Cohen - Tuesday Sept. 1, 11am to 12noon in McConnell Engineering Room 437

[Christine Dudek]

Dear all,

This announcement is being sent on behalf of Prof. Kaleem Siddiqi (McGill School of Computer Science & Centre for Intelligent Machines).

All are invited to attend.

Best,

Krys

Krys (Christine) Dudek | Program Administrator, NSERC CREATE Program for Medical Image Analysis (CREATE-MIA) | Centre for Intelligent Machines | McGill University | McConnell Engineering, Room 410 | 3480 University Street | Montreal, QC H3A 0E9 | Tel: 514-398-6319 | cim.mcgill.ca/create-mia

-----------------------------------------------------------------------------------
Segmentation of biomedical images using geodesic methods
Laurent D. COHEN
CEREMADE, UMR cNRS 7534, University Paris Dauphine, France
Place du Marechal de Lattre de Tassigny, 75016 Paris, France
cohen at ceremade.dauphine.fr
http://www.ceremade.dauphine.fr/~cohen

Tubular and tree structures appear very commonly in biomedical images like vessels, microtubules
or neuron cells. Minimal paths have been used for long as an interactive tool to segment these
structures as cost minimizing curves. The user usually provides start and end points on the image
and gets the minimal path as output. These minimal paths correspond to minimal geodesics
according to some adapted metric. They are a way to find a (set of) curve(s) globally minimizing the
geodesic active contours energy. Finding a geodesic distance can be solved by the Eikonal equation
using the fast and efficient Fast Marching method. Different metrics can be adapted to various
problems. In the past years we have introduced different extensions of these minimal paths that
improve either the interactive aspects or the results. For example, the metric can take into account
both scale and orientation of the path. This leads to solving an anisotropic minimal path in a 2D or
3D+radius space. On a different level, the user interaction can be minimized by adding iteratively
what we called the keypoints, for example to obtain a closed curve from a single initial point. The
result is then a set of minimal paths between pairs of keypoints. This can also be applied to
branching structures in both 2D and 3D images.
Geodesic Voting consists in computing geodesics between a given source point and a set of points
scattered in the image. The geodesic density is defined at each pixel of the image as the number of
geodesics that pass over this pixel. The target structure corresponds to image points with a high
geodesic density. We will illustrate different possible applications of this approach.

In this talk we will present recent methods based on geodesics for biomedical applications, like
automatic segmentation of vascular tree in retinal images.

-------------------------------------------------------------------
Laurent Cohen
Directeur de Recherche
CEREMADE, UMR CNRS 7534, Universite  Paris Dauphine PSL*
Place du Marechal de Lattre de Tassigny
75775 Paris cedex 16, France
Tel. (33-1) 44 05 46 78 Fax (33-1) 44 05 45 99
mailto:Cohen at ceremade.dauphine.fr
Home Page: http://www.ceremade.dauphine.fr/~cohen

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.bic.mni.mcgill.ca/pipermail/bic-announce/attachments/20150828/988c2ec0/attachment.html>