Sciweavers

4047 search results - page 134 / 810
» The Discrete Basis Problem
Sort
View
87
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 25 days ago
Blind Compressed Sensing
The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measuremen...
Sivan Gleichman, Yonina C. Eldar
94
Voted
ISPEC
2009
Springer
15 years 7 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
106
Voted
CVPR
2008
IEEE
16 years 2 months ago
A general solution to the P4P problem for camera with unknown focal length
This paper presents a general solution to the determination of the pose of a perspective camera with unknown focal length from images of four 3D reference points. Our problem is a...
Martin Bujnak, Tomás Pajdla, Zuzana Kukelov...
ICASSP
2010
IEEE
15 years 28 days ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
100
Voted
ICPR
2004
IEEE
16 years 1 months ago
A Unified Information-Theoretic Approach to the Correspondence Problem in Image Registration
We consider the correspondence problem associated with the non-rigid registration of a group of images; in particular, the theoretical basis for the derivation of the objective fu...
Carole J. Twining, Stephen Marsland, Christopher J...