An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
A Machine Learning Approach for Locating Boundaries of Liver Tumors in CT Images
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 01
Spatially coherent clustering using graph cuts
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Hi-index | 0.00 |
We propose a novel approach that applies global optimal tree-metrics graph cuts algorithm on multi-phase contrast enhanced contrast enhanced MRI for liver tumor segmentation. To address the difficulties caused by low contrasted boundaries and high variability in liver tumor segmentation, we first extract a set of features in multi-phase contrast enhanced MRI data and use color-space mapping to reveal spatial-temporal information invisible in MRI intensity images. Then we apply efficient tree-metrics graph cut algorithm on multi-phase contrast enhanced MRI data to obtain global optimal labeling in an unsupervised framework. Finally we use tree-pruning method to reduce the number of available labels for liver tumor segmentation. Experiments on real-world clinical data show encouraging results. This approach can be applied to various medical imaging modalities and organs.