An image segmentation process often results in a special spatial set, called a mosaic, as the subdivision of a domain S within the n-dimensional Euclidean space. In this paper, S will be a compact domain and the study will be focused on finite Jordan mosaics, that is to say mosaics with a finite number of regions and where the boundary of each region is a Jordan hypersurface. The first part of this paper addresses the problem of comparing a Jordan mosaic to a given reference Jordan mosaic and introduces the (Epsilon) dissimilarity criterion. The second part will show that the (Epsilon) dissimilarity criterion can be used to perform the evaluation of image segmentation processes. It will be compared to classical criterions in regard to several geometric transformations. The pros and cons of these criterions are presented and discussed, showing that the dissimilarity criterion outperforms the other ones.