Sciweavers

539 search results - page 19 / 108
» Recurrence relations and fast algorithms
Sort
View
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
14 years 10 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
90
Voted
DAC
1999
ACM
15 years 4 months ago
ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
Bernard N. Sheehan
ICIAP
1997
ACM
15 years 4 months ago
A Divide-and-Conquer Strategy in Recovering Shape of Book Surface from Shading
A strategy in solving the shape from shading problem for the shape and albedo recovery of book surfaces under the fully perspective environment is proposed. The whole recovery proc...
Seong Ik Cho, Hideo Saito, Shinji Ozawa
SIAMIS
2008
279views more  SIAMIS 2008»
15 years 9 days ago
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
VLDB
1998
ACM
95views Database» more  VLDB 1998»
15 years 4 months ago
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
Johannes Gehrke, Raghu Ramakrishnan, Venkatesh Gan...