Abstract : Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity ﬁeld. In this paper, we address the same estimation problem and propose to solve it in a more general convex optimization framework based on proximal methods. More precisely, unlike previous works where the criterion must satisfy some restrictive conditions in order to be able to numerically solve the minimization problem, this work offers a great ﬂexibility in the choice of the involved criterion. The method is validated in a stereo image coding framework, and the results demonstrate the good performance of the proposed parallel proximal algorithm.