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.
A locally decodable code encodes a message by a codeword, such that even if the codeword is corrupted by noise, each message bit can be recovered with high probability by a randomized decoding procedure that reads only few bits of the codeword. Recently a new class of locally decodable codes, based on families of vectors with restricted dot products has been discovered. We refer to those codes as...
The requirement to transmit video data over unreliable wireless networks is anticipated in the foreseeable future. Significant compression ratio and error resilience are both needed for applications including tele-operated robotics, vehicle-mounted cameras, sensor network, etc. Block-matching based inter-frame coding techniques, such as MPEG-x and H.26x, do not perform well in these scenarios due...
Novel coding tools have been proposed recently to encode texture and depth maps of multiview images, exploiting inter-view correlations, for depth-image-based rendering (DIBR). However, the important associated bit allocation problem for DIBR remains open: for chosen view coding and synthesis tools, how to allocate bits among texture and depth maps across encoded views, so that the fidelity of a set...
High definition video over IP based networks (IPTV) has become a mainstay in today's consumer environment. In most applications, encoders conforming to the H.264/AVC standard are used. But even within one standard, often a wide range of coding tools are available that can deliver a vastly different visual quality. Therefore we evaluate in this contribution different coding technologies, using different...
In this paper, focusing on a multi-source, two-stage selective decode-and-forward (DF) relaying network in which the multiple sources have a common destination, we propose an effective cooperative relaying transmission scheme via exploiting decentralized distributed space-time block coding (Dis-STBC). This scheme is a unified multi-source cooperative transmission scheme, regardless of the number of...
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arikan. It is shown that polar codes achieve nontrivial perfect secrecy rates for binary-input...
Spectrally Efficient Frequency Division Multiplexing (SEFDM) system proposes enhanced spectrum utilization in contrast to Orthogonal Frequency Division Multiplexing system (OFDM). Spectral efficiency is increased by relaxing the orthogonality condition while maintaining the same transmission rate per individual channel, hence, for the same bandwidth allocation SEFDM offers higher throughput than OFDM...
Jiaguwen or Oracle bone script, which is inscribed on ox bones or tortoise shells of the Shang dynasty in ancient China, is one of the oldest mysterious characters in the world. Along with the rapid development of computer science and information technology, people are eager to deal with Jiaguwen characters just like the way they deal with modern characters. Unfortunately, Jiaguwen characters have...
In this paper, we present a class of LT codes with a novel degree distribution that is distinct from the degree distribution previously described by Luby. We show that with high probability the total size of the packets needed for decoding of these new LT codes is close to the original size of the file. Furthermore, the encoding and decoding complexity of LT codes with this new degree distribution...
Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today's research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive...
In this work, we consider the selection of complexity and rate controlling source coding parameters jointly with transmitter power. Power invested during source encoding can potentially improve coding efficiency while transmission power determines the capacity of the delivery channel. A complexity scalable source encoder is a useful tool during overall system optimization as it allows flexible allocation...
In this paper, we propose a fast mode decision algorithm for intra and inter prediction for H.264/AVC video coding. Here the subband decomposition of the input video is done for the fast mode prediction. To the LL band of the subband decomposition of the video, exhaustive intra prediction is done. To the LH, HL and HH bands selective intra prediction modes are used for the intra prediction. For the...
The technique of variable block-size motion estimation is employed in the H.264 international video coding standard to obtain better compression performance. However, this technique brings about a lot of increase in the computational complexity and thus is very time-consuming. For this reason, a new fast motion estimation mode decision algorithm is proposed in this paper to reduce the computational...
Intra-frame plays a significant role in controlling video quality for H.264/AVC rate control. In this paper, we present an adaptive current buffer fullness ratio-based intra-frame rate control for H.264/AVC. The proposed algorithm adaptively adjusts the quantization step (QP) of the intra-frame by taking current buffer fullness ratio and scene change into consideration. Experimental results show that...
In this paper, we propose a fast intra-prediction mode selection method for JVT video coding standard H.264. The fast mode decision is based on the quantization parameter and the local edge information obtained by calculating the edge histogram parameters. The inclusion of the DC mode is based on the Residual Complexity factor. The proposed method reduces the computational complexity and time considerably...
NAND flash memories are the most widely used non-volatile memories, and data movement is common in flash storage systems. We study data movement solutions that minimize the number of block erasures, which are very important for the efficiency and longevity of flash memories. To move data among n blocks with the help of ?? auxiliary blocks, where every block contains m pages, we present algorithms...
The complexity of the MPEG-2 encoding algorithm is investigated in this paper. A single constraint syntax i.e., the mdn profile & main level, is considered. The results of the study provide the minimum requirement for a hardware solution to perform real-time MPEG-2 encoding. Using a state-of-the-art Video DSP, a mapping of the MPEG-2 algorithm is proposed. Execution times for each functional block...
This paper presents a joint coding scheme for multiprogram video transmission in which the channel capacity is distributed among the programs according to the program complexities.
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.