A Small-Space Algorithm for Removing Small Connected Components from a Binary Image
- 1 January 2013
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E96.A (6), 1044-1050
- https://doi.org/10.1587/transfun.e96.a.1044
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Small Work Space Algorithms for Some Basic Problems on Binary ImagesLecture Notes in Computer Science, 2012
- A New Framework for Connected Components Labeling of Binary ImagesLecture Notes in Computer Science, 2012
- In-place Algorithm for Erasing a Connected Component in a Binary ImageTheory of Computing Systems, 2011
- In-Place Linear-Time Algorithms for Euclidean Distance TransformLecture Notes in Computer Science, 2010
- Do We Need a Stack to Erase a Component in a Binary Image?Lecture Notes in Computer Science, 2010
- In-Place Algorithm for Connected Components LabelingJournal of Pattern Recognition Research, 2010
- Some theoretical challenges in digital geometry: A perspectiveDiscrete Applied Mathematics, 2009
- Constant-Working-Space Algorithms for Image ProcessingLecture Notes in Computer Science, 2009
- A linear-time component-labeling algorithm using contour tracing techniqueComputer Vision and Image Understanding, 2004
- Connected component labeling for binary images on a reconfigurable mesh architectureJournal of Systems Architecture, 1996