Sciweavers

114 search results - page 19 / 23
» Compression of a Dictionary
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Image super-resolution as sparse representation of raw image patches
This paper addresses the problem of generating a superresolution (SR) image from a single low-resolution input image. We approach this problem from the perspective of compressed s...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
ITC
2003
IEEE
139views Hardware» more  ITC 2003»
14 years 19 days ago
A Hybrid Coding Strategy For Optimized Test Data Compression
Store-and-generate techniques encode a given test set and regenerate the original test set during the test with the help of a decoder. Previous research has shown that runlength c...
Armin Würtenberger, Christofer S. Tautermann,...
ICIP
2006
IEEE
14 years 9 months ago
Improving H.264/AVC Inter Compression with Multiscale Recurrent Patterns
In this paper we describe the ongoing work on a new paradigm for compressing the motion predicted error in a video coder, referred to as MMP-Video. This new coding algorithm uses ...
Eduardo A. B. da Silva, Murilo B. de Carvalho, Nun...
INTERSPEECH
2010
13 years 2 months ago
Towards a robust face recognition system using compressive sensing
An application of compressive sensing (CS) theory in imagebased robust face recognition is considered. Most contemporary face recognition systems suffer from limited abilities to ...
Allen Y. Yang, Zihan Zhou, Yi Ma, Shankar Sastry
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
13 years 11 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda