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.
Rate distortion optimization can significantly improve encoder performance in most video coding applications. Taking MPEG-2 as an example, this paper addresses the full rate distortion optimization for the first time by searching the product space of all four free parameters regardless of the computational complexity. An efficient graph-based searching algorithm was extended to the MPEG-2 video coding...
We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both the encoding and the decoding algorithm is O(N log(N)), where N is the blocklength of the code. Our result mirrors Ar??kan's capacity achieving...
High error rate is critical to the wireless video transmission. Our paper tackles the problem of robust video streaming over error-prone channels. Basing on an autoresilient multiple-description coding method and a multi-path transmission strategy, further study is done on the computational complexity of rate-distortion optimization for video coding and transmission. A unitary-optimized operation...
Recently, we proposed canonical inner bounds for a broad class of multiterminal source coding problems, subsuming an array of known results. Computation of those bounds assumes importance in view of open tightness questions, as well as their role as benchmarks, and in other contexts. In this backdrop, as computational algorithms depend exponentially on alphabet sizes of auxiliary random variables,...
We propose a mixed resolution framework based on full resolution key frames and spatial-reduction-based Wyner-Ziv coding of intermediate nonreference frames. Improved rate-distortion performance is achieved by enabling better side-information generation at the decoder side and better rate-allocation at the encoder side. The framework enables reduced encoding complexity by low resolution encoding of...
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.