• Title/Summary/Keyword: Compression method

Search Result 3,465, Processing Time 0.034 seconds

Region Classification and Image Based on Region-Based Prediction (RBP) Model

  • Cassio-M.Yorozuya;Yu-Liu;Masayuki-Nakajima
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1998.06b
    • /
    • pp.165-170
    • /
    • 1998
  • This paper presents a new prediction method RBP region-based prediction model where the context used for prediction contains regions instead of individual pixels. There is a meaningful property that RBP can partition a cartoon image into two distinctive types of regions, one containing full-color backgrounds and the other containing boundaries, edges and home-chromatic areas. With the development of computer techniques, synthetic images created with CG (computer graphics) becomes attactive. Like the demand on data compression, it is imperative to efficiently compress synthetic images such as cartoon animation generated with CG for storage of finite capacity and transmission of narrow bandwidth. This paper a lossy compression method to full-color regions and a lossless compression method to homo-chromatic and boundaries regions. Two criteria for partitioning are described, constant criterion and variable criterion. The latter criterion, in form of a linear function, gives the different threshold for classification in terms of contents of the image of interest. We carry out experiments by applying our method to a sequence of cartoon animation. We carry out experiments by applying our method to a sequence of cartoon animation. Compared with the available image compression standard MPEG-1, our method gives the superior results in both compression ratio and complexity.

  • PDF

Low-complexity patch projection method for efficient and lightweight point-cloud compression

  • Sungryeul Rhyu;Junsik Kim;Gwang Hoon Park;Kyuheon Kim
    • ETRI Journal
    • /
    • v.46 no.4
    • /
    • pp.683-696
    • /
    • 2024
  • The point cloud provides viewers with intuitive geometric understanding but requires a huge amount of data. Moving Picture Experts Group (MPEG) has developed video-based point-cloud compression in the range of 300-700. As the compression rate increases, the complexity increases to the extent that it takes 101.36 s to compress one frame in an experimental environment using a personal computer. To realize real-time point-cloud compression processing, the direct patch projection (DPP) method proposed herein simplifies the complex patch segmentation process by classifying and projecting points according to their geometric positions. The DPP method decreases the complexity of the patch segmentation from 25.75 s to 0.10 s per frame, and the entire process becomes 8.76 times faster than the conventional one. Consequently, this proposed DPP method yields similar peak signal-to-noise ratio (PSNR) outcomes to those of the conventional method at reduced times (4.7-5.5 times) at the cost of bitrate overhead. The objective and subjective results show that the proposed DPP method can be considered when low-complexity requirements are required in lightweight device environments.

Power Quality Monitoring Algorithm Using the Protective Relay (보호계전기를 이용한 전기 품질 감시 기법 연구)

  • Choi In. S.;Lee Kang. S.;Choi Myeon. S.;Lim Seong. I.;Lee Seung. J.
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.11
    • /
    • pp.581-588
    • /
    • 2004
  • Power qualify monitoring system is devoted to more concern than before, because the innovation of industrial technology needs more accurate instruments and more advanced power quality. This paper was studied on using data of the protective relay by Power Quality Monitor. This paper was proposed the wave storage condition and monitoring clauses of the protective relay as a power quality monitoring device. The protective relay will have problem to save data for PQM analysis because the protective relay memory is limited. Therefore this paper was proposed new a data compression of data got from the protective relay. This method is wave compression comparison algorithm using the DFT. The compression rate is higher than any other established method. This method can be real time storage. This algorithm is verified using the comparison among other compression rate and proved by Real Time Digital Simulator (RTDS).

A Low-Complexity and High-Quality Image Compression Method for Digital Cameras

  • Xie, Xiang;Li, Guolin;Wang, Zhihua
    • ETRI Journal
    • /
    • v.28 no.2
    • /
    • pp.260-263
    • /
    • 2006
  • This letter proposes a new near-lossless image compression method with only one line buffer cost for a digital camera with Bayer format image. For such format data, it can provide a low average compression rate (4.24bits/pixel) with high-image quality (larger than 46.37dB where the error of every pixel is less than two). The experimental results show that the near-lossless compression method has better performance than JPEG-LS (lossless) with ${\delta}$ = 2 for a Bayer format image.

  • PDF

Lossless Image Compression Using Block-Adaptive Context Tree Weighting (블록 적응적인 Context Tree Weighting을 이용한 무손실 영상 압축)

  • Oh, Eun-ju;Cho, Hyun-ji;Yoo, Hoon
    • Journal of Internet Computing and Services
    • /
    • v.21 no.4
    • /
    • pp.43-49
    • /
    • 2020
  • This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.

Quality Improvement of Oil Palm Trunk Properties by Close System Compression Method

  • Hartono, Rudi;Wahyudi, Imam;Febrianto, Fauzi;Dwianto, Wahyu;Hidayat, Wahyu;Jang, Jae-Hyuk;Lee, Seung-Hwan;Park, Se-Hwi;Kim, Nam-Hun
    • Journal of the Korean Wood Science and Technology
    • /
    • v.44 no.2
    • /
    • pp.172-183
    • /
    • 2016
  • Densification of the inner part of oil palm trunk (OPT) by the close system compression (CSC) method was performed in this study. The effects of the compression temperature and time on the anatomical, physical and mechanical properties of OPT were evaluated. The inner part of OPT with an initial average density of $0.3g/cm^3$ was used as samples. Oven-dried samples were immersed in water and vacuumed until fully saturated and then compressed by CSC at 120, 140, 160 or $180^{\circ}C$ for 10, 20, 30 or 40 min. The anatomical characteristics of transverse and radial sections before and after compression were compared by optical microscopy. The physical and mechanical properties, including the density, recovery of set (RS), modulus of elasticity (MOE), modulus of rupture (MOR), and compression parallel to grain were examined. It was observed that the anatomical characteristic of the inner part of OPT (i.e., vascular bundles, vessels, and parenchyma tissue) became flattened, fractured, and collapsed after compression by CSC. The RS decreased with increasing compression temperature and time. The lower RS indicated high dimensional stability. The physical and mechanical properties (i.e., density, MOR, MOE, and compressive strength) of the inner part of OPT increased with increasing compression temperature and time. Compression by the CSC method at $160^{\circ}C$ for 40 min was the optimum treatment.

Multispectral image data compression using classified vector quantization (영역분류 벡터 양자화를 이용한 다중분광 화상데이타 압축)

  • 김영춘;반성원;김중곤;서용수;이건일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.8
    • /
    • pp.42-49
    • /
    • 1996
  • In this paper, we propose a satellite multispectral image data compression method using classified vector quantization. This method classifies each pixel vector considering band characteristics of multispectral images. For each class, we perform both intraband and interband vector quantization to romove spatial and spectral redundancy, respectively. And residual vector quantization for error images is performed to reduce error of interband vector quantization. Thus, this method improves compression efficiency because of removing both intraband(spatial) and interband (spectral) redundancy in multispectral images, effectively. Experiments on landsat TM multispectral image show that compression efficiency of proposed method is better than that of conventional method.

  • PDF

Fractal Image Compression Using QR Algorithm (QR 알고리즘을 이용한 프렉탈 영상압축)

  • Han, Kun-Hee;Kim, Tae-Ho;Jun, Byoung-Min
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.3 no.4
    • /
    • pp.369-378
    • /
    • 2000
  • Conventional fractal image compression methods have many problems in searching time for matching domain block. Proposed method is an improved method of Fisher's Quadtree Decomposition in terms of time, compression ratio, and PSNR. This method determines range block in advance using QR algorithm. First, input image is partitioned to $4{\times}4$ range block and then recomposition is performed from bottom level to specified level. As a result, this proposed method achieves high encoding and decoding speed, high compression ratio, and high PSNR than Fisher's Quadtree Decomposition method.

  • PDF

Adaptive local histogram modification method for dynamic range compression of infrared images

  • Joung, Jihye
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.6
    • /
    • pp.73-80
    • /
    • 2019
  • In this paper, we propose an effective dynamic range compression (DRC) method of infrared images. A histogram of infrared images has narrow dynamic range compared to visible images. Hence, it is important to apply the effective DRC algorithm for high performance of an infrared image analysis. The proposed algorithm for high dynamic range divides an infrared image into the overlapped blocks and calculates Shannon's entropy of overlapped blocks. After that, we classify each block according to the value of entropy and apply adaptive histogram modification method each overlapped block. We make an intensity mapping function through result of the adaptive histogram modification method which is using standard-deviation and maximum value of histogram of classified blocks. Lastly, in order to reduce block artifact, we apply hanning window to the overlapped blocks. In experimental result, the proposed method showed better performance of dynamic range compression compared to previous algorithms.

Pullout Behavior of Typical friction Anchors and Development of Design Method (앵커 형식별 인발거동과 설계법 개발)

  • 송일준;김가야;홍석우
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.4
    • /
    • pp.43-51
    • /
    • 2003
  • The resistance mechanism of anchor changes according to the types of anchor. Friction anchors are classified into tension and compression types. In this study, the characteristics and mechanism of pullout are analysed, and the design method of anchor and computer program for design are developed through compression test results of anchor body grout. The characteristics of compression anchor, compared with tension anchor, are summarized mainly as follows: (1) The effect of progressive failure of compression anchor body are much smaller than those of tension anchor during pullout of anchor: (2) The skin friction resistance is increased by Possion effect of grout (anchor body) during pullout of compression anchor.