Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
Constrained gradient analysis (similar to the “cubegrade” problem posed by Imielinski, et al. [9]) is to extract pairs of similar cell characteristics associated with big chan...
Guozhu Dong, Jiawei Han, Joyce M. W. Lam, Jian Pei...
We propose an efficient technique for normal map acquisition, using a cheap and easy to build setup. Our setup consists solely of off-the-shelf components, such as an LCD screen,...
Yannick Francken, Chris Hermans, Tom Cuypers, Phil...
A variational approach to image or video segmentation consists in defining an energy depending on local or global image characteristics, the minimum of which being reached for ob...
Eric Debreuve, Muriel Gastaud, Michel Barlaud, Gil...