• Title/Summary/Keyword: JPEC2000

Search Result 4, Processing Time 0.05 seconds

Parallel Processing Algorithm of JPEG2000 Using GPU (GPU를 이용한 JPEG2000 병렬 알고리즘)

  • Lee, Dong-Ha;Cho, Shi-Won;Lee, Dong-Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.6
    • /
    • pp.1075-1080
    • /
    • 2008
  • Most modem computers or game consoles are well equipped with powerful graphics processing units(GPUs) to accelerate graphics operations. However, since the graphics engines in these GPUs are specially designed for graphics operations, we could not take advantage of their computing power for more general nongraphic operations. In this paper, we studied the GPUs graphics engine in order to accelerate the image processing capability. Specifically, we implemented a JPEC2000 decoding/encoding framework that involves both OpenMP and GPU. Initial experimental results show that significant speed-up can be achieved by utilizing the GPU power.

A Slope Information Based Fast Mask Generation Technique for ROI Coding (관심영역 코딩을 위한 기울기 정보 기반의 빠른 마스크 생성 기법)

  • Park, Sun-Hwa;Seo, Yeong-Geon;Lee, Bu-Kweon;Kang, Ki-Jun;Kim, Ho-Yong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.81-89
    • /
    • 2009
  • To support dynamic Region-of-Interest(ROI) in JPEG2000, a fast ROI mask generation is needed. In the existing methods of ROI coding, after scanning all the pixels in order and discriminating ROI, an ROI mask has been generated. Our method scans 4 pixels of the corners in one code block, and then based on those informations, scans the edges from the corners to get the boundaries of ROI and background. These informations are consisted of a distributed information of ROI and two coordinates of the pixels, which are the points the edges and the boundaries meet. These informations are transmitted to encoder and supported for fast ROI mask generation. There were no great differences between the proposed method and the existing methods in quality, but the proposed method showed superiority in speed.

A Design of Acoustic-based Underwater Image Transmission System Based on the Multipath Analysis. (Multipath를 고려한 수중영상 전송 시스템 설계)

  • 임용곤;박종원;최영철
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.419-425
    • /
    • 2000
  • This paper deals with an analysis of multipath which affect a transmission performance in underwater acoustic channel. Underwater acoustic channel with multipath structure is introduced to mathematical modelling for a basin environment. In this paper, SMR(Signal to Multipath Ratio) which is defined as a parameter of multipath's effect is presented as a mathematical equation, and the equation of SMR is simulated by MATLAB program. Furthermore, this paper is also dealt with an implementation of modulation and demodulation system for acoustic transmission Acoustic Transmission is limited by frequency bandwidth so $\pi$/4 Quadrature Phase Shift Keying) methods which is very useful at frequency limitation and FM(Frequency Modulation) are used at acoustic communication system. This implemented hybrid modulation/demodulation system is used as an analog board of image transmission system

  • PDF

Digital Watermarking Algorithm for Copyright Protection of JPEG Image (JPEG 영상의 저작권 보호를 위한 Digital Watermarking 알고리즘)

  • Park, Eun-Suk;Woo, Jong-Won;Lee, Seok-Hee;Heo, Yoon-Seok;Cho, Ki-Hyung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.1
    • /
    • pp.296-305
    • /
    • 2000
  • In this paper, we propose the method of embedding the encrypted digital watermark in quantization coefficient when we encode the image data in the process of JPEC. The proposed method is as following. After a DCT coefficient of each block is quantized, we arrange the quantization coefficient as on dimension with a zigzag scan and replace each block. By applying even-odd feature of frequency of the encrypted watermark to a quantization coefficient of some fixed domain of replaced each block and embedding it, we obtain the compressed image data by encoding after placing it in the order prior to replacement. The advantages of the proposed method here are as follows: We can embed many information keeping a secret as much as possible by using the algorithm of block replacement. We can control the amount of embedding of each use, as we embed the encrypted information by selecting some fixed domain of a quantization coefficient, we can fix the embedding data regardless of the image and the value of quantization. We verified the results by experiments and analyzed the efficiency of them in comparison with the former study.

  • PDF