Optimal Net Surface Problems with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Coronary Lumen Segmentation Using Graph Cuts and Robust Kernel Regression
IPMI '09 Proceedings of the 21st International Conference on Information Processing in Medical Imaging
Graph search with appearance and shape information for 3-D prostate and bladder segmentation
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
Globally optimal tumor segmentation in PET-CT images: a graph-based co-segmentation method
IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
Globally optimal tumor segmentation in PET-CT images: a graph-based co-segmentation method
IPMI'11 Proceedings of the 22nd international conference on Information processing in medical imaging
Hi-index | 0.01 |
Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target objects of arbitrary shape mutually interact with terrain-like surfaces, which widely exists in the medical imaging field. The approach incorporates context information used during simultaneous segmentation of multiple objects. The object-surface interaction information is encoded by adding weighted inter-graph arcs to our graph model. A globally optimal solution is achieved by solving a single maximum flow problem in a low-order polynomial time. The performance of the method was evaluated in robust delineation of lung tumors in megavoltage cone-beam CT images in comparison with an expert-defined independent standard. The evaluation showed that our method generated highly accurate tumor segmentations. Compared with the conventional graph-cut method, our new approach provided significantly better results (p