Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computer Vision and Pattern Recognition

arXiv:1504.01052 (cs)
[Submitted on 4 Apr 2015]

Title:Fast algorithms for morphological operations using run-length encoded binary images

Authors:Gregor Ehrensperger, Alexander Ostermann, Felix Schwitzer
View PDF
Abstract:This paper presents innovative algorithms to efficiently compute erosions and dilations of run-length encoded (RLE) binary images with arbitrary shaped structuring elements. An RLE image is given by a set of runs, where a run is a horizontal concatenation of foreground pixels. The proposed algorithms extract the skeleton of the structuring element and build distance tables of the input image, which are storing the distance to the next background pixel on the left and right hand sides. This information is then used to speed up the calculations of the erosion and dilation operator by enabling the use of techniques which allow to skip the analysis of certain pixels whenever a hit or miss occurs. Additionally the input image gets trimmed during the preprocessing steps on the base of two primitive criteria. Experimental results show the advantages over other algorithms. The source code of our algorithms is available in C++.
Comments: 17 pages, 2 figures. Submitted to Elsevier (Pattern Recognition). For the associated source code, see this https URL
Subjects: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR); Information Theory (cs.IT)
MSC classes: 94A08 (Primary) 65D18, 65D19, 68U10, 94A12 (Secondary)
ACM classes: I.4.3; I.5; I.4.10
Cite as: arXiv:1504.01052 [cs.CV]
  (or arXiv:1504.01052v1 [cs.CV] for this version)
  https://doi.org/10.48550/arXiv.1504.01052

Submission history

From: Gregor Ehrensperger [view email]
[v1] Sat, 4 Apr 2015 20:51:43 UTC (1,759 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.CV
< prev   |   next >
new | recent | 2015-04
Change to browse by:
cs
cs.GR
cs.IT
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Gregor Ehrensperger
Alexander Ostermann
Felix Schwitzer
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)