The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Intelligent scissors for image composition
Open accessAbstract
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.Live-wire boundary detection formulates discrete dynamic programming (DP) as a two-dimensional graph searching problem.DP provides mathematically optimal boundaries while greatly reducing sensitivity to local noise or other intervening structures.Robustness is further enhanced with on-the-fly training which causes the boundary to adhere to the specific type of edge currently being followed, rather than simply the strongest edge in the neighborhood.Boundary cooling automatically freezes unchanging segments and automates input of additional seed points.Cooling also allows the user to be much more free with the gesture path, thereby increasing the efficiency and finesse with which boundaries can be extracted.Extracted objects can be scaled, rotated, and composited using live-wire masks and spatial frequency equivalencing.Frequency equivalencing is performed by applying a Butterworth filter which matches the lowest frequency spectra to all other image components.Intelligent Scissors allow creation of convincing compositions from existing images while dramatically increasing the speed and precision with which objects can be extracted.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Marr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“This paper utilizes an optimal graph search similar to that presented by Dijkstra [6] and extended by Nilsson [13]; further, this technique builds on and extends previous boundary tracking methods in 4 important ways:”
MethodFreimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Stoer, J. (1999) · Springer-Lehrbuch · doi:10.1007/978-3-662-09021-3 · Cited by 2,059
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
A Note on Two Problems in Connexion with Graphs
Dijkstra, E. W. (2022) · Edsger Wybe Dijkstra · doi:10.1145/3544585.3544600 · Cited by 1,353
A Fast algorithm for active contours and curvature estimation
Williams, D. J., & Shah, M. (1992) · CVGIP: Image Understanding · doi:10.1016/1049-9660(92)90003-l · Cited by 1,101
Using dynamic programming for solving variational problems in vision
Amini, A. A., Weymouth, T. E., & Jain, R. C. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57681 · Cited by 1,008
Principles of artificial intelligence
McDermott, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90026-0 · Cited by 814
On the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
An application of heuristic search methods to edge and contour detection
Martelli, A. (1976) · Communications of the ACM · doi:10.1145/359997.360004 · Cited by 258
Adaptive boundary detection using 'live-wire' two-dimensional dynamic programming
Mortensen, E. N., Morse, B., Barrett, W. A., & Udupa, J. K. (2003) · Computers in cardiology · doi:10.1109/cic.1992.269378 · Cited by 120
Self-citationA decision function method for boundary detection
Chien, Y. P., & Fu, K. S. (1974) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(74)80003-1 · Cited by 34
Cited by
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
Modeling and rendering architecture from photographs: a hybrid geometry- and image-based approach
Debevec, P. E., Taylor, C. J., & Malik, J. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237191 · Cited by 1,905
Graphcut textures: image and video synthesis using graph cuts
Kwatra, V., Schödl, A., Essa, I., Turk, G., & Bobick, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882264 · Cited by 1,216
Li, Y., Sun, J., Tang, C.-K., & Shum, H.-Y. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015719 · Cited by 1,097
"GrabCut": interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015720 · Cited by 935
Metadata
- Authors
- Mortensen, E. N., & Barrett, W. A.
- Venue
- Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 191-198
- OpenAlex
- W2083277843
- Cited by
- 778
- References
- 17
- FWCI
- 12.67
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.