Sciweavers

27 search results - page 2 / 6
» Reconstructing shapes with guarantees by unions of convex se...
Sort
View
AAAI
2011
12 years 5 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
JMIV
2010
98views more  JMIV 2010»
13 years 3 months ago
Expectations of Random Sets and Their Boundaries Using Oriented Distance Functions
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...
Hanna K. Jankowski, Larissa I. Stanberry
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
13 years 10 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
ICIP
2000
IEEE
14 years 6 months ago
POCS-Based Image Reconstruction from Irregularly-Spaced Samples
This paper presents a method for the reconstruction of a regularlysampled image from its irregularly-spaced samples. Such reconstruction is often needed in image processing and co...
Ryszard Stasinski, Janusz Konrad
CVPR
2006
IEEE
14 years 7 months ago
Visible Surface Reconstruction from Normals with Discontinuity Consideration
Given a dense set of imperfect normals obtained by photometric stereo or shape from shading, this paper presents an optimization algorithm which alternately optimizes until conver...
Tai-Pang Wu, Chi-Keung Tang