摘要： A stereoscopic image consists of two views rendering a depth sense. Indeed each eye is constrained to look at one view, and the small objects displacements across the two views are interpreted as an indication of depth. These displacements are exploited as speci?c inter-view redundancies from a compression viewpoint. The classical still compression scheme, called disparity-compensated compression scheme, compresses one view independently of the second view, and a block-based disparity map modeling the displacements is losslessly compressed. The difference between the original view and its disparity predicted view is then compressed and used by the decoder to compute the compensated view to improve the disparity predicted view. However, a proof of concept work has already shown that selecting disparities according to the compensated view, instead of the predicted view, yields increased rate-distortion performance. This paper derives from the JPEG-coder, a disparity-dependent analytic expression of the distortion induced by the compensated view. This expression is embedded into an algorithm with a reasonable numerical complexity approaching the performance obtained with the proof of concept work. The proposed algorithm, called fast disparity-compensated block matching algorithm, provides at the same bitrate an average performance increase as compared to the classical stereoscopic image coding schemes.