• Title/Summary/Keyword: 쿼드트리 분할

Search Result 34, Processing Time 0.023 seconds

Fast Partition Decision Using Rotation Forest for Intra-Frame Coding in HEVC Screen Content Coding Extension (회전 포레스트 분류기법을 이용한 HEVC 스크린 콘텐츠 화면 내 부호화 조기분할 결정 방법)

  • Heo, Jeonghwan;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.23 no.1
    • /
    • pp.115-125
    • /
    • 2018
  • This paper presents a fast partition decision framework for High Efficiency Video Coding (HEVC) Screen Content Coding (SCC) based on machine learning. Currently, the HEVC performs quad-tree block partitioning process to achieve optimal coding efficiency. Since this process requires a high computational complexity of the encoding device, the fast encoding process has been studied as determining the block structure early. However, in the case of the screen content video coding, it is difficult to apply the conventional early partition decision method because it shows different partition characteristics from natural content. The proposed method solves the problem by classifying the screen content blocks after partition decision, and it shows an increase of 3.11% BD-BR and 42% time reduction compared to the SCC common test condition.

(Very Low Bitrate Image Compression Coding Based on Fractal) (프랙탈 기반 저전송율 영상 압축 부호화)

  • 곽성근
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.8
    • /
    • pp.1085-1092
    • /
    • 2002
  • Studies on image information processing have been performed since long time ago because in daily life most of information are acquired by the since of sight. Since there should be a lot of data to describe image as a digital form, data compression is required in order to store or transmit digital image. Lately among most of image compression methods adopted on image compression standards, transform coding methods have been primarily used which transforms the correlations between pixels of image on frequency domain before image compression. It is blown that the standard methods using especially DCT features blocking effect which is the major cause of degrading the quality of image at high compression rate. Fractal encoding using quadtree partition is applied after reducing original image, and we are to find a optimal encoding for the number of scaling bit and offset bit.

  • PDF

Conditional Probability Based Early Termination of Recursive Coding Unit Structures in HEVC (HEVC의 재귀적 CU 구조에 대한 조건부 확률 기반 고속 탐색 알고리즘)

  • Han, Woo-Jin
    • Journal of Broadcast Engineering
    • /
    • v.17 no.2
    • /
    • pp.354-362
    • /
    • 2012
  • Recently, High Efficiency Video Coding (HEVC) is under development jointly by MPEG and ITU-T for the next international video coding standard. Compared to the previous standards, HEVC supports variety of splitting units, such as coding unit (CU), prediction unit (PU), and transform unit (TU). Among them, it has been known that the recursive quadtree structure of CU can improve the coding efficiency while the encoding complexity is increased significantly. In this paper, a simple conditional probability to predict the early termination condition of recursive unit structure is introduced. The proposed conditional probability is estimated based on Bayes' formula from local statistics of rate-distortion costs in encoder. Experimental results show that the proposed method can reduce the total encoding time by about 32% according to the test configuration while the coding efficiency loss is 0.4%-0.5%. In addition, the encoding time can be reduced by 50% with 0.9% coding efficiency loss when the proposed method was used jointly with HM4.0 early CU termination algorithm.

3D Point Clouds Encryption Method and Analysis of Encryption Ratio in Holographic Reconstruction Image (3D 공간정보 암호화 기법과 홀로그래픽 복원영상의 암호화 효율 분석)

  • Choi, Hyun-Jun;Seo, Young-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.9
    • /
    • pp.1703-1710
    • /
    • 2017
  • This paper propose a 3D point clouds (depth) security technique for digital holographic display service. Image contents encryption is a method to provide only authorized right owners with the original image information by encrypting the entire image or a part of the image. The proposed method detected an edge from a depth and performed quad tree decomposition, and then performed encryption. And encrypts the most significant block among the divided blocks. The encryption effect was evaluated numerically and visually. The experimental results showed that encrypting only 0.43% of the entire data was enough to hide the constants of the original depth. By analyzing the encryption amount and the visual characteristics, we verified a relationship between the threshold for detecting an edge-map. As the threshold for detecting an edge increased, the encryption ratio decreased with respect to the encryption amount.

An Early Termination Algorithm of Prediction Unit (PU) Search for Fast HEVC Encoding (HEVC 고속 부호화를 위한 PU 탐색 조기 종료 기법)

  • Kim, Jae-Wook;Kim, Dong-Hyun;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.627-630
    • /
    • 2014
  • The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

AAW-based Cell Image Segmentation Method (적응적 관심윈도우 기반의 세포영상 세그먼테이션 기법)

  • Seo, Mi-Suk;Ko, Byoung-Chul;Nam, Jae-Yeal
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.11a
    • /
    • pp.199-202
    • /
    • 2006
  • 본 논문에서는 적응적 관심윈도우에 기반한 세포영상 세그먼테이션 기법을 제안한다. 명암지도를 이용하여 초기 관심윈도우를 생성하고, 초기 관심윈도우를 쿼드-트리 분할을 통해 실제 관심영역과 유사한 크기가 될 때까지 축소한다. 이렇게 생성된 적응적 관심윈도우는 세포영상에서 배경을 제거하고 관심영역 추출의 처리시간을 줄일 수 있다. 그리고 세그먼테이션과 관심영역의 분리를 위한 영역 병합 및 제거를 수행하여 최종적으로 정밀한 관심영역을 얻어낸다. 실험에서 제안된 기법은 세포영상의 관심영역을 효과적으로 분리하여 인간 시각과 유사한 향상된 세그먼테이션 결과를 보여준다.

  • PDF

An Algorithm for Measurement of Pack Ice Concentration Using Localized Binarization of Quadtree-Subdivided Image (쿼드트리 분할영상의 국부이진화를 통한 팩아이스 집적도 측정 알고리즘)

  • Lee, Jeong-Hoon;Byun, Seok-Ho;Nam, Jong-Ho;Cho, Seong-Rak
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.54 no.1
    • /
    • pp.49-56
    • /
    • 2017
  • Recently, many research works on the icebreaking vessels have been published as the possibility of passing Arctic routes has been increasing. The model ship test on the pack ice model in the ice basin is actively carried out as a way to investigate the performance of icebreaking vessels. In this test, the concentration of pack ice is important since it directly affects the performance. However, it is difficult to measure the concentration because not only the pack ice has uneven shape but also it keeps floating around in the basin. In this paper, an algorithm to identify the concentration of pack ice is introduced. From a digital image of pack ice obtained in the ice basin, the goal is to measure the area of pack ice using an image processing technique. Instead of the general global binarization that yields numerical errors in this problem, a local binarization technique, coupled with image subdivision based on the quadtree structure, is developed. The concentration results obtained by the developed algorithm are compared with the manually measured data to prove its accuracy.

Study on the Method to Create a Pedestrian Path Using Space Decomposition based on Quadtree (쿼드트리 기반의 공간분할 기법을 활용한 경로 생성 방안에 관한 연구)

  • Ga, Chill-O;Woo, Ho-Seok;Yu, Ki-Yun
    • Spatial Information Research
    • /
    • v.18 no.4
    • /
    • pp.89-98
    • /
    • 2010
  • Recently, the target of navigation system is moving from the cars to pedestrians. Many researches are in progress regarding pedestrian navigation, However, in most cases, the path-finding is based on the existing node/link network model. which is widely used for the car navigation, and thus showing its limitation. The reasons arc that a) unlike with a car, the paths that pedestrians take arc not limited to the roads, b) pedestrians an~ not restricted in rotation or direction, and c) they can freely move within the walkable space. No alternatives have been offered yet, especially for openspaces such as a park or square. Therefore, in this research, we suggested appropriate methods to create paths that can be used in pedestrian navigation service, by using motion-planning technology, which is used in the field of robotics for planning the motion of an object, and conducted tests for their applicability.

Fast PU Decision Method Using Coding Information of Co-Located Sub-CU in Upper Depth for HEVC (상위깊이의 Sub-CU 부호화 정보를 이용한 HEVC의 고속 PU 결정 기법)

  • Jang, Jae-Kyu;Choi, Ho-Youl;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.20 no.2
    • /
    • pp.340-347
    • /
    • 2015
  • HEVC (High Efficiency Video Coding) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure and various prediction units (PUs), and the determination of the best CU partition structure and the best PU mode based on rate-distortion (R-D) cost. However, the computation complexity of encoding also dramatically increases. In this paper, to reduce such encoding computational complexity, we propose three fast PU mode decision methods based on encoding information of upper depth as follows. In the first method, the search of PU mode of the current CU is early terminated based on the sub-CBF (Coded Block Flag) of upper depth. In the second method, the search of intra prediction modes of PU in the current CU is skipped based on the sub-Intra R-D cost of upper depth. In the last method, the search of intra prediction modes of PU in the lower depth's CUs is skipped based on the sub-CBF of the current depth's CU. Experimental results show that the three proposed methods reduce the computational complexity of HM 14.0 to 31.4%, 2.5%, and 23.4% with BD-rate increase of 1.2%, 0.11%, and 0.9%, respectively. The three methods can be applied in a combined way to be applied to both of inter prediction and intra prediction, which results in the complexity reduction of 34.2% with 1.9% BD-rate increase.

Fractal Image Coding Based On Variable Block (가변 블록 기반 프랙탈 영상 부호화)

  • 노근수;조성환
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.35T no.3
    • /
    • pp.15-24
    • /
    • 1998
  • In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.

  • PDF