Sciweavers

588 search results - page 59 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
MIA
2010
170views more  MIA 2010»
13 years 4 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
13 years 24 days ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
TSMC
2008
182views more  TSMC 2008»
13 years 9 months ago
Incremental Linear Discriminant Analysis for Face Recognition
Abstract--Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant...
Haitao Zhao, Pong Chi Yuen
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 12 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
CVPR
2007
IEEE
14 years 12 months ago
Modeling Appearances with Low-Rank SVM
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
Lior Wolf, Hueihan Jhuang, Tamir Hazan