By Topic

Circuits and Systems for Video Technology, IEEE Transactions on

Issue 12 • Date Dec. 2001

Filter Results

Displaying Results 1 - 10 of 10
  • Author index

    Page(s): 1302 - 1306
    Save to Project icon | Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE
  • Subject index

    Page(s): 1306 - 1319
    Save to Project icon | Request Permissions | PDF file iconPDF (127 KB)  
    Freely Available from IEEE
  • Interword distance changes represented by sine waves for watermarking text images

    Page(s): 1237 - 1245
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (205 KB)  

    Digital watermarking is widely believed to be a valid means to discourage illicit distribution of information content. Digital watermarking methods for text documents are limited because of the binary nature of text documents. A distinct feature of a text document is its space patterning. We propose a new approach in text watermarking in which interword spaces of different text lines are slightly modified. After the modification, the average spaces of various lines have the characteristics of a sine wave and the wave constitutes a mark. Both nonblind and blind watermarking algorithms are discussed. Preliminary experiments have shown promising results. Our experiments suggest that space patterning of text documents can be a useful tool in digital watermarking View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified rate-distortion analysis framework for transform coding

    Page(s): 1221 - 1236
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (643 KB) |  | HTML iconHTML  

    In our previous work, we have developed a rate-distortion (R-D) modeling framework for H.263 video coding by introducing the new concepts of characteristic rate curves and rate curve decomposition. In this paper, we further show it is a unified R-D analysis framework for all typical image/video transform coding systems, such as embedded zero-tree wavelet (EZW), set partitioning in hierarchical trees (SPIHT) and JPEG image coding; MPEG-2, H.263, and MPEG-4 video coding. Based on this framework, a unified R-D estimation and control algorithm is proposed for all typical transform coding systems. We have also provided a theoretical justification for the unique properties of the characteristic rate curves. A linear rate regulation scheme is designed to further improve the estimation accuracy and robustness, as well as to reduce the computational complexity of the R-D estimation algorithm. Our extensive experimental results show that with the proposed algorithm, we can accurately estimate the R-D functions and robustly control the output bit rate or picture quality of the image/video encoder View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Postprocessing of low bit-rate wavelet-based image coding using multiscale edge characterization

    Page(s): 1263 - 1272
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (936 KB)  

    In this paper, we propose a new postprocessing method for low bit-rate wavelet-based image coding which uses the technique of wavelet modulus maximum representation (WMMR). The edge degradation from wavelet-based coding is discussed under the overcomplete wavelet expansion, and interpreted as the distortion of wavelet modulus maxima, i.e., magnitude decays. Based on the empirical analysis and experimental results, we develop a set of compensation functions to restore the distorted wavelet modulus maxima of a coded image. Therefore, we can enhance the image quality for low bit-rate wavelet coding by reconstructing the coded image using the WMMR with improved visual quality and image fidelity (peak signal-to-noise ratio) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust scene-change detection method for video segmentation

    Page(s): 1281 - 1288
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (241 KB)  

    This paper proposes a new method that combines the intensity and motion information to detect scene changes such as abrupt scene changes and gradual scene changes. Two major features are chosen as the basic dissimilarity measures, and self- and cross-validation mechanisms are employed via a static scene test. We also develop a novel intensity statistics model for detecting gradual scene changes. Experimental results show that the proposed algorithms are effective and outperform the previous approaches View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved techniques for automatic image segmentation

    Page(s): 1273 - 1280
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (251 KB)  

    Mathematical morphology is very attractive for automatic image segmentation because it efficiently deals with geometrical descriptions such as size, area, shape, or connectivity that can be considered as segmentation-oriented features. This paper presents an image-segmentation system based on some well-known strategies. The segmentation process is divided into three basic steps, namely: simplification, marker extraction, and boundary decision. Simplification, which makes use of area morphology, removes unnecessary information from the image to make it easy to segment. Marker extraction identifies the presence of homogeneous regions. A new marker extraction design is proposed in this paper. It is based on both luminance and color information. The goal of boundary decision is to precisely locate the boundary of regions detected by the marker extraction. This decision is based on a region-growing algorithm which is a modified watershed algorithm. A new color distance is also defined for this algorithm. In both marker extraction and boundary decision, color measurement is used to replace grayscale measurement and L*a*b* color space is used to replace the more straightforward spaces such as the RGB color space and YUV color space View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplex minimization for single- and multiple-reference motion estimation

    Page(s): 1209 - 1220
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (275 KB) |  | HTML iconHTML  

    Block-matching motion estimation (BMME) can be formulated as a 2-D constrained minimization problem. This problem can, therefore, be solved with reduced complexity using optimization techniques. This paper proposes a novel fast BMME algorithm called the simplex minimization search (SMS). The algorithm is based on the simplex minimization (SM) optimization method. The initialization procedure, termination criterion, and constraints on the independent variables of the search are designed to take advantage of the characteristics of the BMME problem and the properties of the block motion fields of typical video sequences. Simulation results show that the proposed algorithm outperforms other fast BMME algorithms, providing better prediction quality, a smoother motion field, and higher speed-up ratio. This paper also investigates the properties of the multiple-reference (MR) block motion field. Guided by the results of this investigation, the paper extends the SMS algorithm to the MR case. Three MR SMS algorithms are proposed, providing different degrees of compromise between prediction quality and computational complexity. Simulation results using 50 reference frames indicate that the proposed MR algorithms have a computational complexity comparable to that of single-reference full-search while still maintaining the prediction gain of MR motion estimation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast multi-resolution block matching algorithm and its LSI architecture for low bit-rate video coding

    Page(s): 1289 - 1301
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (337 KB) |  | HTML iconHTML  

    We propose a fast multi-resolution block-matching algorithm (BMA) using multiple motion vector (MV) candidates and spatial correlation in MV fields, called a multi-resolution motion search algorithm (MRMCS). The proposed MRMCS satisfies high estimation performance and efficient LSI implementation. This paper describes the MRMCS with three resolution levels. At the coarsest level, two MV candidates are obtained on the basis of minimum matching error for the next search level. At the middle level, the two candidates selected at the coarsest level and the other one based on spatial MV correlation at the finest level are used as center points for local searches, and a MV candidate is chosen for the next search level. Then, at the finest level, the final MV is obtained from local search around the single candidate obtained at the middle level. This paper also describes an efficient LSI architecture based on the proposed algorithm for low bit-rate video coding. Since this architecture requires a small number of processing elements (PEs) and a small size on-chip memory, MRMCS can be implemented with a much smaller number of gates than other conventional architectures for full-search BMA while keeping a negligible degradation of coding performance. Moreover, the proposed motion estimator can support an advanced prediction mode (8×8 prediction mode) for H.263 and MPEG-4 video encoding. We implement this architecture with about 25 K gates and 288 bytes of RAM for a search range of [-16.0, +15.5] by using a synthesizable VHDL View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of design alternatives for the 2-D-discrete wavelet transform

    Page(s): 1246 - 1262
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (486 KB) |  | HTML iconHTML  

    In this paper, the three main hardware architectures for the 2-D discrete wavelet transform (2-D-DWT) are reviewed. Also, optimization techniques applicable to all three architectures are described. The main contribution of this work is the quantitative comparison among these design alternatives for the 2-D-DWT. The comparison is performed in terms of memory requirements, throughput, and energy dissipation, and is based on a theoretical analysis of the alternative architectures and schedules. Memory requirements, throughput, and energy are expressed by analytical equations with parameters from both the 2-D-DWT algorithm and the implementation platform. The parameterized equations enable the early but efficient exploration of the various tradeoffs related to the selection to the one or the other architecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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