Abstract
A method to solve oversegmentation and undersegmentation in a region-based correspondence process is presented. The approach is based on performing a preprocessing step before using existing graph based methods. This preprocessing tries to assess the possible split regions in each image, with respect to the corresponding image, and form merge regions that could map better with regions in the other image. The method is based on graph techniques, building an incompatibility graph and using an algorithm for finding all the maximal cliques in order to look for the possible region mergings.

Keywords:
Stereo, Region-based matching, Oversegmentation, Undersegmentation, Maximal clique, Association graph, Relaxation .