• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.4
• /
• pp.725-732
• /
• 2020

This paper uses variables following as : to follow me well(0-9), it takes a lot of time to make a decision (0-9), lethargy(0-9) during physical activity in the exercise learning program of the children in the marginalized class. This paper classifies 'gender', 'physical education classroom', and 'upper, middle and lower' of age, and observe changes in ego-resiliency and self-control through sports rehabilitation therapy to find out changes in mental health. To achieve this, the data acquired was merged and the characteristics of large and small numbers were removed using the Label encoder and One-hot encoding. Then, to evaluate the performance by applying each algorithm of MLP, SVM, Dicesion tree, RNN, and LSTM, the train and test data were divided by 75% and 25%, and then the algorithm was learned with train data and the accuracy of the algorithm was measured with the Test data. As a result of the measurement, LSTM was the most effective in sex, MLP and LSTM in physical education classroom, and SVM was the most effective in age.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.1
• /
• pp.27-34
• /
• 2013

Background subtraction is one of the key techniques for automatic video content analysis, especially in the tasks of visual detection and tracking of moving object. In this paper, we present a new sample-based technique for background extraction that provides background image as well as background model. To handle both high-frequency and low-frequency events at the same time, multiple interval background models are adopted. The main innovation concerns the use of a confidence factor to select the best model from the multiple interval background models. To our knowledge, it is the first time that a confidence factor is used for merging several background models in the field of background extraction. Experimental results revealed that our approach based on multiple interval sampling works well in complicated situations containing various speed moving objects with environmental changes.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2022

In this paper, we design and implement a GPU-based parallel algorithm to effectively solve the traveling salesman problem through an ant color system. The repetition process of generating hundreds or thousands of tours simultaneously in TSP utilizes GPU's task-level parallelism, and the update process of pheromone trails data actively exploits data parallelism by 32x32 thread blocks. In particular, through simultaneous memory access of multiple threads, the coalesced accesses on continuous memory addresses and concurrent accesses on shared memory are supported. This experiment used 127 to 1002 city data provided by TSPLIB, and compared the performance of sequential and parallel algorithms by using Intel Core i9-9900K CPU and Nvidia Titan RTX system. Performance improvement by GPU parallelization shows speedup of about 10.13 to 11.37 times.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.138-145
• /
• 2005

This paper describes a technique for detecting the boundary of the optic disk in digital image of the retina using inward and outward curve evolution. This paper offers medical information about glaucoma progresses. For accurate boundary detection, image inpainting based on texture synthesis removes blood vessels crossing the optic disk. For removing noises and preserving boundary of optic disk in image inpainting process, the anisotropic diffusion filtering is necessary. After pre-processing, the optic disk boundary is determined using inward and outward curve evolution. The experimental results show that the algorithm is effective for detection of optic disk boundary.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1137-1147
• /
• 1997

I propose a RZETA network consisted of switching elements(SEs) that have regular links and alternate links. A modified Zeta nework used for the RZETA network's regular links and a MIN used for its alternate links are generated using the graph theory. The RZETA network is driven from merging the formaer and latter MINs. A necessary and sufficient condition for modified Zeta network to be a nonblocking network is also presented. This condition is a ufficient condition for RZETA network with a faulty link or a faulty SE to be nonblocked. Performance of the RZETA network is analyzed by modification of the model of 2-dilated Banyan network and its performance is compared with existing redundant path networks, when packet arrival rate of each source is 1.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.293-300
• /
• 2018

We propose a moving object extraction and tracking method for improvement of animal identification and tracking technology. First, we propose a method of merging separated moving objects into a moving object by using FCM (Fuzzy C-Means) clustering algorithm to solve the problem of moving object loss caused by moving object extraction process. In addition, we propose a method of extracting data from a moving object and a method of counting moving objects to determine the number of clusters in order to satisfy the conditions for performing FCM clustering algorithm. Then, we propose a method to continuously track merged moving objects. In the proposed method, color histograms are extracted from feature information of each moving object, and the histograms are continuously accumulated so as not to react sensitively to noise or changes, and the average is obtained and stored. Thereafter, when a plurality of moving objects are overlapped and separated, the stored color histogram is compared with each other to correctly recognize each moving object. Finally, we demonstrate the feasibility and applicability of the proposed algorithms through some experiments.

• Journal of the Korean Society for information Management
• /
• v.23 no.4 s.62
• /
• pp.215-231
• /
• 2006

Recently there are many bibliometric studies attempting to utilize Pathfinder networks(PFNets) for examining and analyzing the intellectual structure of a scholarly field. Pathfinder network scaling has many advantages over traditional multidimensional scaling, including its ability to represent local details as well as global intellectual structure. However there are some limitations in PFNets including very high time complexity. And Pathfinder network scaling cannot be combined with cluster analysis, which has been combined well with traditional multidimensional scaling method. In this paper, a new method named as Parallel Nearest Neighbor Clustering (PNNC) are proposed for complementing those weak points of PFNets. Comparing the clustering performance with traditional hierarchical agglomerative clustering methods shows that PNNC is not only a complement to PFNets but also a fast and powerful clustering method for organizing informations.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.111-119
• /
• 2006

Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with $\chi2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.