• Title/Summary/Keyword: Information compression

Search Result 2,191, Processing Time 0.03 seconds

Modeling and prediction of buckling behavior of compression members with variability in material and/or section properties

  • Gadalla, M.A.;Abdalla, J.A.
    • Structural Engineering and Mechanics
    • /
    • v.22 no.5
    • /
    • pp.631-645
    • /
    • 2006
  • Buckling capacity of compression members may change due to inadvertent changes in the member section dimensions or material properties. This may be the result of repair, modification of section properties or degradation of the material properties. In some occasions, enhancement of buckling capacity of compression members may be achieved through splicing of plates or utilization of composite materials. It is very important for a designer to predict the buckling resistance of the compression member and the important parameters that affect its buckling strength once changes in section and/or material properties took place. This paper presents an analytical approach for determining the buckling capacity of a compression member whose geometric and/or material properties has been altered resulting in a multi-step non-uniform section. This analytical solution accommodates the changes and modifications to the material and/or section properties of the compression member due to the factors mentioned. The analytical solution provides adequate information and a methodology that is useful during the design stage as well as the repair stage of compression members. Three case studies are presented to show that the proposed analytical solution is an efficient method for predicting the buckling strength of compression members that their section and/or material properties have been altered due to splicing, coping, notching, ducting and corrosion.

Quad Tree Representation and Compression for LiDAR Data (LiDAR 데이터의 Quad Tree 구조 표현과 압축에 관한 연구)

  • Lee, Hyo-Jong;Woo, Seung-Young;Jo, Ki-Seong
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.753-754
    • /
    • 2008
  • LiDAR data are acknowledged as very useful method to represent 3-D geographical information. In this paper aquad tree has been utilized to represent the 3-D spatial information. Compression algorithm is implemented based on a given threshold. The efficiency of compress is very high with large threshold values.

  • PDF

Design and Implementation of Medical Image Information System (의료 화상 정보 시스템의 설계 및 구현)

  • 지은미;권용무
    • Journal of Biomedical Engineering Research
    • /
    • v.15 no.2
    • /
    • pp.121-128
    • /
    • 1994
  • In this paper, MIlS (Medical Image Information System) has been designed and implemented using INGRES RDBMS, which is based on a client/server architecture. The implemnted system allows users to register and retrieve patient information, medical images and diagnostic reports. It also provides the function to display these information on workstation windows simultaneously by using the designed menu-driven graphic user interface. The medical image compression! decompression techniques are implemented and integrated into the medical image database system for the efficient data storage and the fast access through the network.

  • PDF

Comparative Experiment of 2D and 3D DCT Point Cloud Compression (2D 및 3D DCT를 활용한 포인트 클라우드 압축 비교 실험)

  • Nam, Kwijung;Kim, Junsik;Han, Muhyen;Kim, Kyuheon;Hwang, Minkyu
    • Journal of Broadcast Engineering
    • /
    • v.26 no.5
    • /
    • pp.553-565
    • /
    • 2021
  • Point cloud is a set of points for representing a 3D object, and consists of geometric information, which is 3D coordinate information, and attribute information, which is information representing color, reflectance, and the like. In this way of expressing, it has a vast amount of data compared to 2D images. Therefore, a process of compressing the point cloud data in order to transmit the point cloud data or use it in various fields is required. Unlike color information corresponding to all 2D geometric information constituting a 2D image, a point cloud represents a point cloud including attribute information such as color in only a part of the 3D space. Therefore, separate processing of geometric information is also required. Based on these characteristics of point clouds, MPEG under ISO/IEC standardizes V-PCC, which imitates point cloud images and compresses them into 2D DCT-based 2D image compression codecs, as a compression method for high-density point cloud data. This has limitations in accurately representing 3D spatial information to proceed with compression by converting 3D point clouds to 2D, and difficulty in processing non-existent points when utilizing 3D DCT. Therefore, in this paper, we present 3D Discrete Cosine Transform-based Point Cloud Compression (3DCT PCC), a method to compress point cloud data, which is a 3D image by utilizing 3D DCT, and confirm the efficiency of 3D DCT compared to V-PCC based on 2D DCT.

Moving Image Compression with Splitting Sub-blocks for Frame Difference Based on 3D-DCT (3D-DCT 기반 프레임 차분의 부블록 분할 동영상 압축)

  • Choi, Jae-Yoon;Park, Dong-Chun;Kim, Tae-Hyo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.1
    • /
    • pp.55-63
    • /
    • 2000
  • This paper investigated the sub-region compression effect of the three dimensional DCT(3D-DCT) using the difference component(DC) of inter-frame in images. The proposed algorithm are the method that obtain compression effect to divide the information into subband after 3D-DCT, the data appear the type of cubic block(8${\times}$8${\times}$8) in eight difference components per unit. In the frequence domain that transform the eight differential component frames into eight DCT frames with components of both spatial and temporal frequencies of inter-frame, the image data are divided into frame component(8${\times}$8 block) of time-axis direction into 4${\times}$4 sub block in order to effectively obtain compression data because image components are concentrate in corner region with low-frequency of cubic block. Here, using the weight of sub block, we progressed compression ratio as consider to adaptive sub-region of low frequency part. In simulation, we estimated compression ratio, reconstructed image resolution(PSNR) with the simpler image and the complex image contained the higher frequency component. In the result, we could obtain the high compression effect of 30.36dB(average value in the complex-image) and 34.75dB(average value in the simple-image) in compression range of 0.04~0.05bpp.

  • PDF

A Study on DWT Compression of Interlaced Images (Interlace 영상의 DWT 압축에 관한 연구)

  • 김윤호;허창우;오용선;류광렬
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.392-397
    • /
    • 2000
  • An Interlaced 2D field images compression technique by Discrete Wavelet Transform is proposed. The result has a good image resolution and compression rate, PSNR, and reduces processing time of compression. PSNR depends on the exponential function corresponding to 2 power N has higher 30% than DCT. And It is easier to process the inter-frame and fast to work a second with each parallel field processing, and more be able to approximate a frame on the field.

  • PDF

Quadtree Based Image Compression in Wavelet Transform Domain (웨이브렛 변환 영역에서 쿼드트리 기반 영상압축)

  • 소이빈;조창호;이상효;이상철;박종우
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2303-2306
    • /
    • 2003
  • The Wavelet Transform providing both of the frequency and time information of an image is proved to be very much effective for the compression of images, and recently lot of studies on coding algorithms for images decomposed by the wavelet transform together with the multiresolution theory are going on. This paper proposes a Quadtree decompositon method of image compression applied to the images decomposed by wavelet transform by using the correlations between pixels .Since the coefficients obtained by the wavelet transform have high correlations between scales, the Quadtree method can reduce the data quantity effectively The experimental image with 256${\times}$256 size was used to compare the Performances of the existing and the proposed compression methods.

  • PDF

Development of Absolute Moment Block Truncation Coding Algorithm using Flexible Base Point(Mean of Block) (이동기준점을 이용한 AMBTC 알고리즘 개발)

  • Choi, Yong-Soo
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.10 no.2
    • /
    • pp.80-85
    • /
    • 2011
  • In this paper, I propose flexible base point used for a BTC(Block Truncation Coding). Halftoning images are used for printer by reducing the number of pixel depth. During over 20 years, many researches have been studied to apply this techniques to image compression. BTC algorithms are the compression methods using digital halftoning technique about images. In the BTC algorithm, an image block is divided into higher and lower domain compared with the mean of block. then the MAX and MIN representative values are evaluated by calculating the mean of higher and lower domain respectively. At a result, an image block(for example 88 size) is compressed into 64bits pixel representation and 16 bits of the MAX and MIN. And they also have been tried to sustain the image quality high after compression. In this paper, I found that there is some marginal possibility to enhance the image quality by adjusting the base point(generally mean of block) of existing algorithms.

  • PDF

Fractal image compression with perceptual distortion measure (인지 왜곡 척도를 사용한 프랙탈 영상 압축)

  • 문용호;박기웅;손경식;김윤수;김재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.587-599
    • /
    • 1996
  • In general fractal imge compression, each range block is approximated by a contractive transform of the matching domain block under the mean squared error criterion. In this paper, a distortion measure reflecting the properties of human visual system is defined and applied to a fractal image compression. the perceptual distortion measure is obtained by multiplying the mean square error and the noise sensitivity modeled by using the background brightness and spatial masking. In order to compare the performance of the mean squared error and perceptual distortion measure, a simulation is carried out by using the 512*512 Lena and papper gray image. Compared to the results, 6%-10% compression ratio improvements under improvements under the same image quality are achieved in the perceptual distortion measure.

  • PDF

Efficient rate control algorithm for video near-lossless compression (비디오 준무손실 압축을 위한 효율적인 레이트 컨트롤 알고리즘)

  • Joh, Beom Seok;Kim, Young Ro
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.2
    • /
    • pp.11-17
    • /
    • 2010
  • In this paper, we propose efficient rate control algorithm for video near-lossless compression. The proposed method adjusts pixel error range using amounts of previous encoded bits and target bits at a slice encoding interval. Thus, encoded bits by the proposed method are transmitted well through limited bandwidth without overflow. Also, target bits and encoded bits can be controlled according to transmission policy. Experimental results show that our proposed method not only almost fits compression ratio, but also has better image quality.