A NEW MINIMUM-VARIANCE REGION GROWING ALGORITHM FOR IMAGE SEGMENTATION

Authors
Citation
C. Revol et M. Jourlin, A NEW MINIMUM-VARIANCE REGION GROWING ALGORITHM FOR IMAGE SEGMENTATION, Pattern recognition letters, 18(3), 1997, pp. 249-258
Citations number
13
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence
Journal title
ISSN journal
01678655
Volume
18
Issue
3
Year of publication
1997
Pages
249 - 258
Database
ISI
SICI code
0167-8655(1997)18:3<249:ANMRGA>2.0.ZU;2-W
Abstract
Region growing is a very useful technique for image segmentation. Its efficiency mainly depends on its aggregation criterion. In the present paper, a new algorithm is proposed with a homogeneity criterion based on an adequate tuning between spatial neighbourhood and histogram nei ghbourhood. It differs from other techniques by reconsidering the pixe l (or voxel) assignments on each step by a process which minimizes var iance through special dilations. Thus, the region created by an initia l seed can be non-connected and possibly does not contain this seed. E xamples are given in dental surgery for 2D X-Ray images (and their ass ociated 3D block) and for 3D images acquired by the Morphometre, the n ew 3D scanner constructed by GEMSE (General Electric Medical Systems). (C) 1997 Published by Elsevier Science B.V.