• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.24-31
• /
• 2003

In this paper, a new opto-digital multiple information hiding and real-time extracting system is implemented. That is, multiple information is hidden in a cover image by using the stego keys which are generated by combined use of random sequence(RS) and Hadamard matrix(HM) and these hidden information is extracted in real-time by using a new optical correlator-based extraction system. In the experiment, 3 kinds of information, English alphabet of "N", "R", "L" having 512$\times$512 pixels, are formulated 8$\times$8 blocks and each of these information is multiplied with the corresponding stego keys having 64$\times$64 pixels one by one. And then, by adding these modulated data to a cover image of "Lena"having 512$\times$512 pixels, a stego image is finally generated. In this paper, as an extraction system, a new optical nonlinear joint transform correlator(NJTC) is introduced to extract the hidden data from a stego image in real-time, in which optical correlation between the stego image and each of the stego keys is performed and from these correlation outputs the hidden data can be asily exacted in real-time. Especially, it is found that the SNRs of the correlation outputs in the proposed optical NJTC-based extraction system has been improved to 7㏈ on average by comparison with those of the conventional JTC system under the condition of having a nonlinear parameter less than k=0.4. This good experimental results might suggest a possibility of implementation of an opto-digital multiple information hiding and real-time extracting system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.260-267
• /
• 2005

To search efficiently a text T of length n for a pattern P over an alphabet 5, suffix trees and suffix arrays are widely used. In case of a large text, suffix arrays are preferred to suffix trees because suffix ways take less space than suffix trees. Recently, O(${\mid}P{\mid}{\codt}{\mid}{\Sigma}{\mid}$-time and O(${\mid}P{\mid}P{\cdot}log{\mid}{\Sigma}{\mid}$)-time search algorithms in suffix ways were developed. In this paper we present time and space efficient search algorithms in suffix arrays. One algorithm runs in O(${\mid}P{\mid}$) time using O($n{\cdot}{\mid}{\Sigma}{\mid}$)-bits space, and the other runs in O($n{\cdot}{\mid}{\Sigma}{\mid}$ time using O($nlog{\mid}{\Sigma}{\mid}+{\mid}{\Sigma}{\mid}{\cdot}$nlog log n/logn)-bits space, which is more space efficient and still fast. Experiments show that our algorithms are efficient in both time and space when compared to previous algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.473-484
• /
• 2013

Shorten URL service is the method of using short URL instead of long URL, it redirect short url to long URL. While the users of microblog increased rapidly, as the creating and usage of shorten URL is convenient, shorten url became common under the limited length of writing on microblog. E-mail, SMS and books use shorten URL well, because of its simplicity. But, there is no relativeness between the most of shorten URLs and their target URLs, user can not expect the target URL. To cover this problem, there is attempts such as changing the shorten URL service name, inserting the information of website into shorten URL, and the usage of shortcode of physical address. However, each ones has the limits, so these are the trouble of automation, relatively long address, and the narrowness of applicable targets. SHRT is complementary to the attempts, as getting the idea from the writing system of Arabic. Though the writing system of Arabic has no vowel alphabet, Arabs have no difficult to understand their writing. This paper proposes SHRT, new method of URL Shortening. SHRT makes user guess the target URL using Relative word of the lowest domain of target URL without vowels.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.70-76
• /
• 2010

This paper Extended ELZW(EBCDIC Lempel Ziv Welch) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangeul, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1byte LZW algorithm as 5.22 percent and superior to 2byte LZW algorithm as 8.96 percent.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Journal of the Korean Society of Food Culture
• /
• v.28 no.6
• /
• pp.603-622
• /
• 2013

Egg is a food that has been loved from ancient times by people all around the world. It has been called a present from god because its rounded shape was believed to refer to the earth. We found the oldest and most perfectly preserved egg fossil at Chunmachong (天馬) in Kyungju (慶州). We believe that it was used during the period of the Three States or the unified Silla (新羅), and, accordingly, it was a noble food that has been found at the king's grave of the age. Egg, which is called egg of chicken in Korean, was written as egg of chicken (鷄卵), son of chicken (鷄子), bird's egg of chicken (鷄蛋), and round thing of chicken (鷄丸) in the Korean alphabet and Chinese characters. The ancient countries had the following myths about eggs In myths about offspring by egg, they were born as heaven's will to make them god. There were 19 proverbs: 'Hitting a rock with an egg', 'It's like the yellow part of an egg' and 'Even an egg stops when it rolls', etc. According to a theory of divination based on topography, people use eggs when they find a good place. There are 10 proverbs (四字 成語): Dongjiipran (冬至立卵), Nanyeoseoktu (卵與石投) etc. Studies for analysis of egg recipes found in the old literature (cooking, agriculture and fishing, and medical books) in the Chosun Dynasty recorded 36 times where cuisine with egg was mentioned as the main ingredient, 154 times as a sub-ingredient, 79 times as a garnish, and 20 times etc. As a garnish, they were 'finely sliced', 'thin rectangular and the rhombus form', and 'rounded shape'; after grilling they were divided into yellow and white parts. When cooked, they were used in comparison of the size or shape of an object with that of other objects.

• Archives of design research
• /
• v.15 no.3
• /
• pp.241-248
• /
• 2002

Researches of Hangul automation have been focused mainly on the set of character system. But, practical problem of using the Korean standard keyboard system of two sets is increment of errors and fatigue due to frequent use of shift keys. The author formulate a hypothesis as follows to solve the problem. 'Changing location and design of shift keys can reduce errors in typing Korean by avoiding interferences with other keys when pressing shift keys.' This study verify the hypothesis by the analysis of experiments using improved keyboard prototypes which have changed layout and design of shift keys. On the result, change of shift key location causes confusion to experienced user. But, while keeping its location, removing other keys at the bottom row and magnifying size of shift keys decrease errors in typing by avoiding interferences. And, the efficiency of typing in Korean is increased, too, because there is not any influence on typing speed. This study focuses on layout and design of shift keys only, but further study for entire layout of keyboard including alternative location of other function keys is needed to improve general usability.

• Journal of Satellite, Information and Communications
• /
• v.8 no.2
• /
• pp.94-98
• /
• 2013

A report of security problems and simultaneous operation limits of Standard tone currently used for FTS introduces the development of a next generation FTS. In this paper, BER performance by modulations and channel coding methods for EFTS are compared. Simulation results show that coherent modulations have better BER performance than noncoherent modulations. However the environments of a lunching vehicle may cause serious problems in achieving and maintaining synchronization and the increasing complexity of coherent systems also increases reliability problems. Therefore noncoherent systems are suitable for FTS even though BER performace of noncoherent systems is lower than coherent systems. Noncoherent DPSK has better BER performance than noncoherent CPFSK. However the PEP of noncoherent DPSK is 0.8dB higher than noncoherent CPFSK. Therefore a transmitter of noncoherent DPSK has more output power than noncoherent CPFSK. Convoltional code has better BER performance than RS code. However RS code has a tendency of steeply decreasing BER near the wanted $E_b/N_0$.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.3
• /
• pp.85-90
• /
• 2014

In this paper, we propose a virtual violin implementation using the detection of bowing and finger dropping position from the estimated finger tip and finger board information with the 3D image data from a Kinect. Violin finger board pattern and depth information are extracted from the color image and depth image to detect the touch event on the violin finger board and to identify the touched position. Final decision of activated musical alphabet is carried out with the finger drop position and bowing information. Our virtual violin uses PC MIDI to output synthesized violin sound. The experimental results showed that the proposed method can detect finger drop position and bowing detection with high accuracy. Virtual violin can be utilized for the easy and convenient interface for a beginner to learn playing violin with the PC-based learning software.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.