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.
This work presents the Edge-Aware Depth Motion Estimation (E-ADME), a complexity reduction scheme developed for depth maps coding on 3D High Efficiency Video Coding (3D-HEVC). This scheme focuses on obtaining an execution time reduction while keeping a high quality of the encoded depth map. E-ADME starts classifying each encoding depth block as edge or homogeneous. If the block is classified as an...
We present a set of algorithmic complexity estimates. We derive a normalized semi-distance that is shown to outperform the state-of-the-art. We also propose estimators for causality inference on directed acyclic graphs. Illustrative applications include clustering of human writing systems and causality assessment on novel drafts.
High Efficiency Video Coding (HEVC) employs the complex rate-distortion optimization (RDO) to choose the optimal mode decison which leads to the drastical increase of computation complexity. In order to solve the problem, this paper proposed a new RD estimation method for HEVC intra mode decision that uses transformed coefficients to do the rate-distortion optimization. For the rate part, the method...
In this paper, the high throughput hardware architecture is designed to calculate the Sum of Absolute Difference (SAD) based on the variable block size of the image. Even though the fixed block size motion estimation is simple with respect to the complexity of the variable block size motion estimation, variable block size estimation technique results in exquisite performance. Motion estimation is...
In order to improve the error resistance and security of JPEG2000 standard, a joint source channel and security arithmetic coding/decoding scheme for EBCOT in JPEG2000 is proposed. Based on error resistant arithmetic coding, this scheme inserts multiple forbidden symbols and generates secure two-way decodable bitstream controlled by chaotic maps, improving the security of the scheme. Meanwhile, at...
In order to reduce the computational complexity of the intra prediction module in HEVC, this paper proposes an optimization method for intra prediction mode selection. First, the size of the prediction block PU in HEVC is obtained. For 4×4 size PU block, the prewitt operator is used to extract the texture direction. Then, we judge whether the texture direction is obvious or not. If it is obvious,...
Plagiarism has become an increasing problem in higher education in recent years. Coding style can be used to detect source code plagiarism that involves writing and deciding the structure of the code which does not affect the logic of a program, thus offering a way to differentiate between different code authors. This paper focuses to identify whether a data set consisting of student programming assignments...
The High Efficiency Video Coding (HEVC) standard significantly saves coding bit-rate over the proceeding H.264 standard, but at the expense of extremely high encoding complexity. In fact, the coding tree unit (CTU) partition consumes a large proportion of HEVC encoding complexity, due to the brute-force search for rate-distortion optimization (RDO). Therefore, we propose in this paper a complexity...
The latest video coding standard, HEVC, uses quarter pixel motion vector (MV) resolution for motion compensation. The adaptation of MV resolution supported by PMVR (progressive MV resolution) brings further improvement of the performance, by progressively adjusting the resolution according to the distance between the MV and the MV predictor (MVP). In this work, we propose to improve PMVR by adapting...
Intra prediction plays an important role in H.264/AVC. The mode fast decision is a significant factor for video coding efficiency in current video coding standard. Therefore, in this paper, the authors propose a method with equivalent Mean Square Error (Eq-MSE) to choose the prediction mode quickly to save coding resource. According to the frame texture characteristics, the authors choose the block...
We consider the problem of encoding a finite set of vectors into a small number of bits while approximately retaining information on the angular distances between the vectors. By deriving improved variance bounds related to binary Gaussian circulant embeddings, we largely fix a gap in the proof of the best known fast binary embedding method. Our bounds also show that well-spreadness assumptions on...
Emerging high-efficiency video coding (HEVC) outperforms H.264 by a gain of 50% bitrate reduction while maintaining almost the same perceptual quality. However, it induces higher coding complexity due to its adoption of recursive block partitioning mechanism in motion estimation (ME) with a fixed search range. For an objective of reducing the computational burden in HEVC, this paper proposes an adaptive...
A new high-performance VLSI architecture for least mean square (LMS) adaptive filter using distributed arithmetic (DA) is presented. It is based on storing possible filter partial products in a look-up table (LUT) followed by a shiftaccumulation (SA) unit. Usually, all the address location of LUT need to be re-calculated in every iteration. In this paper, we proposed a new strategy for updating the...
Orthogonal frequency division multiplexing with index modulation (OFDM-IM) is a newly proposed technique, which achieves significantly improved performance in comparison with classical OFDM by using the indices of active subcarriers to carry additional information bits. In this paper, we propose two power allocation (PA) algorithms for the sake of further improving the bit error rate (BER) performance...
We extend Kawamura and Cook's framework for computational complexity for operators in analysis. This model is based on second-order complexity theory for functionals on the Baire space, which is lifted to metric spaces via representations. Time is measured in the length of the input encodings and the output precision.
Fountain codes are used in many applications where the channels are time varying and it is difficult at the transmitter to predict the appropriate code rate. In this situation, fixedrate codes are not suitable. Despite the good performance of fountain codes, universally optimal codes do not exist in the finite-length regime. In this paper, we design new fountain codes that are robust to the communication...
This paper addresses the problem of Approximate Nearest Neighbor (ANN) search in pattern recognition where feature vectors in a database are encoded as compact codes in order to speed-up the similarity search in large-scale databases. Considering the ANN problem from an information-theoretic perspective, we interpret it as an encoding, which maps the original feature vectors to a less entropic sparse...
A concatenated soft-decision channel coding scheme consisting of an inner LDGM code and an outer staircase code is proposed. The soft-decision LDGM code is used for error reduction while the majority of bit errors are corrected by the low complexity hard-decision staircase code. Decoding complexity of the concatenated code is quantified by a score based on the number of edges in the LDGM code Tanner...
We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly...
We consider the problem of polar coding for transmission over a non-stationary sequence of independent binary-input memoryless symmetric (BMS) channels {Wi}∞i=1 where the i-th encoded bit is transmitted over Wi. We show, for the first time, a polar coding scheme that achieves the average symmetric capacity Ī({Wi}∞i=1) def= limN→∞ 1/N NΣi=1 I(Wi) assuming that the limit exists. The polar coding scheme...
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.