Results 1 
7 of
7
MPEG: A Video Compression Standard for Multimedia Applications
 Communications of the ACM
, 1991
"... MPEG: a video compression standard for multimedia applications. ..."
Abstract

Cited by 598 (0 self)
 Add to MetaCart
MPEG: a video compression standard for multimedia applications.
CHECK: A Document Plagiarism Detection System
 SAC '97: PROCEEDINGS OF THE 1997 ACM SYMPOSIUM ON APPLIED COMPUTING
, 1997
"... Digital documents are vulnerable to being copied. Most existing copy detection prototypes employ an exhaustive sentencebased comparison method in comparing a potential plagiarized document against a repository of legal or original documents to identify plagiarism activities. This approach is not sc ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Digital documents are vulnerable to being copied. Most existing copy detection prototypes employ an exhaustive sentencebased comparison method in comparing a potential plagiarized document against a repository of legal or original documents to identify plagiarism activities. This approach is not scalable due to the potentially large number of original documents and the large number of sentences in each document. Furthermore, the security level of existing mechanisms is quite weak; a plagiarized document could simply bypass the detection mechanisms by performing a minor modification on each sentence. In this paper, we propose a copy detection mechanism that will eliminate unnecessary comparisons. This is based on the observation that comparisons between two documents addressing different subjects are not necessary. We describe the design and implementation of our experimental prototype called CHECK. The results of some exploratory experiments will be illustrated and the security level of our mechanism will be discussed.
An Efficient Architecture for the in Place Fast Cosine Transform
 in IEEE Conf on ApplicationSpecific System, Architectures and Processors (ASAP'97
, 1999
"... . The twodimensional discrete cosine transform (2DDCT) is at the core of image encoding and compression applications. We present a new architecture for the 2DDCT which is based on rowcolumn decomposition. An efficient architecture to compute the onedimensional fast direct (1DDCT) and inverse co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The twodimensional discrete cosine transform (2DDCT) is at the core of image encoding and compression applications. We present a new architecture for the 2DDCT which is based on rowcolumn decomposition. An efficient architecture to compute the onedimensional fast direct (1DDCT) and inverse cosine (1DIDCT) transforms, which is based in reordering the butterflies after their computation, is also discussed. The architectures designed exploit locality, allowing pipelining between stages and saving memory (in place). The result is an efficient architecture for high speed computation of the (1D,2D)DCT that significantly reduces the area required for VLSI implementation. Keywords: Discrete Cosine Transform, bit reversal and shuffle permutations, constant geometry architecture. 1. Introduction The twodimensional Discrete Cosine Transform (2DDCT) is considered the most efficient technique in image encoding and compression, being used as a standard in many applications [1][2][3]. Se...
Bit_serial Architecture For The Two Dimensional Dct
, 1995
"... We present an architecture for the calculation of the Two Dimensional Discrete Cosine Transform and its Inverse that admits a high data rate. It is based on the rowcolumn decomposition, the use of a fast algorithm, serial digit arithmetic and redundant coding. The critical path is set by the delay ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present an architecture for the calculation of the Two Dimensional Discrete Cosine Transform and its Inverse that admits a high data rate. It is based on the rowcolumn decomposition, the use of a fast algorithm, serial digit arithmetic and redundant coding. The critical path is set by the delay of a multiplexer plus a binary adder with as many digits as the width of the serial digits to be processed. We discuss its implementation for processing 8 bit 8x8 pixel blocks or 12 bit coefficients. Its implementation using standard cell 1 microm CMOS technology presents a 100MHz data rate and a core area of 42mm 2 . I  INTRODUCTION The Two dimensional Discrete Cosine Transform (2D DCT) is considered the most efficient technique in image encoding and compression schemes, being used as a standard in several applications [1][2]. The 2D DCT transforms a real NxN point matrix {x(i,j); i,j=0,1,...,N1} into another matrix {y(m,n); m,n=0,1,...,N1} whose elements are given by: Several imple...
Bit Serial Architecture For The Two Dimensional DCT
 Proc. ICSPAT'95
, 1995
"... We present an architecture for the calculation of the Two Dimensional Discrete Cosine Transform and its Inverse that admits a high data rate. It is based on the rowcolumn decomposition, the use of a fast algorithm, serial digit arithmetic and redundant coding. The critical path is set by the delay ..."
Abstract
 Add to MetaCart
We present an architecture for the calculation of the Two Dimensional Discrete Cosine Transform and its Inverse that admits a high data rate. It is based on the rowcolumn decomposition, the use of a fast algorithm, serial digit arithmetic and redundant coding. The critical path is set by the delay of a multiplexer plus a binary adder with as many digits as the width of the serial digits to be processed. We discuss its implementation for processing 8 bit 8x8 pixel blocks or 12 bit coefficients. Its implementation using standard cell 1 microm CMOS technology presents a 100MHz data rate and a core area of 42mm 2 . I  INTRODUCTION The Two dimensional Discrete Cosine Transform (2D DCT) is considered the most efficient technique in image encoding and compression schemes, being used as a standard in several applications [1][2]. The 2D DCT transforms a real NxN point matrix {x(i,j); i,j=0,1,...,N1} into another matrix {y(m,n); m,n=0,1,...,N1} whose elements are given by: Several impleme...
A JPEG Performance Analysis Utilizing a Generalized Chen Transform on the Am29050^TM Microprocessor
"... This paper will demonstrate the effectiveness of executing JPEG in software on AMD's general purpose Am29050 RISC microprocessor in a still imaging environment, and will highlight RISCbased embedded software applications for JPEG. Two major factors affecting JPEG performance in a software environme ..."
Abstract
 Add to MetaCart
This paper will demonstrate the effectiveness of executing JPEG in software on AMD's general purpose Am29050 RISC microprocessor in a still imaging environment, and will highlight RISCbased embedded software applications for JPEG. Two major factors affecting JPEG performance in a software environment are the speed of the DCT algorithm and the architecture of the microprocessor. The architecture of the Am29050 microprocessor is compared to that of CISC 80x86 processors. Two ports of Ricoh's Generalized Chen Transformbased fast JPEG code are benchmarked  one written in C and Intel 80386 assembler and run on an Intel 80486 CISC microprocessor; the other written entirely in C, compiled, then run on an Am29050 RISC microprocessor  and their performance analyzed. INTRODUCTION Computer imaging is a set of enabling technologies and standards which will be incorporated into a wide variety of application software in much the same way that "desktop publishing" is now a part of the mainstrea...
Bit Serial Architecture For The Calculation Of The Two Dimensional DCT
, 1995
"... We present an architecture for the calculation of the Two Dimensional Discrete Cosine Transform and its Inverse that admits a high data rate. It is based on the rowcolumn decomposition, the use of a fast algorithm, serial digit arithmetic and redundant coding. The critical path is set by the de ..."
Abstract
 Add to MetaCart
We present an architecture for the calculation of the Two Dimensional Discrete Cosine Transform and its Inverse that admits a high data rate. It is based on the rowcolumn decomposition, the use of a fast algorithm, serial digit arithmetic and redundant coding. The critical path is set by the delay of a multiplexer plus a binary adder with as many digits as the width of the serial digits to be processed. We discuss its implementation for processing 8 bit 8x8 pixel blocks or 12 bit coefficients. Its implementation using standard cell 1 microm CMOS technology presents a 100MHz data rate and a core area of 42mm 2 . I  INTRODUCTION The Two dimensional Discrete Cosine Transform (2D DCT) is considered the most efficient technique in image encoding and compression schemes, being used as a standard in several applications [1][2]. The 2D DCT transforms a real NxN point matrix {x(i,j); i,j=0,1,...,N1} into another matrix {y(m,n); m,n=0,1,...,N1} whose elements are given by: S...