The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Steganography is a form of secret communication in which a secret message (text, image) is hidden inside a carrier message (text, image). While in cryptography, the goal is to make everything unreadable to the ones who do not know the password, in steganography, on the other hand, the goal is to camouflage a message inside an apparently innocent carrier. In other words, while cryptography conceals...
The paper is focused on use of Pulse Coupled Neural Network (PCNN) in the image steganography based on the research in the field of invariant image recognition. In general, steganography deals with data concealing in the cover mediums which can be freely accessible or transmitted by various communication channels without any restriction. A suitable position of hidden message is crucial for a successful...
Reordering is of a challenging issue in phrase-based statistical machine translation systems. This paper proposed three techniques to optimize classification-based reordering models for phrase-based translation under the bracket transduction grammar framework. First, a forced decoding technique is adopted to learn reordering samples for maximum entropy model training. Secondly, additional features...
This Paper proposes a Novel frame work for reversible data hiding scheme over an encrypted cover medium. Reversible data hiding techniques are gaining huge importance in recent years due to its excellent feature of enabling zero distortion reconstruction of both cover medium information as well as secret data information, while protecting the confidentiality of the payload image information. We propose...
Linear index coding is generally more robust against channel variations as compared to the fixed-to-variable length coding. This paper proposes a novel multi-pass decoding approach to decode linear index coded images. In contrast to the typical one-pass decoding, the proposed scheme harnesses the information recovered in the first decoding pass with the source statistics and utilize it in the subsequent...
We establish the rate region of an extended Gray-Wyner system for 2-DMS (X, Y) with two additional decoders having complementary causal side information. This extension is interesting because in addition to the operationally significant extreme points of the Gray-Wyner rate region, which include Wyner's common information, Gåcs-Körner common information and information bottleneck, the rate region...
The problem of computing the modulo-sum of messages over a finite-field erasure multiple access channel (MAC) is studied, and the role of feedback for function computation is explored. Our main contribution is two-fold. First, a new outer bound on the non-feedback computation capacity is proved, which strictly improves the state of the art [1]. The new outer bound answers a previously unsettled question...
The problem of zero-rate multiterminal hypothesis testing is revisited. A Neyman-Pearson-like test is proposed and its non-asymptotic performance is clarified; for short blocklength, it is numerically examined that the proposed test is superior to a previously known Hoeffding-like test proposed by Han-Kobayashi. For the large deviation regime, it is shown that our proposed test achieves the optimal...
The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression for the ρ-th moment of the list size, which is derived using the relative α-entropy.
We consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized logarithm of the empirical average of the exponentiated code length. Since the probabilistic CGF is minimized in terms of the Renyi entropy of the source, one of the...
The capacity region of the class of injective semi-deterministic two-way channels (TWCs) is investigated in this paper. To characterize this capacity, two conditions under which Shannon's bounds on the capacity region of TWCs are tight are first given. Using those conditions, it is shown that the capacity of this class of TWCs is characterized by the rectangle formed by the one-way capacities. This...
Whether superposition (source separation) Is optimal for the asymmetric multilevel diversity coding systems (AMDCS) with perfect secrecy is answered in this paper by studying a non-trivial example. Threshold perfect secrecy is added to the AMDCS model. The eavesdropper may have access to any one but not more than one subset of the channels but can get nothing about the sources, as long as the size...
This paper gives upper and lower bounds on the minimum error probability of Bayesian M-ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order α. The improved tightness of these bounds over their specialized versions with the Shannon conditional entropy (α = 1) is demonstrated. In particular, in the case where M is finite, we show how to generalize Fano's inequality...
Data movement to and from off-chip memory dominates energy consumption in most video decoders, with DRAM accesses consuming 2.8x–6x more energy than the processing itself. We present a H.265/HEVC video decoder with embedded DRAM (eDRAM) as main memory. We propose the following techniques to optimize data movement and reduce the power consumption of eDRAM: 1) lossless compression is used to store reference...
This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed...
Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes vector quantization, and where the decoder bases its decision only on the compressed codewords and the channel output, which is in turn, the channel's response to the transmission of an original codeword, before compression....
Multiple parties observe correlated data generated independently and identically (in time) from a known joint distribution. Parties communicate with each other interactively to enable each party to recover the data observed by all the other parties and attain omniscience. We characterize the asymptotic growth of the number of bits of interactive communication required by the parties to attain omniscience...
We study a notion of guesswork, where multiple agents intend to launch a coordinated brute-force attack to find a single binary secret string, and each agent has access to side information generated through either a BEC or a BSC. The average number of trials required to find the secret string grows exponentially with the length of the string, and the rate of the growth is called the guesswork exponent...
The corner points of the capacity region of the two-user Gaussian interference channel under strong or weak interference are determined using the notions of almost Gaussian random vectors, almost lossless addition of random vectors, and almost linearly dependent random vectors. In particular, the “missing” corner point problem is solved in a manner that differs from previous works in that it avoids...
We present Marlin, a variable-to-fixed (VF) codec optimized for decoding speed. Marlin builds upon a novel way of constructing VF dictionaries that maximizes efficiency for a given dictionary size. On a lossless image coding experiment, Marlin achieves a compression ratio of 1.94 at 2494MiB/s. Marlin is as fast as state-of-the-art high-throughput codecs (e.g., Snappy, 1.24 at 2643MiB/s), and its compression...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.