• Title/Summary/Keyword: Real-time compression

Search Result 366, Processing Time 0.025 seconds

Video object segmentation and frame preprocessing for real-time and high compression MPEG-4 encoding (실시간 고압축 MPEG-4 부호화를 위한 비디오 객체 분할과 프레임 전처리)

  • 김준기;이호석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.147-161
    • /
    • 2003
  • Video object segmentation is one of the core technologies for content-based real-time MPEG-4 encoding system. For real-time requirement, the segmentation algorithm should be fast and accurate but almost all existing algorithms are computationally intensive and not suitable for real-time applications. The MPEG-4 VM(Verification Model) has provided basic algorithms for MPEG-4 encoding but it has many limitations in practical software development, real-time camera input system and compression efficiency. In this paper, we implemented the preprocessing system for real-time camera input and VOP extraction for content-based video coding and also implemented motion detection to achieve the 180 : 1 compression rate for real-time and high compression MPEG-4 encoding.

Implementation of Real Time 3 channel Transmission System Using ECG Data Compression Algorithm by Max-Min Slope Update (최대 및 최소 기울기 갱신에 의한 ECG 압축 알고리듬을 이용한 실시간 3채널 전송시스템 구현)

  • 조진호;김명남
    • Journal of Biomedical Engineering Research
    • /
    • v.16 no.3
    • /
    • pp.271-278
    • /
    • 1995
  • An ECG data compression algorithM using max-min slope update is proposed and a real time 3 channel ECG transmission system is implemented using the proposed algorithm. In order to effectively compress ECG data, we compare a threshold value with the max-min slope difference (MMSD) which is updated at each sample values. If this MMSD value is smaller than the threshold value, then the data is compressed. Conversely, when the MMSD value is larger than threshold value, the data is transmitted after storing the value and the length between the data which is beyond previous threshold level. As a result, it can accurately compress both the region of QRS, P, and T wave that has fast-changing and the region of the base line that slope is changing slow. Therefore, it Is possible to enhance the compression rate and the percent roms difference. In addition, because of the simplicity, this algorithm is more suitable for real-time implementation.

  • PDF

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

  • Cui, Li;Jang, Euee S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

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

  • Yoon, Jeong-Oh;Sung, Woo-Seok;Hwang, Chan-Sik
    • The KIPS Transactions:PartC
    • /
    • v.8C no.5
    • /
    • pp.525-534
    • /
    • 2001
  • Generally, compression and encryption procedures are performed independently in lossless image compression and encryption. When compression is followed by encryption, the compressed-stream should have the property of randomness because its entropy is decreased during the compression. However, when full data is compressed using image compression methods and then encrypted by encryption algorithms, real-time processing is unrealistic due to the time delay involved. In this paper, we propose to combine compression and encryption to reduce the overall processing time. It is method decomposing gray-scale image by means of quadtree compression algorithms and encrypting the structural part. Moreover, the lossless compression ratio can be increased using a transform that provides an decorrelated image and homogeneous region, and the encryption security can be improved using a reconstruction of the unencrypted quadtree data at each level. We confirmed the increased compression ratio, improved encryption security, and real-time processing by using computer simulations.

  • PDF

A Hybrid Texture Coding Method for Fast Texture Mapping

  • Cui, Li;Kim, Hyungyu;Jang, Euee S.
    • Journal of Computing Science and Engineering
    • /
    • v.10 no.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.

Compression and Visualization Techniques for Time-Varying Volume Data (시변 볼륨 데이터의 압축과 가시화 기법)

  • Sohn, Bong-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.85-93
    • /
    • 2007
  • This paper describes a compression scheme for volumetric video data(3D space X 1D time) there each frame of the volume is decompressed and rendered in real-time. Since even one frame size of volume is very large, runtime decompression can be a bottleneck for real-time playback of time-varying volume data. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and only update significantly changing blocks. The results show that our compression scheme compromises decompression speed and image quality well enough for interactive time-varying visualization.

  • PDF

High Performance QoS Traffic Transmission Scheme for Real-Time Multimedia Services in Wireless Networks

  • Kang, Moonsik
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.3
    • /
    • pp.182-191
    • /
    • 2012
  • This paper proposes a high performance QoS (Quality of Service) traffic transmission scheme to provide real-time multimedia services in wireless networks. This scheme is based on both a traffic estimation of the mean rate and a header compression method by dividing this network model into two parts, core RTP/UDP/IP network and wireless access parts, using the IEEE 802.11 WLAN. The improvement achieved by the scheme means that it can be designed to include a means of provisioning the high performance QoS strategy according to the requirements of each particular traffic flow by adapting the header compression for real-time multimedia data. A performance evaluation was carried out to show the effectiveness of the proposed traffic transmission scheme.

  • PDF

New high-efficient universal code(BL-beta) proposal for com pressed data transferring of real-time IoT sensing or financia l transaction data (IoT 및 금융 거래 실시간 데이터 정보의 압축 전송을 위한 새로운 고효율 유니버설 코드(BL-beta) 제안)

  • Kim, Jung-Hoon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.421-429
    • /
    • 2018
  • While IoT device sensing data or financial transaction data is transmitted in real time, huge data traffic is generated in processing it. This huge data can be effectively compressed or transmitted using universal code, which is a real-time lossless compressor. In this paper, we propose our BL-beta code, which is newly developed universal code for compressing stock trading data, which the maximum range of measured values is difficult to predict and is generated within a relatively constant range over a very short period of time. For compressing real-time stock trading data, Compared with the fixed length bit transmission, the compression efficiency is at least 49.5% higher than that of the fixed length bit transmission, and the compression transmission performance is 16.6% better than the Exponential Golomb code.

Implementation of RTP based Image Transport System using JPEG2000 (RTP 기반의 JPEG2000 영상 전송 시스템 구현)

  • 박동진;정영기
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.355-358
    • /
    • 2002
  • In this paper, we propose RTP(Real-Time Transport Protocol) based image transport system to transport still images in real-time after JPEG2000 compression, which is still image compression standard for next generation. To add RTP packet on UDP packet, the image transport system inserts packetizer and depacketizer process into transmitter and receiver of RTP data, respectively. We apply the proposed system to several image and compare the transport time to TCP-based method.

  • PDF

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).