• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.57-66
• /
• 2011

In this paper, it is proposed for algorithm to detect human efficiently using a edge symmetry and gradient directional characteristics in realtime by the feature extraction in a single input image. Proposed algorithm is composed of three stages, preprocessing, region partition of human candidates, verification of candidate regions. Here, preprocessing stage is strong the image regardless of the intensity and brightness of surrounding environment, also detects a contour with characteristics of human as considering the shape features size and the condition of human for characteristic of human. And stage for region partition of human candidates has separated the region with edge symmetry for human and size in the detected contour, also divided 1st candidates region with applying the adaboost algorithm. Finally, the candidate region verification stage makes excellent the performance for the false detection by verifying the candidate region using feature vector of a gradient for divided local area and classifier. The results of the simulations, which is applying the proposed algorithm, the processing speed of the proposed algorithms is improved approximately 1.7 times, also, the FNR(False Negative Rate) is confirmed to be better 3% than the conventional algorithm which is a single structure algorithm.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.145-154
• /
• 2015

This paper proposes an enhanced projection candidate selection algorithm to improve the performance of the existing path prediction algorithm. Various user path prediction algorithms have previously been developed, but those algorithms are inappropriate for a real-time and close user path prediction environment. To resolve this issue, a new prediction algorithm has been proposed, but several problems still remain. In particular, this algorithm should be enhanced to provide much faster processing performance. The major cause of the high processing time of the previous path prediction algorithm is the high time complexity of its projection candidate selection. Therefore, this paper proposes a new path fragment management structure and an improved projection candidate selection algorithm to improve the processing speed of the existing projection candidate selection algorithm. This paper also shows the effectiveness of the algorithm herein proposed through a comparative performance evaluation.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.11-18
• /
• 2008

Korean morphological analyzer generally generates multiple candidates, and then selects the most likely one among multiple candidates. As the number of candidates increases, the chance that the correctly analyzed candidate is included in the candidate list also grows. This process, however, increases ambiguity and then deteriorates the performance. In this paper, we propose a new rule-based model that produces one best analysis. The analysis rules are automatically extracted from large amount of Part-of-Speech tagged corpus, and the proposed model does not require any manual construction cost of analysis rules, and has shown high success rate of analysis. Futhermore, the proposed model can reduce the ambiguities and computational complexities in the candidate selection phase because the model produces one analysis when it can successfully analyze the given word. By combining the conventional probability-based model. the model can also improve the performance of analysis when it does not produce a successful analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2812-2817
• /
• 2013

In this paper, an outage probability for the best relay selection in decode-and-forward relaying systems in the presence of interference is analyzed over Rayleigh fading channels. Based on the outage performance results, we propose a method to determine effective relay candidates for the best relay selection, where the effective relay candidates represent the relays except for relays that make no contribution to improving the performance. in all possible relays given in the system. By determining the effective relay candidates, the feedback overhead of channel state information and the energy consumption of relays can be significantly reduced while minimizing the performance degradation. In this paper, we provide important parameters that affect the determination of the effective relay candidates.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.2
• /
• pp.115-126
• /
• 2012

The artificial captions appearing in videos include information that relates to the videos. In order to obtain the information carried by captions, many methods for caption extraction from videos have been studied. Most traditional methods of detecting caption region have used one frame. However video include not only spatial information but also temporal information. So we propose a method of detection caption region using temporal and spatial information. First, we make improved Text-Appearance-Map and detect continuous candidate regions through matching between candidate-regions. Second, we detect disappearing captions using disappearance test in candidate regions. In case of captions disappear, the caption regions are decided by a merging process which use temporal and spatial information. Final, we decide final caption regions through ANNs using edge direction histograms for verification. Our proposed method was experienced on many kinds of captions with a variety of sizes, shapes, positions and the experiment result was evaluated through Recall and Precision.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.199-205
• /
• 2018

So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.8
• /
• pp.47-54
• /
• 2021

Given a document, keyphrase extraction is to automatically extract words or phrases which topically represent the content of the document. In unsupervised keyphrase extraction approaches, candidate words or phrases are first extracted from the input document, and scores are calculated for keyphrase candidates, and final keyphrases are selected based on the scores. Regarding the computation of the scores of candidates in unsupervised keyphrase extraction, this study proposes a method of adjusting the scores of keyphrase candidates according to the types of keyphrase candidates: word-type or phrase-type. For this, type-token ratios of word-type and phrase-type candidates as well as information content of high-frequency word-type and phrase-type candidates are collected from the input document, and those values are employed in adjusting the scores of keyphrase candidates. In experiments using four keyphrase extraction evaluation datasets which were constructed for full-text articles in English, the proposed method performed better than a baseline method and comparison methods in three datasets.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.120-124
• /
• 2010

This paper presents a method that can automatically detect variety of degradations (i.e., scratches and blotches) in old film archive. The proposed method consists of candidate detection and verification. Degradations are first identified by finding the local extreme of a frame in spatiotemporal domains, thereby using edge detector and SROD detector. Then, to remove some false alarms occurred in the first stages, the verification is performed using the texture and shape properties of scratches and blotches. The textural properties of scratches and blotches are learned using neural networks (NNs) and their shapes are represented using morphological filters. The experiments were performed on several old films, then the results demonstrated the effectiveness of the proposed method, where it has a precision of 81% and a recall of 79%.

• Journal of Music and Human Behavior
• /
• v.15 no.2
• /
• pp.1-22
• /
• 2018

The purpose of this analysis was to classify music therapy studies published in KCI journals to understand the type of research being conducted and trends in the research. This study analyzed 472 music therapy articles published in KCI journals from 2005 to October 31, 2017. The study analyzed the overall characteristics of the included studies, trends in each research field, study subjects, research types, and commonalities and differences between research fields. It was confirmed that the number of music therapy studies published in KCI journals steadily increased from 2005. The results also confirmed that the research subjects and types of music therapy research became more diverse. For example, earlier studies focused on participants with disabilities, but populations without disabilities were increasingly the focus of more recent studies. Similarly, earlier studies were mostly experimental or descriptive, but more recent research included historical, philosophical, and program development studies. The results of analysis confirm that music therapy research is evolving and being conducted in cooperation with many other fields. This article provides a snapshot of the current state of music therapy research and offers implications for the future of music therapy research with multidisciplinary characteristics.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.547-551
• /
• 2009

In recent years, a film restoration has gained increasing attention by many researchers, to emergence of variety multimedia and to importance of video preservation. Blotch is the most frequent degradation in old film. This paper presents a blotch detection method using color and shape feature. The proposed method is two major modules: a SROD detector using impulsive feature and NN-based detector using shape feature. To assess the validity of the proposed method, the experiments have been performed on several old films.