Sciweavers

312 search results - page 16 / 63
» Iterative compression and exact algorithms
Sort
View
LCPC
2000
Springer
14 years 1 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
JMIV
2006
124views more  JMIV 2006»
13 years 9 months ago
Iterative Total Variation Regularization with Non-Quadratic Fidelity
Abstract. A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity ter...
Lin He, Martin Burger, Stanley Osher
TSP
2010
13 years 4 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
IJON
2008
109views more  IJON 2008»
13 years 9 months ago
Unsupervised learning neural network with convex constraint: Structure and algorithm
This paper proposed a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compres...
Hengqing Tong, Tianzhen Liu, Qiaoling Tong
ICIP
2001
IEEE
14 years 11 months ago
Lossy and lossless compression for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color informationhas been developed. Rather than sorting color indexes into a linear list...
Xin Chen, Sam Kwong, Ju-fu Feng