Sciweavers

1177 search results - page 84 / 236
» Iterative methods for Robbins problems
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 18 days ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
131
Voted
ICIP
2009
IEEE
14 years 10 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré
ICIP
2009
IEEE
14 years 10 months ago
PCA Gaussianization for image processing
The estimation of high-dimensional probability density functions (PDFs) is not an easy task for many image processing applications. The linear models assumed by widely used transf...
Valero Laparra, Gustavo Camps-Valls, Jesús ...
PC
2010
101views Management» more  PC 2010»
14 years 7 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
CVIU
2011
14 years 4 months ago
Graph attribute embedding via Riemannian submersion learning
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...