3630 search results - page 239 / 726 » Fast Marching Methods |
153
click to vote
TIP
2010
15 years 1 months ago
2010
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
175
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
162
click to vote
MICCAI
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large clas...
184
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
172
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...