期刊名称:International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN:2277-6451
电子版ISSN:2277-128X
出版年度:2012
卷号:2
期号:6
出版社:S.S. Mishra
摘要:3D stereo images are acquired by simulating human's eyesight effect upon observing objects through two horizontally separated perspectives. Correspondingly, two frames are resulted for one 3 -D image, labelled as left frame and right frame. If these two frames are to be transmitted with the idea of reconstructing the 3D image at the receiver end, we would need double the bandwidth required for monocular image transmission. Therefore, data compression is necessary. The left and right views that comprise a 3D -stereoscopic image pair or motion stream pa ir are obviously very similar. They are often described as "highly redundant", in that most of the info rmation contained in either is repeated in the other, or as "highly correlated" in that either is for the most part easily predicted from the other by ap plication of some external information about the relationship between them. We can thus synthesize a reasonable approximation to either view given the other vi ew and a little additional information that describes the relationship between the two views. A useful form for the additional information is a disparity map: a two dimensional vector field that encodes ho w to displace blocks of pixels in one view to approximate the other view. In this paper I wish to illustrate how the block matching algorithm works and helpful for the effective stereo image compression.