ML Anthology

Parallel Memory Systems for Image Processing

Kichul Kim, V. K. Prasanna Kumar
CVPR 1989 pp. 654-659
doi:10.1109/CVPR.1989.37915 /cvpr/1989/kim1989cvpr-parallel/

Abstract

A novel memory system is proposed for image processing. Latin squares, which are well known combinatorial objects, are used as the skew function of the memory system. A Latin square with desired properties for image-array access is introduced. The resulting memory system provides access to various subsets of image data (rows, columns, diagonals, main subsquares, etc.) without memory conflict. The memory modules are fully utilized for most frequently used subsets of image data. The address generation can be performed in constant time. This memory system achieves constant-time access to rows, columns, diagonals, and subarrays using a minimum number of memory modules.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

CVPR Semantic Scholar

Cite

Text

Kim and Kumar. "Parallel Memory Systems for Image Processing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1989. doi:10.1109/CVPR.1989.37915

Markdown

[Kim and Kumar. "Parallel Memory Systems for Image Processing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1989.](https://mlanthology.org/cvpr/1989/kim1989cvpr-parallel/) doi:10.1109/CVPR.1989.37915

BibTeX

@inproceedings{kim1989cvpr-parallel,
  title     = {{Parallel Memory Systems for Image Processing}},
  author    = {Kim, Kichul and Kumar, V. K. Prasanna},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1989},
  pages     = {654-659},
  doi       = {10.1109/CVPR.1989.37915},
  url       = {https://mlanthology.org/cvpr/1989/kim1989cvpr-parallel/}
}