9 search results - page 1 / 2 » G-Optimal Design with Laplacian Regularization |
TIP
2010
13 years 2 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
AAAI
2010
13 years 6 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
SIAMSC
2008
13 years 4 months ago
2008
We describe a hybrid algorithm that is designed to reconstruct a piecewise smooth surface mesh from noisy input. While denoising, our method simultaneously regularizes triangle me...
ICIP
2001
IEEE
14 years 6 months ago
2001
IEEE
A flexible multiscale and directional representation for images is proposed. The scheme combines directional filter banks with the Laplacian pyramid to provides a sparse represent...