• Journal of Integrative Natural Science
• /
• v.3 no.1
• /
• pp.49-53
• /
• 2010

Molecular docking is a critical event which mostly forms Van der waals complex in molecular recognition. Since the majority of developed drugs are small molecules, docking them into proteins has been a prime concern in drug discovery community. Since the binding pose space is too vast to cover completely, many search algorithms such as genetic algorithm, Monte Carlo, simulated annealing, distance geometry have been developed. Proper evaluation of the quality of binding is an essential problem. Scoring functions derived from force fields handle the ligand binding prediction with the use of potential energies and sometimes in combination with solvation and entropy contributions. Knowledge-based scoring functions are based on atom pair potentials derived from structural databases. Forces and potentials are collected from known protein-ligand complexes to get a score for their binding affinities (e.g. PME). Empirical scoring functions are derived from training sets of protein-ligand complexes with determined affinity data. Because non of any single scoring function performs generally better than others, some other approaches have been tried. Although numerous scoring functions have been developed to locate the correct binding poses, it still remains a major hurdle to derive an accurate scoring function for general targets. Recently, consensus scoring functions and target specific scoring functions have been studied to overcome the current limitations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.522-539
• /
• 2021

In order to solve the problems of the existing audio fingerprint method when extracting audio fingerprints from long speech segments, such as too large fingerprint dimension, poor robustness, and low retrieval accuracy and efficiency, a robust audio fingerprint retrieval method based on feature dimension reduction and feature combination is proposed. Firstly, the Mel-frequency cepstral coefficient (MFCC) and linear prediction cepstrum coefficient (LPCC) of the original speech are extracted respectively, and the MFCC feature matrix and LPCC feature matrix are combined. Secondly, the feature dimension reduction method based on information entropy is used for column dimension reduction, and the feature matrix after dimension reduction is used for row dimension reduction based on energy feature dimension reduction method. Finally, the audio fingerprint is constructed by using the feature combination matrix after dimension reduction. When speech's user retrieval, the normalized Hamming distance algorithm is used for matching retrieval. Experiment results show that the proposed method has smaller audio fingerprint dimension and better robustness for long speech segments, and has higher retrieval efficiency while maintaining a higher recall rate and precision rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3121-3143
• /
• 2019

Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.

• Journal of the Korean association of regional geographers
• /
• v.2 no.2
• /
• pp.49-73
• /
• 1996

This study produces quantitatively weather entropy and information ratio using information theory about frequency in the appearance of precipitation phenomenon and monthly change, and then applies them to observation of the change of their space scale by time. As a result of these, this study defines Pusan, Chongju and Kwangju's weather representativeness and then establishes the range of weather representativeness. Based on weather entropy (statistical parameter)-the amount of average weather information-and information ratio, we can define each area's weather representativeness, which can show us more constant form included topographical, geographical factors and season change. The data used for this study are the daily precipitotion and cloudiness during the recent five years($1990{\sim}1994$) at the 69 stations in Korea. It is divided into class of no precipitation, that of precipitation. The results of this study can be summarized as follows: (1) The four season's mean value of information ratio is the highest value. as 0.641, on the basis of Chongju. It is the lowest as 0.572, on the basis of Pusan. On a seasonal basis, the highest mean value of information rate is April's (spring) in Chongju, and the lowest is October's(fall) in Pusan. Accordingly weather representativeness has the highest in Chongju and the lowest in Pusan. (2) To synthesize information ratio of decaying tendancy and half-decay distance, Chonju's weather representativeness has the highest in April, July and October. And kwangju has the highest value in January and the lowest in April and July. Pusan's weather representativeness is not high, that of Pusan's October is the lowest in the year. (3) If we establish the weather representative character on the basis of Chongju-Pusan, the domain of Chongju area is larger than that of Pusan area in October, July and April in order. But Pusan's is larger than Chongju's in January. In the case of Chongju and Kwangju, the domain of Chongju area is larger than that of Kwangju in October, July and April in order, but it is less than that of Kwangju area in January. In the case of Kwangju-Pusan, the domain of Kwangju is larger than that of Pusan in October, July in order. But in April it is less than Pusan's.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.20-27
• /
• 2006

Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.

• Journal of Biomedical Engineering Research
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2003

The job of long distance driving is likely to be fatiguing and requires long period alertness and attention, which make considerable demands of the driver. Driving fatigue contributes to driver related with accidents and fatalities. In this study, we investigated the relationship between the number of hours of driving and driving fatigue using heart rate variability(HRV) signal. With a more traditional measure of overall variability (standard deviation, mean, spectral values of heart rate). Nonlinear characteristics of HRV signal were analyzed using Approximate Entropy (ApEn) and Poincare plot. Five subjects drive the four passenger vehicle twice. All experiment number was 40. The test route was about 300Km continuous long highway circuit and driving time was about 3 hours. During the driving, measures of electrocardiogram(ECG) were performed at intervals of 30min. HRV signal, derived from the ECG, was analyzed using time, frequency domain parameters and nonlinear characteristic. The significance of differences on the response to driving fatigue was determined by Student's t-test. Differences were considered significant when a p value < 0.05 was observed. In the results, mean heart rate(HRmean) decreased consistently with driving time, standard deviation of RR intervals(SDRR), standard deviation of the successive difference of the RR intervals(SDSD) increased until 90min. Hereafter, they were almost unchanging until the end of the test. Normalized low frequency component $(LF_{norm})$, ratio of low to high frequency component (LF/HF) increased. We used the Approximate Entropy(ApEn), Poincare plot method to describe the nonlinear characteristics of HRV signal. Nonlinear characteristics of HRV signals decreased with driving time. Statistical significant is appeared after 60 min in all parameters.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.20 no.3
• /
• pp.55-64
• /
• 2017

The problem of the population number of honeybees that is decreasing not only domestically but also globally, has a great influence on human beings and the entire ecosystem. The habitat of honeybees is recognized to be superior in urban environment rather than rural environment, and predicting for habitat assessment and conservation is necessary. Based on this, we targeted Cheonan City and neighboring administrative areas where the distribution of agricultural areas, urban areas, and forest areas is displayed equally. In order to predict the habitat preferred by honeybees, we apply the Maxent model what based on the presence information of the species. We also selected 10 environmental variables expected to influence honeybees habitat environment through literature survey. As a result of constructing the species distribution model using the Maxent model, 71.7% of the training data were shown on the AUC(Area Under Cover) basis, and it was be confirmed with an area of 20.73% in the whole target area, based on the 50% probability of presence of honeybees. It was confirmed that the contribution of the variable has influence on land covering, distance from the forest, altitude, aspect. Based on this, the possibility of honeybee's habitat characteristics were confirmed to be higher in wetland environment, in agricultural land, close to forest and lower elevation, southeast and west. The prediction of these habitat environments has significance as a lead research that presents the habitat of honeybees with high conservation value of ecosystems in terms of urban space, and it will be useful for future urban park planning and conservation area selection.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.4
• /
• pp.163-172
• /
• 2012

A driver assistance system is critical to improve a convenience and stability of vehicle driving. Several systems have been already commercialized such as adaptive cruise control system and forward collision warning system. Efficient vehicle detection is very important to improve such driver assistance systems. Most existing vehicle detection systems are based on a radar system, which measures distance between a host and leading (or oncoming) vehicles under various weather conditions. However, it requires high deployment cost and complexity overload when there are many vehicles. A camera based vehicle detection technique is also good alternative method because of low cost and simple implementation. In general, night time vehicle detection is more complicated than day time vehicle detection, because it is much more difficult to distinguish the vehicle's features such as outline and color under the dim environment. This paper proposes a method to detect vehicles at night time using analysis of a captured color space with reduction of reflection and other light sources in images. Four colors spaces, namely RGB, YCbCr, normalized RGB and Ruta-RGB, are compared each other and evaluated. A suboptimal threshold value is determined by Otsu algorithm and applied to extract candidates of taillights of leading vehicles. Statistical features such as mean, variance, skewness, kurtosis, and entropy are extracted from the candidate regions and used as feature vector for SVM(Support Vector Machine) classifier. According to our simulation results, the proposed statistical feature based SVM provides relatively high performances of leading vehicle detection with various distances in variable nighttime environments.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.83-93
• /
• 2012

This paper proposes an image segmentation framework that modifies the objective function of Fuzzy C-Means (FCM) to improve the performance and computational efficiency of the conventional FCM-based image segmentation. The proposed image segmentation framework includes a locally weighted fuzzy c-means (LWFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors. Distance between a center pixel and a neighboring pixels are calculated within a window and these are basis for determining weights to indicate the importance of the memberships as well as to improve the clustering performance. We analyzed the segmentation performance of the proposed method by utilizing four eminent cluster validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), Xie-Bdni function ($V_{xb}$) and Fukuyama-Sugeno function ($V_{fs}$). Experimental results show that the proposed LWFCM outperforms other FCM algorithms (FCM, modified FCM, and spatial FCM, FCM with locally weighted information, fast generation FCM) in the cluster validity functions as well as both compactness and separation.

• Journal of the Korean association of regional geographers
• /
• v.21 no.1
• /
• pp.21-38
• /
• 2015

This study attempts to estimate the complementarity between 21 cities in the Korean Southeastern Region using data on the network time distance and the volume of flow between the cities. Four types of flows recognized are people, commodities, information and finance. The first two types of flows are thought to be made on the transportation network while the last two are on the communication network. For the purpose of the study, the expected volumes of flows between cities are first estimated using the gravity-based regression and doubly-constrained entropy maximization models. These baseline volumes are then subtracted from the observed volumes of flows (of people and commodities) or the estimated volumes of flows (of information and finance) in order to identify positive differences or complementarities. The result shows that these four types of complementarity flows form distinctive urban networks in terms of spatial pattern and urban hierarchy. This suggests that more customized strategies to different types of complementarity are recommended to properly address the issues related to network infrastructure provision in the pursuit of the network city model in the region.