Intelligent scissors for image composition
Published 1 January 1995Open access
Eric N. Mortensen, William A. Barrett
Citations791
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Intelligent Sc scissors allows objects within digital images to be extracted quickly and accurately using simple gesture motions with a mouse, and allows creation of convincing compositions from existing images while dramatically increasing the speed and precision with which objects can be extracted.
Abstract
We present a new, interactive tool called Intelligent Scissors which we use for image segmentation and composition. Fully automated segmentation is an unsolved problem, while manual tracing is inaccurate and laboriously unacceptable. However, Intelligent Scissors allow objects within digital images to be extracted quickly and accurately using simple gesture motions with a mouse. When the gestured mouse position comes in proximity to an object edge, a live-wire boundary "snaps" to, and wraps around the object of interest.
Keywords
Computer Science
International Journal of Computer VisionSnakes: Active contour models
16,951 Citations1988Michael Kass, Andrew Witkin +1 more
This work uses snakes for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest, and uses scale-space continuation to enlarge the capture region surrounding a feature.
ScienceDynamic Programming
13,088 Citations1966Richard Bellman
The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Proceedings of the Royal Society of London. Series B, Biological sciencesTheory of edge detection
6,193 Citations1980David Marr, Ellen C. Hildreth
The theory of edge detection explains several basic psychophysical findings, and the operation of forming oriented zero-crossing segments from the output of centre-surround ∇2G filters acting on the image forms the basis for a physiological model of simple cells.
Principles of Artificial Intelligence
3,336 Citations1982Nils J. Nilsson
This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Princeton University Press eBooksApplied Dynamic Programming
1,956 Citations1962Richard Bellman, Stuart E. Dreyfus
ACM eBooksA Note on Two Problems in Connexion with Graphs
1,234 Citations2022E. W. Dijkstra
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
CVGIP Image UnderstandingA Fast algorithm for active contours and curvature estimation
1,095 Citations1992Donna J. Williams, Mubarak Shah
A greedy algorithm is presented which retains the improvements of stability, flexibility, and inclusion of hard constraints introduced by dynamic programming but is more than an order of magnitude faster than that approach, being O(nm).
IEEE Transactions on Pattern Analysis and Machine IntelligenceUsing dynamic programming for solving variational problems in vision
1,003 Citations1990Amir A. Amini, Terry E. Weymouth +1 more
The optimization problem is set up as a discrete multistage decision process and is solved by a time-delayed discrete dynamic programming algorithm, and a parallel procedure for decreasing computational costs is discussed.
Communications of the ACMOn the optimal detection of curves in noisy pictures
295 Citations1971Ugo Montanari
A technique for recognizing systems of lines is presented, in which the heuristic of the problem is not embedded in the recognition algorithm but is expressed in a figure of merit, which allows for greater flexibility and adequacy in the particular problem.
Communications of the ACMAn application of heuristic search methods to edge and contour detection
257 Citations1976Alberto Martelli
Experimental results show how various information about the shape of the contour of an object can be embedded in the figure of merit, thus allowing the extraction of contours from noisy pictures and the separation of touching objects.
Adaptive boundary detection using 'live-wire' two-dimensional dynamic programming
121 Citations2003Eric N. Mortensen, B. Morse +2 more
An adaptive boundary detection algorithm that uses two-dimensional dynamic programming (DP) is presented and accurately detects the boundaries of low contrast objects, which occur with intravenous injections, as well as those found in noisy, low SNR images.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Interactive outlining: an improved approach using active contours</title>
55 Citations1993Dirk Daneels, David van Campenhout +4 more
An improved method based on energy minimizing active contours or `snakes' is used to outline objects on images in an interactive environment using a two-stage algorithm and gives the user the possibility of incremental contour tracking, thus providing feedback on the refinement process.
Computer Graphics and Image ProcessingA decision function method for boundary detection
34 Citations1974Y.P. Chien, K. S. Fu
This algorithm has been tested to locate the heart boundary on PA chest x-ray pictures and it is found that this algorithm will successfully extract theheart boundary even in very noisy backgrounds.
IEEE Transactions on Pattern Analysis and Machine IntelligenceMultiple widths yield reliable finite differences (computer vision)
33 Citations1992Margaret M. Fleck
A finite difference edge finder in which the finite difference is computed at a range of widths, i.e. arange of distances between data points, proves equally good at suppressing noise, but is better able to detect faint or blurred features.
Multiple widths yield reliable finite differences
9 Citations2002Margaret M. Fleck
It is shown, both theoretically and empirically, that this method out-performs traditional Gaussian smoothing, and chooses the narrowest response with statistically reliable sign.