By Topic

Circuits and Systems for Video Technology, IEEE Transactions on

Issue 7 • Date Jul 2002

Filter Results

Displaying Results 1 - 6 of 6
  • An efficient algorithm for video sequence matching using the modified Hausdorff distance and the directed divergence

    Publication Year: 2002 , Page(s): 592 - 596
    Cited by:  Papers (26)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (496 KB) |  | HTML iconHTML  

    To manipulate a large video database, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for framewise user query or video content query, whereas few video-sequence matching algorithms have been investigated. In this paper, we propose an efficient algorithm for video sequence matching using the modified Hausdorff distance and the directed divergence of histograms between successive frames. To effectively match the video sequences with a low computational load, we use the key frames extracted by the cumulative directed divergence and compare the set of key frames using the modified Hausdorff distance. Experimental results with color video sequences show that the proposed algorithms for video sequence matching yield better performance than conventional algorithms such as histogram difference, histogram intersection, and chi-square test methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VLSI implementation for low-complexity full-search motion estimation

    Publication Year: 2002 , Page(s): 613 - 619
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (338 KB) |  | HTML iconHTML  

    Although many ASICs for motion estimation have been developed, either the chip complexity is too high or the optimal accuracy was not achieved. In this study, an adaptive full-search algorithm is presented to reduce the searching complexity with a temporal correlation approach. The efficiency of the proposed full search can be promoted about 5-10 times in comparison with the conventional full search while the searching accuracy remains intact. Based on the adaptive full-search algorithm, a real-time VLSI chip is regularly designed by using the module base. For MPEG-2 applications, the computational kernel only uses eight processing elements to meet the speed requirement. The processing rate of the proposed chip can achieve 53 K blocks/s to search from -127 to +127 vectors, using only 8 K gates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic segmentation of moving objects in video sequences: a region labeling approach

    Publication Year: 2002 , Page(s): 597 - 612
    Cited by:  Papers (75)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (512 KB)  

    The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improve coding efficiency, MPEG-4 relies on a decomposition of each frame of an image sequence into video object planes (VOP). Each VOP corresponds to a single moving object in the scene. This paper presents a new method for automatic segmentation of moving objects in image sequences for VOP extraction. We formulate the problem as graph labeling over a region adjacency graph (RAG), based on motion information. The label field is modeled as a Markov random field (MRF). An initial spatial partition of each frame is obtained by a fast, floating-point based implementation of the watershed algorithm. The motion of each region is estimated by hierarchical region matching. To avoid inaccuracies in occlusion areas, a novel motion validation scheme is presented. A dynamic memory, based on object tracking, is incorporated into the segmentation process to maintain temporal coherence of the segmentation. Finally, a labeling is obtained by maximization of the a posteriori probability of the MRF using motion information, spatial information and the memory. The optimization is carried out by highest confidence first (HCF). Experimental results for several video sequences demonstrate the effectiveness of the proposed approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive trellis-coded space-frequency quantization for wavelet image coding

    Publication Year: 2002 , Page(s): 587 - 591
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (243 KB) |  | HTML iconHTML  

    This paper addresses progressive wavelet image coding within the trellis-coded space-frequency quantization (TCSFQ) framework (Xiong et al., 1999). A method similar to that in Bilgin et al. (1999), is used to approximately invert TCSFQ when decoding at rates lower than the encoding rate. Our experiments show that the loss incurred for progressive transmission is within 1 dB in peak signal-to-noise ratio and that the progressive coding performance of TCSFQ is competitive with that of the celebrated SPIHT coder (Said et al., 1996) at all rates View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient moving object segmentation algorithm using background registration technique

    Publication Year: 2002 , Page(s): 577 - 586
    Cited by:  Papers (133)  |  Patents (28)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (346 KB) |  | HTML iconHTML  

    An efficient moving object segmentation algorithm suitable for real-time content-based multimedia communication systems is proposed in this paper. First, a background registration technique is used to construct a reliable background image from the accumulated frame difference information. The moving object region is then separated from the background region by comparing the current frame with the constructed background image. Finally, a post-processing step is applied on the obtained object mask to remove noise regions and to smooth the object boundary. In situations where object shadows appear in the background region, a pre-processing gradient filter is applied on the input image to reduce the shadow effect. In order to meet the real-time requirement, no computationally intensive operation is included in this method. Moreover, the implementation is optimized using parallel processing and a processing speed of 25 QCIF fps can be achieved on a personal computer with a 450-MHz Pentium III processor. Good segmentation performance is demonstrated by the simulation results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image resizing in the compressed domain using subband DCT

    Publication Year: 2002 , Page(s): 620 - 627
    Cited by:  Papers (51)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (307 KB) |  | HTML iconHTML  

    Resizing of digital images is needed in various applications, such as transmission of images over communication channels varying widely in their bandwidths, display at different resolutions depending on the resolution of a display device, etc. In this work, we propose a modification of a recently proposed elegant image resizing algorithm by Dugad and Ahuja (2001). We have also extended their approach and our modified versions to color images and studied their performance at different levels of compression for an image. Our proposed modified algorithms, in general, perform better than the earlier method in most cases. Though there is a marginal increase in the computation required in image-halving, the computation overhead of the proposed modification is higher compared to the Dugad-Ahuja algorithm in the case of doubling the images 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