Intelligent scissors for image composition
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
An application of heuristic search methods to edge and contour detection
Communications of the ACM
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM SIGGRAPH 2004 Papers
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Multiple Paths Extraction in Images Using a Constrained Expanded Trellis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Image Processing, Analysis, and Machine Vision
Image Processing, Analysis, and Machine Vision
Membrane boundary extraction using circular multiple paths
Pattern Recognition
Interactive segmentation framework of the Medical Imaging Interaction Toolkit
Computer Methods and Programs in Biomedicine
Detection of Non-convex Objects by Dynamic Programming
CAIP '09 Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns
A comparative evaluation of interactive segmentation algorithms
Pattern Recognition
Interactive image segmentation by maximal similarity based region merging
Pattern Recognition
Interactive image segmentation using probabilistic hypergraphs
Pattern Recognition
Interactive color image segmentation with linear programming
Machine Vision and Applications
Detections of Arterial Wall in Sonographic Artery Images Using Dual Dynamic Programming
IEEE Transactions on Information Technology in Biomedicine
Hi-index | 0.01 |
In this paper we present the Rack algorithm for the detection of optimal non-star-shaped contours in images. It is based on the combination of a user-driven image transformation and dynamic programming. The fundamental idea is to interactively specify and edit the general shape of the desired object by using a rack. This rack is used to model the image as a directed acyclic weighted graph that contains a path corresponding to the expected contour. In this graph, the shortest path with respect to an adequate cost function can be calculated efficiently via dynamic programming. The experimental results indicate the algorithm's ability of combining an acceptable amount of user interaction with generally good segmentation results.