2527 search results - page 285 / 506 » Discrete optimization in computer vision |
158
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
111
click to vote
ACNS
2003
Springer
15 years 8 months ago
2003
Springer
We proposed the first threshold GQ signature scheme. The scheme is unforgeable and robust against any adaptive adversary if the base GQ signature scheme is unforgeable under the c...
145
click to vote
NIPS
2003
15 years 6 months ago
2003
We consider the problem of reconstructing patterns from a feature map. Learning algorithms using kernels to operate in a reproducing kernel Hilbert space (RKHS) express their solu...
143
click to vote
MVA
1992
15 years 6 months ago
1992
In this study, we explore the domain of orthogonal transforms, in order to bring an understanding on the characterization of image features, with emphasis placed on the Karhunen-L...
196
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...