Sciweavers

1245 search results - page 54 / 249
» Binary Sparse Coding
Sort
View
130
Voted
ICIP
2009
IEEE
15 years 4 days ago
Incremental sparse saliency detection
By the guidance of attention, human visual system is able to locate objects of interest in complex scene. We propose a new visual saliency detection model for both image and video...
Yin Li, Yue Zhou, Lei Xu, Xiaochao Yang, Jie Yang
122
Voted
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
15 years 3 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
TCOM
2010
85views more  TCOM 2010»
14 years 9 months ago
Achieving the rate-distortion bound with low-density generator matrix codes
It is shown that binary low-density generator matrix codes can achieve the rate-distortion bound of discrete memoryless sources with general distortion measure via multilevel quant...
Zhibin Sun, Mingkai Shao, Jun Chen, Kon Max Wong, ...
ICASSP
2011
IEEE
14 years 6 months ago
Random block-angular matrices for distributed data storage
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
Paulo Jorge S. G. Ferreira, Bruno Jesus, Jose Viei...
LCTRTS
2004
Springer
15 years 7 months ago
Link-time optimization of ARM binaries
The overhead in terms of code size, power consumption and execution time caused by the use of precompiled libraries and separate compilation is often unacceptable in the embedded ...
Bruno De Bus, Bjorn De Sutter, Ludo Van Put, Domin...