• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• ETRI Journal
• /
• 제27권6호
• /
• pp.713-724
• /
• 2005

This paper focuses on the problem of key-frames coding and proposes a new promising approach based on the use of fractals. The summary, made of a set of key-frames selected from a full-length video sequence, is coded by using a 3D fractal scheme. This allows the video presentation tool to expand the video sequence in a "natural" way by using the property of the fractals to reproduce the signal at several resolutions. This feature represents an important novelty of this work with respect to the alternative approaches, which mainly focus on the compression ratio without taking into account the presentation aspect of the video summary. In devising the coding scheme, we have taken care of the computational complexity inherent in fractal coding. Accordingly, the key-frames are first wavelet transformed, and the fractal coding is then applied to each subband to reduce the search range. Experimental results show the effectiveness of the proposed approach.

• 한국정보처리학회논문지
• /
• 제4권4호
• /
• pp.1121-1131
• /
• 1997

높은 앞축율을 가지는 동영상 압축 방법에 있어, 공간영역에서의 프랙탈을 이용한 동영상 앞축 방법은 복원영상의 블록화 현상이 두드러지는 단점이 있고, 웨이브릿 / 변환 영역에서의 동영상 압축 방법은 에지의 열화가 생기는 단점이 있다. 그러므로 본 논문에서는 이러한 단점을 보완하기 위해 높은 압축률에서도 에지가 선명하고 블록화 현상이 없는 웨이브릿 변환 영역에서의 프랙탈을 이용한 동영상 압축 방법을 제안한다 제안한 방법에서는 서로 다른 부대역간의 상관성을 이용하여 가변 블록 크기의 움 직임을 추정하고, 움직임 추청에 의하여 효과적으로 부호화되지 않는 웨이브릿 계수들은 저해상도 부대역에서 고해상도 부대역을 계층적으로 추정하는 프레임간 프랙탈 부호화 한다. 실험을 통하여 제안한 방법이 기존의 프랙탈과 웨이브릿을 이용한 동영상 부호와 방법도 더 좋은 성능을 나타냄을 보였다.

• 대한전자공학회논문지SP
• /
• 제37권3호
• /
• pp.1-10
• /
• 2000

본 논문에서는 프랙탈 기반의 전송율 제어 가능을 갖는 동영상 압축 시스템을 제안한다. 기존의 프랙탈 압축방법의 부호화비트량 과다라는 단점을 극북하기위해, 제안하는 시스템은 이미지를 배경, 움직임 보상 및 프랙탈 코딩의 3가지로 분류하여 부호화 하였다. 부호화 되는 코드의 양을 줄이기 위하여 움직임 보상부의 움직임 벡터값은 가변길이 코드를 사용하고 프랙탈 변이값(offset)은 이전 프레임으로부터의 예측값과 최소 자승 근사화(least-square approximation)법으로 구한 값의 차값(difference)을 가변 길이 코드로 부호화하였다. 전송율 제어를 위해 현재의 비트 발생량과 밴드폭을 고려해서 화연 분할 문턱값(threshold)을 결정하는 알고리듬을 적용하였다. 전체 시스템의 실험 결과 동일한 화질에서 기존의 시스템에 비해 압축율이 18배이상 향상됨을 확인하였고, 전송율이 결정되어 있을 때의 전송율 제어가 이루어짐을 확인하였다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.72-76
• /
• 1996

We propose a novel algorithm for fractal video sequence coding, based on the circular prediction mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM is similar to the block matching algorithm in the motion compensation techniques, and the advantages of this similarity are discussed. Also we show that the CPM can be combined with non-contractive inter-frame mapping (NCIM), improving the performance of the fractal sequence coder further. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, ranging from 40 Kbps to 250 Kbps.

• Journal of Electrical Engineering and Technology
• /
• 제11권2호
• /
• pp.519-528
• /
• 2016

In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

• The Journal of the Acoustical Society of Korea
• /
• 제15권2E호
• /
• pp.85-91
• /
• 1996

New very low bit rate segmentation video image coding technique is proposed by segmenting image into textually homogeneous regions. Regions are classified into one of three perceptually distinct texture classes(perceived constant intensity, smooth texture, and rough texture) using the Human Visual System(HVS) and the fractals. To design very low bit rate video image coder, it is very important to determine the best block size for estimation the fractal dimension and the thresholding of the fractal dimension for each texture class. Good quality reconstructed images are obtained with about 0.10 to 0.21 bit per pixel(bpp) for many different types of imagery.