Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
A fast recursive shortest spanning tree for image segmentation and edge detection
60
Zitationen
2
Autoren
1997
Jahr
Abstract
This correspondence presents a fast recursive shortest spanning tree algorithm for image segmentation and edge detection. The conventional algorithm requires a complexity of o(n(2)) for an image of n pixels, while the complexity of our approach is bounded by O(n), which is a new lower bound for algorithms of this kind. The total memory requirement of our fast algorithm is 20% smaller.
Ähnliche Arbeiten
Use of the Hough transformation to detect lines and curves in pictures
1972 · 6.521 Zit.
Efficient Graph-Based Image Segmentation
2004 · 6.190 Zit.
Statistical and structural approaches to texture
1979 · 5.739 Zit.
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
1991 · 5.564 Zit.
The quickhull algorithm for convex hulls
1996 · 5.316 Zit.