Sciweavers

4212 search results - page 151 / 843
» On Compressible Pairings and Their Computation
Sort
View
CRYPTO
2006
Springer
129views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
New Proofs for
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
Mihir Bellare
TCSV
2008
124views more  TCSV 2008»
15 years 6 months ago
A Block-Edge-Pattern-Based Content Descriptor in DCT Domain
In this correspondence, we describe a robust and effective content descriptor based on block edge patterns extracted directly in DCT domain, which is suitable for applications in J...
Jianmin Jiang, Kaijin Qiu, Guoqiang Xiao
TCSV
2010
15 years 1 months ago
Compressed Domain Video Object Segmentation
We propose a compressed domain video object segmentation method for MPEG or MPEG-like encoded videos. Computational superiority is the main advantage of the compressed domain proc...
Fatih Murat Porikli, Faisal I. Bashir, Huifang Sun
DCC
2010
IEEE
16 years 1 months ago
Block Compressed Sensing of Images Using Directional Transforms
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
Sungkwang Mun, James E. Fowler
CVPR
2010
IEEE
15 years 4 months ago
Compression of surface registrations using Beltrami coefficients
Surface registration is widely used in machine vision and medical imaging, where 1-1 correspondences between surfaces are computed to study their variations. Surface maps are usua...
Lok Ming Lui, Tsz Wai Wong, Paul M. Thompson, Tony...