• ETRI Journal
• /
• 제31권2호
• /
• pp.151-161
• /
• 2009

In this paper, we propose an adaptive multiview video coding scheme based on spatiotemporal correlation analyses using hierarchical B picture (AMVC-HBP) for the integrative encoding performances, including high compression efficiency, low complexity, fast random access, and view scalability, by integrating multiple prediction structures. We also propose an in-coding mode-switching algorithm that enables AMVC-HBP to adaptively select a better prediction structure in the encoding process without any additional complexity. Experimental results show that AMVC-HBP outperforms the previous multiview video coding scheme based on H.264/MPEG-4 AVC using the hierarchical B picture (MVC-HBP) on low complexity for 21.5%, on fast random access for about 20%, and on view scalability for 11% to 15% on average. In addition, distinct coding gain can be achieved by AMVC-HBP for dense and fast-moving sequences compared with MVC-HBP.

• 방송공학회논문지
• /
• 제10권4호통권29호
• /
• pp.621-631
• /
• 2005

다시점 동영상 부호화기의 성능을 향상시키기 위해서 본 논문에서는 평행식 카메라 구조에서의 효율적인 변이 벡터 예측을 이용한 부호화 방식을 제안한다 변이 벡터는 움직임 벡터와는 달리 다시점 카메라 구조 정보로부터 예측이 가능하다. 이러한 성질을 이용하여 예측하여 구한 예측 벡터와 직접 추정한 변이 벡터와의 차이값을 부호화한다. 그러므로 변이 벡터 부호화의 성능을 향상시키기 위해서 정교한 변이 벡터의 예측이 필요하다. 기존의 벡터 예측 방식은 미리 부호화된 주위 블록의 변이 벡터를 이용하여 현재 블록의 변이 벡터를 예측하지만 제안 알고리듬은 다시점 영상간의 상관성을 이용한다. 본 논문에서는 5시점 동영상에 대해서 차벡터의 엔트로피와 절대 평균값을 구하는 실험을 수행하였다. 실험 결과를 통해서 기존의 공간적인 상관성만을 이용하여 변이 벡터를 부호화하는 방식보다 제안 알고리듬이 우수한 성능을 보임을 확인하였다. 제안 알고리듬은 기존알고리듬과 비교하여 영상의 화질을 유지하면서 $30{\~}40\%$의 부호화 효율을 증가시킨다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.265-266
• /
• 2007

New coding tools require the increase of the encoder complexity in H.264. In this paper we propose a fast mode decision method to reduce the computational complexity of mode decision. The simulation results shows that the proposed methods could reduce the coding time of overall sequences by 30% on average without any noticeable degradation of the coding efficiency.

• Journal of Forest and Environmental Science
• /
• 제28권4호
• /
• pp.278-281
• /
• 2012

Comparative sequence analyses were conducted on complete mtDNA sequences from four small mammal species in Korea and revealed the presence of 30 well conserved sequences in various regions of the complete mtDNA sequences. The conserved sequences were found in 9 regions in protein coding genes, 10 regions in tRNA genes, 10 in rRNA genes, one region in replication origin and 2 regions in D loop. They could be used to design primers for amplifying complete mtDNA sequences of small mammals.

• 한국정보전자통신기술학회논문지
• /
• 제9권6호
• /
• pp.519-525
• /
• 2016

This paper addresses the framework of object-oriented image coding, describing a new algorithm, based on monodimensional Legendre polynomials, for texture approximation. Through the use of 1D orthogonal basis functions, the computational complexity which usually makes prohibitive most of 2D region-oriented approaches is significantly reduced, while only a slight increment of distortion is introduced. In the aim of preserving the bidimensional intersample correlation of the texture information as much as possible, suitable pseudo-bidimensional basis functions have been used, yielding significant improvements with respect to the straightforward 1D approach. The algorithm has been experimented for coding still images as well as motion compensated sequences, showing interesting possibilities of application for very low bitrate video coding.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.79-82
• /
• 2008

We propose a new motion vector skip coding method for better motion compensation-based coding of inter-slices in H.264/AVC. It is to best utilize the spatial correlation between motion vectors of adjacent 4x4 blocks by effective motion vector coding. For this purpose, we introduce a new macroblock type of Predictive (P) slice into those of the H.264/AVC, so that it can lead to reduction in the coding bits required for encoding motion information. Experimental results with several well-known test video sequences verify that better performance of the proposed method is obtained.

• ETRI Journal
• /
• 제31권1호
• /
• pp.80-82
• /
• 2009

In this letter, a new intra-block coding mode is presented to improve the coding efficiency for band-limited signals. A band-limited block is sub-sampled, and the sub-sampled signal is coded on the basis of the conventional prediction/transform coding. The rest of the samples are reconstructed by interpolation at the decoder side without any side information. Experimental results show that the proposed algorithm achieves coding gains of 2.7% for common intermediate format (CIF), 4.29% for quarter CIF, and 6.39% for 720p60 sequences against the H.264/AVC JM10.2 reference software.

• ETRI Journal
• /
• 제28권2호
• /
• pp.145-154
• /
• 2006

In the decoding process associated with interframe wavelet coding, the inverse wavelet transform requires high computational complexity. However, as video technology starts to pervade all aspects of our lives, decoders are becoming required in various devices such as PDAs, notebooks, PCs, and set-top boxes. Therefore, a decoder's complexity needs to be adapted to the processor's computational power, and consequently a low-complexity codec is also required for scalable video coding. In this paper, we propose a method of controlling and lowering the complexity of the spatial wavelet transform while sustaining the same coding efficiency as that currently afforded. In addition, the proposed method may alleviate the ringing effect for slowly changing image sequences.

• 한국정보전자통신기술학회논문지
• /
• 제7권4호
• /
• pp.205-211
• /
• 2014

This paper addresses the framework of object-oriented image coding, describing a new algorithm, based on monodimensional Legendre polynomials, for texture approximation. Through the use of 1D orthogonal basis functions, the computational complexity which usually makes prohibitive most of 2D region-oriented approaches is significantly reduced, while only a slight increment of distortion is introduced. In the aim of preserving the bidimensional intersample correlation of the texture information as much as possible, suitable pseudo-bidimensional basis functions have been used, yielding significant improvements with respect to the straightforward 1D approach. The algorithm has been experimented for coding still images as well as motion compensated sequences, showing interesting possibilities of application for very low bitrate video coding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1825-1839
• /
• 2015

The final draft of the latest video coding standard, High Efficiency Video Coding (HEVC), was approved in January 2013. The coding efficiency of HEVC surpasses its predecessor, H.264/MPEG-4 Advanced Video Coding (AVC), by using only half of the bitrate to encode the same sequence with similar quality. However, the complexity of HEVC is sharply increased compared to H.264/AVC. In this paper, a method is proposed to decrease the complexity of intra coding in HEVC. Early pruning and an early splitting strategy are applied to the quadtree structure of coding tree units (CTU) and residual quadtree (RQT). According to our experiment, when our method is applied to sequences from Class A to Class E, the coding time is decreased by 44% at the cost of a 1.08% Bjontegaard delta rate (BD-rate) increase on average.