Sciweavers

7150 search results - page 1010 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Image denoising: Can plain neural networks compete with BM3D?
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
Harold Christopher Burger, Christian J. Schuler, S...
CVPR
2009
IEEE
17 years 1 months ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
CVPR
2004
IEEE
16 years 8 months ago
Visual Tracking Using Learned Linear Subspaces
This paper presents a simple but robust visual tracking algorithm based on representing the appearances of objects using affine warps of learned linear subspaces of the image spac...
Jeffrey Ho, Kuang-Chih Lee, Ming-Hsuan Yang, David...
ECCV
2006
Springer
16 years 8 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 8 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
« Prev « First page 1010 / 1430 Last » Next »