IEEE Transactions on Circuits and Systems for Video Technology
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 22 Issue: 7
- Vol: 22 Issue: 8
- Vol: 22 Issue: 9
- Vol: 22 Issue: 10
- Vol: 22 Issue: 11
- Vol: 22 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 20 Issue: 7
- Vol: 20 Issue: 8
- Vol: 20 Issue: 9
- Vol: 20 Issue: 10
- Vol: 20 Issue: 11
- Vol: 20 Issue: 12
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 19 Issue: 7
- Vol: 19 Issue: 8
- Vol: 19 Issue: 9
- Vol: 19 Issue: 10
- Vol: 19 Issue: 11
- Vol: 19 Issue: 12
- Vol: 8 Issue: 1
- Vol: 8 Issue: 2
- Vol: 8 Issue: 3
- Vol: 8 Issue: 4
- Vol: 8 Issue: 5
- Vol: 8 Issue: 6
- Vol: 8 Issue: 7
- Vol: 8 Issue: 8
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 18 Issue: 7
- Vol: 18 Issue: 8
- Vol: 18 Issue: 9
- Vol: 18 Issue: 10
- Vol: 18 Issue: 11
- Vol: 18 Issue: 12
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 17 Issue: 7
- Vol: 17 Issue: 8
- Vol: 17 Issue: 9
- Vol: 17 Issue: 10
- Vol: 17 Issue: 11
- Vol: 17 Issue: 12
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 16 Issue: 7
- Vol: 16 Issue: 8
- Vol: 16 Issue: 9
- Vol: 16 Issue: 10
- Vol: 16 Issue: 11
- Vol: 16 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 15 Issue: 7
- Vol: 15 Issue: 8
- Vol: 15 Issue: 9
- Vol: 15 Issue: 10
- Vol: 15 Issue: 11
- Vol: 15 Issue: 12
- Vol: 14 Issue: 1
- Vol: 14 Issue: 2
- Vol: 14 Issue: 3
- Vol: 14 Issue: 4
- Vol: 14 Issue: 5
- Vol: 14 Issue: 6
- Vol: 14 Issue: 7
- Vol: 14 Issue: 8
- Vol: 14 Issue: 9
- Vol: 14 Issue: 10
- Vol: 14 Issue: 11
- Vol: 14 Issue: 12
- Vol: 13 Issue: 1
- Vol: 13 Issue: 2
- Vol: 13 Issue: 3
- Vol: 13 Issue: 4
- Vol: 13 Issue: 5
- Vol: 13 Issue: 6
- Vol: 13 Issue: 7
- Vol: 13 Issue: 8
- Vol: 13 Issue: 9
- Vol: 13 Issue: 10
- Vol: 13 Issue: 11
- Vol: 13 Issue: 12
- Vol: 12 Issue: 1
- Vol: 12 Issue: 2
- Vol: 12 Issue: 3
- Vol: 12 Issue: 4
- Vol: 12 Issue: 5
- Vol: 12 Issue: 6
- Vol: 12 Issue: 7
- Vol: 12 Issue: 8
- Vol: 12 Issue: 9
- Vol: 12 Issue: 10
- Vol: 12 Issue: 11
- Vol: 12 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 28 Issue: 7
- Vol: 28 Issue: 8
- Vol: 28 Issue: 9
- Vol: 28 Issue: 10
- Vol: 28 Issue: 11
- Vol: 28 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 27 Issue: 7
- Vol: 27 Issue: 8
- Vol: 27 Issue: 9
- Vol: 27 Issue: 10
- Vol: 27 Issue: 11
- Vol: 27 Issue: 12
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11
- Vol: 26 Issue: 12
- Vol: 25
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
- Vol: 22 Issue: 1
- Vol: 22 Issue: 2
- Vol: 22 Issue: 3
- Vol: 22 Issue: 4
- Vol: 22 Issue: 5
- Vol: 22 Issue: 6
- Vol: 22 Issue: 7
- Vol: 22 Issue: 8
- Vol: 22 Issue: 9
- Vol: 22 Issue: 10
- Vol: 22 Issue: 11
- Vol: 22 Issue: 12
- Vol: 21 Issue: 1
- Vol: 21 Issue: 2
- Vol: 21 Issue: 3
- Vol: 21 Issue: 4
- Vol: 21 Issue: 5
- Vol: 21 Issue: 6
- Vol: 21 Issue: 7
- Vol: 21 Issue: 8
- Vol: 21 Issue: 9
- Vol: 21 Issue: 10
- Vol: 21 Issue: 11
- Vol: 21 Issue: 12
- Vol: 20 Issue: 1
- Vol: 20 Issue: 2
- Vol: 20 Issue: 3
- Vol: 20 Issue: 4
- Vol: 20 Issue: 5
- Vol: 20 Issue: 6
- Vol: 20 Issue: 7
- Vol: 20 Issue: 8
- Vol: 20 Issue: 9
- Vol: 20 Issue: 10
- Vol: 20 Issue: 11
- Vol: 20 Issue: 12
- Vol: 19 Issue: 1
- Vol: 19 Issue: 2
- Vol: 19 Issue: 3
- Vol: 19 Issue: 4
- Vol: 19 Issue: 5
- Vol: 19 Issue: 6
- Vol: 19 Issue: 7
- Vol: 19 Issue: 8
- Vol: 19 Issue: 9
- Vol: 19 Issue: 10
- Vol: 19 Issue: 11
- Vol: 19 Issue: 12
- Vol: 8 Issue: 1
- Vol: 8 Issue: 2
- Vol: 8 Issue: 3
- Vol: 8 Issue: 4
- Vol: 8 Issue: 5
- Vol: 8 Issue: 6
- Vol: 8 Issue: 7
- Vol: 8 Issue: 8
- Vol: 18 Issue: 1
- Vol: 18 Issue: 2
- Vol: 18 Issue: 3
- Vol: 18 Issue: 4
- Vol: 18 Issue: 5
- Vol: 18 Issue: 6
- Vol: 18 Issue: 7
- Vol: 18 Issue: 8
- Vol: 18 Issue: 9
- Vol: 18 Issue: 10
- Vol: 18 Issue: 11
- Vol: 18 Issue: 12
- Vol: 17 Issue: 1
- Vol: 17 Issue: 2
- Vol: 17 Issue: 3
- Vol: 17 Issue: 4
- Vol: 17 Issue: 5
- Vol: 17 Issue: 6
- Vol: 17 Issue: 7
- Vol: 17 Issue: 8
- Vol: 17 Issue: 9
- Vol: 17 Issue: 10
- Vol: 17 Issue: 11
- Vol: 17 Issue: 12
- Vol: 16 Issue: 1
- Vol: 16 Issue: 2
- Vol: 16 Issue: 3
- Vol: 16 Issue: 4
- Vol: 16 Issue: 5
- Vol: 16 Issue: 6
- Vol: 16 Issue: 7
- Vol: 16 Issue: 8
- Vol: 16 Issue: 9
- Vol: 16 Issue: 10
- Vol: 16 Issue: 11
- Vol: 16 Issue: 12
- Vol: 15 Issue: 1
- Vol: 15 Issue: 2
- Vol: 15 Issue: 3
- Vol: 15 Issue: 4
- Vol: 15 Issue: 5
- Vol: 15 Issue: 6
- Vol: 15 Issue: 7
- Vol: 15 Issue: 8
- Vol: 15 Issue: 9
- Vol: 15 Issue: 10
- Vol: 15 Issue: 11
- Vol: 15 Issue: 12
- Vol: 14 Issue: 1
- Vol: 14 Issue: 2
- Vol: 14 Issue: 3
- Vol: 14 Issue: 4
- Vol: 14 Issue: 5
- Vol: 14 Issue: 6
- Vol: 14 Issue: 7
- Vol: 14 Issue: 8
- Vol: 14 Issue: 9
- Vol: 14 Issue: 10
- Vol: 14 Issue: 11
- Vol: 14 Issue: 12
- Vol: 13 Issue: 1
- Vol: 13 Issue: 2
- Vol: 13 Issue: 3
- Vol: 13 Issue: 4
- Vol: 13 Issue: 5
- Vol: 13 Issue: 6
- Vol: 13 Issue: 7
- Vol: 13 Issue: 8
- Vol: 13 Issue: 9
- Vol: 13 Issue: 10
- Vol: 13 Issue: 11
- Vol: 13 Issue: 12
- Vol: 12 Issue: 1
- Vol: 12 Issue: 2
- Vol: 12 Issue: 3
- Vol: 12 Issue: 4
- Vol: 12 Issue: 5
- Vol: 12 Issue: 6
- Vol: 12 Issue: 7
- Vol: 12 Issue: 8
- Vol: 12 Issue: 9
- Vol: 12 Issue: 10
- Vol: 12 Issue: 11
- Vol: 12 Issue: 12
- Vol: 9 Issue: 1
- Vol: 9 Issue: 2
- Vol: 9 Issue: 3
- Vol: 9 Issue: 4
- Vol: 9 Issue: 5
- Vol: 9 Issue: 6
- Vol: 9 Issue: 7
- Vol: 9 Issue: 8
- Vol: 11 Issue: 1
- Vol: 11 Issue: 2
- Vol: 11 Issue: 3
- Vol: 11 Issue: 4
- Vol: 11 Issue: 5
- Vol: 11 Issue: 6
- Vol: 11 Issue: 7
- Vol: 11 Issue: 8
- Vol: 11 Issue: 9
- Vol: 11 Issue: 10
- Vol: 11 Issue: 11
- Vol: 11 Issue: 12
- Vol: 10 Issue: 1
- Vol: 10 Issue: 2
- Vol: 10 Issue: 3
- Vol: 10 Issue: 4
- Vol: 10 Issue: 5
- Vol: 10 Issue: 6
- Vol: 10 Issue: 7
- Vol: 10 Issue: 8
- Vol: 28 Issue: 1
- Vol: 28 Issue: 2
- Vol: 28 Issue: 3
- Vol: 28 Issue: 4
- Vol: 28 Issue: 5
- Vol: 28 Issue: 6
- Vol: 28 Issue: 7
- Vol: 28 Issue: 8
- Vol: 28 Issue: 9
- Vol: 28 Issue: 10
- Vol: 28 Issue: 11
- Vol: 28 Issue: 12
- Vol: 27 Issue: 1
- Vol: 27 Issue: 2
- Vol: 27 Issue: 3
- Vol: 27 Issue: 4
- Vol: 27 Issue: 5
- Vol: 27 Issue: 6
- Vol: 27 Issue: 7
- Vol: 27 Issue: 8
- Vol: 27 Issue: 9
- Vol: 27 Issue: 10
- Vol: 27 Issue: 11
- Vol: 27 Issue: 12
- Vol: 26 Issue: 1
- Vol: 26 Issue: 2
- Vol: 26 Issue: 3
- Vol: 26 Issue: 4
- Vol: 26 Issue: 5
- Vol: 26 Issue: 6
- Vol: 26 Issue: 7
- Vol: 26 Issue: 8
- Vol: 26 Issue: 9
- Vol: 26 Issue: 10
- Vol: 26 Issue: 11
- Vol: 26 Issue: 12
- Vol: 25
- Vol: 25 Issue: 1
- Vol: 25 Issue: 2
- Vol: 25 Issue: 3
- Vol: 25 Issue: 4
- Vol: 25 Issue: 5
- Vol: 25 Issue: 6
- Vol: 25 Issue: 7
- Vol: 25 Issue: 8
- Vol: 25 Issue: 9
- Vol: 25 Issue: 10
- Vol: 25 Issue: 11
- Vol: 25 Issue: 12
Volume 10 Issue 4 • June 2000
Sponsor
Filter Results
-
Efficient summarization of stereoscopic video sequences
Publication Year: 2000, Page(s):501 - 517
Cited by: Papers (58) | Patents (3)An efficient technique for summarization of stereoscopic video sequences is presented, which extracts a small but meaningful set of video frames using a content-based sampling algorithm. The proposed video-content representation provides the capability of browsing digital stereoscopic video sequences and performing more efficient content-based queries and indexing. Each stereoscopic video sequence... View full abstract»
-
Layered representation of scenes based on multiview image analysis
Publication Year: 2000, Page(s):518 - 529
Cited by: Papers (1) | Patents (5)This paper describes a novel cooperative procedure for the segmentation of multiview image sequences exploiting multiple sources of information. Compared to other approaches, no a priori information is needed about the structure and the arrangement of objects in the scene. Three cameras in a particular unsymmetrical set-up are used in the system. The color distribution and the object contours in t... View full abstract»
-
Focused object extraction with multiple cameras
Publication Year: 2000, Page(s):530 - 540
Cited by: Papers (8) | Patents (4)This paper describes a novel framework for object extraction from images utilizing multiple cameras. Focused regions in images and disparities of point correspondences among multiple images are 3-D clues for the extraction. We examine the extraction of focused objects from images by these automatically acquired clues. Edges in images captured by the cameras are detected, and disparities of the edg... View full abstract»
-
Robust estimation of rigid-body 3-D motion parameters based on point correspondences
Publication Year: 2000, Page(s):541 - 549
Cited by: Papers (14) | Patents (1)The estimation of rigid-body 3-D motion parameters using point correspondences from a pair of images under perspective projection is, typically, very sensitive to noise. We present a novel robust method combining two approaches: (1) the SVD analysis of a linear operator resulting from the feature points and the displacement vectors and (2) a modified version of the well-known weighted least-square... View full abstract»
-
3-D scene reconstruction with viewpoint adaptation on stereo displays
Publication Year: 2000, Page(s):550 - 562
Cited by: Papers (7)We propose a generic algorithm for the geometrically correct reconstruction of 3-D scenes on stereo displays with viewpoint adaptation. This forms the basis of multiviewpoint systems, which are currently the most promising candidates for real-time implementations of 3-D visual communication systems. The reconstruction algorithm needs 3-D tracking of the viewers' eyes with respect to the display. W... View full abstract»
-
Occlusion and visible background and foreground areas in stereo: a Bayesian approach
Publication Year: 2000, Page(s):563 - 575
Cited by: Papers (13)Efficient techniques are introduced in this paper for the identification of the occlusion and visible background and foreground areas in a noisy stereoscopic image pair. Three different Bayes decision methods are tested for this purpose. The first, and uses three hypotheses for the formulation of the Bayes decision rules, adopting the right image as a reference. After performing a dual-Bayes decis... View full abstract»
-
Sequential construction of 3-D-based scene description
Publication Year: 2000, Page(s):576 - 584Binocular camera systems are commonly used to construct 3-D-based scene description. However, there is a tradeoff between the length of the camera baseline and the difficulty of the matching problem and the extent of the field of view of the 3-D scene. A large baseline system provides better depth resolution than a smaller baseline system at the expense of a narrower field of view. To increase the... View full abstract»
-
A fast search algorithm for vector quantization using a directed graph
Publication Year: 2000, Page(s):585 - 593
Cited by: Papers (9) | Patents (1)A fast search algorithm for vector quantization (VQ) is presented. This approach provides a practical solution to the implementation of a multilevel search based on a special designed directed graph (DG). An algorithm is also given of the optimal DG for any given practical source. Simulation results obtained from applying this approach to still images have shown that it can reduce the searching co... View full abstract»
-
An efficient computation of Euclidean distances using approximated look-up table
Publication Year: 2000, Page(s):594 - 599
Cited by: Papers (9) | Patents (2)For fast vector quantization (VQ) encoding, we present in this paper a new method to speed up the calculation of the squared Euclidean distance between two vectors. We call it the approximated look-up table (ALUT) method. This method considers the frequency of each squared number that occurs in the equation of squared Euclidean distances, and generates a more practical table to store squared numbe... View full abstract»
-
Precise and fast error tracking for error-resilient transmission of H.263 video
Publication Year: 2000, Page(s):600 - 607
Cited by: Papers (18)A precise error tracking scheme for robust transmission of real-time H.263 video is presented. By utilizing a feedback channel, the decoder reports the addresses of corrupted blocks induced by transmission errors back to the encoder. With these negative acknowledgments, the encoder can precisely calculate and track the propagated errors by examining the backward motion dependency for each pixel in... View full abstract»
-
Motion estimation using a one-dimensional gradient descent search
Publication Year: 2000, Page(s):608 - 616
Cited by: Papers (20)This work presents a low-complexity high-performance motion estimation method using a one-dimensional (1-D) gradient descent search. The proposed method consists of initial-point determination, initial-direction determination, a gradient descent search using variable step sizes and conjugate directions, and convergence checking. For each block, one of the original and predictive points with the be... View full abstract»
-
A practical projection-based postprocessing of block-coded images with fast convergence rate
Publication Year: 2000, Page(s):617 - 623
Cited by: Papers (31)At present, block-transform coding is probably the most popular approach for image compression. However, for the sake of its implementation, an image is partitioned into spatially adjoining blocks which are processed independently without considering inter-block correlation. So, this approach inescapably causes an annoying defect called a blocking artifact. In this letter, in order to reduce a blo... View full abstract»
-
Semi-automatic video object segmentation in the presence of occlusion
Publication Year: 2000, Page(s):624 - 629
Cited by: Papers (20) | Patents (1)We describe a semi-automatic approach for segmenting a video sequence into spatio-temporal video objects in the presence of occlusion. Motion and shape of each video object is represented by a 2-D mesh. Assuming that the boundary of an object of interest is interactively marked on some keyframes, the proposed method finds the boundary of the object in all other frames automatically by tracking the... View full abstract»
-
A source and channel-coding framework for vector-based data hiding in video
Publication Year: 2000, Page(s):630 - 645
Cited by: Papers (20) | Patents (4)Digital data hiding is a technology being developed for multimedia services, where significant amounts of secure data is invisibly hidden inside a host data source by the owner, for retrieval only by those authorized. The hidden data should be recoverable even after the host has undergone standard transformations, such as compression. In this paper, we present a source and channel coding framework... View full abstract»
-
MPEG-2 error concealment based on block-matching principles
Publication Year: 2000, Page(s):646 - 658
Cited by: Papers (98) | Patents (10)The MPEG-2 compression algorithm is very sensitive to channel disturbances due to the use of variable-length coding. A single bit error during transmission leads to noticeable degradation of the decoded sequence quality, in that part or an entire slice information is lost until the next resynchronization point is reached. Error concealment (EC) methods, implemented at the decoder side, present one... View full abstract»
-
A cell-loss concealment technique for MPEG-2 coded video
Publication Year: 2000, Page(s):659 - 665
Cited by: Papers (133) | Patents (7)Audio-visual and other multimedia services are seen as important sources of traffic for future telecommunication networks, including wireless networks. A major drawback with some wireless networks is that they introduce a significant number of transmission errors into the digital bitstream. For video, such errors can have the effect of degrading the quality of service to the point where it is unus... View full abstract»
Aims & Scope
IEEE Transactions on Circuits and Systems for Video Technology (TCSVT) covers the circuits and systems aspects of all video technologies. General, theoretical, and application-oriented papers with a circuits and systems perspective are encouraged for publication in TCSVT on or related to image/video acquisition, representation, presentation and display; processing, filtering and transforms; analysis and synthesis; learning and understanding; compression, transmission, communication and networking; storage, retrieval, indexing and search; and/or hardware and software design and implementation.
Meet Our Editors
Editor-in-Chief
Shipeng Li
iFLYTEK Co. Ltd.
No. 666 West Wangjiang Road
Hi-Tech Zone, Hefei, China 230088
Peer Review Support Services
Desiree Noel
IEEE Publishing Operations
d.noel@ieee.org
732-562-2644