Stawiaski, Jean (2008) Mathematical Morphology and Graphs : Application to Interactive Medical Image Segmentation. PhD thesis Morphologie mathématique, CMM- Centre de Morphologie Mathématique, ENSMP p.175.

Full text available as: - These_Jean_Stawiaski.pdf ( 29048 Kb )

Licence: Copyright

Abstract

Medical imaging is one of the most active research topics in image analysis. Analyzing and segmenting medical images in a clinical context remains a challenging task due to the multiplicity of imaging modalities and the variability of the patients characteristics and pathologies. Medical image processing also requires a human supervision for interpretation and validation purposes. The numerous applications and the huge amount of medical image data need complex software that combine high level graphical user interfaces as well as robust and fast interactive image analysis tools. Recent research in image segmentation has highlighted the potential of graph based methods for medical applications. These new tools have generated a great interest in the imaging community. Graph theory is the framework used in this thesis to propose innovative image segmentation tools. The focus of this thesis is both theoretical and practical. On the theoretical level, we study properties of minimal spanning trees, shortest paths trees and minimal cuts and we revisit these notions for image segmentation purposes. It allows us to derive new theoretical links between minimal spanning trees, shortest paths trees and minimal multi-terminal cuts. These results highlight the possibilities and the limitations of each technique for image segmentation problems. In a second step, we propose some theoretical and practical improvements of image segmentation based on graph cuts. This structure is particularly interesting for solving a fairly large variety of energy minimization problems. Our strategy is based on the use of the region adjacency graph produced by the watershed transform from mathematical morphology. The combination of morphological and graph cuts segmentation permits us to speed up and define new classes of energy functions that can be minimized using graph cuts. The use of region graphs gives promising results and can potentially become a leading method for interactive medical image segmentation. The third point of this thesis details some qualitative and quantitative studies of medical image segmentation problems, which is the initial motivation of this work. We show that the developed methods are well suited for various medical image segmentation problems. We study applications to surgery simulation, radiotherapy planning and tumors delineation. We show by a quantitative analysis that the combination of morphological and graph cuts segmentation methods outperforms several recent and state of the art tools. This study shows that our methods can be used in a clinical context. The last point of the thesis revisits and extends some classical graph based image segmentation tools. We revisit the well known watershed transform from the point of view of path optimization and path algebra. We recall existing properties of the watershed transform and propose some clear definitions of the watershed transform on graphs. Finally we also propose new extensions of the minimal graph cut problem for image segmentation purposes. New types of constraints are included in the classical minimal graph cut problem, which bring this standard problem into the linear programming framework. This class of combinatorial optimization problems is particulary interesting for image segmentation purposes since it provides a general framework for various constrained image segmentation problems such as boundary constrained minimal cuts and various geometric constrained minimal cuts. These new methods show great potential for various image segmentation scenarios.

References

[1] C. All ene, J. Audibert, M. Couprie, J. Cousty, and R. Keriven, Some links between min-cuts,

optimal spanning forests and watersheds, Proceedings of the The 8th International Symposium on

Mathematical Morphology, Rio de Janeiro, Brazil 1 (2007), 253{264.

[2] R. Audigier and R. A. Lotufo, Watershed by image foresting transform, tie-zone, and theoretical

relationships with other watershed de nitions, Proceedings of the The 8th International Symposium

on Mathematical Morphology, Rio de Janeiro, Brazil 1 (2007), 277{288.

[3] R. Beare, Regularized seeded region growing, Proceedings of the The 6th International Symposium

on Mathematical Morphology, Sydney, Australia (2002), 91{99.

[4] , A locally constrained watershed transform, IEEE Transactions on Pattern Analysis and

Machine Intelligence 28 (2006), 1063{1074.

[5] J.-M. Beaulieu and M. Goldberg, Hierarchy in picture segmentation : a stepwise optimization

approach., IEEE Transactions on Pattern Analysis and Machine Intelligence 11 (1989), no. 2.

[6] I. Ben-Dan and E. Shenhav, Liver tumor segmentation in ct images using probabilistic., Workshop

on 3D Segmentation in the Clinic: A Grand Challenge II. Liver Tumor Segmentation Challenge.

MICCAI, New York, USA. (2008).

[7] C. Berge, Th eorie des graphes et ses applications, Dunod, Paris, 1958.

[8] J. Besag, On the statistical analysis of dirty pictures, Royal Journal of Statistics, Soc. B 48(3)

(1974), 259{302.

[9] , Spatial interaction and the statistical analysis of lattice systems, Royal Journal of Statistics,

Soc. B 36 (1974), 192{236.

[10] S. Beucher, Watershed, hierarchical segmentation and waterfall algorithm, Mathematical Morphology

and its applications to signal processing (Proceedings ISMM'94) (Fontainebleau, France)

(J. Serra and P. Soille, eds.), Kluwer Academic Publishers, September 1994, pp. 69{76.

[11] S. Beucher and C. Lantu ejoul, Use of watershed in contour detection, International workshop on

image processing, real time edge and motion detection/estimation. Rennes, France (1979).

[12] N. Biggs, E. Lloyd, and R. Wilson, Graph theory, 1736-1936, Oxford University Press, 1986.

[13] Y. Boykov and M.P. Jolly., Interactive graph cuts for optimal boundary and region segmentation

of objects in n-d images, Proceedings of the 8th International Conference on Computer Vision,

Vancouver, Canada 1 (2001), 105{112.

[14] Y. Boykov and V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, Proceedings

of the 9th International Conference on Computer Vision, Nice, France 1 (2003), 26{33.

[15] , An experimental comparison of min-cut/max-

ow algorithms for energy minimization in

vision, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004), no. 9, 1124{

1137.

[16] Y. Boykov, O.Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE

Transactions on Pattern Analysis and Machine Intelligence 23 (2001), no. 11, 1222{1239.

[17] Y. Boykov, O. Veksler, and R. Zabih, Markov random elds with e cient approximations, IEEE

Conference on Computer Vision and Pattern Recognition (1998), 648{655.

[18] M. Bruglieri, F. Ma oli, and M. Ehrgott, Cardinality constrained minimum cut problems: com-

plexity and algorithms, Discrete Applied Mathematics 137 (3) (2004), 311{341.

[19] B. Carre, Graphs and networks, Oxford University Press, 1979.

[20] V. Caselles, R. Kimmel, and G. Sapiro, Geodesic active contours, International Journal of Computer

Vision, 694{699.

[21] V. Caselles, R. Kimmel, G. Sapiro, and C. Sbert, Minimal surfaces: A three dimensional segmen-

tation approach, Technion EE Pub. 973 (1995).

[22] A. Choudhary, N. Moretto, F. Pizzorni Ferrarese, and G. Zamboni, An entropy based multi-

thresholding method for semi-automatic segmentation of liver tumors, Workshop on 3D Segmentation

in the Clinic: A Grand Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New

York, USA. (2008).

[23] T. Cormen, C. Leiserson, and R. Rivest, Introduction to algorithms, McGraw-Hill (1990).

[24] J. Crespo, R. Schafer, J. Serra, C. Gratin, and F. Meyer, The

at zone approach : a general low-level

region merging segmentation method, Signal Processing 62 (1997), 37{60.

[25] E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D Seymour, and M. Yannakakis, The complexity

of multiterminal cuts, SIAM J. Comput. 23 (1994), 864{894.

[26] G.B. Dantzig, Maximization of a linear function of variables subject to linear inequalities, Activity

of production and allocation (T.C.Koopmans, ed.), Wiley, New York (1951), 359{373.

[27] G.B. Dantzig and D.R. Fulkerson, On the max-

ow min-cut theorem of networks, vol. 38, 1956,

pp. 215{221.

[28] E. W. Dijkstra, A note on two problems in connexion with graphs, In Numerische Mathematik 1

(1959), 269{271.

[29] E. A. Dinic, Algorithm for solution of a problem of maximum

ow in a network with power estima-

tion, Soviet Math. Doklady 11 (1970), 1277{1280.

[30] J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic e ciency for network

ow

problems, Journal of the ACM 19. 2 (1972), 248{264.

[31] A.N. Evans and X.U. Liu, A morphological gradient approach to color edge detection, IEEE Transactions

on Image Processing 15 (2006), 1454{1463.

[32] A. X. Falc~ao, J. K. Udupa, S. Samarasekera, S. Sharma, B. E. Hirsch, and R. A. Lotufo, User-steered

image segmentation paradigms: Live wire and live lane, Graphical Models and Image Processing

60 (1998), no. 4, 233{260.

[33] A.X. Falcao, J. Stol , and R. Lotufo, The image foresting transform: Theory, algorithms, and

applications, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004), 19{29.

[34] J. Fan, G. Zeng, and M. Body M.-S. Hacid, Seeded region growing: an extensive and comparative

study, Pattern Recognition Letters 26 (2005), 1139{1156.

[35] F. Ford and D. Fulkerson, A simplex algorithm nding maximal networks

ows and an application

to the hitchock problem, Rand Report Rand Corporation ,Santa Monica (1955).

[36] , Flows in networks, Princeton University Press, 1962.

[37] D. Freedman and P. Drineas, Energy minimization via graph cuts: Settling what is possible, D.

Freedman and P. Drineas. Energy minimization via graph cuts: Settling what is possible. In Proc.

IEEE Conf. Com (b) (c) (2005), 939{946.

[38] S. Gaubert, Two lectures on max-plus algebra, In Proceedings of the 26th Spring School on Theoretical

Computer Science and Automatic Control, Noirmoutier (1998).

[39] S. Gaubert and Max Plus, Methods and applications of (MAX, +) linear algebra, Symposium on

Theoretical Aspects of Computer Science (1997), 261{282.

[40] S. Geman and D. Geman, Stochastic relaxation, gibbs distributions, and the bayesian restoration of

images, IEEE Transactions on Pattern Analysis and Machine Intelligence 6 (1984), no. 6, 721{741.

[41] B. Glocker, N. Komodakis, N. Paragios, G. Tziritas, and N. Navab, Inter and intra-modal de-

formable registration: Continuous deformations meet e cient optimal linear programming., Proceedings

of the 20th International Conference on Information Processing in Medical Imaging. (2008).

[42] A. Goldberg and R.Tarjan, A new approach to the maximum-

ow problem, vol. 35(4), 1988, pp. 921{

940.

[43] M. Gondran and M. Minoux, Graphes et algorithmes, Eyrolles, 1995.

[44] L. Grady, Computing exact discrete minimal surfaces: Extending and solving the shortest path

problem in 3d with application to segmentation, Proceedings of CVPR 2006 (2006), 69{78.

[45] , Random walks for image segmentation, IEEE Transactions on Pattern Analysis and Machine

Intelligence 28 (2006), no. 11, 1768{1783.

[46] L. Grady and E.L. Schwartz, Isoperimetric partitioning: A new algorithm for graph partitioning,

SIAM Journal on Scienti c Computing 27 (2006), no. 6, 1844{1866.

[47] L. Grady and A. K. Sinop, A seeded image segmentation framework unifying graph cuts and random

walker which yields a new algorithm, Proceedings of the 11th International Conference on Computer

Vision, Rio de Janeiro, Brazil (2007).

[48] D.M. Greig, B.T. Porteous, and A.H. Seheult., Exact maximum a posteriori estimation for binary

images, Royal Journal of Statistics, Soc. B 51(2) (1989), 271{279.

[49] O. Grygorash, Y. Zhou, and Z. Jorgensen, Minimum spanning tree based clustering algorithms, Proceedings

of the 18th IEEE International Conference on Tools with Arti cial Intelligence (ICTAI'06)

(2006), 73{81.

[50] Y. Hame, Liver tumor segmentation using implicit surface evolution., Workshop on 3D Segmentation

in the Clinic: A Grand Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New

York, USA. (2008).

[51] W.R. Hamilton, Account of the icosian game, Proceedings of the Royal Irish Academy 6, 415{416.

[52] J.M. Hammersley and P. Cli ord, Markov eld on nite graphs and lattices, Unpublished.

[53] T.C. Hu, The maximum capacity route problem, Journal of Operations Research 9 (1961), no. 2,

898{900.

[54] H. Ishikawa, Exact optimization for markov random elds with convex priors, IEEE Transactions

on Pattern Analysis and Machine Intelligence 25 (2003), no. 10, 1333{1336.

[55] E. Ising, Beitrag zur theorie des ferromagnetismus, Z. Physik 31 (1925), 235{258.

[56] T.N. Janakiraman, Image segmentation based on minimal spanning tree and cycles, Proceedings of

the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA

2007) 3 (2007), 215{219.

[57] I.H. Jermyn and H. Ishikawa, Globally optimal regions and boundaries as minimum ratio cycles,

IEEE Transactions on Pattern Analysis and Machine Intelligence 23 (2001), 1075{1088.

[58] D. Karger, P. Klein, C. Stein, M. Thorup, and N. Young, Rounding algorithms for a geometric

embedding of minimum multiway cut., STOC'99 (1999), 668{678.

[59] M. Kass, A. Witkin, and D. Terzopoulos, Snakes : Active contour models, International Journal of

Computer Vision 1(4) (1988), 321{331.

[60] R. Kindermann and J.L. Snell, Markov random elds and their applications, American Mathematical

Society, Providence, R.I (1980).

[61] V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts?, IEEE

Transactions on Pattern Analysis and Machine Intelligence 26 (2004), 147{159.

[62] B. Korte and J. Vygen, Combinatorial optimization. theory and algorithms, Springer, 2005.

[63] A. H. Land and A. G. Doig, An automatic method for solving discrete programming problems.,

Econometrica. 28 (1960), 497{520.

[64] Y. Li, S. Hara, and K. Shimura, A machine learning approach for locating boundaries of liver

tumors in ct images, Proceedings of the 18th International Conference on Pattern Recognition

(2006), 400{403.

[65] Y. Li, J. Sun, C. Tang, and H. Shum, Lazy snapping, SIGGRAPH 2004, ACM Transaction on

Graphics 23 (2004), 303{308.

[66] R. Lotufo and A. Falcao, The ordered queue and the optimality of the watershed approaches, Proceedings

of the International Symposium on Mathematical Morphology 2000, Palo Alto, CA, Jun

2000. (2000), 341{350.

[67] R. Lu, P. Marziliano, and C.H. Thng, Liver tumor volume estimation by semi-automatic segmen-

tation method, Proceedings of the 2005 IEEE Engineering in Medicine and Biology 27th Annual

Conference Shanghai, China, September 1-4. (2005), 3297{3299.

[68] B. Marcotegui, P. Correia, F. Marqu es, R. Mech, R. Rosa, M. Wollborn, and F. Zanoguera, A video

object generator tool allowing friendly user interaction, IEEE International Conference on Image

Processing (Kobe, Japan), October 1999.

[69] C.E. Mathieu and I.E. Magnin, On the choice of the rst level on graph pyramids, Journal of

Mathematical Imaging and Vision. 6 (1996), 85{96.

[70] J. McQueen, Some methods for classi cation and analysis of multivariate observations, In Proceedings

of the Fifth Berkeley Symposium on Mathematical Statistics and Probability 1 (1967),

281{297.

[71] F. Meyer, Minimal spanning forests for morphological segmentation, ISMM'94, Mathematical Morphology

and its applications to Signal Processing (1994), 77{84.

[72] , Topographic distance and watershed lines., Signal Processing 38 (1994), 113{125.

[73] , Grey-weighted, ultrametric and lexicographical distances, Computational Imaging and Vision,

Mathematical Morphology: 40 Years On. Proceedings of the 7th International Symposium on

Mathematical Morphology, vol. 30, 2005, pp. 289{298.

[74] F. Meyer and S. Beucher, Morphological segmentation, Journal of Visual Communication and Image

Representation 1 (1990), no. 1, 21{46.

[75] , The morphological approach to segmentation: the watershed transformation, Mathematical

Morphology in Image Processing (E.R. Dougherty, ed.), 1993, pp. 433{481.

[76] F. Meyer and C. Vachier, Image segmentation based on viscous

ooding simulation, Proceedings of

The 6th International Symposium on Mathematical Morphology, Sydney, Australia (2002), 69{77.

[77] M. Mohri, Semiring frameworks and algorithms for shortest-distance problems, Journal of Automata,

Languages and Combinatorics 7, 321{350.

[78] J. Moltz, L. Bornemann, V. Dicken, and H. Peitgen, Segmentation of liver metastases in ct scans

by adaptive thresholding and morphological processing, Workshop on 3D Segmentation in the Clinic:

A Grand Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New York, USA. (2008).

[79] E.N. Mortensen and W.A. Barrett, Interactive segmentation with intelligent scissors, Graphical

Models and Image Processing 60 (1998), no. 5, 349{384.

[80] L. Najman and M. Schmitt, Watershed of a continuous function, Signal Processing 38 (1994),

99{112.

[81] S. Osher and R. Fedkiw, Level set methods and dynamic implicit surfaces, Springer.

[82] M. Pard as, Segmentaci on morfol ogica de secuencias de im agenes: Aplicaci on a la codi caci on, PhD

thesis, Universitat Politcnica de Catalunya, Barcelona, Spain. (1995).

[83] T. Popa, L. Ibanez, E. Levy, A. White, J. Bruno, and K. Cleary, Tumor volume measurement

and volume measurement comparison plug-ins for volview using itk, Proceedings of the SPIE : The

International Society for Optical Engineering 6141 (2006), 395{402.

[84] F.A. Potra and S.J. Wright, Interior-point methods, Journal of Computational and Applied Mathematics

(2000), 281{302.

[85] F. Preteux, On a distance function approach for gray-level mathematical morphology, In Mathematical

Morphology in Image Processing, E. R. Dougherty, Ed. Marcel Dekker, New York 10 (1993),

323{349.

[86] Y. Qi, W. Xiong, W. Leow, Q. Tian, J. Zhou, and J. Liu, Semi-automatic segmentation of liver

tumors from ct scans using bayesian rule-based 3d region growing, Workshop on 3D Segmentation

in the Clinic: A Grand Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New York,

USA. (2008).

[87] J.B.T.M. Roerdink and A. Meijster, The watershed transform: De nitions, algorithms and paral-

lelization strategies, Fundamenta Informatica 41 (2001), 187{228.

[88] P. Salembier and J. Serra, Flat zones ltering, connected operators and lters by reconstruction,

IEEE Transactions on Image Processing 3 (1995), no. 8, 1153{1160.

[89] G. Schmidt, G. Binnig, M. Kietzmann, and J. Kim, Cognition network technology for a fully au-

tomated 3d segmentation of liver tumors, Workshop on 3D Segmentation in the Clinic: A Grand

Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New York, USA. (2008).

[90] J. Serra, Image analysis and mathematical morphology - volume i, Academic Press, 1982.

[91] J.A. Sethian, Level set methods and fast marching methods, Cambridge University Press.

[92] J. Shi, S. Belongie, T. Leung, and J. Malik, Image and video segmentation: The normalized cut

framework, IEEE Int'l Conf on Image Processing, Chicago, Illinois (1998), 943{947.

[93] A. Shimizu, T. Narihira, D. Furukawa, H. Kobatake, S. Nawano, and K. Shinozaki, Ensemble

segmentation using adaboost with application to liver lesion extraction from a ct volume, Workshop

on 3D Segmentation in the Clinic: A Grand Challenge II. Liver Tumor Segmentation Challenge.

MICCAI, New York, USA. (2008).

[94] D. Smeets, B. Stijnen, D. Loeckx, B. De Dobbelaer, and P. Suetens, Segmentation of liver metastases

using a level set method with spiral-scanning technique and supervised fuzzy pixel classi cation.,

Workshop on 3D Segmentation in the Clinic: A Grand Challenge II. Liver Tumor Segmentation

Challenge. MICCAI, New York, USA. (2008).

[95] T.S. S rensen, G.F. Greil, O.K. Hansen, and J. Mosegaard, Surgical simulation - a new tool to

evaluate surgical incisions in congenital heart disease?, Interactive Cardiovascular and Thoracic

Surgery 5 (2006), 536{539.

[96] T.S. S rensen, J. Stawiaski, and J. Mosegaard, Virtual open heart surgery: Obtaining models suit-

able for surgical simulation, Proceedings of Medicine Meets Virtual Reality 15. Stud Health Technol

Inform. 2007;125:445-7 (2007).

[97] S.Sarkar and P. Soundararajan, Supervised learning of large perceptual organization: Graph spectral

partitioning and learning automata, IEEE Transactions on Pattern Analysis and Machine Intelligence

22 (2000), 504{525.

[98] J. Stawiaski, F. Bidault, E. Decenci ere, T. Girinsky, C. Le Pchoux, I. Ferreira, F. Dhermain,

F. Meyer, J. Bourhis, and R. Sigal, Analyse dimages ct 4d : Application a la segmentation des

poumons., Journ ee fran caise de Radiologie, Paris La D efense. (2007).

[99] J. Stawiaski, F. Bidault, E. Decenci ere, T. Girinsky, C. Le P echoux, I. Ferreira, F. Dhermain,

F. Meyer, J. Bourhis, and R. Sigal, Segmentation interactive dimages m edicales par hi erarchie de

partitions, apport des marqueurs, Journ ee fran caise de Radiologie, Paris La D efense. (2006).

[100] J. Stawiaski and E. Decenci ere, Computing approximate geodesics and minimal surfaces using wa-

tershed and graph-cuts, Proceedings of the The 8th International Symposium on Mathematical

Morphology, Rio de Janeiro, Brazil 1 (2007), 349{360.

[101] , Combining graph-cuts and morphological segmentation, Image Analysis and Stereolgy 27

(2008), no. 1, 39{46.

[102] J. Stawiaski, E. Decenci ere, and F. Bidault, Interactive liver tumor segmentation using graph cuts

and watershed, Workshop on 3D Segmentation in the Clinic: A Grand Challenge II. Liver Tumor

Segmentation Challenge. MICCAI, New York, USA. (2008).

[103] J. Stawiaski, E. Decenci ere, and F. Bidault., Spatio-temporal segmentation of 4d ct images., The

European Consortium For Mathematics In Industry 2008, London, England. (2008).

[104] J. Stawiaski, E. Decenci ere, and D. Jeulin, Interactive segmentation of microstructures, Workshop

on 3D image analysis and modelling of microstructures, ITWM Fraunhofer, Kaiserslautern (2007).

[105] , Segmentation semi-automatique dimages 3d de microtomographie, Journ ees Annuelles de

la Soci et e Fran caise de M etallurgie et de Mat eriaux. (2007).

[106] J. Stawiaski, J. Mosegaard, and T.S. S rensen, Virtual open heart surgery: Segmentation, Proceedings

of Medicine Meets Virtual Reality 15. Stud Health Technol Inform. 125:448-50 (2007).

[107] J. Stawiaski, T.S. S rensen, E. Decenci ere, and F. Bidault, Combining morphological and graph

based methods for multi-label segmentation, Workshop on interaction in medical image analysis and

visualisation, MICCAI 2007, Brisbane, Australia (2007).

[108] J.J. Sylvester, Chemistry and algebra, Nature 17 (1878), 284.

[109] Y. Taieb, O. Eliassaf, M. Freiman, L. Joskowicz, and J. Sosna, An iterative bayesian approach for

liver analysis: tumors validation study., Workshop on 3D Segmentation in the Clinic: A Grand

Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New York, USA. (2008).

[110] K. Tsuda and G. Ratsch, Image reconstruction by linear programming, IEEE transactions on image

processing. 14 (2005), 737{744.

[111] P. Tylsky, G. Bonniaud, E. Decenci ere, J. Stawiaski, D. Lefkopoulos, and M. Ricard, FDG PET

images segmentation using morphological watershed: a phantom study, IEEE Nuclear Science Symposium

and Medical Imaging Conference (San Diego (CA), USA), October 2006.

[112] O. Veksler, Image segmentation by nested cuts, IEEE Conf. Computer Vision and Pattern Recognition

1 (2000), 339{344.

[113] L. Vincent, Algorithmes morphologiques a base de les d'attente et de lacets. extension aux graphes.,

Ph.D. thesis, Ecole des Mines de Paris, Paris, May 1990.

[114] W.E.Lorensen and H.E. Cline, Marching cubes: A high resolution 3d surface construction algorithm,

Computer Graphics (Proceedings of SIGGRAPH '87) 21 (1987), 163{169.

[115] D. Wong, J. Liu, F. Yin, Q. Tian, W. Xiong, and J. Zhou, A semi-automated method for liver

tumor segmentation based on 2d region growing., Workshop on 3D Segmentation in the Clinic: A

Grand Challenge II. Liver Tumor Segmentation Challenge. MICCAI, New York, USA. (2008).

[116] Z. Wu and R. Leahy, An optimal graph theoretic approach to data clustering : theory and its appli-

cations to image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence

15 (1993), no. 11, 1101{1113.

[117] F. Zanoguera, B. Marcotegui, and F. Meyer, A tool-box for interactive image segmentation based

on nested partitions, IEEE International Conference on Image Processing (Kobe, Japan), October

1999.

[118] , A segmentation pyramid for the interactive segmentation of 3-d images and video sequences,

Mathematical Morphology and its Applications to Image Processing, Proc. ISMM'00 (Palo Alto,

California), Kluwer Ac. Publ., Nld, June 2000, pp. 263{272.

[119] J. Zhou, W. Xiong, Q. Tian, Y. Qi, J. Liu, and W. Leow, Semi-automatic segmentation of 3d

liver tumors from ct scans using voxel classi cation and propagational learning, Workshop on 3D

Segmentation in the Clinic: A Grand Challenge II. Liver Tumor Segmentation Challenge. MICCAI,

New York, USA. (2008).

Statistiques de consultation

Repository Staff Only: edit this item