Search

The invention provides an adaptive dynamic coding method for track circuits in a high speed railway. The adaptive dynamic coding method for the track circuits in the high speed railway includes the steps that two sections of track circuits form a block section, and multiple block sections form an automatic block track circuit; when multiple train conduct tracking operation on the automatic block track circuit, a train control center adjusts the coding of the automatic block track circuit by electronic coding according to the change of train operating position, train route and status information of each block section in accordance with the principle of minimizing the tracking interval. The adaptive dynamic coding method for the track circuits in the high speed railway has the advantages ofrealizing automatic block of a train in interval tracking operation in a CTCS-3 (Chinese train control system level 3) train control system not by adding any hardware device to the CTCS-3 system but only by improving the TCC (electronic coding algorithm), improving the resolution of the train control system to a train occupied track circuit, and enabling an automatic block system to possess the basic features of virtual block and mobile block.

A method for programming reactive systems, called scenario-based algorithmics, can have several advantages, both in programming and in computer science education. We provide new examples, experiments, and perspectives.

High Efficiency Video Coding (HEVC) is the latest international video coding standard. As an extension of HEVC, scalable HEVC (SHVC) achieves high compression efficiency at the cost of dramatically increased computational complexity. In this paper, a fast Coding Unit (CU) size decision algorithm is suggested for spatial SHVC intra-coding to early terminate the CU size decision process by jointly utilising the inter-layer and spatiotemporal correlations. Furthermore, in order to realise a fast Prediction Unit (PU) intra-mode decision, the mode dependency between the Base Layer (BL) and the Enhancement Layer (EL) is effectively used to remove unlikely coding modes. A fast PU inter-mode decision method is also developed for spatial SHVC inter-coding, in which the degree of motion activity and the PU mode dependency are exploited. Simulation results show that the proposed fast intra-coding algorithm produces a saving in encoding time of up to 72% and the proposed fast inter-coding scheme reduces the encoding time by up to 50% compared with the original SHVC encoder, and the loss in Rate-Distortion (RD) performance is negligible.

This article describes a fast Reed–Solomon encoding algorithm with four and seven parity symbols in between. First, we show that the syndrome of Reed–Solomon codes can be computed via the Reed–Muller transform. Based on this result, the fast encoding algorithm is then derived. Analysis shows that the proposed approach asymptotically requires 3 XORs per data bit, representing an improvement over previous algorithms. The simulation demonstrates that the performance of the proposed approach improves with the increase of code length and is superior to other methods. In particular, when the parity number is 5, the proposed approach is about two times faster than other cutting-edge methods.

In order to adapt to various real-time applications, fast coding algorithms for high efficiency video coding (HEVC) standard maintain a hot research topic in recent years. In this paper, a complexity reduction algorithm based on hierarchical classification for HEVC inter coding is proposed. It consists of five fast algorithms which is accomplished by hierarchical classification trees at coding unit (CU) level, prediction unit (PU) level and transformation unit (TU) level respectively. At the beginning of proposed algorithm, intra features and inter features which describe the texture and context properties of CU, PU and TU are extracted from the training set. Then the classification trees for CU, PU and TU are generated by carefully selecting features and designing the classification criteria. By analyzing the spatiotemporal correlation, two strategies including early termination and early split are applied to fast coding by referring to these classification trees. The objective evaluation demonstrates that the proposed algorithm can significantly reduce coding complexity with little compression loss. Particularly the subjective evaluation based on similarity measurement for color histogram approves that decoded video quality between the original HM16.9 algorithm and the proposed algorithm is nearly identical.

To explore the application of improved variational iterative method in solving fractional differential equations and the effect of DNA coding algorithm based on logistic chaos mapping in image encryption, combining Chebyshev polynomial with variational iterative method, a new algorithm for solving fractional differential equations is proposed. In order to solve the initial value problem, the simulation software is used to compare the approximate solution after the change of values of [Formula: see text] and [Formula: see text] in the solution process to investigate the influence of different parameters on the accuracy of fractional order system. Subsequently, the logistic chaos sequence is used to generate discrete binary sequences, and an image encryption algorithm based on DNA coding is proposed. In order to verify the encryption performance of the proposed algorithm, Matlab simulation software is used to simulate and verify the image encryption processing. The results show that when [Formula: see text] approaches 1, the solution is closer to the exact solution than that when [Formula: see text] approaches 0.5, 0.7, and 0.9; compared with 1, 3, 5, and 7, the constructed algorithm has the highest accuracy when [Formula: see text] value is 9. The simulation results of the fuzzy partial fractional order system show that the chaotic sequence is sensitive to the initial value, and the logistic mapping sequence is suitable for the information encryption of the secure communication system. The simulation results of the image encryption algorithm based on DNA coding show that the algorithm can effectively encrypt the image, and the image histogram after encryption is approximately a horizontal line; slight changes in the initial value will affect the decryption effect of the image; the correlation analysis results show that there is no correlation between adjacent pixels in the image after encryption, which indicates that combining Chebyshev polynomials with variational iteration method can reduce the computational burden and improve the computational accuracy, and the image encryption algorithm proposed in this study can improve the reliability and security of image encryption.

Unpredictable packet loss that occurs in the channel connecting a local sensor and a remote estimator will deteriorate the performance of state estimation. To relieve this detrimental impact, an online linear temporal coding scheme is studied in this paper. If the packet of the last step is lost, a linear combination of the current and the last measurements with proper weights is transmitted; otherwise, only the current data is sent. By virtue of the innovation sequence approach, a linear minimum mean-squared error estimation algorithm is designed. To optimize performance, a novel estimator is also proposed which provides a recursive expression of the error covariances. The proposed two algorithms are proved to be equivalent via a set of transformations. With the aid of some optimization techniques, a recursive algorithm is presented to obtain the optimal coding weight in terms of minimizing the average estimation error covariance.

BACKGROUND AND OBJECTIVE In the context of Vanessa's Law, the medical records department and the pharmacy team of a mother-child hospital collaborated to create a system for coding adverse drug reactions (ADRs). This study was conducted to validate the coding of ADRs by the medical records team. MATERIAL AND METHODS This retrospective descriptive study covered 12 months of coding of hospitalization data by the medical records team (November 1, 2017, to October 31, 2018). The pharmacy team performed twice-monthly analysis to validate the ADR data, based on coded information for drugs and associated clinical manifestations. RESULTS Over the 12-month study period, a total of 755 ADRs were coded by the medical records department (i.e., 2.1 ADRs per day, corresponding to 7.1% of admissions). For 34 (4.5%) of these ADRs, the pharmacy team made a change to the code originally assigned by the medical records department. Eighty-five (11.5%) of the coded ADRs were deemed serious, as defined by Health Canada, but only 13 (15%) of these serious ADRs were reported to the regulatory authority. The new process allowed clinical manifestation codes to be associated with individual drugs in the pharmacy's Med-Echo-Plus® software, which facilitated interpretation of the data. Following this study, coding practices were reviewed, a coding algorithm was developed, and the codes for 18 drugs were clarified. CONCLUSION This study highlights the feasibility of establishing a link between the medical records and pharmacy departments to validate the coding of ADRs. At the study hospital, this linkage has identified serious ADRs, for which reporting will soon be required by Health Canada.

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes for the transmission of text messages is investigated elsewhere. In this study, the authors investigate the RCBQ's performance with Cut-Decoding and 4-Sets-Cut-Decoding algorithms for transmission of images and audio files through a Gaussian channel. They compare experimental results for both coding/decoding algorithms and for different values of signal-to-noise ratio. In all experiments, the differences between the transmitted and decoded image or audio file are considered. Experimentally obtained values for bit-error rate and packet error rate and the decoding speed of both algorithms are compared. Also, two filters for enhancing the quality of the images decoded using RCBQ are proposed.

With the advancement in modern video processing technologies, the requirement of an efficient coding algorithm for compressing the video data in a huge surveillance system is necessary. The video data rate in a surveillance system plays a crucial role in determining the performance of the compression algorithm. In this paper, a novel compression algorithm for effectively compressing the video inputs from the surveillance systems is presented. The traditional methods fail to eliminate the redundancies in the video input, and can’t meet the current requirement standards in the modern technologies. This results in the increased storage requirement for input video and also makes it time-consuming in processing the video input in real time. In order to overcome the above issues, the proposed algorithm made sufficient modification in the traditional run length coding algorithm by encoding the frames and removing the redundancies using the texture information similarity in the surveillance video, thereby achieved a better compression rate of 50% for a huge dataset of surveillance videos when compared to existing methodologies.

PURPOSE To examine the validity of International Classification of Diseases, 10th Revision, (ICD-10) code-based algorithms for herpes zoster (HZ) in the electronic medical record (EMR) of a large, integrated pediatric healthcare network and to examine baseline demographics and chronic comorbidities associated with HZ in a representative pediatric population. METHODS We reviewed the electronic charts of all patients with a single ICD-10 for HZ (B02.xx) as their primary or secondary diagnosis in the EMR of the Children's Hospital of Philadelphia (CHOP) healthcare network from January 2010-March 2019. The positive predictive value (PPV) for a single code for HZ was calculated and alternative algorithms were examined to determine which method resulted in the highest PPV. RESULTS The PPV for a single ICD-10 code was 91.7% (95% CI 80.8-95.4) for definitive and/or probable cases of HZ and 63.9% (95% CI 53.4%-75.5%) for definitive cases alone. Adding a prescription for an antiviral did not improve the PPV. However, adding a new code for rash entered within 1 week of the HZ code increased the PPV to 100% for definitive and/or probable cases but with substantial loss of sensitivity. A high proportion of children with HZ who required inpatient hospitalization had chronic disease (70%) and were on systemic immunomodulatory therapy (50%). CONCLUSIONS HZ can be identified with a high PPV in electronic medical records of children using ICD-10 code alone. These findings lay the foundation for future pharmacoepidemiologic research to better understand risk factors for HZ infection.

Digital Audio Broadcasting (DAB) and all similar systems for digital radio and television broadcasting are inevitably associated with lossy psychoacoustic audio compression. The coding algorithms are continuously being improved. To achieve high sound quality a lower bitrate, required by the broadcasters, is now sufficient. This paper compares the relevant digital audio codecs: MPEG 2 and AAC in three profiles (AAC LC, HE-AAC v1 and HE-AAC v2). The well-known MP3 format is also added for a better comparison. A brief description of the basic functional principles of the codecs is followed by a comparison of their efficiency keeping in mind the subjectively comparable sound quality. The main contribution of this paper is the verification of the relationship of the bitrate level and sound quality in broadcasting environment and the finding out the influence of other, often more significant factors, such as the primary quality of the input recordings and the concatenation of non-entropic coding, on the subjective perception in the digital broadcasting chain. These findings are supported by the results of a unique research analysis providing an insight into which specific audio encoding configurations are used for DAB+ radio broadcasting in practice, in Europe as a whole and in individual European countries.

We give an overview of applications of the rubber method. The rubber method is a coding algorithm that was developed in 2005 by Ahlswede, Deppe and Lebedev for channels with feedback. It was a big surprise that an encoding strategy that reserves one symbol exclusively as a rubber can sometimes reach the capacity of a channel. Since then, generalizations of the algorithm have been developed. These generalizations can be used for special channels. There are also other ideas for modifying the rubber method., Comment: arXiv admin note: substantial text overlap with arXiv:2001.09030

This work proposes a bi-directional intra prediction-based measurement coding algorithm for compressive sensing images. Compressive sensing is capable of reducing the size of the sparse signals, in which the high-dimensional signals are represented by the under-determined linear measurements. In order to explore the spatial redundancy in measurements, the corresponding pixel domain information extracted using the structure of measurement matrix. Firstly, the mono-directional prediction modes (i.e. horizontal mode and vertical mode), which refer to the nearest information of neighboring pixel blocks, are obtained by the structure of the measurement matrix. Secondly, we design bi-directional intra prediction modes (i.e. Diagonal + Horizontal, Diagonal + Vertical) base on the already obtained mono-directional prediction modes. Experimental results show that this work improves 0.01 - 0.02 dB PSNR improvement and the birate reductions of on average 19%, up to 36% compared to the state-of-the-art.

Video coding algorithms attempt to minimize the significant commonality that exists within a video sequence. Each new video coding standard contains tools that can perform this task more efficiently compared to its predecessors. In this work, we form a coarse representation of the current frame by minimizing commonality within that frame while preserving important structural properties of the frame. The building blocks of this coarse representation are rectangular regions called cuboids, which are computationally simple and has a compact description. Then we propose to employ the coarse frame as an additional source for predictive coding of the current frame. Experimental results show an improvement in bit rate savings over a reference codec for HEVC, with minor increase in the codec computational complexity.

Dynamic point clouds and meshes are used in a wide variety of applications such as gaming, visualization, medicine, and more recently AR/VR/MR. This paper presents two extensions of MPEG-I Video-based Point Cloud Compression (V-PCC) standard to support mesh coding. The extensions are based on Edgebreaker and TFAN mesh connectivity coding algorithms implemented in the Google Draco software and the MPEG SC3DMC software for mesh coding, respectively. Lossless results for the proposed frameworks on top of version 8.0 of the MPEG-I V-PCC test model (TMC2) are presented and compared with Draco for dense meshes.

Objective Compare comorbidity identification in Medicare and Veterans Health Administration (VA) data for the purposes of risk adjustment. Data sources Analysis of Medicare and VA datasets for dually-enrolled Veterans receiving care in both settings, fiscal years 2010-2014. Study design A retrospective analysis of administrative data for a national sample of cancer decedents. Data extraction methods Comorbidities were evaluated using Elixhauser and Charlson coding algorithms. Principal findings Clinical comorbidities were more likely to be recorded in Medicare than in VA datasets. Of 42 comorbidities, 36 (86%) were recorded at a different frequency. For example, congestive heart failure was recorded for 22.0% of patients in Medicare data and for 11.3% of patients in VA data (P Conclusion There are large differences in comorbidity assessment across VA and Medicare administrative data for the same patient, posing challenges for risk adjustment.

Video playback on mobile consumer electronic (CE) devices is plagued by fluctuations in the network bandwidth and by limitations in processing and energy availability at the individual devices. Seen as a potential solution, the state-of-the-art adaptive streaming mechanisms address the first aspect, yet the efficient control of the decoding-complexity and the energy use when decoding the video remain unaddressed. The quality of experience (QoE) of the end-users&rsquo, experiences, however, depends on the capability to adapt the bit streams to both these constraints (i.e., network bandwidth and device&rsquo, s energy availability). As a solution, this paper proposes an encoding framework that is capable of generating video bit streams with arbitrary bit rates and decoding-complexity levels using a decoding-complexity&ndash, rate&ndash, distortion model. The proposed algorithm allocates rate and decoding-complexity levels across frames and coding tree units (CTUs) and adaptively derives the CTU-level coding parameters to achieve their imposed targets with minimal distortion. The experimental results reveal that the proposed algorithm can achieve the target bit rate and the decoding-complexity with 0.4% and 1.78% average errors, respectively, for multiple bit rate and decoding-complexity levels. The proposed algorithm also demonstrates a stable frame-wise rate and decoding-complexity control capability when achieving a decoding-complexity reduction of 10.11 (%/dB). The resultant decoding-complexity reduction translates into an overall energy-consumption reduction of up to 10.52 (%/dB) for a 1 dB peak signal-to-noise ratio (PSNR) quality loss compared to the HM 16.0 encoded bit streams.

We propose a new approach to construct optimal zero-error codes, based on the concatenation of words of variable length, taken from a generator set. Two zero-error variable-length coding algorithms, referred to as "variable-length coding" and "intermingled coding" are under study. We characterize their asymptotic performances via linear difference equations, in terms of simple properties of the generator set, e.g. the roots of the characteristic polynomial or the spectral radius of an adjacency matrix. For a specific example, we construct an "intermingled" coding scheme that achieves asymptotically the zero-error capacity of a specific channel graph.A full version of this paper is accessible on ArXiv at: https://arxiv.org/abs/2001.03523

Proteins play a significant part in life processes such as cell growth, development, and reproduction. Exploring protein subcellular localization (SCL) is a direct way to better understand the function of proteins in cells. Studies have found that more and more proteins belong to multiple subcellular locations, and these proteins are called multi-label proteins. They not only play a key role in cell life activities, but also play an indispensable role in medicine and drug development. This article first presents a new prediction model, MpsLDA-ProSVM, to predict the SCL of multi-label proteins. Firstly, the physical and chemical information, evolution information, sequence information and annotation information of protein sequences are fused. Then, for the first time, use a weighted multi-label linear discriminant analysis framework based on entropy weight form (wMLDAe) to refine and purify features, reduce the difficulty of learning. Finally, input the optimal feature subset into the multi-label learning with label-specific features (LIFT) and multi-label k-nearest neighbor (ML-KNN) algorithms to obtain a synthetic ranking of relevant labels, and then use Prediction and Relevance Ordering based SVM (ProSVM) classifier to predict the SCLs. This method can rank and classify related tags at the same time, which greatly improves the efficiency of the model. Tested by jackknife method, the overall actual accuracy (OAA) on virus, plant, Gram-positive bacteria and Gram-negative bacteria datasets are 98.06%, 98.97%, 99.81% and 98.49%, which are 0.56%-9.16%, 5.37%-30.87%, 3.51%-6.91% and 3.99%-8.59% higher than other advanced methods respectively. The source codes and datasets are available athttps://github.com/QUST-AIBBDRC/MpsLDA-ProSVM/.

In order to solve the problem that the A-law 13 polyline coding algorithm lacks a specific programming language simulation, C language is used to implement the algorithm in this paper. First, the polar code is obtained according to the positive and negative sample values. Then the paragraph code and the inner code are obtained and finally decoded. Experimental results show that the program can realize A-law 13 polyline encoding and decoding, and for a given sample value, it can obtain its 8-bit encoding. Compared with the bit-wise encoding method, the program is more efficient.

En el presente estudio describo y analizo dos objetivos, el primero es sobre la oposición y la equivalencia del algoritmo de codificación del manuscrito Voynich con los métodos conocidos de cifrado del período medieval. Según los resultados de mi investigación innovadora del manuscrito Voynich, este fue escrito en gallego medieval (gallego-portugués). Su algoritmo de codificación fue influenciado por el cifrado de sustitución del uso de un cifrado polialfabético para la mayor parte de su texto, así como definitivamente fue influenciado por el cifrado de transposición para texto alquímico de cifrado doble. Sin embargo, debe mencionarse que existen diferencias significativas entre los códigos que se usaron en el período medieval y el algoritmo codificado del manuscrito Voynich. Por la razón que hizo que el descifrado fuera más complicado a lo largo de los siglos, el cifrado por sustitución de un cifrado polialfabético se usó en parte y simultáneamente con cifrado monoalfabético, además del texto sin codificar. Por lo tanto, lo principal a tener en cuenta es que el segundo objetivo de mayor interés en este artículo en particular son partes de los textos del manuscrito de Voynich –marginalias– que no se cifraron en absoluto y su lectura.

The authors propose a new type of classification of various anatomical variants of venous return from the right half of the colon based on the application of the principles of topology and combinatorics. The article presents data obtained from the topographic and anatomical study of the venous return from the right hemicolon collected from anatomical material (25 observations), and describes the coding algorithm in each case, allocating it to a particular class according to the proposed classification. A block diagram of a software package for semi-automatic retopology of venous return from the right half of the colon is also proposed.

In order to tackle the exclusive characteristic in the screen content video, new coding tools such as intra block copy mode and palette mode are adopted in the screen content coding (SCC) based on high efficiency video coding (HEVC) standard. It results in high coding complexity for SCC and is hard to satisfy real time applications. An efficient intra coding algorithm for screen content video is proposed in this paper. Early skipping or early termination of coding unit (CU) partition and mode prediction is applied to speed up intra coding by exploiting the correlated information among luminance, gradient and neighboring CUs. Furthermore, the correlated information of hit rate and coding bit is revealed and properly used for fast CU depth decision. Experimental results demonstrate that the proposed algorithm obtains significant time saving with ignorable compression loss in comparison with several recent algorithms.

The 3D extension of High Efficiency Video Coding (3D-HEVC) is the latest international 3D video coding standard, which enhances the compression efficiency of 3D videos with multi-view plus depth (MVD) format. However, it is at the cost of increasing coding complexity. Therefore, this paper proposes a fast inter-prediction algorithm based on depth segmentation for the depth coding of 3D-HEVC to reduce the coding complexity of the depth map. We aim to reduce the coding time by efficiently utilizing the properties of the depth map. First, the proposed algorithm divides a depth map into background, middle ground and foreground, based on automatic thresholding technique. Then, we adjust the search range according to the classification of the coding tree unit (CTU). In addition, an early termination decision by utilizing the correlation of spatial, temporal, and inter-view neighboring CTUs and a fast prediction unit mode decision are also proposed to reduce coding time. The experimental results show that the proposed algorithm can reduce the depth coding time and still maintain good video quality.

The latest High Efficiency Video Coding (HEVC) standard only requires 50% bitrate of the H.264/AVC at the same video quality. Due to introduction of more advanced coding tools and techniques, its computational complexity rises rapidly. In this paper, we propose a novel fast Intra coding algorithm. Firstly, a novel feature is proposed to measure the complexity of video content based on the analysis of mode information obtained from a previous frame. Then, a model is built based on the relationship between this feature and Coding Tree Unit (CTU) depth range. According to the model, the unnecessary operations of Coding Unit (CU) split are skipped. Secondly, the correlation between CU distribution structure and mode selection is established. For the prediction of unlikely CU, the last few intra modes in candidate list are eliminated before rate-distortion optimization process. Experimental results demonstrate that the proposed algorithm reduces the encoding time by 43.2% with just 0.47% BD-rate increase compared with HEVC test model. Compared with other state-of-art algorithms, the proposed algorithm achieves better trade-off between complexity reduction and RD performance.

The evolution of social network and multimedia technologies encourage more and more people to generate and upload visual information, which leads to the generation of large-scale video data. Therefore, preeminent compression technologies are highly desired to facilitate the storage and transmission of these tremendous video data for a wide variety of applications. In this paper, a systematic review of the recent advances for large-scale video compression (LSVC) is presented. Specifically, fast video coding algorithms and effective models to improve video compression efficiency are introduced in detail, since coding complexity and compression efficiency are two important factors to evaluate video coding approaches. Finally, the challenges and future research trends for LSVC are discussed.

In traditional coding algorithm, sampling and compressing are used to reduce the utilization of sampling data, without taking into account the visual redundancy of human eyes. Therefore, a hybrid coding algorithm based on wavelet zero tree and fractal is proposed. Firstly, the concept of wavelet zero tree and fractal is explained. According to the gradient formula, the blocks of video image after segmentation are divided into 3 kinds, and the coding of image blocks is transformed into wavelet domain. At the same time, the wavelet coefficients of all the restored wavelet coefficients are transformed to obtain the reconstructed image. The experimental results show that the algorithm enlarges the range of search space, enriches the diversity of coding, and improves the global search ability of the algorithm, which has some application value.

Structured lighting (SL) scanning technology has been successfully applied to reconstruct personalized avatars, providing high-quality geometry for the face and body. However, previous white SL methods have typically been unable to capture and reconstruct hair geometry, preventing a complete, realistic avatar surface from being reconstructed. In this paper, we propose a novel hair capture system, producing a full-head manifold with complete hair, based on four white SL scanners made by ourselves. The key technical contribution is a robust strip-edge-based coding algorithm, using a projection pattern of 18 stripes; it allows geometric acquisition to an accuracy of 1 mm. Experiments are given to show that our system produces high-quality hair geometry, comparable to that captured by more expensive state-of-the-art multiview stereo systems. Our system is however easier to configure, and is more suited to real-world setups.

To achieve more accurate navigation performance in the landing process, a multi-resolution visual positioning technique is proposed for landing assistance of an Unmanned Aerial System (UAS). This technique uses a captured image of an artificial landmark (e.g. barcode) to provide relative positioning information in the X, Y and Z axes, and yaw, roll and pitch orientations. A multi-resolution coding algorithm is designed to ensure the UAS will not lose the detection of the landing target due to limited visual angles or camera resolution. Simulation and real world experiments prove the performance of the proposed technique in positioning accuracy, detection accuracy, and navigation effect. Two types of UAS are used to verify the generalisation of the proposed technique. Comparison experiments to state-of-the-art techniques are also included with the results analysis.

High efficiency video coding (HEVC) achieves higher coding efficiency than previous standards but introduces a large computational complexity. Because HEVC adopted some new advanced tools and the most prominent one is the flexible hierarchical coding structures which include coding unit (CU), prediction unit (PU), transform unit (TU). All of those units must be test through rate-distortion optimisation. Since the CU is highly content dependent it is not efficient to test all the modes. In this study, the authors propose a fast coding algorithm for HEVC based on video contents. The authors statistically analysis the features of video contents from three aspects, the pixel gradient, the block mean value, and the block variance of CU. Then, jointly use these features with the CU depth levels and the prediction modes of spatiotemporal adjacent CUs to realise fast CU depth level decision and fast prediction mode decision. The experimental results show that the proposed algorithm can save 58.9 and 57.6% computational complexity on average with only average 1.8 and 1.9% bitrate losses under ‘random access, main’ and ‘low-delay, main’ conditions, respectively.

A fast intra coding algorithm based on rough mode cost (RMC) is proposed for HEVC.Image complexity and gradient are considered.RMC values for fast CU depth decisions and RMC ratio for fast PU intra mode decisions.Fast TU depth decisions using the TU partition of the mode with the least RMC outperform the default method. The quadtree-based coding unit (CU) and transform unit (TU) structure, as well as various prediction units (PUs) of HEVC, considerably increase encoding complexity in intra coding and inter coding. This paper proposes a rough mode cost (RMC)-based algorithm for accelerating CU/TU depth decisions and PU mode decisions in HEVC intra coding. For CU depth decisions, RMC values are used for the fast determination of CU partition. In the case of PU mode decisions, modes with higher RMCs are removed from the candidate list to reduce the number of test modes. For TU depth decisions, the TU partition of the mode with the least RMC is used to determine the TU partitions of remaining modes. The proposed TU partitioning method demonstrates superior performance to the default method in reference software. The proposed algorithm can reduce encoding time by approximately 51% on average, with a 0.69% increase in the Bjntegaard-Delta (BD) rate.

As the newest video coding standard, High Efficiency Video Coding (HEVC) greatly enhances the encoding performance of H.264/AVC. However, HEVC also has high computational complexity, which limits application of this new standard. In this paper, we propose a fast DEA-based intra-coding algorithm, including block partitioning; prediction mode selection and edge offset (EO) class decision algorithms. The idea behind the proposed algorithm is to utilize the texture characteristics of the encoding image, which are quantified by dominant edge assent (DEA) and its distribution, to reduce the decision space. Specifically, for block partitioning, we propose the most possible depth range (MPDR) and employ DEA to determine whether the current coding block can use the MPDR to predict the partitioning depth or not; for intra-prediction mode selection, we use DEA and its distribution to reduce the range of prediction direction; for the EO class decision, we use DEA to determine the EO class of the sample adaptive offset. We integrate the proposed algorithm into the test model HM 13.0 and present a detailed comparative analysis. Experimental results show that the proposed fast DEA-based intra-coding algorithm reduces the computational complexity of HM 13.0 to about 46% in encoding time with 2.08% increases in the Biontegaard-Delta bitrate (BD-rate). Moreover, the proposed algorithm also demonstrates better performance over other state-of-the-art work.

The size of the audio file can affect the time of sending data to be long and can cause waste of storage space. Therefore, compression is performed to compress the contents of the audio file into smaller ones. One of the compression techniques is lossless technique, which is a compression method where the compressed audio file can be returned to the file before it is compressed without losing information on the previous data. This study uses the Interpolative coding algorithm on mp3 audio files. Interpolative coding algorithm is an innovative way to assign dynamic code to data symbols. This method is different from other compression methods, because the code it provides for individual symbols is not static. The design of this system consists of 2 main processes namely the compression process and the decompression process and the process of calculating the performance of Compression Ratio (CR) and Redundancy. The resulting compression results in a new file with the * .ipc extension containing the compressed bit string which can then be decompressed. Application designed only one form, where in the form there is a process for compression and decompression, while the process of compressing the input file has the extension *. MP3 and produces output with the extension * IPC, and the size of the compressed audio file is smaller than the previous file size .Keywords: Compression, Audio File, Interpolative coding algorithm

The large amount of data that has been stored in memory or hard disk will result in increasing the amount of usage capacity on the storage media. Large file sizes can also affect the time of sending or transferring data between storage media. Therefore humans conduct a study in order to have alternative ways to overcome these problems, one of them is by means of compression techniques. In this research, an image file compression application program was built using the interpolative coding method. In building applications using Visual Basic.Net software. The construction of this application is expected to reduce storage media capacity usage. In this testing phase is done with an image file type that is a test file with RGB color type.Keywords: Compression, Image file, Interpolative Coding Algorithm

The size of the video files is relatively large, long duration and has a good top kulithen it requires a large storage space. With a very large video file size, at the time of the move process could be the process of moving failed because the media storage space exceeds the limit and consume very much quota at the time of transfer. The solution to this problem is how the video file can be compressed to accelerate the process of transferring and saving the video files and saving the quota. In this research, the algorithm used is Interpolative Coding, using the different compression methods-the difference of each value, and the compression results will be profitable, because the delivery will be easier and saves your quota and saves storage space.Keywords: Video File compression, Interpolative Coding algorithm