78 search results - page 8 / 16 » Attacking Some Perceptual Image Hash Algorithms |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
A significant effort has been put in designing watermarking algorithms during the last decade. But today, the watermarking community needs some advanced attacks and fair benchmark...
APGV
2004
ACM
14 years 1 months ago
2004
ACM
Motivated by the need for an informative, unbiased and quantitative perceptual method for the development and evaluation of a talking head we are developing, we propose a new test...
SMI
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper presents a benchmarking system for the evaluation of robust mesh watermarking methods. The proposed benchmark has three different components: a "standard" mesh...
FSE
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...