Sciweavers

1523 search results - page 97 / 305
» The Computational Complexity of Linear Optics
Sort
View
160
Voted
VLSM
2005
Springer
15 years 9 months ago
Entropy Controlled Gauss-Markov Random Measure Field Models for Early Vision
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
Mariano Rivera, Omar Ocegueda, José L. Marr...
122
Voted
CVPR
2010
IEEE
15 years 11 months ago
Linear View Synthesis Using a Dimensionality Gap Light Field Prior
Acquiring and representing the 4D space of rays in the world (the light field) is important for many computer vision and graphics applications. Yet, light field acquisition is c...
Anat Levin, Fredo Durand
119
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
Is the World Linear?
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
Rudolf Fleischer
126
Voted
LSSC
2005
Springer
15 years 9 months ago
On Weighted Structured Total Least Squares
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
Ivan Markovsky, Sabine Van Huffel
147
Voted
DAC
2008
ACM
15 years 5 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...