• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3018-3038
• /
• 2020

In the stereoscopic or multiview display, the depth video illustrates visual distances between objects and camera. To promote the computational efficiency of depth video encoder, we exploit the intra prediction of depth videos under Versatile Video Coding (VVC) and observe a diverse distribution of intra prediction modes with different coding unit sizes. We propose a hybrid scheme to further boost fast depth video coding. In the first stage, we adaptively predict the HADamard (HAD) costs of intra prediction modes and initialize a candidate list according to the HAD costs. Then, the candidate list is further improved by considering the probability distribution of candidate modes with different CU sizes. Finally, early termination of CU splitting is performed at each CU depth level based on the Bayesian theorem. Our proposed method is incorporated into VVC intra prediction for fast coding of depth videos. Experiments with 7 standard sequences and 4 Quantization parameters (Qps) validate the efficiency of our method.

• 말소리와 음성과학
• /
• 제4권3호
• /
• pp.119-125
• /
• 2012

This paper describes a new algorithm for encoding spectral shape and envelope in the generic mode of G.718 super-wide band (SWB). In the G.718 SWB coder, generic mode coding and sinusoidal enhancement are used for the quantization of modified discrete cosine transform (MDCT)-based parameters in the high frequency band. In the generic mode, the high frequency band is divided into sub-bands and for every sub-band the most similar match with the selected similarity criteria is searched from the coded and envelope normalized wideband content. In order to improve the quantization scheme in high frequency region of speech/audio signals, the modified generic mode by the improvement of the generic mode in G.718 SWB is proposed. In the proposed generic mode, perceptual vector quantization of spectral envelopes and the resolution increase for spectral copy are used. The performance of the proposed algorithm is evaluated in terms of objective quality. Experimental results show that the proposed algorithm increases the quality of sounds significantly.

• 한국멀티미디어학회논문지
• /
• 제13권12호
• /
• pp.1748-1759
• /
• 2010

We extend the octree subdivision process from Cartesian coordinates to spherical coordinates to develop more efficient space-partitioning structure for surface models. As an application of the proposed structure, we apply the octree subdivision in spherical coordinates ("S-Octree") to geometry compression in progressive mesh coding. Most previous researches on geometry-driven progressive mesh compression are devoted to improve predictability of geometry information. Unlike this, we focus on the efficient information storage for the space-partitioning structure. By eliminating void space at initial stage and aligning the R axis for the important components in geometry information, the S-Octree improves the efficiency in geometry information coding. Several meshes are tested in the progressive mesh coding based on the S-Octree and the results for performance parameters are presented.

• Journal of Multimedia Information System
• /
• 제6권4호
• /
• pp.245-250
• /
• 2019

In this paper, we propose an ellipsoid modeling method for coding of a face depth picture. The ellipsoid modeling is firstly based on a point of a nose tip which is defined as the lowest value of the depth in the picture. The proposed ellipsoid representation is simplified through a difference of depth values between in the nose tip and in left or right boundary point of the face. Parameters of the ellipsoid are calculated through coordinates and depth values to minimize differences from the actual depth pixels. A picture is predicted by the modeled ellipsoid for coding of the face depth picture. In simulation results, an average MSEs between the face depth picture and the predicted picture is measured as 20.3.

• ETRI Journal
• /
• 제28권5호
• /
• pp.664-667
• /
• 2006

We propose an efficient audio transcoding algorithm that can convert audio streams from terrestrial digital television broadcasting service stations to those for terrestrial digital multimedia broadcasting hand-held receivers. The proposed algorithm avoids the complicated psychoacoustic analysis by calculating the scalefactors of the bit-sliced arithmetic coding encoder directly from the signal-to-noise ratio parameters of the AC-3 decoder. The bit-allocation process is also simplified by cascading the nested distortion control loop. Through subjective evaluation, it is shown that the proposed algorithm provides comparable audio quality to tandem coding but it requires much smaller complexity.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.435-436
• /
• 2006

When working with multi-view images, imbalances between multi-view images occur a serious problem in multi-view video coding because they decrease the performance of disparity estimation. To overcome this problem, we propose inter-view balanced disparity estimation for multi-view video coding. In general, the imbalance problem can be solved by a preprocessing step that transforms reference images linearly. However, there are some problems in pre-processing such as the transformation of the original images. In order to obtain a balancing effect among the views, we perform block-based disparity estimation, which includes several balancing parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• 한국통신학회논문지
• /
• 제19권6호
• /
• pp.1115-1125
• /
• 1994

본 논문에서는 위성 채널에 효율적인 오류 정정 방식으로 펑쳐드 콘볼루션 부호(punctured convolutional code)를 이용한 직렬 연결 부호(concatenated code) 방식을 제안하고 위성 채널을 모델링 하여 제안된 오류 정정 방식의 오율 성능을 모의 실험을 통하여 분석하였다. 제안된 직렬 연결 부호 방식은 외부 부호를 (255.223)RS 부호로 하고 구속장 길이가 7인 2/3 펑쳐드 콘볼루션 부호를 내부 부호로 사용하였으며, 일반적으로 위성 부호 채널(satellite coding channel) 모델로 사용되고 있는 광대역 부가 백색 가우시간 잡음 채널의 부정확성을 보완하기 위해 위성 채널 입력 여과기, 고출력 진행파관 증폭기(traveling wave tube amplifier), 위성 채널 출력 여파기 및 하향링크 잡음 등으로 구성되는 위성 부호 채널을 모델링하여 성능 평가 실험에 사용하였다.

• 한국통신학회논문지
• /
• 제36권6C호
• /
• pp.368-375
• /
• 2011

분산 동영상 부호화 시스템에서는 복호기에서 Wyner-Ziv 프레임을 복원하기 위해서 부호기에서 생성된 패리티비트를 사용하게 된다. 이때 오류 정정 부호로 터보 부호나 LDPC 부호가 사용되는데 복호기에서는 원 Wyner-Ziv 프레임을 모르기 때문에 오류 정정을 위한 효과적인 상관 잡음 모델링이 필요하다. 본 논문에서는 복호기에서 Wyner-Ziv 프레임과 부가정보 간의 상관 잡음을 효과적으로 모델링하기 위한 방법을 제안하고 추정한 상관 잡음 모델이 분산 동영상 부호화 시스템에 미치는 영향을 분석한다. 또한 모의실험을 위해 H.264 intraframe 부호화 방법으로 부호화된 키 프레임을 사용하였는데 부호기에서 동적으로 키 프레임 양자화 파라미터 값을 추정하기 위한 방법을 제안하고 성능을 해석한다.

• ETRI Journal
• /
• 제34권2호
• /
• pp.190-198
• /
• 2012

An adaptive correlation noise model (CNM) construction algorithm is proposed in this paper to increase the efficiency of parity bits for correcting errors of the side information in transform domain Wyner-Ziv (WZ) video coding. The proposed algorithm introduces two techniques to improve the accuracy of the CNM. First, it calculates the mean of direct current (DC) coefficients of the original WZ frame at the encoder and uses it to assist the decoder to calculate the CNM parameters. Second, by considering the statistical property of the transform domain correlation noise and the motion characteristic of the frame, the algorithm adaptively models the DC coefficients of the correlation noise with the Gaussian distribution for the low motion frames and the Laplacian distribution for the high motion frames, respectively. With these techniques, the proposed algorithm is able to make a more accurate approximation to the real distribution of the correlation noise at the expense of a very slight increment to the coding complexity. The simulation results show that the proposed algorithm can improve the average peak signal-to-noise ratio of the decoded WZ frames by 0.5 dB to 1.5 dB.