Filters








465 Hits in 2.9 sec

Page 719 of Mathematical Reviews Vol. , Issue 2001A [page]

2001 Mathematical Reviews  
A survey on quasi-cyclic and quasi-twisted optimal codes is included.”  ...  In this paper, we give asymptotically tight bounds on the key equivocation rate for ALIB encipherers.”  ... 

SNR Maximization Hashing

Honghai Yu, Pierre Moulin
2015 IEEE Transactions on Information Forensics and Security  
We first motivate this approach under a Gaussian model for the underlying signals, in which case maximizing SNR is equivalent to minimizing the robust hashing error probability.  ...  We propose a novel robust hashing algorithm based on signal-to-noise ratio (SNR) maximization to learn compact binary codes, where the SNR metric is used to select a set of projection directions, and one  ...  In particular, for a N (0, σ 2 ) source, the rate distortion function R(D) = 1 2 log σ 2 D gives the minimum bit rate needed to describe the source with MSE not exceeding D [35] .  ... 
doi:10.1109/tifs.2015.2436871 fatcat:wdwjhhwldbhj3p33fiv7c2myum

PolarSig: An efficient digital signature based on polar codes

Pouyan Forghani, Masoumeh Koochak Shooshtari, Mohammad Reza Aref
2020 IET Communications  
CFS uses a counter to produce decodable syndromes or the complete decoding technique that imposes some extra computational cost to the signing algorithm for many choices of codes.  ...  Construction of secret code Using Procedure 1 for constructing a polar code that can achieve rate-distortion bound for BSS 1/2 ends up with a unique code for each set of N, k and a specific distortion  ...  According to Example 1, due to achieving symmetric rate-distortion, Polar codes can achieve rate-distortion bound as well.  ... 
doi:10.1049/iet-com.2019.0578 fatcat:xuouzim7dnbj7g7yxknnos7ob4

The problem with the SURF scheme [article]

Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich
2017 arXiv   pre-print
This problem turns out to be easy in the regime of parameters needed for the SURF scheme to work. We give afterwards the old version of the paper for the reader's convenience.  ...  Acknowledgments We would thank André Chailloux for a careful reading of a preliminary version of this paper [DST17] , for finding an error in the security proof and for suggesting Proposition 5 to fix  ...  Fig. 4 . 4 Comparison of the Optimal Signature Distortion with or without the Rejection Sampling Method, the Gilbert-Varshamov Bound and the Generic Distortion , s1, . . . , sq ∈ F Case 1 : 1 P(p 0  ... 
arXiv:1706.08065v4 fatcat:6bwz4u5kbff2napx33zbpnmmem

Anonymous Publication of Sensitive Transactional Data

Gabriel Ghinita, Panos Kalnis, Yufei Tao
2011 IEEE Transactions on Knowledge and Data Engineering  
Existing techniques work well for fixedschema data, with low dimensionality.  ...  We propose two categories of novel anonymization methods for sparse high-dimensional data.  ...  A hashing algorithm for binary data, the same that we use in our anonymization method, is then applied.  ... 
doi:10.1109/tkde.2010.101 fatcat:nw4qep2fajhgpjvuwdztmoltey

Wyner-Ziv video coding for wireless lightweight multimedia applications

Nikos Deligiannis, Frederik Verbist, Athanassios C Iossifides, Jürgen Slowack, Rik Van de Walle, Peter Schelkens, Adrian Munteanu
2012 EURASIP Journal on Wireless Communications and Networking  
of temporal correlation (which is of crucial importance in the context of endoscopic video content), and the high compression performance make the proposed distributed video codec a strong candidate for  ...  Daniel Urbain, head of the Gastroenterology clinic of the Universitair Ziekenhuis Brussel for providing numerous endoscopic video sequences.  ...  ), the hash and the key-frame rate to the total rate of the proposed system for (a) Foreman and (b) Soccer.  ... 
doi:10.1186/1687-1499-2012-106 fatcat:kfpsmeoid5hhjgix35asc7qvze

Anonymizing Unstructured Data [article]

Rajeev Motwani, Shubha U. Nabar
2008 arXiv   pre-print
We define an optimization problem that arises from this definition of anonymity and provide O(klogk) and O(1)-approximation algorithms for the same.  ...  We formalize the notion of k-anonymity for set-valued data as a variant of the k-anonymity model for traditional relational datasets.  ...  ACKNOWLEDGEMENTS The authors would like to thank Tomas Feder, Evimaria Terzi and An Zhu for many useful discussions.  ... 
arXiv:0810.5582v2 fatcat:przldunth5d3hctxsypvs74ula

On Compressing Encrypted Data

M. Johnson, P. Ishwar, V. Prabhakaran, D. Schonberg, K. Ramchandran
2004 IEEE Transactions on Signal Processing  
counter-intuitive, we show surprisingly that, through the use of coding with side information principles, this reversal of order is indeed possible in some settings of interest without loss of either optimal  ...  Hence, W-Z cryptosystems are optimal in every sense for Gaussian sources and squared error distortion.  ...  We are also working on the related problem of image hashing. In this problem, it is desired to map an image to a binary hash value in a secure manner.  ... 
doi:10.1109/tsp.2004.833860 fatcat:lex7z4mzhjdlndoo7mfp2aayju

A Secure Crypto based ECG Data Communication using Modified SPHIT and Modified Quasigroup Encryption

S. Sujatha, R. Govindaraju
2013 International Journal of Computer Applications  
Modified quasi group encryption which uses genetic algorithm for optimization is used in this approach for improving the Quasigroup performance.  ...  The optimization based approach provides the optimized Quasigroup for encryption which gives better security for the ECG data.  ...  In order to obtain high compression with less distortion, in this paper, Modified SPHIT (MSPIHT) is used for the compression and modified quasi group encryption is used for encryption.  ... 
doi:10.5120/13494-1217 fatcat:qoc3fxci3bajtdwyxo3ihhd7em

2020 Index IEEE Transactions on Image Processing Vol. 29

2020 IEEE Transactions on Image Processing  
., +, TIP 2020 7845-7860 Binary codes Deep Collaborative Multi-View Hashing for Large-Scale Image Search.  ...  ., +, TIP 2020 8988-9001 Model Optimization Boosting Framework for Linear Model Hash Learning.  ... 
doi:10.1109/tip.2020.3046056 fatcat:24m6k2elprf2nfmucbjzhvzk3m

A Novel Approach of 3D Object Watermarking Algorithm using Vertex Normal

Law KumarSingh, Deepak Chaudhry, Gopalji Varshney
2012 International Journal of Computer Applications  
The proposed technique is evaluated for robustness, experimentally by simulating attacks such as introducing noise, smoothing, cropping.  ...  MD5 will be used as a hash function, and hence L will be 128 for implementation if L<128 then make it 128 by adding 1 as binary bit at remaining places.  ...  MD5 will be used as a hash function, and hence L will be 128 for implementation if L 128 then make it 128 by adding 1 as binary bit at remaining places. Hence, let Pi be a stream of 128 bits for Gi.  ... 
doi:10.5120/9689-4128 fatcat:4y7mupeltbf63evhrxyykl4zbq

What if Adversarial Samples were Digital Images?

Benoît Bonnet, Teddy Furon, Patrick Bas
2020 Proceedings of the 2020 ACM Workshop on Information Hiding and Multimedia Security  
Quantization is especially more effective at middle range distortion: For¯= 0.4, the success rate is higher by 10 points.  ...  In the hashed areas, quantization is always the same, independently of . Figure 4 : 4 Trade-off between the classifier loss and the distortion as = ( ) for increasing sorted index .  ... 
doi:10.1145/3369412.3395062 dblp:conf/ih/BonnetFB20 fatcat:m2wila7l5jhjrmlk3ehz47mcaa

Methods for image authentication: a survey

Adil Haouzia, Rita Noumeir
2007 Multimedia tools and applications  
The aim of this paper is to present a survey and a comparison of emerging techniques for image authentication.  ...  Image authentication techniques have recently gained great attention due to its importance for a large number of multimedia applications.  ...  Distortions localization can be achieved by identifying lines and columns for which the hashes are different.  ... 
doi:10.1007/s11042-007-0154-3 fatcat:wwtvlpeyjnck3pj5gcpxakvhfq

To Petabytes and beyond: recent advances in probabilistic and signal processing algorithms and their application to metagenomics

R A Leo Elworth, Qi Wang, Pavan K Kota, C J Barberan, Benjamin Coleman, Advait Balaji, Gaurav Gupta, Richard G Baraniuk, Anshumali Shrivastava, Todd J Treangen
2020 Nucleic Acids Research  
For instance, sketching algorithms such as MinHash have seen a rapid and widespread adoption.  ...  These techniques handle increasingly large datasets with minimal sacrifices in quality for tasks such as sequence similarity calculations.  ...  Rather than avoid hash collisions, open addressing attempts to rearrange elements in the hash table for optimal performance.  ... 
doi:10.1093/nar/gkaa265 pmid:32338745 fatcat:v4julw322nc47kgb7q7urkkkci

For-all Sparse Recovery in Near-Optimal Time [article]

Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2017 arXiv   pre-print
We consider the 'for all' model, in which a single matrix Φ, possibly 'constructed' non-explicitly using the probabilistic method, is used for all signals x.  ...  The best existing sublinear algorithm by Porat and Strauss (SODA'12) uses O(ϵ^-3 k(N/k)) measurements and runs in time O(k^1-αN^α) for any constant α > 0.  ...  ACKNOWLEDGMENTS We thank the anonymous reviewer for the valuable comments and suggestions that greatly contributed to improving this paper.  ... 
arXiv:1402.1726v2 fatcat:aozmpfbnvbdrnmiodkrsyqac4m
« Previous Showing results 1 — 15 out of 465 results