Sciweavers

111 search results - page 12 / 23
» From irreducible representations to locally decodable codes
Sort
View
CODES
2006
IEEE
14 years 1 months ago
Generic netlist representation for system and PE level design exploration
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
Bita Gorjiara, Mehrdad Reshadi, Pramod Chandraiah,...
TOG
2012
230views Communications» more  TOG 2012»
11 years 10 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
ECCV
2010
Springer
13 years 11 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ICIP
2008
IEEE
14 years 9 months ago
Resolution-progressive compression of encrypted grayscale images
Compression of encrypted data can be achieved by employing Slepian-Wolf coding (SWC). However, how to efficiently exploit the source dependency in an encrypted colored signal such...
Wei Liu, Wenjun Zeng, Lina Dong, Qiuming Yao
TIP
2002
102views more  TIP 2002»
13 years 7 months ago
Multilayered image representation: application to image compression
Abstract--The main contribution of this work is a new paradigm for image representation and image compression. We describe a new multilayered representation technique for images. A...
François G. Meyer, Amir Averbuch, Ronald R....