• Journal of Korea Multimedia Society
• /
• v.15 no.7
• /
• pp.847-858
• /
• 2012

In this paper, we propose a mobile watermarking based on the distortion analysis of display-capture image in a smart phone. We compose a random sequence by utilizing the property of frequency band in the wavelet domain. Then we calculate the CCS (Coefficients Comparative Sum) using the block wavelet coefficients of selected subbands after the wavelet transformation and the random sequence and repeatedly embed a watermark using an insertion threshold for the watermark robustness. For correcting a distortion caused by the display-capture process, we adopt a frame at the outside of watermarked image, then we can equate a watermark synchronization by detecting the frame. And we can improve frame detection ratio by using an iteratively adaptive threshold. A proposed scheme embedded information of 206 bits into standard digital images and it shows an average about 41.42 dB in PSNR. In watermark extract experiments, a proposed scheme accurately recognizes the frame more than 97% in total captured images. Also in BER (Bit Error Ratio) of captured images, it shows about 3.73%, then it was improved more than 70%, compared with the Pramila's method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1571-1578
• /
• 1999

In this paper, we present the Modulator Channel Card and VLSI chip for the Radio Transceiver Unit (RTU) of direct sequence code division multiple access (DS-CDMA) Wireless Local Loop (WLL) System. The Modulator Channel Card is designed and implemented using ASIC's, FPGA's and DSP's. The ASIC, compliance with Common Air Interface specification proposed by ETRI, has 40K gates which is designed to operate at 32MHz, and is fabricated using $0.6\mu\textrm{m}$ CMOS process. The ASIC carries out for I- or Q- phase data channel signal processing at a time, where each data channel processing consists of channel coding, block interleaving, scrambling, Walsh modulation, Pseudo-Noise (PN) spreading, and baseband filtering. The Modulator Channel Card has been integrated as a part of RTU of WLL system and is confirmed that it meets all functional and performance requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.23-33
• /
• 2007

Video compression is essential technique for fast and efficient transmission of a large amount of video data maintaining high quality. Also, motion estimation and motion compensation is most important technique for efficient video compression. A proposed method is improved diamond search method which uses split diamond pattern and rotated diamond pattern. In particular, the proposed method shows superb result when it is used for the sequence with a direction of camera moving. Moreover when it is used for the sequence with little motion, complexity is reduced considerably by using fewer search points. Also, by varying the number of initial search points, the propose method can provide several options in terms of duality or speed. Simulation results shows that the proposed method sustains better visual quality compared with diamond search method and HEXBS even by using fewer search points. Besides, compared with existing methods, it is able to conduct a motion estimation more efficiently by changing the number of search points adaptively according to motion of video data.

• Journal of Navigation and Port Research
• /
• v.44 no.3
• /
• pp.219-226
• /
• 2020

The container terminal operators established a re-marshalling plan to reduce the loading operation time and the release operation time. Re-marshalling is to rearrange the containers in the container yard to the advantageous position to shorten the working time using the spare time of the automated yard crane. This study assumed the automated container terminal with a perpendicular layout and deals with the inter-bay re-marshalling planning problem in a yard block. The inter-bay re-marshalling plan determines the container to be moved, the location to be relocated, and the sequence of relocation operations. This study presents a mixed integer programming model that simultaneously determines the storage location and the operation sequence while satisfying the spatial availability during the re-marshalling. Numerical experiments are conducted to understand re-marshalling operation using a beam search method.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.415-422
• /
• 2004

Automation systems improve the productivity of works which relate to product design, facilities management, fault processing and quality evaluation. In these systems, the description language for monitoring and control process is called new control language. These are five flow control languages : IL, ST, FBD, SFC and LD. IL and ST are based on left form. FBD, SFC and LD are based on graphic form. Generally, a software which monitors and controls a system is allowed to use just one flow control language. It is impossible to use more than two languages for simulation in the same system environment. In this paper, we analyzed the characteristics of flow control languages and the process of programming in the legacy system. In addition, for the Integrated processing of languages, we propose Extended ST based on the high-level ST language. Based on this research, we implement a graphical language editor and EST-IL convertor. The graphical language editor makes sequence rules, and converts graphical language into EST. EST-IL convertor has a function to convert EST into IL which is similar to assembly language. As the result of this paper, we present a scheme which integrates all the flow control language processing based on IL.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.533-540
• /
• 2021

To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.

• Journal of the Society of Naval Architects of Korea
• /
• v.60 no.3
• /
• pp.202-211
• /
• 2023

The profile shops in shipyards produce section steels required for block production of ships. Due to the limitations of shipyard's production capacity, a considerable amount of work is already outsourced. In addition, the need to improve the productivity of the profile shops is growing because the production volume is expected to increase due to the recent boom in the shipbuilding industry. In this study, a scheduling optimization was conducted for a parallel welding line of the profile process, with the aim of minimizing tardiness and the number of set-up changes as objective functions to achieve productivity improvements. In particular, this study applied a dynamic scheduling method to determine the job sequence considering variability of processing time. A Markov decision process model was proposed for the job sequence problem, considering the trade-off relationship between two objective functions. Deep reinforcement learning was also used to learn the optimal scheduling policy. The developed algorithm was evaluated by comparing its performance with priority rules (SSPT, ATCS, MDD, COVERT rule) in test scenarios constructed by the sampling data. As a result, the proposed scheduling algorithms outperformed than the priority rules in terms of set-up ratio, tardiness, and makespan.

• Genomics & Informatics
• /
• v.10 no.2
• /
• pp.110-116
• /
• 2012

Recent several studies have shown that the genetic variation of SCN5A is related with atrioventricular conduction block (AVB); no study has yet been published in Koreans. Therefore, to determine the AVB-associated genetic variation in Korean patients, we investigated the genetic variation of SCN5A in Korean patients with AVB and compared with normal control subjects. We enrolled 113 patients with AVB and 80 normal controls with no cardiac symptoms. DNA was isolated from the peripheral blood, and all exons (exon 2-exon 28) except the untranslated region and exon-intron boundaries of the SCN5A gene were amplified by multiplex PCR and directly sequenced using an ABI PRISM 3100 Genetic Analyzer. When a variation was discovered in genomic DNA from AVB patients, we confirmed whether the same variation existed in the control genomic DNA. In the present study, a total of 7 genetic variations were detected in 113 AVB patients. Of the 7 variations, 5 (G87A-A29A, intervening sequence 9-3C>A, A1673G-H558R, G3578A-R1193Q, and T5457C-D1819D) have been reported in previous studies, and 2 (C48G-F16L and G3048A-T1016T) were novel variations that have not been reported. The 2 newly discovered variations were not found in the 80 normal controls. In addition, G298S, G514C, P1008S, G1406R, and D1595N, identified in other ethnic populations, were not detected in this study. We found 2 novel genetic variations in the SCN5A gene in Korean patients with AVB. However, further functional study might be needed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.294-302
• /
• 2020

In a genetic algorithm, computer simulations are performed based on the natural evolution process of life, such as selection, crossover, and mutation. The genetic algorithm searches the approximate optimal solution by the parallel arrangement of Schema, which has a short definition length, low order, and high adaptability. This study examined the possibility of improving the efficiency of the optimal solution by considering the characteristics of the building block hypothesis, which are one of the key operating principles of a genetic algorithm. This study evaluated the efficiency of the optimization results according to the gene sequence for the implementation in solving problems. The optimal design problem of the water pipe was selected, and the genetic arrangement order reflected the engineering specificity by dividing into the existing, the network topology-based, and the flowrate-based arrangement. The optimization results with a flowrate-based arrangement were, on average, approximately 2-3% better than the other batches. This means that to increase the efficiency of the actual engineering optimization problem, a methodology that utilizes clear prior knowledge (such as hydraulic properties) to prevent such excellent solution characteristics from disappearing is essential. The proposed method will be considered as a tool to improve the efficiency of large-scale water supply network optimization in the future.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.514-526
• /
• 2004

Microarray is a new technique for gene expression experiment, which has gained biologist's attention for recent years. This technology enables us to obtain hundreds and thousands of expression of gene or genotype at once using microarray Since it requires manual work to analyze patterns of gene expression, we want to develop an effective and automated tools to analyze microarray image. However it is difficult to analyze DNA chip images automatically due to several problems such as the variation of spot position, the irregularity of spot shape and size, and sample contamination. Especially, one of the most difficult problems in microarray analysis is the block and spot addressing, which is performed by manual or semi automated work in all the commercial tools. In this paper we propose a new algorithm to address the position of spot and block using a new concept of regular structure grid searching. In our algorithm, first we construct maximal I-regular sequences from the set of input points. Secondly we calculate the rotational angle and unit distance. Finally, we construct I-regularity graph by allowing pseudo points and then we compute the spot/block address using this graph. Experiment results showed that our algorithm is highly robust and reliable. Supplement information is available on http://jade.cs.pusan.ac.kr/~autogrid.