• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.290-296
• /
• 2008

In this paper development of on-line data visualization program is described and some examples of data postprocessing are shown. The program is written in JAVA language and runs as a JAVA applet on the web browser such as Internet Explorer or Firefox. Remote users can use the program to visualize and analyze their own flow data by accessing the program server through the internet and loading data files in proper formats from their local computers. This paper describes briefly about algorithms for data visualization, structure and available functions of the program, and web sever system. The mechanism of how the JAVA applet can access and process local data files and relevant coding techniques are explained as well. Also explained is what is required for the remote users and client computers to access the program on-line. Some visualization examples performed on a local computer are illustrated by accessing the server remotely.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.290-296
• /
• 2008

In this paper development of on-line data visualization program is described and some examples of data postprocessing are shown. The program is written in JAVA language and runs as a JAVA applet on the web browser such as Internet Explorer or Firefox. Remote users can use the program to visualize and analyze their own flow data by accessing the program server through the internet and loading data files in proper formats from their local computers. This paper describes briefly about algorithms for data visualization, structure and available functions of the program, and web sever system. The mechanism of how the JAVA applet can access and process local data files and relevant coding techniques are explained as well. Also explained is what is required for the remote users and client computers to access the program on-line. Some visualization examples performed on a local computer are illustrated by accessing the server remotely.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.761-776
• /
• 2012

This paper proposes the revised Roman character code system using Unicode 3.0. The background of the paper is whether the Latin character code system th using in the world in Unicode V.3 is proper or not in the side of the transmission efficiency in data communications. In data communications, when the consecutive 4 bits or 8 bits of "0" bit from the information devices input into the line coder, its consecutive "0" bits are scrambled to the predetermined bit patterns to avoid the syncronization loss. The paper was based on the statistical data for the using frequency of the alphabet letter and the proposed rule for characters coding in [1]. The paper was focused to improve of Unicode itself and UTF-8 code system. As a result of the paper, when the proposed coding systems for Latin character in Unicode 3.0 itself and UTF-8 code system, the scrambler efficiency using HDB-3 in the line coder of the data transmission system could be improved about 3645 ~ 31400% and 480 ~ 1700% respectively.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.11-18
• /
• 2009

In this paper, we introduce a novel method to extend the JPEG standard, which is the most widely used for lossy image compression, in order to improve compression ratio. To employ two of the most successful methodologies for the data compression: differential coding and quantization simultaneously, we propose a line-based approach. For each line in a block, we apply one-dimensional discrete cosine transformation to the increments instead of the pixel values. Those values are quantized and entropy-coded similarly to the JPEG standard. To further increase compression ratio, the proposed method is plugged into the JPEG standard to form a new compression method, in which the proposed method are applied to only selected JPEG blocks. In our experiment, we found that the proposed method outperform the JPEG standard when the qualities of the coded images are set to be high. We believe the proposed method can be simply plugged into the standard to improve its compression ratio for higher quality images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3056-3068
• /
• 1996

This papre presents the RDM algorithm for composition of bit. After this, we propose a digital signature scheme for facsimile document using RDM algorithm. We modify the even-odd feature in distance of changing pel between coding line and multiple reference line which have been scanned before, and run-length in coding line. The time to take in signature is reduced by spreading of signature. Non-repudiation in origin, the 3rd condition of digital signature is realized by proposed digital signature scheme. The transmitter embeds the signature secretly and tensfers it, and the receiver makes a check of any forgery on the signature and the document. This scheme is compatible with the ITU-T.4(G3 or G4 facsimile standard). The total amount of data transmitted and the quality of image are about the same to that of the original document, thus a third party does not notics signature embeded on the document.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.68-77
• /
• 2000

Line special frequency (LSF) parameters have been widely used in low bit-rate speech coding due to their efficiency for representing the short-time speech spectrum. In this paper, a new distance measure based on the masking properties of human ear is proposed for quantizing LSF parameters whereas most conventional quantization methods are based on the weighted Euclidean distance measure. The proposed method derives the perceptual distance measure from the definition of noise-to-mask ratio (NMR) which has high correspondence with the actual distortion received in the human ear and uses it for quantizing LSF parameters. In addition, we propose an adaptive bit allocation scheme, which allocates minimal bits to LSF parameters maintaining the perceptual transparency of given speech frame for reducing the average bit-rates. For the performance evaluation, we has shown the ratio of perceptually transparent frames and the corresponding average bit-rates for the conventional and proposed methods. By jointly combining the proposed distance measure and adaptive bit allocation scheme, the proposed system requires only 770 bps for obtaining 95.5% perceptually transparent frames, while the conventional systems produce 89.9% at even 1800 bps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.10-23
• /
• 1994

To transmit information efficiently and securely in On-line transmission, data compression, secrecy and authentication are required. In this paper, we propose LZWH4 which creates two compression strings with applying Hnageul to LZW. design HDES1 by extending S-box (S1-S16) which satsfies SAC and correlation coefficient as a partial countermeasure of Differential Cryptanalysis and implement LZWHDES1 which concatenates efficiently these for digital signature in On-line transmission. Also HDES1 is more in U.D.(Unicity Distance) than DES and HDES. We show that the proposed LZWHDES1 reduces processing times than LZWHDES which LZW is directly concatnated to DES and LZWHDES which LZWH1 is directly concatenated to HDES. LZWHDES1 can be used to digital signature system as conventional key cryptosystem.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.2
• /
• pp.102-108
• /
• 2017

Videos for 360-degree virtual reality (VR) systems have a large amount of data because they are made with several different videos from multiple cameras. To store the VR data in limited space or to transmit it through a channel with limited bandwidth, the data need to be compressed at a high ratio. This paper focuses on the compression efficiency of VR videos for good visual quality. Generally, 360-degree VR videos should be projected into the planer format to cope with modern video coding standards. Among various projection schemes, three typical schemes (equirectangular, line-cubic, and cross-cubic) are selected and compared in terms of compression efficiency and quality using various videos.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.124-129
• /
• 2009

Although the maximum sum-rate capacity of multiple-input multiple output(MIMO) broadcast channels(BCs) can be achieved by dirty-paper coding(DPC), the results were obtained without fairness considerations in uncorrelated MIMO channels. In this paper, we propose new multiuser scheduling algorithms, which find a best user set for approaching the maximum sum-rate capacity while maintaining fairness among users. We analyze the performance of the proposed algorithms using zero-forcing dirty paper coding(ZF-DPC) in the correlated MIMO BCs for throughput and delay fairness, respectively. Numerical results demonstrate that a large time window can reduce the average throughput difference between users, but it increases head-of-line(HOL) delay jitters in the case of delay fairness.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.656-665
• /
• 1990

In this paper, some new results on minimum-bandwidth system are presented. First, we state sufficient condition for the existance of a existance of a power spectral null at the zero frequency and Nyquist frequency. Second, eye boundary functions and eyewidth are obtained for minimum-bandwidth systems of arbitrary numbers of transmitted symbol levels. Third, for linear minimum-bandwidth systems usually known as PR systems, we derived formulars for evaluating DSVs and ASVs in terms of the coefficients of the system polynomials and using formulars, we obtain DSVs and ASVs of various PR systems. Last, the relations among DSV, ASV, power spectral nulls, system polynomial nulls, and the minimum-bandwidth property are summarized.