1778 search results - page 164 / 356 » On the Power of the Randomized Iterate |
132
click to vote
ICIP
1998
IEEE
16 years 8 months ago
1998
IEEE
We present a framework for designing fast and monotonic algorithms for transmission tomography penalizedlikelihood image reconstruction. The new algorithms are based on paraboloid...
166
click to vote
MICCAI
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...
164
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
171
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
146
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Active learning methods aim to select the most informative unlabeled instances to label first, and can help to focus image or video annotations on the examples that will most impr...