Sciweavers

125 search results - page 12 / 25
» Semidefinite representation of convex sets
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
VLDB
1987
ACM
106views Database» more  VLDB 1987»
13 years 11 months ago
A Dual Space Representation for Geometric Data
Thie paper presents a representation echeme for polyhedral objects in arbitrary dimensions. Each object ie represented as the algebraic sum of convex polyhedra (cells). Each cell ...
Oliver Günther, Eugene Wong
CVPR
2011
IEEE
12 years 11 months ago
A Non-convex Relaxation Approach to Sparse Dictionary Learning
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
Jianping Shi, Xiang Ren, Jingdong Wang, Guang Dai,...
AUTOMATICA
2008
98views more  AUTOMATICA 2008»
13 years 8 months ago
An algorithm for bounded-error identification of nonlinear systems based on DC functions
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
J. M. Bravo, T. Alamo, M. J. Redondo, Eduardo F. C...
TOG
2012
237views Communications» more  TOG 2012»
11 years 10 months ago
An algebraic model for parameterized shape editing
We present an approach to high-level shape editing that adapts the structure of the shape while maintaining its global characteristics. Our main contribution is a new algebraic mo...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel, V...