By Topic

Circuits and Systems for Video Technology, IEEE Transactions on

Issue 11 • Date Nov. 2004

Filter Results

Displaying Results 1 - 12 of 12
  • Table of contents

    Publication Year: 2004 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Circuits and Systems for Video Technology publication information

    Publication Year: 2004 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (40 KB)  
    Freely Available from IEEE
  • Efficient, low-complexity image coding with a set-partitioning embedded block coder

    Publication Year: 2004 , Page(s): 1219 - 1235
    Cited by:  Papers (103)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4608 KB) |  | HTML iconHTML  

    We propose an embedded, block-based, image wavelet transform coding algorithm of low complexity. It uses a recursive set-partitioning procedure to sort subsets of wavelet coefficients by maximum magnitude with respect to thresholds that are integer powers of two. It exploits two fundamental characteristics of an image transform-the well-defined hierarchical structure, and energy clustering in frequency and in space. The two partition strategies allow for versatile and efficient coding of several image transform structures, including dyadic, blocks inside subbands, wavelet packets, and discrete cosine transform (DCT). We describe the use of this coding algorithm in several implementations, including reversible (lossless) coding and its adaptation for color images, and show extensive comparisons with other state-of-the-art coders, such as set partitioning in hierarchical trees (SPIHT) and JPEG2000. We conclude that this algorithm, in addition to being very flexible, retains all the desirable features of these algorithms and is highly competitive to them in compression efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable variable complexity approximate forward DCT

    Publication Year: 2004 , Page(s): 1236 - 1248
    Cited by:  Papers (26)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (712 KB) |  | HTML iconHTML  

    The discrete cosine transform (DCT) is one of the major components in most of image and video compression systems. The variable complexity algorithm framework has been applied successfully to achieve complexity savings in the computation of the inverse DCT in decoders. These gains can be achieved due to the highly predictable sparseness of the quantized DCT coefficients in natural image/video data. With the increasing demand for instant video messaging and two-way video transmission over mobile communication systems running on general-purpose embedded processors, the encoding complexity needs to be optimized. In this paper, we focus on complexity reduction techniques for the forward DCT, which is one of the more computationally intensive tasks in the encoder. Unlike the inverse DCT, the forward DCT does not operate on sparse input data, but rather generates sparse output data. Thus, complexity reduction must be obtained using different methods from those used for the inverse DCT. In the literature, two major approaches have been applied to speed up the forward DCT computation, namely, frequency selection, in which only a subset of DCT coefficients is computed, and accuracy selection, in which all the DCT coefficients are computed with reduced accuracy. These two approaches can achieve significant computation savings with minor output quality degradation, as long as the coding parameters are such that the quantization error is larger than the error due to the approximate DCT computation. Thus, in order to be useful, these algorithms have to be combined using an efficient mechanism that can select the "right" level of approximation as a function of the characteristics of the input and the target rate, a selection that is often based on heuristic criteria. In this paper, we consider two previously proposed fast, variable complexity, forward DCT algorithms, one based on frequency selection, the other based on accuracy selection. We provide an explicit analysis of the additional distortion that each scheme introduces as a function of the quantization parameter and the variance of the input block. This analysis then allows us to improve the performance of these algorithms by making it possible to select the best approximation level for each block and a target quant- ization parameter. We also propose a hybrid algorithm that combines both forms of complexity reduction in order to achieve overall better performance over a broader range of operating rates. We show how our techniques lead to scalable implementations where complexity can be reduced if needed, at the cost of small reductions in video quality. Our hybrid algorithm can speed up the DCT and quantization process by close to a factor of 4 as compared to fixed-complexity forward DCT implementations, with only a slight quality degradation in PSNR. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A progressive view-dependent technique for interactive 3-D mesh transmission

    Publication Year: 2004 , Page(s): 1249 - 1264
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4448 KB) |  | HTML iconHTML  

    A view-dependent graphics streaming scheme is proposed in this work that facilitates interactive streaming and browsing of three-dimensional (3-D) graphics models. First, a 3-D model is split into several partitions. Second, each partition is simplified and coded independently. Finally, the compressed data is sent in order of relevance to the user's requests to maximize visual quality. Specifically, the server can transmit visible parts in detail, while cutting out invisible parts. Experimental results demonstrate that the proposed algorithm reduces the required transmission bandwidth, and provides an acceptable visual quality even at low bit rates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast full-search motion estimation based on multilevel successive elimination algorithm

    Publication Year: 2004 , Page(s): 1265 - 1269
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    An improved fast full-search algorithm for motion estimation is proposed. The computational process of the sum of absolute difference and the multilevel successive elimination algorithm (MSEA) are theoretically analysed. Based on these analyzes, a new detection criterion and an estimation of the starting level are proposed in order to reduce the computations required for judging invalid candidate blocks. The simulation results show that the proposed algorithm achieves a computational timesaving of about 40% compared with the MSEA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Byte and modulo addressable parallel memory architecture for video coding

    Publication Year: 2004 , Page(s): 1270 - 1276
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (592 KB) |  | HTML iconHTML  

    This paper proposes an internal data memory architecture supporting byte and modulo addressing for processors having subword parallel processing capability, or alternatively, multiple SIMD-connected processing elements on-chip. Byte-addressable memory efficiently relieves the data word alignment problem in motion estimation block matching. In addition, a special modulo addressing allows part of the bytes in a word to be accessed simultaneously from the both ends of a circular buffer. With the modulo-addressable memory, the external memory bandwidth can be significantly reduced, while preserving efficient memory access performance in block-matching operations. The proposed data memory architecture consists of parallel memory modules, address computation circuitry, and data permutation network. Designs for different data bus widths (N= 2, 4, 8 bytes) are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining a fuzzy rule-based classifier and illumination Invariance for improved building detection

    Publication Year: 2004 , Page(s): 1277 - 1280
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB) |  | HTML iconHTML  

    The problem of edge-based classification of natural video sequences containing buildings and captured under changing lighting conditions is addressed in this letter. The introduced approach is derived from two empiric observations: In static regions the likelihood of finding features that match the patterns of "buildings" is high because buildings are rigid static objects; and misclassification can be reduced by filtering out image regions changing or deforming in time. These regions may contain objects semantically different to buildings but with a highly similar edge distribution, e.g., high frequency of vertical and horizontal edges. Using these observations a strategy is devised in which a fuzzy rule-based classification technique is combined with a method for changing region detection in outdoor scenes. The proposed approach has been implemented and tested with sequences showing changes in the lighting conditions. Selected results from the experimental evaluation are reported. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2005 IEEE International Symposium on Circuits and Systems (ISCAS 2005)

    Publication Year: 2004 , Page(s): 1281
    Save to Project icon | Request Permissions | PDF file iconPDF (520 KB)  
    Freely Available from IEEE
  • IEEE 2005 International Conference on Image Processing

    Publication Year: 2004 , Page(s): 1282
    Save to Project icon | Request Permissions | PDF file iconPDF (484 KB)  
    Freely Available from IEEE
  • IEEE Circuits and Systems Society Information

    Publication Year: 2004 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (35 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Circuits and Systems for Video Technology Information for authors

    Publication Year: 2004 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (32 KB)  
    Freely Available from IEEE

Aims & Scope

The emphasis is focused on, but not limited to:
1. Video A/D and D/ A
2. Video Compression Techniques and Signal Processing
3. Multi-Dimensional Filters and Transforms
4. High Speed Real-Tune Circuits
5. Multi-Processors Systems—Hardware and Software
6. VLSI Architecture and Implementation for Video Technology 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Dan Schonfeld
Multimedia Communications Laboratory
ECE Dept. (M/C 154)
University of Illinois at Chicago (UIC)
Chicago, IL 60607-7053
tcsvt-eic@tcad.polito.it

Managing Editor
Jaqueline Zelkowitz
tcsvt@tcad.polito.it