Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Decomposition of cells in clumps is a difficult segmentation task requiring region splitting techniques. Techniques that do not employ prior shape constraints usually fail to achi...
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...