Abstract
In this paper, we consider the problem of reconstructing a high- resolution binary image from several low-resolution scans. Each of the pixels in a low-resolution scan yields the value of the sum of the pixels in a rectangular region of the high-resolution image. For any given set of such pixel sums, we derive an upper bound on the difference between a certain binary image which can be computed efficiently, and any binary image that corresponds with the given measurements. We also derive a bound on the difference between any two binary images having these pixel sums. Both bounds are evaluated experimentally for different geometrical settings, based on simulated scan data for a range of images.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Batenburg, K. J., Fortes, W., Hajdu, L., Tijdeman, R.: Bounds on the difference between reconstructions in binary tomography. In: Proc. of the 16th IAPR International Conference on Discrete Geometry for Computer Imagery, pp. 369–380 (2011)
Batenburg, K.J., Sijbers, J.: Generic iterative subset algorithms for discrete tomography. Discrete Appl. Math. 157(3), 438–451 (2009)
Ben-Israel, A., Greville, T.N.E.: Generalized inverses: Theory and applications. Canadian Math. Soc. (2002)
Björck, Å.: Numerical methods for least square problems. SIAM, Linköping University, Sweden (1996)
Frosini, A., Nivat, M.: Binary matrices under the microscope: A tomographical problem. Theoretical Computer Science 370, 201–217 (2007)
Frosini, A., Nivat, M., Rinaldi, S.: Scanning integer matrices by means of two rectangular windows. Theoretical Computer Science 406, 90–96 (2008)
Hajdu, L., Tijdeman, R.: Algebraic aspects of discrete tomography. J. Reine Angew. Math. 534, 119–128 (2001)
Li, L., Stankovic, V., Stankovic, L., Li, L., Cheng, S., Uttamchandani, D.: Single pixel optical imaging using a scanning MEMS mirror. J. Micromech. Microeng. 21, 25022 (2011)
Saad, Y.: Iterative methods for sparse linear systems. SIAM, Philadelphia (2003)
Slavinsky, J., Laska, J., Davenport, M., Baraniuk, R.: The compressive multiplexer for multi-channel compressive sensing. In: Proc. of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP) (2011)
Wakin, M., Laska, J., Duarte, M., Baron, D., Sarvotham, S., Takhar, D., Kelly, K., Baraniuk, R.: An Architecture for Compressive Imaging. In: Proceedings of the International Conference on Image Processing (ICIP), pp. 1273–1276 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fortes, W., Batenburg, K.J. (2011). Error Bounds on the Reconstruction of Binary Images from Low Resolution Scans. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds) Computer Analysis of Images and Patterns. CAIP 2011. Lecture Notes in Computer Science, vol 6854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23672-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-23672-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23671-6
Online ISBN: 978-3-642-23672-3
eBook Packages: Computer ScienceComputer Science (R0)