.png){kind=icon}
.png){kind=icon}
Return
Sequential block-based disparity map estimation algorithm for stereoscopic image coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2015.09.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the problem of block-based disparity map estimation for stereoscopic image coding where the estimated map is transmitted to the decoder in order to predict one view from the other. The estimation problem of the disparity map is thus a trade-off between the quality prediction and the binary cost of the disparities to be stored or transmitted. This trade-off is modeled as a joint entropy-distortion metric assuming that the disparity map is encoded with an entropy coder; and one of the two views is fully predicted using this map when applied to the other view. However minimizing this joint metric is a complex combinatorial optimization problem where choices of disparities are all interrelated. A sub-optimal optimization solution is then proposed. It is based on a tree structure which is constructed sequentially whenever a block is matched. The developed algorithm, called Modified M-Algorithm (MMA), processes the reference view in a raster scanning order and assumes that the disparities to be selected in the unprocessed area are likely to follow a chosen disparity distribution. This algorithm has the ability at each step of the process not only to retain the M-best paths of the tree in terms of entropy-distortion cost but also to explore all possible extensions of each of these M paths until reading the last block of the view. Simulations, conducted on stereoscopic images extracted from Middlebury and Deimos datasets, show the advantage of our MMA compared to the conventional Block Matching Algorithm (BMA) with and without regularization both in terms of reducing bitrate and distortion. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Optimization
Disparity estimation
Rate-distortion
Entropy
Distortion
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
2.7
Papers:
2.8K
Citations:
4.2K