Jean Cousty
Jean Cousty
Professor of Computer Science, Université Paris-Est, ESIEE-Paris
Bestätigte E-Mail-Adresse bei esiee.fr
TitelZitiert vonJahr
Watershed cuts: Minimum spanning forests and the drop of water principle
J Cousty, G Bertrand, L Najman, M Couprie
IEEE Transactions on Pattern Analysis and Machine Intelligence 31 (8), 1362-1374, 2008
2832008
Watershed cuts: Thinnings, shortest path forests, and topological watersheds
J Cousty, G Bertrand, L Najman, M Couprie
IEEE Transactions on Pattern Analysis and Machine Intelligence 32 (5), 925-939, 2009
1562009
Method and apparatus for registering 3D models of anatomical regions of a heart and a tracking system with projection images of an interventional fluoroscopic system
R Vaillant, F Kotian, JS Sra, J Cousty, L Launay
US Patent 8,515,527, 2013
1262013
Method and system for registering 3D models of anatomical regions with projection images of the same
R Vaillant, JS Sra, J Cousty, F Kotian
US Patent 7,327,872, 2008
1122008
Segmentation of 4D cardiac MRI: Automated method based on spatio-temporal watershed cuts
J Cousty, L Najman, M Couprie, S Clément-Guinaudeau, T Goissen, ...
Image and Vision Computing 28 (8), 1229-1243, 2010
1002010
Some links between min-cuts, optimal spanning forests and watersheds
C Allène, JY Audibert, M Couprie, J Cousty, R Keriven
Mathematical Morphology and its Applications to Image and Signal Processing …, 2007
942007
Morphological filtering on graphs
J Cousty, L Najman, F Dias, J Serra
Computer Vision and Image Understanding 117 (4), 370-385, 2013
572013
Some morphological operators in graph spaces
J Cousty, L Najman, J Serra
International Symposium on Mathematical Morphology and its Applications to …, 2009
572009
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
J Cousty, L Najman
International Symposium on Mathematical Morphology and Its Applications to …, 2011
532011
Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs
L Najman, J Cousty, B Perret
International Symposium on Mathematical Morphology and Its Applications to …, 2013
432013
A graph-based mathematical morphology reader
L Najman, J Cousty
Pattern Recognition Letters 47, 3-17, 2014
422014
4D Morphological segmentation and the MICCAI LV-segmentation grand challenge
L Marak, J Cousty, L Najman, H Talbot
372009
Constructive links between some morphological hierarchies on edge-weighted graphs
J Cousty, L Najman, B Perret
International Symposium on Mathematical Morphology and Its Applications to …, 2013
322013
Fusion graphs: merging properties and watersheds
J Cousty, G Bertrand, M Couprie, L Najman
Journal of Mathematical Imaging and Vision 30 (1), 87-104, 2008
312008
A hierarchical image segmentation algorithm based on an observation scale
SJF Guimarães, J Cousty, Y Kenmochi, L Najman
Joint IAPR International Workshops on Statistical Techniques in Pattern …, 2012
292012
Automated, accurate and fast segmentation of 4D cardiac MR images
J Cousty, L Najman, M Couprie, S Clément-Guinaudeau, T Goissen, ...
International Conference on Functional Imaging and Modeling of the Heart …, 2007
282007
Nonsupervised ranking of different segmentation approaches: application to the estimation of the left ventricular ejection fraction from cardiac cine MRI sequences
J Lebenberg, I Buvat, A Lalande, P Clarysse, C Casta, A Cochet, ...
IEEE Transactions on Medical Imaging 31 (8), 1651-1660, 2012
262012
Artwork 3D model database indexing and classification
S Philipp-Foliguet, M Jordan, L Najman, J Cousty
Pattern Recognition 44 (3), 588-597, 2011
262011
Some morphological operators on simplicial complex spaces
F Dias, J Cousty, L Najman
International Conference on Discrete Geometry for Computer Imagery, 441-452, 2011
252011
Directed connected operators: Asymmetric hierarchies for image filtering and segmentation
B Perret, J Cousty, O Tankyevych, H Talbot, N Passat
IEEE transactions on pattern analysis and machine intelligence 37 (6), 1162-1176, 2014
242014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20