Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Efficient Data Handling for Transform Encoding and Decoding of Images

IP.com Disclosure Number: IPCOM000108191D
Original Publication Date: 1992-Apr-01
Included in the Prior Art Database: 2005-Mar-22
Document File: 1 page(s) / 34K

Publishing Venue

IBM

Related People

Linzer, E: AUTHOR

Abstract

An algorithm is disclosed that efficiently manipulates data for transform encoding or decoding of images. The algorithm is useful when the transform is done in a row-column fashion and the machine used is more efficient at repeatedly computing the same row or column transform than at computing different rows or columns consecutively.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 91% of the total text.

Efficient Data Handling for Transform Encoding and Decoding of Images

      An algorithm is disclosed that efficiently manipulates data for
transform encoding or decoding of images.  The algorithm is useful
when the transform is done in a row-column fashion and the machine
used is more efficient at repeatedly computing the same row or column
transform than at computing different rows or columns consecutively.

      The algorithm computes the transform on n blocks at a time.  If
the row transforms can be implemented more efficiently when
particular row transforms are computed consecutively, then the 0th
row transform for each of the n blocks is computed, followed by the
1st row transform for each of the n blocks, etc., until all of the
row transforms on each of the n blocks have been computed.
Otherwise, all of the row transforms are computed for the first
block, then the second block, etc.  If the column transforms can be
implemented more efficiently when particular column transforms are
computed consecutively, then the 0th column transform for each of the
n blocks is computed, followed by the 1st column transform for each
of the n blocks, etc., until all of the column transforms on each of
the n blocks have been computed.  Otherwise, all of the column
transforms are computed for the first block, then the second block,
etc. The value chosen for n will depend on the memory hierarchy of
the machine; generally, it should be as large as possible without the
use of...