An efficient union-find algorithm for extracting the connected components of a large-sized image (2004)
by
Robert Strandh
,
Robert Str
,
Jacques-Oliver Lapeyre
,
Jacques-olivier Lapeyre
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Strandh04anefficient,
author = {Robert Strandh and Robert Str and Jacques-Oliver Lapeyre and Jacques-olivier Lapeyre},
title = {An efficient union-find algorithm for extracting the connected components of a large-sized image},
year = {2004}
}
author = {Robert Strandh and Robert Str and Jacques-Oliver Lapeyre and Jacques-olivier Lapeyre},
title = {An efficient union-find algorithm for extracting the connected components of a large-sized image},
year = {2004}
}
Bookmarks
OpenURL
Abstract:
Some simple algorithms exist for extracting the connected components of a binary or multiplevalued image. These algorithms are usually rather fast, even though they imply several passes over the image data, pixel by pixel processing, or multiple access to the same pixel during one pass. We discuss a new such algorithm, simple as well, that is faster, especially for large document images.
Citations
| 7 | Document image compression and analysis – Kia - 1997 |
| 2 | Fast connected components on images. http://web.media.mit.edu/~ rahimi/connected – Rahimi - 2001 |
