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.
High Efficiency Video Coding (HEVC), the latest video standard, provides new algorithmic features that are substantial advances over those in previous standards in order to optimize the coding efficiency. HEVC performs with a high data compression ratio at the same level of video quality when compared to its predecessors, or substantially improved video quality at the same bitrate and it supports...
The High Efficiency Video Coding (HEVC) standard achieves 50% improvement incompression efficiency over the widely used H.264/AVC standard at a cost of much higher complexity. The increase in complexity is due to, among other factors, the time needed to findthe optimal partition structure among the more flexible possibilities for the coding units (CUs) and prediction units (PUs). Many classification...
The amortized communication complexity of functions f : {0, 1,…, m − 1} × {0, 1,…, m − 1} having an all-zero row and and an all-zero column in their function matrix is determined. For m = 2 this yields the set intersection funtion or Boolean “and”, for m = 3 a function mentioned in a problem in [5] arises.
On a given vector X = (x1, x2, , xn) of integers, the range selection (i, j, k) query is finding the k -- th smallest integer in (xi, xi+1, , xj) for any (i, j, k) such that 1 ≤ i ≤ j ≤ n, and 1 ≤ k ≤ j-i+1. Previous studies on the problem kept X intact and proposed data structures that occupied additional O (n ⋅...
We present a new linear time algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length N on an alphabet of size σ, that utilizes only Nlog N + O(σ log N) bits of working space. When the alphabet size is small, this greatly improves the previous best space requirement for linear time LZ77 factorization (Kärkkäinen et al. CPM 2013), which is...
In this paper, we develop a distributed compression technique that has low decoding and encoding computational complexity. The proposed scheme exploits both temporal and spatial correlations between nodes in distributed sensor networks. In case of events occurring, the values of both spatial and temporal might change and the compression technique needs to adjust its rate to the changes automatically...
In this paper, the authors propose a variable length source code that achieves very good performance even for short sequences and has low encoding complexity, although it does not achieve the theoretical limit. Furthermore, the performance can be predicted for infinite codeword length with close form expressions, and has been proven to be good even when a suboptimum decoder with very low complexity...
Summary form only given. In this paper we propose a video coding optimization strategy for H.264/AVC encoder which uses HVS (Human Visual System) theory to improve the visual quality. It is based on a basic rule that sensitivity of distortion is different according to the image property. Most existing coding strategies which allocate fixed parameters to each unit within a frame are not reasonable...
Summary form only given. In this paper, we propose an optimized in painting-based macro block(MB) prediction mode (IP-mode) in the state-of-the-art H.264/AVC video compression engine, and belief propagation (BP) is applied to achieve the global spatio-temporal consistency between the predicted content and the co-located known region. To decrease the computing complexity of the iterative BP algorithm,...
Compressive sensing (CS) is recently and enthusiastically promoted as a joint sampling and compression approach. The advantages of CS over conventional signal compression techniques are architectural: the CS encoder is made signal independent and computationally inexpensive by shifting the bulk of system complexity to the decoder. While these properties of CS allow signal acquisition and communication...
In this paper, a novel algorithm called spatially varying transform (SVT) is proposed to improve the coding efficiency of video coders. SVT enables video coders to vary the position of the transform block, unlike state-of-art video codecs where the position of the transform block is fixed. In addition to changing the position of the transform block, the size of the transform can also be varied within...
Distributed Video Coding (DVC) is a popular topic in the research community and the past years have seen several different implementations. DVC has been proposed as a solution for applications that have limited battery resources and low hardware complexity, thus necessitating a low complexity encoder. An ideal application would be in remote surveillance/monitoring or live video conferencing. However,...
In this paper, an efficient search center definition algorithm is proposed for H.264/AVC. H.264/AVC achieved high coding efficiency by introducing some new coding tools including a new definition of the search center. However, the definition of the search center is not efficient in the case of significant motions. This work proposes some new search center candidates using spatial and temporal correlations...
In the popular video coding trend, the encoder has the task to exploit both spatial and temporal redundancies present in the video sequence, which is a complex procedure; As a result almost all video encoders have five to ten times more complexity than their decoders. In a video compression process, one of the main tasks at the encoder side is motion estimation which is to extract the temporal correlation...
This paper proposes an efficient algorithm for the compression, prioritized transmission and progressive rendering of circular light field (CLF) for ancient Chinese artifacts. It employs wavelet coder to achieve spatial scalability and divide the compressed data into a lower resolution base layer and an additional enhancement layer. The enhancement layer is coded as in JPEG2000 into packets where...
Compact representation of integer values is a key feature for data compression. A compressed representation allows us to store more integers within less space, and therefore, to work in faster hierarchies of memory. Adaptive searching yields to compressed representations of integers. In scenarios where the cost of updating the encoding is high, approaches to perform operations over integers dynamically...
We implement a text-classification engine on a single FPGA chip running on a 50 Mhz clock. It is based on arithmetic coding data compression. The text classifier is based on the non-parametric nearest-neighbor algorithm. It computes a compression-based distance between two text files. We have devised a parallel hardware architecture for the computation of the tag-interval that encodes the data sequence...
Recently, Distributed Video Coding (DVC) has been actively studied as a solution to the growing demands on light video encoder. However, DVC shifts the complexity from the encoder to the decoder side, and in some applications it needs unacceptably long decoding time and/or big computing power. In this paper, we propose a Wyner-Ziv (WZ) video coding which extracts fast moving regions called Region-Of-Interest...
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...
For image and video compression standards, one image is divided into a serial of non-overlapped blocks. Detecting edge existence and analyzing the edge direction in a block level is useful in the applications, such as perceptually improved coding, MB encoding mode decision, blocking artifacts reduction, content-based retrieval, senses changing detection, etc. This paper proposes a novel Fast Block...
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.