Morphological Decomposition and Compression of Binary Images via a Minimum Set Cover Algorithm
- 29 May 2018
- journal article
- research article
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 61 (1) , 71-83
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A linear-time algorithm for Euclidean feature transform setsInformation Processing Letters, 2007
- Computing geometric moments using morphological erosionsPattern Recognition, 2001
- Refined moment calculation using image block representationIEEE Transactions on Image Processing, 2000
- Binary text image compression using overlapping rectangular partitioningPattern Recognition Letters, 1999
- Real-time computation of two-dimensional moments on binary images using image block representationIEEE Transactions on Image Processing, 1998
- A new computation of geometric momentsPattern Recognition, 1993
- An efficient algorithm for computation of shape moments from run-length codes or chain codesPattern Recognition, 1992
- Fast algorithm for the computation of moment invariantsPattern Recognition, 1987
- Distance transformations in digital imagesComputer Vision, Graphics, and Image Processing, 1986
- Minimal rectangular partitions of digitized blobsComputer Vision, Graphics, and Image Processing, 1984