• The Journal of the Acoustical Society of Korea
• /
• v.21 no.3
• /
• pp.237-244
• /
• 2002

In this paper we mention the optimization of MPEG-4 VM (Moving Picture Expert Group-4 Verification Model) GA (General Audio) AAC (Advanced Audio Coding) encoder and the design of the decoder for PDA (Personal Digital Assistant) using MPEG-4 VM source. We profiled the VMC source and several optimization methods have applied to those selected functions from the profiling. Intel Pentium III 600 MHz PC, which uses windows 98 as OS, takes about 20 times of encoding time compared to input sample running time, with additional options, and about 10 times without any option. Decoding time on PDA was over 35 seconds for the 17 seconds input sample. After optimization, the encoding time has reduced to 50% and the real time decoding has achieved on PDA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1279-1288
• /
• 1997

In this paper, we propose a fast fractal coding method based on LMSE analysis and subblock feature. In the proposed method, scaling paarameter is calculated and whether search for each domain block should be done or not is determined based on the LMSE analysis of fractal approximation, and isometry parameter is chosen based on subblock feature. To investigate the efficiency of the proposed method, we compared it with Jacquin's method on image quality and encoding time. Experimental results show the proposed method yields nearly the same performance as that of Jacquin method in PSNR, and its encoding time is reduced by about 1/7 times.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1868-1871
• /
• 2007

This paper proposes a novel scheme to significantly reduce mode decision time by predicting optimal mode candidates. Unlike previous fast mode decision algorithms computing RDcost in a pre-defined mode order, the proposed scheme predicts optimal mode candidates and calculates their RDcosts first, increasing the possibility to satisfy early-exit conditions sooner, resulting in fast mode decision. This H.264 mode decision time reduction enables small computing power mobile devices to handle H.264 encoding effectively. Extensive simulations show that, when compared with JM10.2, AMD and LCIMS, the proposed scheme boosts H.264 encoding speed by up to 575% with a reasonable image quality degradation.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1665-1670
• /
• 2004

The general fractal image compression provides a high compression rate, but it requires a large encoding time. In order to overcome this disadvantage, many researchers have introduced various methods that reduce the total number of domain blocks considering their block similarities or control the number of searching domain block depending on its distribution. In this paper, we propose a method that can reduce the number of searching domain blocks employing the variance coherence of intensity values and also the number of range blocks requiring the domain block search through the classification of range blocks. This proposed method effectively reduces the encoding time and also a negligible drop of the quality as compared with the previous methods requiring the search of all range blocks.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.669-672
• /
• 1998

In this paper, w epropose a fast fractal coding method based on correlation coefficients of subblocks in input image. In the proposed method, domain pool is selected based on correlation analysis of input image and the isometry transform for each block is chosen based on the IFS method. To investigate the performance of the proposed method, we compared image quality and encoding time with full search PIFS method and jacquin's PIFS method. Experimental results show that proposed method yields nearly the same performance in PSNR, and its encoding time is reduced for images size of 512*512 compared with full search PIFS method and jacquin's PIFS method.

• Journal of Biomedical Engineering Research
• /
• v.17 no.1
• /
• pp.93-98
• /
• 1996

The purpose of this paper is to propose a new localized imaging method of reduced imaging time luting a locally-linear gradient. Since most fast MR(Magnetic Resonance) imaging methods need the whole $\kappa$-space(Spatial frequency space) data corresponding to the whole imaging area, there are limitstions in reducing the minimum imaging time. The imaging method proposed in this paper uses a specially-made gradient coil generating a local ramp-shape field and uniform field outside of the imaging areal Conventional imaging sequences can be used without any RF/gradient pulse sequence modifiestions except the change in the number of encoding steps and the field of view.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.86-96
• /
• 2002

In video conferencing system using H.263 encoding and decoding time is as important as compression rate is. To reduce encoding time, a number of methods were proposed. We use a method of them that reduces the computational complexity in motion estimation. The complexity is determined by three factors, such as a cost function, a search range parameter, and a motion search algorithm. In fact, it takes a lot of time to encode the video data on account of the cost function factor. That's the reason that we use the factor to reduce encoding time. In this paper, we tried to reduce total encoding time by reducing the number of calling the cost function. In case of a little moving, our algorithm enabled faster motion searching than TSS(Three Step Search) and NTSS(New TSS). Here, we called the algorithm by an ITSS(Improved TSS) that improves a shortcoming of NTSS requiring more checkpoints than TSS. For an experimentation, our algorithm was compared to other algorithms using PSNR, file size and SAD call times.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1195-1211
• /
• 2016

The emerging video coding standard High Efficiency Video Coding (HEVC) has shown almost 40% bit-rate reduction over the state-of-the-art Advanced Video Coding (AVC) standard but at about 40% computational complexity overhead. The main reason for HEVC computational complexity is the inter prediction that accounts for 60%-70% of the whole encoding time. In this paper, we propose several fast coding unit (CU) encoding schemes based on the Merge mode and motion estimation information to reduce the computational complexity caused by the HEVC inter prediction. Firstly, an early Merge mode decision method based on motion estimation (EMD) is proposed for each CU size. Then, a Merge mode based early termination method (MET) is developed to determine the CU size at an early stage. To provide a better balance between computational complexity and coding efficiency, several fast CU encoding schemes are surveyed according to the rate-distortion-complexity characteristics of EMD and MET methods as a function of CU sizes. These fast CU encoding schemes can be seamlessly incorporated in the existing control structures of the HEVC encoder without limiting its potential parallelization and hardware acceleration. Experimental results demonstrate that the proposed schemes achieve 19%-46% computational complexity reduction over the HEVC test model reference software, HM 16.4, at a cost of 0.2%-2.4% bit-rate increases under the random access coding configuration. The respective values under the low-delay B coding configuration are 17%-43% and 0.1%-1.2%.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.124-131
• /
• 1997

There have been many demands for th ereal-time image compression. The image compression systems have a wide range of applications. However, real-time encoding is hard to implement because it needs a large amount of computations. In particular, the discrete cosine transform (DCT) and motion estimatio require a large number of arithmetic oeprations compared to other algorithms in MPEG-2. The conventional fasdt DCT algorithms have focused on the reduction of the number of additions more cycles and more expense in realization. Because TMS320C80 has special structure, new approach for implementation of DCT is suggested. The selection of adaptive algorithm and optimization is requried TMS320C80 are analyzed an dsome adaptive DCT algorithms are selected. The DCT algorithms are optimized and implemented. Chens and lees DCT algorithms among various fast algorithms are selected because 1-D approach is effective in the view of th einternal structure of TMS320C80. According to the simulation result, Lees algorithm is more effective in speed and has little difference in precision. On the basis of the result, the possibility of DCT implementation for real-time MPEG-2 system is verified and the required number of the processor, called advanced DSP, is decided for real-time MPEG-2 encoding and decoding.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.508-521
• /
• 2020

We compared a novel encoding Lempel-Ziv complexity (ELZC) with three common complexity algorithms i.e., approximate entropy (ApEn), sample entropy (SampEn), and classic Lempel-Ziv complexity (CLZC) so as to determine a satisfied complexity and its corresponding quality indices for assessing quality of multi-lead electrocardiogram (ECG). First, we calculated the aforementioned algorithms on six artificial time series in order to compare their performance in terms of discerning randomness and the inherent irregularity within time series. Then, for analyzing sensitivity of the algorithms to content level of different noises within the ECG, we investigated their change trend in five artificial synthetic noisy ECGs containing different noises at several signal noise ratios. Finally, three quality indices based on the ELZC of the multi-lead ECG were proposed to assess the quality of 862 real 12-lead ECGs from the MIT databases. The results showed the ELZC could discern randomness and the inherent irregularity within six artificial time series, and also reflect content level of different noises within five artificial synthetic ECGs. The results indicated the AUCs of three quality indices of the ELZC had statistical significance (>0.500). The ELZC and its corresponding three indices were more suitable for multi-lead ECG quality assessment than the other three algorithms.