• 제목/요약/키워드: Compression processing time

검색결과 324건 처리시간 0.138초

실시간 처리를 위한 쿼드트리 기반 무손실 영상압축 및 암호화 (QuadTree-Based Lossless Image Compression and Encryption for Real-Time Processing)

  • 윤정오;성우석;황찬식
    • 정보처리학회논문지C
    • /
    • 제8C권5호
    • /
    • pp.525-534
    • /
    • 2001
  • 일반적으로 무손실 영상압축 및 암호화 방법에는 압축과 암호화 과정이 독립적으로 이루어진다. 압축 후 암호화를 수행하면 압축열이 암호에 대한 평문으로 사용되므로 압축에 따른 엔트로피가 감소하여 랜덤한 성질을 갖게된다. 그러나 압축열 전체에 대한 암호화는 수행시간이 길어져 실시간 처리를 저해하는 원인이 되기도 한다. 본 논문에서는 무손실 영상압축과 암호의 결합에서 전체 처리시간을 줄이는 방법을 제안한다. 이는 쿼드트리 압축 알고리즘으로 그레이 영상을 분해하여 구조부분만을 암호화하는 방법이다. 아울러 영상의 무상관성과 동질영역을 확보하기 위한 변환과정을 수행하여 무손실 압축성능을 개선하였고, 쿼드트리 분해시 암호화되지 않은 데이터를 레벨별로 재구성하여 안전성을 갖도록 하였다. 모의 실험을 통하여 제안한 방법이 영상 압축율의 개선과 암호화 방법의 안전성 확보 및 실시간 처리가 가능함을 확인하였다.

  • PDF

영상 압축을 위한 유사성 함수 연구 (Study on the Similarity Functions for Image Compression)

  • 주우석;강종오
    • 한국정보처리학회논문지
    • /
    • 제4권8호
    • /
    • pp.2133-2142
    • /
    • 1997
  • 프랙탈 영상압축은 블록단위의 비교방식을 사용함으로써 기존의 압축 방법에 비해 획기적으로 증대된 압축율을 보인다. 소프트웨어에 의한 실시간대 재생이 가능함에도 불구하고 프랙탈 영상압축의 실용화에 관건이 되는 것은 압축에 소요되는 시간이다. 본 논문에서는, i)영상내부의 차원정보 추출 및 군집화에 의해 유사블럭 탐색 횟수를 줄임으로써 압축에 소요되는 시간을 최소화시키는 알고리즘과 ii)영상내부의 휘도 및 명암대비 정보를 사용하여 재생영상의 화질을 증가시키는 알고리즘을 제안하고 검증함으로써, 고속이면서도 상대적으로 고화질을 유지할 수 있는 방법을 제시하였다.

  • PDF

Intra-picture Block-matching Method for Codebook-based Texture Compression

  • Cui, Li;Jang, Euee S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권10호
    • /
    • pp.5063-5073
    • /
    • 2016
  • In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.

이동형 Tele-cardiology 시스템 적용을 위한 최저 지연을 가진 웨이브릿 압축 기법 (Wavelet Compression Method with Minimum Delay for Mobile Tele-cardiology Applications)

  • 김병수;유선국;이문형
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권11호
    • /
    • pp.786-792
    • /
    • 2004
  • A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

사출/압축 성형 Center-gated 터스크에서의 잔류 응력과 복굴절의 수치 해석 (II) - 공정조건의 영향 - (Numerical Analysis of Residual Stresses and Birefringence in Injection/Compression Molded Center-gated Disks (II) - Effects of Processing Conditions -)

  • 이영복;권태헌;윤경환
    • 대한기계학회논문집A
    • /
    • 제26권11호
    • /
    • pp.2355-2363
    • /
    • 2002
  • The accompanying paper, Part 1, has presented the physical modeling and basic numerical analysis results of both the flow-induced and thermally-induced residual stress and birefringence in injection molded center gated disks. The present paper, Part II, has attempted to investigate the effects of various processing conditions of injection/compression molding process on the residual stress and birefringence. The birefringence is significantly affected by injection melt temperature, packing pressure and packing time. Birefringence in the shell layer increases as melt temperature gets lower. The inner peak of birefringence increases with packing time and packing pressure. On the other hand, packing pressure, packing time and mold wall temperature affect the thermally-induced residual stress rather significantly in the shell layer, but insignificantly in the core region. Injection/compression molding has been found to reduce the birefringence in comparison with the conventional injection molding process. In particular, mold closing velocity and initial opening thickness in the compression stage of injection/compression molding process have significant effect on the flow-induced birefringence, but not on tile thermal residual stress and the thermally induced birefringence.

분산 얼굴인식을 위한 퍼지로직 기반 비트 압축법 (Fuzzy Logic-based Bit Compression Method for Distributed Face Recognition)

  • 김태영;노창현;이종식
    • 한국시뮬레이션학회논문지
    • /
    • 제18권2호
    • /
    • pp.9-17
    • /
    • 2009
  • 얼굴인식이 널리 사용되기 시작하면서, 얼굴 데이터베이스는 많은 양의 얼굴정보를 담게 되었다. 이러한 얼굴 데이터의 증가로 인하여 분산처리 방법을 이용한 얼굴인식이 주요 주제로 대두되고 있다. 하지만 기존 방법에서는 대용량의 데이터를 전송하는 방법에 대한 논의가 부족하다. 이에 본 논문은 분산처리 환경에서 퍼지로직 기반 비트압축률 선택을 통한 얼굴인식을 제안한다. 제안한 방법은 얼굴인식률, 얼굴인식 수행시간, 전송된 비트 길이를 바탕으로 퍼지추론을 하여 효과적인 압축률을 선택한다. 우리는 제안한 방법과 압축을 하지 않은 데이터, 고정 압축률을 적용한 데이터에 따른 얼굴인식률과 얼굴인식 수행시간을 측정하여 비교하였다. 실험 결과는 퍼지로직 기반 압축률 선택이 수행시간을 감소시키면서도 합리적인 인식률을 유지하는 효과가 있음을 보여준다.

Multi-Description Image Compression Coding Algorithm Based on Depth Learning

  • Yong Zhang;Guoteng Hui;Lei Zhang
    • Journal of Information Processing Systems
    • /
    • 제19권2호
    • /
    • pp.232-239
    • /
    • 2023
  • Aiming at the poor compression quality of traditional image compression coding (ICC) algorithm, a multi-description ICC algorithm based on depth learning is put forward in this study. In this study, first an image compression algorithm was designed based on multi-description coding theory. Image compression samples were collected, and the measurement matrix was calculated. Then, it processed the multi-description ICC sample set by using the convolutional self-coding neural system in depth learning. Compressing the wavelet coefficients after coding and synthesizing the multi-description image band sparse matrix obtained the multi-description ICC sequence. Averaging the multi-description image coding data in accordance with the effective single point's position could finally realize the compression coding of multi-description images. According to experimental results, the designed algorithm consumes less time for image compression, and exhibits better image compression quality and better image reconstruction effect.

압축 왜곡 감소를 위한 CNN 기반 이미지 화질개선 알고리즘 (CNN based Image Restoration Method for the Reduction of Compression Artifacts)

  • 이유호;전동산
    • 한국멀티미디어학회논문지
    • /
    • 제25권5호
    • /
    • pp.676-684
    • /
    • 2022
  • As realistic media are widespread in various image processing areas, image or video compression is one of the key technologies to enable real-time applications with limited network bandwidth. Generally, image or video compression cause the unnecessary compression artifacts, such as blocking artifacts and ringing effects. In this study, we propose a Deep Residual Channel-attention Network, so called DRCAN, which consists of an input layer, a feature extractor and an output layer. Experimental results showed that the proposed DRCAN can reduced the total memory size and the inference time by as low as 47% and 59%, respectively. In addition, DRCAN can achieve a better peak signal-to-noise ratio and structural similarity index measure for compressed images compared to the previous methods.

An Efficient Bit-Level Lossless Grayscale Image Compression Based on Adaptive Source Mapping

  • Al-Dmour, Ayman;Abuhelaleh, Mohammed;Musa, Ahmed;Al-Shalabi, Hasan
    • Journal of Information Processing Systems
    • /
    • 제12권2호
    • /
    • pp.322-331
    • /
    • 2016
  • Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

Motion JPEG2000을 위한 실시간 비디오 압축 프로세서의 하드웨어 구조 및 설계 (Hardware Architecture and its Design of Real-Time Video Compression Processor for Motion JPEG2000)

  • 서영호;김동욱
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권1호
    • /
    • pp.1-9
    • /
    • 2004
  • In this paper, we proposed a hardware(H/W) structure which can compress and recontruct the input image in real time operation and implemented it into a FPGA platform using VHDL(VHSIC Hardware Description Language). All the image processing element to process both compression and reconstruction in a FPGA were considered each of them was mapped into a H/W with the efficient structure for FPGA. We used the DWT(discrete wavelet transform) which transforms the data from spatial domain to the frequency domain, because use considered the motion JPEG2000 as the application. The implemented H/W is separated to both the data path part and the control part. The data path part consisted of the image processing blocks and the data processing blocks. The image processing blocks consisted of the DWT Kernel for the filtering by DWT, Quantizer/Huffman Encoder, Inverse Adder/Buffer for adding the low frequency coefficient to the high frequency one in the inverse DWT operation, and Huffman Decoder. Also there existed the interface blocks for communicating with the external application environments and the timing blocks for buffering between the internal blocks. The global operations of the designed H/W are the image compression and the reconstruction, and it is operated by the unit or a field synchronized with the A/D converter. The implemented H/W used the 54%(12943) LAB(Logic Array Block) and 9%(28352) ESB(Embedded System Block) in the APEX20KC EP20K600CB652-7 FPGA chip of ALTERA, and stably operated in the 70MHz clock frequency. So we verified the real time operation. that is. processing 60 fields/sec(30 frames/sec).