• 제목/요약/키워드: compression method

검색결과 3,449건 처리시간 0.025초

새로운 압축 방식을 이용한 인과관계 순서화 알고리즘 (A causal ordering algorithm using a new compression method)

  • 권봉경;정광수
    • 한국통신학회논문지
    • /
    • 제22권6호
    • /
    • pp.1127-1136
    • /
    • 1997
  • A vector timestamp is used to satisfy message ordering in a group communications. In this paper, we propose a new vector timestamp compression method which is applicable to a single process group environment where one process belongs to only one precess group. An existing compression method compares the fields of the previously sent vector timestamp with thouse of the currently updated vector timestamp, then sends only the modified fields of the vector timestamp. Unlike the previous one, a proposed compression method performs individual compression for each process using the locally maintained vector timestamp information on other processes. Also, we logicallyproved the causal ordering algorithm using the new compression method and compared the performance of the proposed method with one of the previous compression method by computer simulation. Using the proposed compression method, the message overhead required for causal ordering can be reduced.

  • PDF

비트맵과 양자화 데이터 압축 기법을 사용한 BTC 영상 압축 알고리즘 (BTC Algorithm Utilizing Compression Method of Bitmap and Quantization data for Image Compression)

  • 조문기;윤영섭
    • 전자공학회논문지
    • /
    • 제49권10호
    • /
    • pp.135-141
    • /
    • 2012
  • LCD 오버드라이브에서 프레임 메모리 크기를 줄이는 방법으로, BTC 영상 압축이 널리 사용되고 있다. BTC 영상 압축에서압축률을 높이기 위해서는 비트맵 데이터를 압축하거나 양자화 데이터의 압축이 필요하다. 본 논문에서는 압축률을 높이기 위해서 CMBQ-BTC (CMBQ : compression method bitmap and quantization data) 알고리즘을 제안한다. 시뮬레이션으로 기존의 BTC 알고리즘과 PSNR 및 압축비율의 비교를 통해서, 제안한 알고리즘의 효율성을 확인하였다.

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.

격자압축을 이용해 구성된 격자의 효과적인 격자유연화 방법 (An Effective mesh smoothing technique for the mesh constructed by the mesh compression technique)

  • 홍진태;이석렬;양동열
    • 한국소성가공학회:학술대회논문집
    • /
    • 한국소성가공학회 2003년도 춘계학술대회논문집
    • /
    • pp.331-334
    • /
    • 2003
  • In the finite element simulation of hot forging processes using hexahedron, remeshing of a flash is very difficult. The mesh compression method is a remeshing technique to construct an effective hexahedral mesh. However, because mesh is distorted during the compression procedure or the mesh compression method, mesh smoothing is necessary to improve the mesh Qualify. in this study, several geometric mesh smoothing techniques and a matrix norm optimization technique are applied and compared which is more adaptive to the mesh compression method.

  • PDF

의료영상 압축을 위한 통합압축환경시스템 구현 (Implement of Integration Compression Environment System Compressing Medical Images)

  • 추은형;박무훈
    • 한국정보통신학회논문지
    • /
    • 제7권1호
    • /
    • pp.142-148
    • /
    • 2003
  • 병원에서 발생하는 대용량 의료영상들을 저장 및 전송 할 경우에 저장 매체 수요의 증가와 네트워크 속도의 저하 등의 문제점들이 야기된다. 이러한 문제점들을 해결하기 위한 방안으로 의료영상의 압축이 필요하게 되었다. 본 논문에서는 개개의 여러 압축방법들로 하나의 통합된 환경에서 다양한 종류의 의료영상들을 압축할 수 있는 통합압축환경시스템을 설계 및 구현하였다. 이 통합압축환경에 구현된 압축방법들 중에는 DICOM 3.0규약을 따르는 RLC, 무손실 JPEG 압축방식, JPEG방식들이 있다. 그리고 JPEG2000에 사용되어진 이산웨이블릿변환을 이용한 압축방식과 병 변에 대한 정확성을 높이고 압축률을 좋게 하기 위해서 하나의 영상에서 무손실 압축과 손실 압축을 동시에 하는 방법을 제안하였다. 그리고 영상 정보를 효율적 관리할 수 있게 데이터베이스와 연동이 가능하도록 하였다.

A Hybrid Texture Coding Method for Fast Texture Mapping

  • Cui, Li;Kim, Hyungyu;Jang, Euee S.
    • Journal of Computing Science and Engineering
    • /
    • 제10권2호
    • /
    • pp.68-73
    • /
    • 2016
  • An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

새로운 무손실 유니버셜 데이터 압축 기법 (A New Method of Lossless Universal Data Compression)

  • 김성수;이해기
    • 전기학회논문지P
    • /
    • 제58권3호
    • /
    • pp.285-290
    • /
    • 2009
  • In this paper, we propose a new algorithm that improves the lossless data compression rate. The proposed algorithm lessens the redundancy and improves the compression rate evolutionarily around 40 up to 80 percentile depending on the characteristics of binary images used for compression. In order to demonstrate the superiority of the proposed method, the comparison between the proposed method and the LZ78 (LZ77) is demonstrated through experimental results theoretical analysis.

Indicator Elimination for Locally Adaptive Scheme Using Data Hiding Technique

  • Chang, Hon-Hang;Chou, Yung-Chen;Shih, Timothy K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권12호
    • /
    • pp.4624-4642
    • /
    • 2014
  • Image compression is a popular research issue that focuses on the problems of reducing the size of multimedia files. Vector Quantization (VQ) is a well-known lossy compression method which can significantly reduce the size of a digital image while maintaining acceptable visual quality. A locally adaptive scheme (LAS) was proposed to improve the compression rate of VQ in 1997. However, a LAS needs extra indicators to indicate the sources, consequently the compression rate of LAS will be affected. In this paper, we propose a novel method to eliminate the LAS indicators and so improve the compression rate. The proposed method uses the concept of data hiding to conceal the indicators, thus further improving the compression rate of LAS. From experimental results, it is clearly demonstrated that the proposed method can actually eliminate the extra indicators while successfully improving the compression rate of the LAS.

이동형 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.

심폐소생술 방법 변화에 따른 quality 비교 - 30:2와 2:30 비교분석실험 - (Comparison of quality of 30:2 vs. 2:30 CPR in manikins)

  • 엄태환;유순규;최혜경;정지연
    • 한국응급구조학회지
    • /
    • 제14권3호
    • /
    • pp.71-81
    • /
    • 2010
  • Purpose: To minimize an interruption in chest compression, reduce the hands-off time, the American Heart Association has recommended the ratio of chest compression to ventilation ratio to 30:2 from 2005 CPR guideline to 2010 CPR guideline. However, current studies have shown that the hands-off time was > 10 seconds with that method. For this reason, we devised new CPR method that a ventilation to chest compression ratio of 2:30 to reduce pt assessment time and skipped the assessment step of carotid artery pulse would be a more effective way to reduce the hands-off time & the time to set the CPR. According to the more detailed purpose are listed below. 1) We would like to confirm efficiency of a ventilation to chest compression ratio of 2:30 than a chest compression to ventilation ratio of 30:2 to reduce the hands-off time & the time to set the CPR. 2) We would like to evaluate possibility of increasing for chest compression accuracy of a ventilation to chest compression ratio of 2:30 than a chest compression to ventilation ratio of 30:2 3) We would like to evaluate possibility of increasing for ventilation accuracy of a ventilation to chest compression ratio of 2:30 than a chest compression to ventilation ratio of 30:2 Methods: According to 2005 American Heart Association Guidelines, 60 paramedic students(20 students X freshmen, sophomore, junior) performed 5 cycles of 3~ chest compressions : 2 ventilations after A, B, C evaluation with Laerdal Resusci R Anne SkillReporters. After 5 minutes rest, the 60 students performed 5 cycles of 2 ventilations : 30 chest compressions after A, B evaluation with the manikins between 13 and 17 September 2010. The short reports including speed & accuracy of chest compression, respiratory, CPR cycle were gained from the manikins. Hands-off times were measured by assistants. Results: Recently, the importance of high quality CPR was emphasized in order to perform the CPR faster and more accurate. To find out improving the conventional CPR method, we switch the procedure of the compression and the ventilation. By switching the procedure back and forth, we are able to compare the effectiveness of CPR between two type of CPR method which are 2:30 and 30:2 methods. 2:30 is that the breaths is delivered twice, first and perform 30 compressions while 30:2 perform 30 compressions first and give 2 breaths followed by the ABC method. Also, we verify the effectiveness of the hands off time, compression accuracy of the compression through the comparison of the two procedure as mentioned earlier. Consequently research verified that 2:30 is the efficient by providing faster set up delivering more accurate chest compression. Conclusion: 2:30 can minimize a time delay from cardiac standstill until starting the chest compression. In addition, hands-off time which is an interruption in chest compression can be shortened by 2:30 method, which result to effective oxygenation of coronary artery & maintenance of the bloodstream. Once again, performing the 2:30 method provide lessen hands off time and increase the accuracy of the chest compression.

  • PDF