Paper
2 January 1998 Complexity reduction on two-dimensional convolutions for image processing
Luca Chiarabini, Jonathan Yen
Author Affiliations +
Abstract
Presented here is a method for reducing the computational complexity of two-dimensional linear convolutions used in image processing like binary image scaling. This method is a hybrid of convolving at run-time and convolving by table lookup. The convolution step in image processing usually calculates a weighted average of an area of the input image by calculating the entry-by-entry multiplication of the input pixels with a weight table. This method partitions the calculations in the convolution step and stores pre-calculated partial results in lookup tables. When the convolution step takes place, a binary indexing is used to retrieve the partial results and the final result is obtained by summing up the partial results. A line cache and a double buffering scheme are designed to reduce memory access in table lookup. Space and time complexities are analyzed and compared to the conventional two-dimensional linear convolutions. We demonstrate that an order of magnitude reduction in the computational cost can be achieved. Examples, test images and performance data are provided.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Luca Chiarabini and Jonathan Yen "Complexity reduction on two-dimensional convolutions for image processing", Proc. SPIE 3300, Color Imaging: Device-Independent Color, Color Hardcopy, and Graphic Arts III, (2 January 1998); https://doi.org/10.1117/12.298286
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Convolution

Binary data

Image processing

Image scaling

Printing

3D image processing

Quantization

RELATED CONTENT

Graph-order dithering
Proceedings of SPIE (January 16 2006)

Back to Top