Solving Oversegmentation Errors in Graph-Based Region Matching
Angeles López, Filiberto Pla

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 methods for region based correspondence. This preprocessing tries to assess the possible split regions in each image, with respect to the corresponding image, and construct hipothetical merged regions that could map better with regions in the other image. The preprocessing is based on graph techniques, building an incompatibility graph and using a maximal clique approach to look for possible region mergings.