Translator Disclaimer
24 May 1999 Digital signal processing for the analysis and coding of stereoscopic and 3D video
Author Affiliations +
Proceedings Volume 3639, Stereoscopic Displays and Virtual Reality Systems VI; (1999)
Event: Electronic Imaging '99, 1999, San Jose, CA, United States
The main problem in stereo vision is the reconstruction of the 3D surface of objects in the scene from a pair of stereo images. This is performed by establishing correspondence between homologous points in each stereo image. Once correspondence is established it is straightforward to compute the coordinates of the corresponding 3D point. Although, important image analysis tasks like scene segmentation and 3D motion estimation may be performed using a monocular sequence, one may achieve better result by exploiting depth information from a stereo image sequence. Especially if depth estimation is combined with 3D motion estimation a considerable improvement in the accuracy of the estimates is expected. In this paper we present algorithms for the analysis of stereoscopic image sequences. Apart from the usefulness of stereoscopic imagin in compute revision, its application in advanced telecommunications is also of prime importance. Since the bandwidth required to transmit both stereoscopic image streams is large, efficient coding technique should be employed to reduce the data rate. In this paper we present an object-based approach that lacks the disadvantages of tradition block-based techniques. Also, the ability of this algorithm to describe a scene in a structural way, in contrast to traditional waveform-based coding techniques, opens new areas of applications.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael G. Strintzis, Sotiris Malassiotis, and Ioannis Kompatsiaris "Digital signal processing for the analysis and coding of stereoscopic and 3D video", Proc. SPIE 3639, Stereoscopic Displays and Virtual Reality Systems VI, (24 May 1999);

Back to Top