<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors></contributors><titles><title><style face="normal" font="default" size="100%">Fuzzy-connected 3D image segmentation at interactive speeds</style></title><secondary-title><style face="normal" font="default" size="100%">GRAPHICAL MODELS</style></secondary-title><short-title><style face="normal" font="default" size="100%">GRAPH MODELS</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">64</style></volume><pages><style face="normal" font="default" size="100%">259 - 281</style></pages><isbn><style face="normal" font="default" size="100%">1524-0703</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Image segmentation techniques using fuzzy connectednessprinciples hake shown their effectiveness in segmenting a 
variety of objects in several large applications in recent 
years. However, one problem with these algorithms has been their 
excessive computational requirements. In an attempt to 
substantially speed them up. in the present paper, we study 
systematically a host of 18 'optimal' graph search algorithms. 
Extensive testing of these algorithms on a variety of 3D medical 
images taken from large ongoing applications demonstrates that a 
20 1000-fold improvement over current speeds is achievable with 
a combination of algorithms and last modern PCs. Utilizing 
efficient algorithms and careful selection of implementations 
can speed up the computation of fuzzy connectedness values by a 
factor of 16 29 (on the same hardware), as compared to the 
implementation previously used in our applications utilizing 
fuzzy object segmentation. The optimality of an algorithm 
depends on the input data as well as on the choice of the fuzzy 
affinity relation. The running time is reduced considerably (by 
a factor up to 34 for brain MR and even more for bone CT), when 
the algorithms make use of predetermined thresholds for the 
fuzz), objects. The reliable recognition (assisted by human 
operators) and the accurate, efficient. and sophisticated 
delineation (automatically performed by the computer) can be 
effectively incorporated into a single interactive process. If 
images having intensities kith tissue-Specific meaning (such Lis 
CT or standardized MR images) are utilized. most of the 
parameters for the segmentation method can be fixed once for 
all. all, intermediate data (feature and fuzzy affinity values 
for the hole scene) can be computed before the user interaction 
is needed and the user can be provided kith more information at 
the little of interaction.
</style></abstract><issue><style face="normal" font="default" size="100%">5</style></issue><notes><style face="normal" font="default" size="100%">UT: 000182188800001ScopusID: 0038708574doi: 10.1016/S1077-3169(02)00005-9</style></notes></record></records></xml>