• Title/Summary/Keyword: Bit Plane Coding

Search Result 53, Processing Time 0.025 seconds

Fractal Coding Method for Fast Encoding and High Compression (고속 및 고압축을 위한 프랙탈 영상 부호화)

  • 김정일
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.3
    • /
    • pp.64-69
    • /
    • 2000
  • This paper proposes a novel fractal coding method for fast encoding and high compression to shorten time to take on fractal encoding by using limited search area. First. the original image is contracted respectively by half and by quarter with the scaling method and bit-plane method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image qualify than Jacquin's method.

  • PDF

Software development for the visualization of brain fiber tract by using 24-bit color coding in diffusion tensor image

  • Oh, Jung-Su;Song, In-Chan;Ik hwan Cho;Kim, Jong-Hyo;Chang, Kee-Hyun;Park, Kwang-Suk
    • Proceedings of the KSMRM Conference
    • /
    • 2002.11a
    • /
    • pp.133-133
    • /
    • 2002
  • Purpose: The purpose of paper is to implement software to visualize brain fiber tract using a 24-bit color coding scheme and to test its feasibility. Materials and Methods: MR imaging was performed on GE 1.5 T Signa scanner. For diffusion tensor image, we used a single shot spin-echo EPI sequence with 7 non-colinear pulsed-field gradient directions: (x, y, z):(1,1,0),(-1,1,0),(1,0,1),(-1,0,1),(0,1,1),(0,1,-1) and without diffusion gradient. B-factor was 500 sec/$\textrm{mm}^2$. Acquisition parameters are as follows: TUTE=10000ms/99ms, FOV=240mm, matrix=128${\times}$128, slice thickness/gap=6mm/0mm, total slice number=30. Subjects consisted of 10 normal young volunteers (age:21∼26 yrs, 5 men, 5 women). All DTI images were smoothed with Gaussian kernel with the FWHM of 2 pixels. Color coding schemes for visualization of directional information was as follows. HSV(Hue, Saturation, Value) color system is appropriate for assigning RGB(Red, Green, and Blue) value for every different directions because of its volumetric directional expression. Each of HSV are assigned due to (r,$\theta$,${\Phi}$) in spherical coordinate. HSV calculated by this way can be transformed into RGB color system by general HSV to RGB conversion formula. Symmetry schemes: It is natural to code the antipodal direction to be same color(antipodal symmetry). So even with no symmetry scheme, the antipodal symmetry must be included. With no symmetry scheme, we can assign every different colors for every different orientation.(H =${\Phi}$, S=2$\theta$/$\pi$, V=λw, where λw is anisotropy). But that may assign very discontinuous color even between adjacent yokels. On the other hand, Full symmetry or absolute value scheme includes symmetry for 180$^{\circ}$ rotation about xy-plane of color coordinate (rotational symmetry) and for both hemisphere (mirror symmetry). In absolute value scheme, each of RGB value can be expressed as follows. R=λw|Vx|, G=λw|Vy|, B=λw|Vz|, where (Vx, Vy, Vz) is eigenvector corresponding to the largest eigenvalue of diffusion tensor. With applying full symmetry or absolute value scheme, we can get more continuous color coding at the expense of coding same color for symmetric direction. For better visualization of fiber tract directions, Gamma and brightness correction had done. All of these implementations were done on the IDL 5.4 platform.

  • PDF

A VLSI Efficient Design and Implementation of EBCOT for JPEG2000 (JPEG2000을 위한 효율적인 EBCOT의 VLSI 설계 및 구현)

  • Yang, Sang-Hoon;Yoo, Hyuck-Min;Park, Dong-Sun;Yoon, Sook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.3
    • /
    • pp.37-43
    • /
    • 2009
  • The new still image compression standard JPEG2000 is consisted of DWT and EBCOT. In this paper, proposed and designed new algorithm in efficient EBCOT. BPC based on the contort. Proposed BPC Algorithm is forecasted coding pass using Sigstage, column, mpass value. BAC design apply 4-pipeline stage. EBCOT designed using Verilog HDL. Verification and Synthesis using Xillinx FPGA technology.

Fractal Coding Method using Bit - plane Image (비트 - 플레인 영상을 이용한 프랙탈 부호화 기법)

  • Kim, Jeong-Il;Lee, Kwang-Bae;Kim, Hyen-Ug
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.1057-1065
    • /
    • 1998
  • This paper describes a new fractal image coding algorithm to shorten time to take on fractal image encoding by using limited search area method and scaling method. First, the original image is contracted respectively by half and by quarter with the scaling method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. This searched block is used in encoding. Also, we propose an algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

  • PDF

A binary adaptive arithmetic coding algorithm based on adaptive symbol changes for lossless medical image compression (무손실 의료 영상 압축을 위한 적응적 심볼 교환에 기반을 둔 이진 적응 산술 부호화 방법)

  • 지창우;박성한
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2714-2726
    • /
    • 1997
  • In this paper, adaptive symbol changes-based medical image compression method is presented. First, the differenctial image domain is obtained using the differentiation rules or obaptive predictors applied to original mdeical image. Also, the algorithm determines the context associated with the differential image from the domain. Then prediction symbols which are thought tobe the most probable differential image values are maintained at a high value through the adaptive symbol changes procedure based on estimates of the symbols with polarity coincidence between the differential image values to be coded under to context and differential image values in the model template. At the coding step, the differential image values are encoded as "predicted" or "non-predicted" by the binary adaptive arithmetic encoder, where a binary decision tree is employed. The simlation results indicate that the prediction hit ratios of differential image values using the proposed algorithm improve the coding gain by 25% and 23% than arithmetic coder with ISO JPEG lossless predictor and arithmetic coder with differentiation rules or adaptive predictors, respectively. It can be used in compression part of medical PACS because the proposed method allows the encoder be directly applied to the full bit-planes medical image without a decomposition of the full bit-plane into a series of binary bit-planes as well as lower complexity of encoder through using an additions when sub-dividing recursively unit intervals.

  • PDF

Development of Morphological Pattern Recognition System - Morphological Shape Decomposition using Shape Function (형태론적 패턴인식 시스템의 개발 - 형상함수를 이용한 형태론적 형상분해)

  • Jong Ho Choi
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.8
    • /
    • pp.1127-1136
    • /
    • 1995
  • In this paper, a morphological shape decomposition method is proposed for the purpose of pattern recognition and image compression. In the method, a structuring element that geometrical characteristics is more similar to the shape function is preselected. The shape is decomposed into the primitive elements corresponding to the structuring element. A gray scale image also is transformed into 8 bit plane images for the hierarchical reconstruction required in image communication systems. The shape in each bitplane is decomposed to the proposed method. Through the experiment. it is proved that the description error is reduced and the coding efficiency is improved.

  • PDF

A study of FGS coding with increased video quality scalability (화질 확장성을 높인 FGS 코딩 기법에 관한 연구)

  • Hee-Hyung Boo;Nak-Hoon Beak
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.175-178
    • /
    • 2008
  • MPEG-4 Part 2 에서 표준으로 채택된 FGS (fine granularity scalability) 코딩 기법은 전송 선로의 상태가 급변하는 경우에도 주어진 대역폭에서 최적의 화질 향상을 얻을 수 있도록 설계된 망 상태에 적응적인 스케일러블 비디오 코딩 기법이다 [1][2][9]. 본 논문에서는 기존의 FGS 향상 계층에서 영상의 잔여 신호를 다시 한 번 bit-plane 코딩을 해줌으로써 화질 확장성을 더 높인 Advanced FGS 코딩 구조를 제안하였다. 본 논문의 실험에서는 기존의 MPEG-4 VM (verification model)에서 사용된 FGS 코딩과의 비교를 통해 Advanced FGS 구조의 화질 확장성을 평가하였다. 비교는 두 부호화 기술의 PSNR 값의 분석으로 이루어졌고, 결과를 통해 Advanced FGS 구조가 고화질을 가지며, 화질 확장성이 더 높은 구조임을 알 수 있었다.

An Iterative Side Information Refinement Based on Block-Adaptive Search in Distributed Video Coding (분산 비디오 부호화에서 블록별 적응적 탐색에 기초한 반복적인 보조정보 보정기법)

  • Kim, Jin-Soo;Yun, Mong-Han;Kim, Jae-Gon;Seo, Kwang-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.355-363
    • /
    • 2011
  • Recently, as one of several methods to improve the performance of DVC(Distributed Video Coding) system, many research works are focusing on the iterative refinement of side information. Most of the conventional techniques are mainly based on the relationship between the reconstruction level and side information, or the vector median filtering of motion vectors, but, their performance improvements are restricted. In order to overcome the performance limit of the conventional schemes, in this paper, a side information generation scheme is designed by measuring the block-cost estimation. Then, by adaptively selecting the compensation mode using the received bit-plane information, we propose a block-adaptive iterative refinement which is efficient for non-symmetric moving objects. Computer simulations show that, by using the proposed refinement method, the performance can be improved up to 0.2 dB in rate-distortion.

An Interactive Image Transmission For Mobile Devices (모바일 시스템을 위한 인터랙터브 이미지 전송)

  • Lim, Nak-Won;Kim, Dae-Young;Lee, Hae-Young
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.2
    • /
    • pp.17-26
    • /
    • 2011
  • This paper presents an interactive progressive image transmission method, which enables a remote user to interactively select and transmit preferred regions from an index image. Our enhanced quadtree decomposition using PSNR-based rules and new implicit quadtree coding provide better rate-distortion performance than previous quadtree coders as well as leading bit plane methods. An adaptive traversal of child nodes is introduced for better visual display of restored images. Depth-first traversal combined with breadth-first traversal of the quadtree to accomplish interactive transmission as presented, results in a method that provides competitive performance at a low level of computational complexity. Moreover, our decoding requires only simple arithmetic which is enabling our method to be used for real-time mobile applications.

Time Complexity Analysis of SPIHT(Set Partitioning in Hierarchy Trees) Image Coding Algorithm (SPIHT 영상코딩 알고리즘의 시간복잡도 해석)

  • 박영석
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.1
    • /
    • pp.36-40
    • /
    • 2003
  • A number of embedded wavelet image coding methods have been Proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. The SPIHT algorithm is computationally very simple, but even so it provides excellent numerical and visual results. But the evaluation of its time complexity is no more than the relative result of experimental comparisons and the strict time complexity analysis wasn't taken until now. In this paper, we analyze strictly the processing time complexity of SPIHT algorithm and prove that the time complexity for one bit-plane processing is O( nlog $_2$n) in worst case.

  • PDF