Fast DCT-domain image shifting and merging

Timothy J. Trenary; Charles A. Micchelli; J. Q. Trelewicz; Marco Martens; Joan L. Mitchell

doi:10.1109/acssc.2001.987675

Fast DCT-domain image shifting and merging

Timothy J. Trenary
, Charles A. Micchelli
, J. Q. Trelewicz
, Marco Martens
, Joan L. Mitchell

Mathematics

IBM

Research output: Contribution to journal › Conference article › peer-review

Abstract

In high-speed color image processing applications, it is desired to manipulate DCT-domain images in real time. Because of throughput requirements, operations required for the building of a printer page, such as merging and shifting, cannot be performed in the sampled domain - the overhead associated with the DCT slows computation. In this paper we present an efficient method for the merging or shifting of JPEG-compressed images, performed in the DCT domain to avoid additional overhead. The algorithm exploits quantization to achieve further gains. The resulting algorithm can save between 25% and 75% of the required operation cycles in a typical image processing system.

Original language	English
Pages (from-to)	1166-1170
Number of pages	5
Journal	Conference Record of the Asilomar Conference on Signals, Systems and Computers
Volume	2
DOIs	https://doi.org/10.1109/acssc.2001.987675
State	Published - 2001
Event	35th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States Duration: Nov 4 2001 → Nov 7 2001

Access to Document

10.1109/acssc.2001.987675

Cite this

@article{5356ec94225149a6b0c1c1c646694b22,

title = "Fast DCT-domain image shifting and merging",

abstract = "In high-speed color image processing applications, it is desired to manipulate DCT-domain images in real time. Because of throughput requirements, operations required for the building of a printer page, such as merging and shifting, cannot be performed in the sampled domain - the overhead associated with the DCT slows computation. In this paper we present an efficient method for the merging or shifting of JPEG-compressed images, performed in the DCT domain to avoid additional overhead. The algorithm exploits quantization to achieve further gains. The resulting algorithm can save between 25\% and 75\% of the required operation cycles in a typical image processing system.",

author = "Trenary, \{Timothy J.\} and Micchelli, \{Charles A.\} and Trelewicz, \{J. Q.\} and Marco Martens and Mitchell, \{Joan L.\}",

year = "2001",

doi = "10.1109/acssc.2001.987675",

language = "English",

volume = "2",

pages = "1166--1170",

journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",

issn = "1058-6393",

note = "35th Asilomar Conference on Signals, Systems and Computers ; Conference date: 04-11-2001 Through 07-11-2001",

}

TY - JOUR

T1 - Fast DCT-domain image shifting and merging

AU - Trenary, Timothy J.

AU - Micchelli, Charles A.

AU - Trelewicz, J. Q.

AU - Martens, Marco

AU - Mitchell, Joan L.

PY - 2001

Y1 - 2001

N2 - In high-speed color image processing applications, it is desired to manipulate DCT-domain images in real time. Because of throughput requirements, operations required for the building of a printer page, such as merging and shifting, cannot be performed in the sampled domain - the overhead associated with the DCT slows computation. In this paper we present an efficient method for the merging or shifting of JPEG-compressed images, performed in the DCT domain to avoid additional overhead. The algorithm exploits quantization to achieve further gains. The resulting algorithm can save between 25% and 75% of the required operation cycles in a typical image processing system.

AB - In high-speed color image processing applications, it is desired to manipulate DCT-domain images in real time. Because of throughput requirements, operations required for the building of a printer page, such as merging and shifting, cannot be performed in the sampled domain - the overhead associated with the DCT slows computation. In this paper we present an efficient method for the merging or shifting of JPEG-compressed images, performed in the DCT domain to avoid additional overhead. The algorithm exploits quantization to achieve further gains. The resulting algorithm can save between 25% and 75% of the required operation cycles in a typical image processing system.

UR - https://www.scopus.com/pages/publications/0035575325

U2 - 10.1109/acssc.2001.987675

DO - 10.1109/acssc.2001.987675

M3 - Conference article

AN - SCOPUS:0035575325

SN - 1058-6393

VL - 2

SP - 1166

EP - 1170

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

T2 - 35th Asilomar Conference on Signals, Systems and Computers

Y2 - 4 November 2001 through 7 November 2001

ER -

Fast DCT-domain image shifting and merging

Abstract

Access to Document

Other files and links

Fingerprint

Cite this