Determination of maximally stable extremal regions in large images

Authors:
J. Wassenberg;D. Bulatov;W. Middelmann;P. Sanders
Affiliations:
FGAN-FOM, Ettlingen, Germany;FGAN-FOM, Ettlingen, Germany;FGAN-FOM, Ettlingen, Germany;Institute for Theoretical Computer Science, KIT, Karlsruhe, Germany
Venue:
SPPRA '08 Proceedings of the Fifth IASTED International Conference on Signal Processing, Pattern Recognition and Applications
Year:
2008

Citing 4
Cited 1

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
A potential-based amortized analysis of the union-find data structure

ACM SIGACT News
Multiple view geometry in computer vision

Multiple view geometry in computer vision
3D Reconstruction by Gluing Pair-Wise Euclidean Reconstructions, or "How to Achieve a Good Reconstruction from Bad Images"

3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)

Experiments on union-find algorithms for the disjoint-set data structure

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coping with ever-increasing data requires efficient algorithms. The topic of this work is segmentation; we present a new means of computing Maximally Stable Extremal Regions that exhibits both high performance and low memory use and is thus able to process large scenes. An efficient data structure and improved variant of the Union-Find algorithm make possible a software implementation that is competitive with an FPGA. After laying out the motivation and algorithm details, we derive a bound on the complexity and compare performance with that of other implementations. The topic is concluded with discussion of applications and future work.