An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Interactive Graph Cut Based Segmentation with Shape Priors
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Level Set Based Shape Prior Segmentation
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
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
Shape-Driven Segmentation of the Arterial Wall in Intravascular Ultrasound Images
IEEE Transactions on Information Technology in Biomedicine
Hi-index | 0.00 |
We present a shape prior based graph cut method which does not require user initialisation. The shape prior is generalised from multiple training shapes, rather than using singular templates as priors. Weighted directed graph construction is used to impose geometrical and smooth constraints learned from priors. The proposed cost function is built upon combining selective feature extractors. A SVM classifier is used to determine an optimal combination of features in presence of calcification, fibrotic tissues, soft plaques, and metallic stent, each of which has its own characteristics in ultrasound images. Comparative analysis on manually labelled ground-truth shows superior performance of the proposed method compared to conventional graph cut methods.