• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.75-82
• /
• 2009

In this paper, we propose a robust preprocessing scheme for entropy coding in gray-level image. The issue of this paper is to reduce additional information needed when bit stream is transmitted. The proposed scheme uses the preprocessing method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ranked numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.1%, 37.5% comparing to the entropy coding and conventional preprocessing scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1572-1582
• /
• 2011

The rapid growth of UnderWater Acoustic Sensor Networks (UW-ASNs) has led researchers to enhance underwater MAC protocols against limitations existing in underwater environment. We propose the customized robust real-time packet inspection mechanism with addressing the problem of the search for the data packet loss and network performance quality analysis in UW-ASNs, and describe our experiences using this approach. The goal of this work is to provide a framework to assess the network real-time performance quality. We propose a customized and adaptive mechanism to detect, monitor and analyze the data packets according to the MAC protocol standards in UW-ASNs. The packet analyzing method and software we propose is easy to implement, maintain, update and enhance. We take input stream as real data packets from sniffer node in capture mode and perform fully analysis. We were interested in developing software and hardware designed tool with the same capabilities which almost all terrestrial network packet sniffers have. Experimental results confirm that the best way to achieve maximum performance requires the most adaptive algorithm. In this paper, we present and offer the proposed packet analyzer, which can be effectively used for implementing underwater MAC protocols.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.1027-1038
• /
• 2002

Multimedia data services have been widely developed with the recent progression of the Internet technology. Multimedia services, especially, must guarantee Quality of Service with restricted environment resources. The abrupt increase of transmission quanta, so called burst, and the number of client that access multimedia server, with limited network bandwidth will demage the quality of service and the utilization of network resource. Smoothing techniques can reduce the burst of a variable bit rate stream by transmitting data at a series of fixed rates. In this paper, we present a new smoothing algorithm using MPEG's characteristics in transmitting stored video data with VBR. The smoothing algorithm we present will be verified with assorted existing techniques in diverse environments.

• Journal of Digital Contents Society
• /
• v.8 no.1
• /
• pp.9-15
• /
• 2007

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CBA, MCBA, MVBA, e-PCRTT and others. e-PCRTT algorithm, which was improved from PCRTT, restricts the number of rate changes with fixed-size run. This causes unnecessary rate changes when run size is small and buffer size is large. In this paper, to overcome a shortcoming of e-PCRTT algorithm, a smoothing algorithm is proposed, which is improved from e-PCRTT, where a transmission rate transmits more intervalsl as possible. Experiments demonstrated that the proposed algorithm outperformed e-PCRTT algorithm. In order to show the performance, various evaluation factors were used such as the number of transmission rate changes, peak rate, transmission rate variability and so on.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.1-5
• /
• 2011

Feedback with carry shift registers (FCSRs) over 2-adic number would be suitable in hardware implementation, but the are not efficient in software implementation since their basic unit (the size of register clls) is 1-bit. In order to improve the efficiency we consider FCSRs over $2^{\ell}$-adic number (i.e., FCSRs with register cells of size ${\ell}$-bit) that produce ${\ell}$ bits at every clocking where ${\ell}$ will be taken as the size of normal words in modern CPUs (e.g., ${\ell}$ = 32). But, it is difficult to deal with the carry that happens when the size of summation results exceeds that of normal words. We may use long variables (declared with 'unsigned _int64' or 'unsigned long long') or conditional operators (such as 'if' statement) to handle the carry, but both the arithmetic operators over long variables and the conditional operators are not efficient comparing with simple arithmetic operators (such as shifts, maskings, xors, modular additions, etc.) over variables of size ${\ell}$-hit. In this paper, we propose some conditions for FCSRs over $2^{\ell}$-adic number which admit fast software implementations using only simple operators. Moreover, we give two implementation examples for the FCSRs. Our simulation result shows that the proposed methods are twice more efficient than usual methods using conditional operators.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.68-78
• /
• 2008

The transmission of multimedia information over error-prone channels such as wireless networks has become an important area of research. In this paper, we propose two Error Concealment(EC) schemes for wireless transmission of JPEG2000 image. The Multiple Representation(MR) is employed as the preprocessing in our schemes, whereas the main error concealing operation is applied in wavelet domain at receiver side. The compressed code-stream of several subsampled versions of original image is transmitted over a single channel with random bit errors. In the decoder side, the correctly reconstructed wavelet coefficients are utilized to recover the corrupted coefficients in other sub-images. The recovery is carried out by proposed basic(MREC-BS) or enhanced(MREC-ES) methods, both of which can be simply implemented. Moreover, there is no iterative processing during error concealing, which results a big time saving. Also, the simulation results confirm the effectiveness and efficiency of our proposed schemes.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.679-686
• /
• 2002

The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.

• Journal of Broadcast Engineering
• /
• v.24 no.1
• /
• pp.182-185
• /
• 2019

This paper analyzes performances of modules in implementing a programmable multi-format video decoder. The goal of the proposed platform is the high-end Full High Definition (FHD) video decoder. The proposed multi-format video decoder consists of a reconfigurable processor, dedicated bit-stream co-processor, memory controller, cache for motion compensation, and flexible hardware accelerators. The experiments suggest performance baseline of modules for the proposed architecture operating at 300 MHz clock with capability of decoding HEVC bit-streams of FHD 30 frames per second.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.37-43
• /
• 2023

Compressed still image or video bitstreams require protection from channel errors in a wireless channel. Embedded Zerotree Coding(EZW), SPIHT could have provided unprecedented high performance in image compression with low complexity. If bit error is generated by dint of wireless channel transmission problem, the loss of synchronization on between encoder and decoder causes serious performance degradation. But wavelet zerotree coding algorithms are producing variable-length codewords, extremely sensitive to bit errors. The idea is to partition the lifting coefficients. A many partition of lifting transform coefficients distributes channel error from wireless channel to each partition. Therefore synchronization problem that caused quality deterioration in still image and video stream was improved.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.791-793
• /
• 2006

In the satellite camera, the incoming light source is converted to electronic analog signals by the electronic component for example CCD (Charge Coupled Device) detectors. The analog signals are amplified, biased and converted into digital signals (pixel data stream) in the video processor (A/Ds). The outputs of the A/Ds are digitally multiplexed and driven out using differential line drivers (two pairs of wires) for cross strap requirement. The MSC (Multi-Spectral Camera) in the KOMPSAT-2 which is a LEO spacecraft will be used to generate observation imagery data in two main channels. The MSC is to obtain data for high-resolution images by converting incoming light from the earth into digital stream of pixel data. The video data outputs are then MUXd, converted to 8 bit bytes, serialized and transmitted to the NUC (Non-Uniformity Correction) module by the Hotlink data transmitter. In this paper, the video data streams, the video data format, and the image data processing routine for satellite camera are described in terms of satellite camera control hardware. The advanced satellite with very high resolution requires faster and more complex image data chain than this algorithm. So, the effective change of the used image data chain and the fast video data transmission method are discussed in this paper