• The Journal of the Korea Contents Association
• /
• v.14 no.4
• /
• pp.407-417
• /
• 2014

An arirang is the most famous Korean folk song and was registered in UNESCO(Unitied Nations Educational, Scientific and cultural Organization) as an intangible cultural heritage in 2012. Most arirangs are composed of text and refrain parts. Genealogy of the arirang was classified in refrain patterns by using multiple sequence alignment algorithm. There are two different refrain patterns, slow and fast melodies. Of 106 arirangs, 38 and 68 arirangs contain fast and slow melodies, respectively. 73 arirangs and 104 their key words were extracted from bipartate arirang network that composed of arirangs, text works, and their relationships. The correlation among the arirangs was analyzed from the selected arirangs and key words by using pairwise comparison matrix. Also, analysis of correlation among the arirnags was performed by stepwise removal of the single degree nodes from the bipartate arirang network In this study, arirangs were analyzed in genealogy and correlation among arirangs by using informatic algorithm and network technology, in which arirang research will be constructed a stepping stone for the popularization and globalization of the arirangs.

• Journal of Digital Contents Society
• /
• v.18 no.6
• /
• pp.1151-1156
• /
• 2017

It is common to achieve lower performance in traversing tree data structures in GPU than one expects. In this paper, we analyze the reason of lower-than-expected performance in GPU tree traversal and present that the warp divergences is caused by the branch instructions ("if${\ldots}$ else") which appear commonly in tree traversal CUDA codes. Also, we compare the parallel shifted sort algorithm which can reduce the number of warp divergences with a kd-tree CUDA implementation to show that the shifted sort algorithm can work faster than the kd-tree CUDA implementation thanks to less warp divergences. As the analysis result, the shifted sort algorithm worked about 16-fold faster than the kd-tree CUDA implementation for $2^{23}$ query points and $2^{23}$ data points in $R^3$ space. The performance gaps tend to increase in proportion to the number of query points and data points.

• The Journal of the Korea Contents Association
• /
• v.18 no.8
• /
• pp.118-126
• /
• 2018

In order to dominate the multiple-targets of high threat in the initial stage of combat, it is necessary to maximize the combat effect by rapidly firing as many weapons as possible within a short time. Therefore, it is mandatory to establish the effective weapon allocation and utilize them for the combat. In this paper, we propose a weapon assignment algorithm for rapid reaction in multi-target and multi-weapon environments. The proposed algorithm maximizes the combat effect by establishing the fire plan that enables the rapid action with the operation of low complexity. To show the superiority of our algorithm, we implement the evaluation and verification of performances through the simulation and visualization of our algorithm. Our experimental results show that the proposed algorithm perform the effective weapon assignment, which shows the high target assignment rate within the fast hour even under the large-scale battle environments. Therefore, our proposed scheme are expected to be highly useful when it is applied to real weapon systems.

• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.9-18
• /
• 2010

This paper proposes a deformable registration method using a demon algorithm for aligning the lungs between end-exhale and end-inhale CT scans. The lungs are globally aligned by affine transformation and locally deformed by a demon algorithm. The use of floating gradient force allows a fast convergence in the lung regions with a weak gradient of the reference image. The active-cell-based demon algorithm helps to accelerate the registration process and reduce the probability of deformation folding because it avoids unnecessary computation of the displacement for well-matched lung regions. The performance of the proposed method was evaluated through comparisons of methods that use a reference gradient force or a combined gradient force as well as methods with and without active cells. The results show that the proposed method can accurately register lungs with large deformations and can reduce the processing time considerably.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1369-1376
• /
• 2012

In this paper, we propose 2D industrial image registration method for the detection of defects. Proposed method performs preprocessing to smooth the original image with the preservation of the edge for the robust registration against general noise. Then, x-direction gradient magnitude image and corresponding binary image are generated. Density analysis around neighborhood regions per pixel are performed to generate feature image for preventing mis-registration due to moire-like patterns, which frequently happen in industrial images. Finally, 2D image registration based on phase correlation between feature images is performed to calculate translational parameters to align two images rapidly and optimally. Experimental results showed that the registration accuracy of proposed method for the real industrial images was 100% and our method was about twenty times faster than the previous method. Our fast and accurate method could be used for the real industrial applications.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.147-152
• /
• 2020

The baseball elimination problem(BEP) is eliminates teams that finishes the season in the early stage without play the remaining games because of the team never most wins even though all wins of remaining games. This problem solved by max-flow/min-cut theorem. But the max-flow/min-cut method has a shortcoming of iterative constructs the network for all of team and decides the min-cut for each network. This paper suggests ascending sort in wins game plus remaining games for each team, then the candidate eliminating team set K with lower 1/2 rank and most easy, simple, and fast computes the existence or not of subset R that a team elimination decision. As a result of various experimental data, this algorithm can be find all of elimination teams for whole data with fast and correct.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.6
• /
• pp.33-42
• /
• 2010

This research propose a practical guidance system considering ocean currents in real sea operation. Optimality of generated path is not an issue in this paper. Way-points from start point to possible goal positions are selected by experienced human supervisors considering major ocean current axis. This paper also describes the implementation of a precise underwater navigation solution using multi-sensor fusion technique based on USBL, GPS, DVL and AHRS measurements in detail. To implement the precise, accurate and frequent underwater navigation solution, three strategies are chosen. The first one is the heading alignment angle identification to enhance the performance of standalone dead-reckoning algorithm. The second one is that absolute position is fused timely to prevent accumulation of integration error, where the absolute position can be selected between USBL and GPS considering sensor status. The third one is introduction of effective outlier rejection algorithm. The performance of the developed algorithm is verified with experimental data of mine disposal vehicle and deep-sea ROV.

• Korean Journal of Optics and Photonics
• /
• v.15 no.6
• /
• pp.583-590
• /
• 2004

The autofocus is one of the important processes in the automated vision inspection or measurements using optical microscopes, because it influences the measuring accuracy. In this paper, we used the confocal microscope configuration based on not a pinhole but a single-mode optical fiber. A single mode fiber has the functions of source and detector by applying the reciprocal scheme. As a result, we acquired a simple system configuration and easy alignment of the optical axis. Also, we embodied a fast autofocus system by acquiring the focus error signal through a source modulation technique. The source modulation technique can effectively reduce physical disturbances compared with objective lens modulation, and it is easily applicable to general optical microscopes. The focus error signal was measured with respect to the modulation amplitude, reflectance of the specimen and inclination angle of the measuring surface. The performance of the proposed autofocus system was verified through autofocusing flat mirror surface. In addition, we confirmed that source modulation rarely degrades the depth resolution by the comparison between the FWHMs of axial response curves.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.674-684
• /
• 2000

One key obstacle which has been identified in achieving parallel processing is to communicate effectively between processors during execution. One approach to achieving an optimal delay time is to use expander graph. The networks and algorithms which are based on expander graphs are successfully exploited to yield fast parallel algorithms and efficient design. The AKS sorting algorithm in time O(logN) which is an important result is based on the use of expanders. The expander graph also can be applied to construct a concentrator and a superconcentrator. Since Margulis found a way to construct an explicit linear expander graph, several expander graphs have been developed. But the proof of existence of such graphs is in fact provided by a nonconstructive argument. We investigate the expander network on the hypercube network. We prove the expansion of a sin81e stage hypercube network and extend this from a single stage to multistage networks. The results in this paper provide a theoretical analysis of expansion in the hypercube network.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.167-175
• /
• 2002

Image Mosaicing creates a new image by composing video frames or still images that are related, and performed by arrangement, composition and redundancy analysis of images. This paper proposes a hierarchical image mosaicing system using camera and object parameters far efficient video database construction. A tree-based image mosiacing has implemented for high-speed computation time and for construction of static and dynamic image mosaic. Camera parameters are measured by using least sum of squared difference and affine model. Dynamic object detection algorithm has proposed for extracting dynamic objects. For object extraction, difference image, macro block, region splitting and 4-split detection methods are proposed and used. Also, a dynamic positioning method is used for presenting dynamic objects and a blurring method is used for creating flexible mosaic image.