• Journal of Information Technology Applications and Management
• /
• v.10 no.4
• /
• pp.159-168
• /
• 2003

This paper is concerned with the compression of EEG signals using wavelet-packet based techniques. EEG data compression is desirable for a number of reasons. Primarily it decreases for transmission time, archival storage space, and in portable systems, it decreases memory requirements or increases channels and bandwidth. Upon wavelet decomposition, inherent redundancies in the signal can be removed through thresholding to achieve data compression. We proposed the energy cumulative function for deciding of the threshold value and it works very innovative of EEG data.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.594-596
• /
• 1999

It is extremely important to compress a very large multimedia data under the currently used communication networks because of the forthcoming high fast multimedia informations. Wavelets are very popular and useful mathematical tool in the field of signal processing recently. In this paper, signal compression methods using the wavelet packet transform are compared with the other compression method under same threshold condition. As the result, the compression of using the wavelet packet transform is much more effective than the other compressing methods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.11
• /
• pp.673-679
• /
• 2005

This Paper presents the 3D wavelet transformation based video compression system, which possesses the capability of progressive transmission by increasing resolution and increasing rate for multimedia applications. The 3D wavelet packet based video compression system removes the temporal correlation of the input sequences using the motion compensation filter and decomposes the spatio-temporal subband using the spatial wavelet packet transformation. The proposed system allocates the higher bit rate to the low frequency image of the 3D wavelet sequences and improves the 0.49dB PSNR performance of the reconstructed image in comparison with that of H.263. In addition to the limitation on the propagation of the motion compensation error by the 3D wavelet transformation, the proposed system progressively transmits the input sequence according to the resolution and rate scalability.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1602-1605
• /
• 2002

Communication schemes are currently changing from circuit switched towards packet switched. These changes enable access to Internet and multimedia services in wireless network. Provision of real-time IP services in air interface introduces relatively large overhead in RTP/UDP/IP headers. To reduce the overhead, the header compression schemes are required. There exist two header compression schemes (CRTP, ROHC) which are IETF standards. We propose Context-ID detection method which reduces more efficiently the packet loss rate than two existing schemes. Its performance in WCDMA system environment is evaluated for CRTP and ROHC schemes.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.3
• /
• pp.124-130
• /
• 2006

A wavelet-based image compression system allowing both lossless and lossy image compression is proposed in this paper. The proposed algorithm consists of the two stages. The first stage uses the wavelet packet transform and the quad-tree coding scheme for the lossy compression. In the second stage, the residue image taken between the original image and the lossy reconstruction image is coded for the lossless image compression by using the integer wavelet transform and the context based predictive technique with feedback error. The proposed wavelet-based algorithm, allowing an optional lossless reconstruction of a given image, transmits progressively image materials and chooses an appropriate wavelet filter in each stage. The lossy compression result of the proposed algorithm improves up to the maximum 1 dB PSNR performance of the high frequency image, compared to that of JPEG-2000 algorithm and that of S+P algorithm. In addition, the lossless compression result of the proposed algorithm improves up to the maximum 0.39 compression rates of the high frequency image, compared to that of the existing algorithm.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1076-1085
• /
• 2004

Recently, the demands for real-time service and multimedia data are rapidly increasing. There are significant redundancies between header fields both within the same packet header and in consecutive packets belonging to the same packet stream. And there are many overheads in using the current UDP/IP protocol. Header compression is considered to enhance the transmission efficiency for the payload of small size. By sending the static field information only once initially and by utilizing dependencies and predictability for other fields, the header size can be significantly reduced for most packets. This work describes an implementation for header compression of the headers of IP/UDP protocols to reduce the overhead on Ethernet network. Typical UDP/IP Header packets can be compressed down to 7 bytes and the header compression system is designed and implemented in Linux environment. Using the Header compression system designed between a server and clients provides have the advantage of effective data throughput in network. Since the minimum packet size in Ethernet is 64 bytes, the amount of reduction by header compression in practical chatting environment was 6.6 bytes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.625-629
• /
• 2005

According to the rapid development of the information and communication technology, the demand on the efficient compression technology for the multimedia data is increased magnificently. In this Paper, we designed new compression algorithm structure using wavelet base for the compression of ECG signal and audible signal data. We examined the efficiency of the compression between 2-band structure and wavelet packet structure, and investigated the efficiency and reconstruction error by wavelet base function using Daubechies wavelet coefficient and Coiflet coefficient for each structure. Finally, data were compressed further more using Huffman code, and resultant Compression Rate(CR) and Percent Root Mean Square difference(PRD) were compared with those of existent DCT.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.101-110
• /
• 2009

The 6LoWPAN(IPv6 Low-power Wireless Personal Area Network) performs IPv6 header compression, TCP/UDP/IGMP header compression, packet fragmentation and re-assemble to transmit IPv6 packet over IEEE 802,15.4 MAC/PHY. However, from the point of view of security. It has the existing security threats issued by IP packet fragmenting and reassembling, and new security threats issued by 6LoWPAN packet fragmenting and reassembling would be introduced additionally. If fragmented packets are retransmitted by replay attacks frequently, sensor nodes will be confronted with the communication disruption. This paper analysis security threats introduced by 6LoWPAN fragmenting and reassembling, and proposes a re-transmission mechanism that could minimize re-transmission to be issued by replay attacks. Re-transmission procedure and fragmented packet structure based on the 6LoWPAN standard(RFC4944) are designed. We estimate also re-transmission delay of the proposed mechanism. The mechanism utilizes timestamp, nonce, and checksum to protect replay attacks. It could minimize reassemble buffer overflow, waste of computing resource, node rebooting etc., by removing packet fragmentation and reassemble unnecessary.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.641-646
• /
• 2003

Packet processing speed of routers as well as transmission speed of physical links gives a great effect on IP packet transfer rate in Internet. The router forwards a packet after determining the next hop to the packet's destination. IP address lookup is a main design issue for high performance routers. In this paper, we propose a partitioned compressed-trie for speeding-up IP address lookup algorithms based on tie data structure by exploiting path compression. In the ,proposed scheme, IP prefixes are divided into several compressed-tries and lookup is performed on only one partitioned compressed-trie. Memory access time for IP address lookup is lessen due to compression technique and memory required for maintaining partition does not increased.