• Journal of Internet of Things and Convergence
• /
• v.8 no.4
• /
• pp.41-47
• /
• 2022

Smoothing is a transmission plan that converts video data stored at a variable bit rate into a fixed bit rate. Algorithms for smoothing include CBA, which aims to minimize the number of transmission rate increases, MCBA, which minimizes the number of transmission rate changes, and MVBA algorithms that minimize the amount of transmission rate change. This paper compares the proposed algorithm with the CBA algorithm with various video data, buffer size, and performance evaluation factors as a follow-up to the proposed smoothing algorithm that minimizes (maximizes) the transmission rate increase (decrease) when the server requires more bandwidth The evaluation factors used were compared with the number of changes in the fps rate, the minimum fps, the average fps, fps variability, and the number of frames to be discarded. As a result of the comparison, the proposed algorithm showed superiority in comparing the number of fps rate changes and the number of frames discarded.

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.53-58
• /
• 2022

Smoothing is a transmission plan that converts video data stored at a variable bit rate into a constant bit rate. In the study of [6-7], when a data rate increase is required, the frame with the smallest increase is set as the start frame of the next transmission rate section, when a data tate decrease is required. the frame with the largest decrease is set as the start frame of the next transmission rate section, And the smoothing algorithm was proposed and performance was evaluated in an environment where network traffic is not considered. In this paper, the smoothing algorithm of [6-7] evaluates the adaptive CBA algorithm and performance with minimum frame rate, average frame rate, and frame rate variation from 512KB to 32MB with E.T 90 video data in an environment that considers network traffic. As a result of comparison, the smoothing algorithm of [6-7] showed superiority in the comparison of the minimum refresh rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11B
• /
• pp.1879-1883
• /
• 2000

디지털 자기 기록 저장기기에서 채널 밀도가 증가하면 심각한 인접심볼 간섭과 비선형 왜곡이 야기된다. 본 논문에서는 심각한 비선형 인접심볼 간섭과 비선형 왜곡을 극복하기 위한 방법으로 기존의 등화기 대신 NLTE(neural linear transversal equalizer)를 등화기로 사용하고 검출기로는 터보 코드를 사용한 NLTE/TC 구조를 제안한다. 채널 밀도 S=2.5에서 부분 삭제가 0.7 정도 존재할 때, 코드율이 8/9일 때는 $10^{-5}$의 비트 에러율을 18dB 이후에서 만족하며, 코드율이 16/17일 때는 20dB 이후에서 만족함을 알 수 있었다. 채널 밀도 S=3에서 부분 삭제가 0.6 정도 존재할 때 코드율이 8/9일 때는 $10^{-5}$의 비트 에러율을 22dB 이후에서 만족하고, 코드율이 16/17일 때는 24dB 이후에서 만족함을 확인할 수 있었다.

• Journal of Internet Computing and Services
• /
• v.19 no.6
• /
• pp.1-7
• /
• 2018

This paper present an 8kbps ACLMS-MPC(Amplitude Compensation and Least Mean Square - Multi Pulse Coding) coding method integrated with ACFBD-MPC(Amplitude Compensation Frequency Band Division - Multi Pulse Coding) and LMS-MPC(Least Mean Square - Multi Pulse Coding) used V/UV/S(Voiced / Unvoiced / Silence) switching, compensation in a multi-pulses each pitch interval and Unvoiced approximate-synthesis by using specific frequency in order to reduce distortion of synthesis waveform. In integrating several methods, it is important to adjust the bit rate of voiced and unvoiced sound source to 8kbps while reducing the distortion of the speech waveform. In adjusting the bit rate of voiced and unvoiced sound source to 8 kbps, the speech waveform can be synthesized efficiently by restoring the individual pitch intervals using multi pulse in the representative interval. I was implemented that the ACLMS-MPC method and evaluate the SNR of APC-LMS in coding condition in 8kbps. As a result, SNR of ACLMS-MPC was 15.0dB for female voice and 14.3dB for male voice respectively. Therefore, I found that ACLMS-MPC was improved by 0.3dB~1.8dB for male voice and 0.3dB~1.6dB for female voice compared to existing MPC, ACFBD-MPC and LMS-MPC. These methods are expected to be applied to a method of speech coding using sound source in a low bit rate such as a cellular phone or internet phone. In the future, I will study the evaluation of the sound quality of 6.9kbps speech coding method that simultaneously compensation the amplitude and position of multi-pulse source.

• Journal of Broadcast Engineering
• /
• v.21 no.6
• /
• pp.929-943
• /
• 2016

This paper proposes the rate control algorithm based on the S-JND (Saliency-Just Noticeable Difference) model for considering perceptual visual quality. The proposed rate control algorithm employs the S-JND model to simultaneously reflect human visual sensitivity and human visual attention for considering characteristics of human visual system. During allocating bits for CTU (Coding Tree Unit) level in a rate control, the bit allocation model calculates the S-JND threshold of each CTU in a picture. The threshold of each CTU is used for adaptively allocating a proper number of bits; thus, the proposed bit allocation model can improve perceptual visual quality. For performance evaluation of the proposed algorithm, the proposed algorithm was implemented on HM 16.9 and tested for sequences in Class B and Class C under the CTC (Common Test Condition) RA (Random Access), Low-delay B and Low-delay P case. Experimental results show that the proposed method reduces the bit-rate of 2.3%, and improves BD-PSNR of 0.07dB and bit-rate accuracy of 0.06% on average. We achieved MOS improvement of 0.03 with the proposed method, compared with the conventional method based on DSCQS (Double Stimulus Continuous Quality Scale).

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.136-137
• /
• 2010

본 논문에서는 고속, 저전력 비디오 부호화에 적합한 변환영역 Wyner-Ziv 분산비디오부호화기를 더욱 고속화하기 위한 병렬처리 방법을 제안한다. 기존에는 변환영역 Wyner-Ziv 분산비디오부호화를 위해 양자화 정보를 비트플레인단위로 분해후 이를 순차적으로 LDPCA 부호화하여 전체 부호화기 연산량에서 LDPCA의 복잡도가 약 54% 정도 차지하였고, 이는 고비트율로 부호화 할수록 더욱 증가하였다. 제안방법은 이를 개선하기 위해 여러 개의 비트플레인을 하나의 심벌 (symbol)로 묶어서 LDPCA 부호화를 수행하여 한 번의 연산으로 여러 개의 데이터를 동시에 처리할 수 있게 한다. 일종의 단일 명령 복수 데이터 처리 (SIMD, Single instruction, multiple data)에 의한 고속화 방법이다. 이를 통해 제안방법은 기존의 순차적 처리 방법에 비해 저비트율에서는 8배, 고비트율에서는 55배까지 LDPCA의 부호화 속도를 향상시켰다. 결과적으로 전체 부호화에서 LDPCA의 상대적인 복잡도 비율은 4%정도로 낮아지게 되었으며 Wyner-Ziv 영상의 부호화 속도도 약 1.5 ~ 2배까지 향상되었다. 제안방법은 LDPCA를 사용하는 다른 Wyner-Ziv 분산비디오부호화 구조에도 적용 가능할 것으로 기대한다.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.679-686
• /
• 2002

The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.

• Korean Journal of Plant Resources
• /
• v.14 no.3
• /
• pp.196-205
• /
• 2001

The results of examining cultivation of tlyster mushroom using NSM(Non Sterilized Media) for determining the condition of artificially culturing oyster mushroom(Pleurotus ostreatus) are as follows. Mycelial growth an[1 density of oyster mushroom. were the highest in the medium of waste cotton(spinning) : corn cob(80 : 20, V/V) followed by the order of rice bran, beet pulp. Expecially, mycelial growth and density of oyster mushroom is the lowest at the mixture rate of 80% waste cotton(spinning) : 10% beet pulp. Mycelial growth and density of oyster mushroom. were the highest in the medium of cotton seed hull and beet pulp mixture followed by the order of rice bran, corn cob. Expecially, mycelial growth and density of oyster mushroom is the lowest at the mixture rate of 80% cotton seed hull : above 20% rice bran. Mycelial growth and density of oyster mushroom were the highest in the medium rate of 70% waste cotton(spinning), 10% corn cob and 10% beet pulp(V/V). Mycelial growth and density of oyster mushroom were the highest in the medium rate of 70% cotton seed hull , 10% corn cob and 10% beet pulp(V/V). Optimal concentration of NSM for the mycelial growth and density of oyster mushroom were shown to be 500 times concentration. Optimal water contents for the mycelial growth and density of NSM was 70%.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.20-28
• /
• 2012

DVC(Distributed Video Coding) technique is a new paradigm, which is based on the Slepian-Wolf and Wyner-Ziv theorems. DVC offers not only flexible partitioning of the complexity between the encoder and decoder, but also robustness to channel errors due to intrinsic joint source-channel coding. Many conventional research works have been focused on the light video encoder and its rate-distortion performance improvement. However, in this paper, we propose a new DVC codec which is effectively applicable for error-prone environment. The proposed method adopts a quantiser without dead-zone and symmetric Gray code around zero value. Through computer simulations, the proposed method is evaluated by the bit errors position as well as the number of burst bit errors. Additionally, it is shown that the maximum and minimum transmission rate for the given application can be linearly determined by the number of bit errors.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1325-1332
• /
• 2013

The first frame of a GOP, an I frame, is encoded in intra mode which generates a larger number of bits. In addition, the I frame is used for the inter mode encoding of the following frames. Thus the intial QP for the I frame affects the first frame as well as the following frames. In our previous work, we analyzed the number of bits for an I frame and showed that the ratio of the number of bits which maximizes the PSNR of a GOP maintains similar value regardless of GOP's. In this paper, we propose a R-Q model which can be used for the calculation of the initial QP given the amount of bits for an I frame. The proposed model is simple and adaptively modifies model parameters, so it can be applicable to the real-time application. It is shown by experimental results that the proposed model captures initial QP characteristics effectively and the proposed method for model parameters accurately estimates the real values.