In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
A new technique is presented for mosaicing sparselyoverlapping image sets, with a target application of assisting the diagnosis and treatment of retinal diseases. The geometric im...
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
We present a new variational framework for recovery of apparent diffusion coefficient (ADC) from High Angular Resolution Diffusion-weighted (HARD) MRI. The model approximates the ...