• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.269-275
• /
• 2005

In this paper, we propose a new efficient motion vector coding algorithm for the video sequence with slow motion. In the proposed algorithm, the amount of motion for a given video sequence is determined by a Skip_rate parameter. The motion difference for slow motion is encoded with a combined codeword which is generated from the conventional codewords. The simulation results show that the proposed algorithm achieves approximately $15\%$ bits gain compared to the conventional methods. Moreover, additional memory and calculations for statistical observation are not required in the proposed algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.11
• /
• pp.611-616
• /
• 2004

In this paper, we introduce a very fast and efficient fractal coding scheme by using the spatial prediction on ultra-small atomic range blocks. This new approach drastically speeds up the encoding while improving the fidelity and the compression ratio. The affine transformation coefficients between adjacent range blocks induced by this method often have good correlations thereby the compression ratios can further be improved. The proposed method leads to improved rate-distortion performance compared to previously reported pure fractals, and it is faster than other state-of-the-art fractal coding methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.426-445
• /
• 2012

Conventional rate control (RC) schemes for H.264 video coding usually regulate output bit rate to match channel bandwidth by adjusting quantization parameter (QP) at fixed full frame rate, and the passive frame skipping to avoid buffer overflow usually occurs when scene changes or high motions exist in video sequences especially at low bit rate, which degrades spatial-temporal quality and causes jerky effect. In this paper, an active content adaptive frame skipping scheme is proposed instead of passive methods, which skips subjectively trivial frames by structural similarity (SSIM) measurement between the original frame and the interpolated frame via motion vector (MV) copy scheme. The saved bits from skipped frames are allocated to coded key ones to enhance their spatial quality, and the skipped frames are well recovered based on MV copy scheme from adjacent key ones at the decoder side to maintain constant frame rate. Experimental results show that the proposed active SSIM-based frameskip scheme acquires better and more consistent spatial-temporal quality both in objective (PSNR) and subjective (SSIM) sense with low complexity compared to classic fixed frame rate control method JVT-G012 and prior objective metric based frameskip method.

• ETRI Journal
• /
• v.45 no.2
• /
• pp.213-225
• /
• 2023

Physical layer security (PLS) can improve the security of both terrestrial and nonterrestrial wireless communication networks. This study proposes a simplified framework for nonterrestrial cyclic prefixed orthogonal variable spreading factor (OVSF)-encoded multiple-input and multiple-output nonorthogonal multiple access (NOMA) systems to ensure complete network security. Various useful methods are implemented, where both improved sine map and multiple parameter-weighted-type fractional Fourier transform encryption schemes are combined to investigate the effects of hybrid PLS. In addition, OVSF coding with power domain NOMA for multi-user interference reduction and peak-toaverage power ratio (PAPR) reduction is introduced. The performance of $\frac{1}{2}$-rated convolutional, turbo, and repeat and accumulate channel coding with regularized zero-forcing signal detection for forward error correction and improved bit error rate (BER) are also investigated. Simulation results ratify the pertinence of the proposed system in terms of PLS and BER performance improvement with reasonable PAPR.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.15 no.2
• /
• pp.1-7
• /
• 1978

In this paper, a preliminary structural analysis of the information source of HANGEUL is performed statistically. And the results of the analysis are utilized to a KS HAHGEUL code, improving its transmission rate of 14%, on the basis of probability rankings of the fundamental HANGEUL elements. Forthermore Some problems about KS code, a coding method for the HAHGEUL information processing, as well as data entry are realized.

• 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.

• Proceedings of the KOSOMBE Conference
• /
• v.1993 no.11
• /
• pp.175-179
• /
• 1993

A Study on the speech processing and coding strategy for cochlear implants have been developed to create a speech signal processing system which extracts stimulus parameter including formants, pitch, amplitude information. In this study we have presented the method which extracts characteristic information of speech signal and adapt patients with hearing handicap.

• Journal of information and communication convergence engineering
• /
• v.3 no.1
• /
• pp.56-61
• /
• 2005

In this paper, we present a video rate control scheme for storage and delivery in which the time-varying viewing interests are controlled by human gaze. To track the gaze, the pupil's movement is detected using the three-step process : detecting face region, eye region, and pupil point. To control bit rates, the quantization parameter (QP) is changed by considering the static parameters, the video object priority derived from the pupil tracking, the target PSNR, and the weighted distortion value of the coder. As results, we achieved human interfaced visual model and corresponding region-of-interest rate control system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.3
• /
• pp.23-31
• /
• 2010

The increasing demands on low-power, and low-complexity video encoder have been motivating extensive research activities on distributed video coding (DVC) in which the encoder compresses frames without utilizing inter-frame statistical correlation. In DVC encoder, contrary to the conventional video encoder, an error control code compresses the video frames by representing the frames in the form of syndrome bits. In the meantime, the DVC decoder generates side information which is modeled as a noisy version of the original video frames, and a decoder of the error-control code corrects the errors in the side information with the syndrome bits. The noisy observation, i.e., the side information can be understood as the output of a virtual channel corresponding to the orignal video frames, and the conditional probability of the virtual channel model is assumed to follow a Laplacian distribution. Thus, performance improvement of DVC systems depends on performances of the error-control code and the optimal reconstruction step in the DVC decoder. In turn, the performances of two constituent blocks are directly related to a better estimation of the parameter of the correlation channel. In this paper, we propose an algorithm to estimate the parameter of the correlation channel and also a low-complexity version of the proposed algorithm. In particular, the proposed algorithm minimizes squared-error of the Laplacian probability distribution and the empirical observations. Finally, we show that the conventional algorithm can be improved by adopting a confidential window. The proposed algorithm results in PSNR gain up to 1.8 dB and 1.1 dB on Mother and Foreman video sequences, respectively.