• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.1
• /
• pp.7-11
• /
• 2013

Taking experts' knowledge to recommend items has shown some promising results in recommender system research. In order to improve the performance of the existing recommendation algorithms, previous researches on expert-based recommender systems have exploited the knowledge of a common expert group for all users. In this paper, we study a problem of identifying personalized experts within a user group, assuming each user needs different kinds and levels of expert help. To demonstrate this idea, we present a framework for using Support Vector Machine (SVM) to find varying expert groups for users; it is shown in an experiment that the proposed SVM approach can identify personalized experts, and that the person-alized expert-based collaborative filtering (CF) can yield better results than k-Nearest Neighbor (kNN) algorithm.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.10 no.3
• /
• pp.199-206
• /
• 2016

Most Koreans walk having their toes in or out, because of their sedentary lifestyles. In addition, using smartphone while walking makes having a desirable walking posture even more difficult. The goal of this study is to make a simple system which easily analyze and inform any person his or her personal walking habit. To discriminate gait patterns, we developed a gait monitoring system using a 3-axis accelerometer and a foot pressure monitoring system. The developed system, with an accelerometer and a few pressure sensors, can acquire subject's foot pressure and how tilted his or her torso is. We analyzed the relationship between type of gate and sensor data using this information. As the result of analysis, we could find out that statistical parameters like standard deviation and root mean square are good for discriminating among torso postures, and k-nearest neighbor algorithm is good at clustering gait patterns. The developed system is expected to be applicable to medical or athletic fields at a low price.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.673-682
• /
• 2005

Distance browsing queries, namely k-nearest neighbor queries, are the most important queries in spatial database applications, e.g., Geographic Information Systems(GISs). Recently, GIS applications trends to extend themselves toward wide multi-user environments such as the Web. Since many techniques for such queries, where Hjaltason and Samet's algorithm is the most efficient one, were optimized for only one query, we need to complement them suitable for multi-user environments. It can be a good approach that we store many individual query results in a cache, i.e., query result caching and reuse them in evaluating incoming queries, j.e., query result matching. In this paper, we propose a complementary Hjaltason and Samet's algerian capable of reusing previous query results in a cache for answering distance browsing queries in multi-user GIS environments. Our experimental results conform the efficiency of our approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.3
• /
• pp.396-402
• /
• 2022

User interactions are being developed in various forms, and in particular, interactions using human gestures are being actively studied. Among them, hand gesture recognition is used as a human interface in the field of realistic media based on the 3D Hand Model. The use of interfaces based on hand gesture recognition helps users access media media more easily and conveniently. User interaction using hand gesture recognition should be able to view images by applying fast and accurate hand gesture recognition technology without restrictions on the computer environment. This paper developed a fast and accurate user hand gesture recognition algorithm using the open source media pipe framework and machine learning's k-NN (K-Nearest Neighbor). In addition, in order to minimize the restriction of the computer environment, a stereoscopic image control system based on user hand gesture recognition was designed and implemented using a web service environment capable of Internet service and a docker container, a virtual environment.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.339-346
• /
• 2006

Increased usage of autonomous underwater vehicle (AUV) has led to the development of alternative navigational methods that do not employ the acoustic beacons and dead reckoning sensors. This paper describes a simultaneous localization and mapping (SLAM) scheme that uses range sonars mounted on a small AUV. The SLAM is one of such alternative navigation methods for measuring the environment that the vehicle is passing through and providing relative position of AUV by processing the data from sonar measurements. A technique for SLAM algorithm which uses several ranging sonars is presented. This technique utilizes an unscented Kalman filter to estimate the locations of the AUV and objects. In order for the algorithm to work efficiently, the nearest neighbor standard filter is introduced as the algorithm of data association in the SLAM for associating the stored targets the sonar returns at each time step. The proposed SLAM algorithm is tested by simulations under various conditions. The results of the simulation show that the proposed SLAM algorithm is capable of estimating the position of the AUV and the object and demonstrates that the algorithm will perform well in various environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5605-5623
• /
• 2016

We propose a face recognition method that utilizes the LCP face descriptor. The proposed method applies a LoG mask to extract a face contour response, and employs the LCP algorithm to produce a binary pattern representation that ensures high recognition performance even under the changes in illumination, noise, and aging. The proposed LCP algorithm produces excellent noise reduction and efficiency in removing unnecessary information from the face by extracting a face contour response using the LoG mask, whose behavior is similar to the human eye. Majority of reported algorithms search for face contour response information. On the other hand, our proposed LCP algorithm produces results expressing major facial information by applying the threshold to the search area with only 8 bits. However, the LCP algorithm produces results that express major facial information with only 8-bits by applying a threshold value to the search area. Therefore, compared to previous approaches, the LCP algorithm maintains a consistent accuracy under varying circumstances, and produces a high face recognition rate with a relatively small feature vector. The test results indicate that the LCP algorithm produces a higher facial recognition rate than the rate of human visual's recognition capability, and outperforms the existing methods.

• Journal of Ship and Ocean Technology
• /
• v.9 no.4
• /
• pp.23-34
• /
• 2005

Increased usage of AUVs has led to the development of alternative navigational methods that use the acoustic beacons and dead reckoning. This paper describes a concurrent mapping and localization (CML) scheme that uses range sonars mounted on SNUUV­I, which is a small test AUV developed by Seoul National University. The CML is one of such alternative navigation methods for measuring the environment that the vehicle is passing through. In addition, it is intended to provide relative position of AUV by processing the data from sonar measurements. A technique for CML algorithm which uses several ranging sonars is presented. This technique utilizes an extended Kalman filter to estimate the location of the AUV. In order for the algorithm to work efficiently, the nearest neighbor standard filter is introduced as the algorithm of data association in the CML for associating the stored targets the sonar returns at each time step. The proposed CML algorithm is tested by simulations under various conditions. Experiments in a towing tank for one dimensional navigation are conducted and the results are presented. The results of the simulation and experiment show that the proposed CML algorithm is capable of estimating the position of the vehicle and the object and demonstrates that the algorithm will perform well in the real environment.

• The Journal of Information Systems
• /
• v.26 no.3
• /
• pp.63-90
• /
• 2017

Purpose This study proposes a novel system trading model using case-based reasoning (CBR) based on absolute similarity threshold. The proposed model is designed to optimize the absolute similarity threshold, feature selection, and instance selection of CBR by using genetic algorithm (GA). With these mechanisms, it enables us to yield higher returns from stock market trading. Design/Methodology/Approach The proposed CBR model uses the absolute similarity threshold varying from 0 to 1, which serves as a criterion for selecting appropriate neighbors in the nearest neighbor (NN) algorithm. Since it determines the nearest neighbors on an absolute basis, it fails to select the appropriate neighbors from time to time. In system trading, it is interpreted as the signal of 'hold'. That is, the system trading model proposed in this study makes trading decisions such as 'buy' or 'sell' only if the model produces a clear signal for stock market prediction. Also, in order to improve the prediction accuracy and the rate of return, the proposed model adopts optimal feature selection and instance selection, which are known to be very effective in enhancing the performance of CBR. To validate the usefulness of the proposed model, we applied it to the index trading of KOSPI200 from 2009 to 2016. Findings Experimental results showed that the proposed model with optimal feature or instance selection could yield higher returns compared to the benchmark as well as the various comparison models (including logistic regression, multiple discriminant analysis, artificial neural network, support vector machine, and traditional CBR). In particular, the proposed model with optimal instance selection showed the best rate of return among all the models. This implies that the application of CBR with the absolute similarity threshold as well as the optimal instance selection may be effective in system trading from the perspective of returns.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.966-977
• /
• 2021

Filterbank multicarrier with offset quadrature amplitude modulation (FBMC-OQAM) is an attractive alternative to the orthogonal frequency division multiplexing (OFDM) modulation technique. In comparison with OFDM, the FBMC-OQAM signal has better spectral confinement and higher spectral efficiency and tolerance to synchronization errors, primarily due to per-subcarrier filtering using a frequency-time localized prototype filter. However, the filtering process introduces intrinsic interference among the symbols and complicates channel estimation (CE). An efficient way to improve the CE in FBMC-OQAM is using a technique known as windowed frequency domain averaging (FDA); however, it requires a priori knowledge of the window length parameter which is set based on the channel's frequency selectivity (FS). As the channel's FS is not fixed and not a priori known, we propose a k-nearest neighbor-based machine learning algorithm to classify the FS and decide on the FDA's window length. A comparative theoretical analysis of the mean-squared error (MSE) is performed to prove the proposed CE scheme's effectiveness, validated through extensive simulations. The adaptive CE scheme is shown to yield a reduction in CE-MSE and improved bit error rates compared with the popular preamble-based CE schemes for FBMC-OQAM, without a priori knowledge of channel's frequency selectivity.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.49-57
• /
• 2022

The government is making great efforts to prevent crimes such as missing children by using public CCTVs. However, there is a shortage of operating manpower, weakening of concentration due to long-term concentration, and difficulty in tracking. In addition, applying real-time object search, re-identification, and tracking through a deep learning algorithm showed a phenomenon of increased parameters and insufficient memory for speed reduction due to complex network analysis. In this paper, we designed the network to improve speed and save memory through the application of Yolo v4, which can recognize real-time objects, and the application of Batch and TensorRT technology. In this thesis, based on the research on these advanced algorithms, OSNet re-ranking and K-reciprocal nearest neighbor for re-identification, Jaccard distance dissimilarity measurement algorithm for correlation, etc. are developed and used in the solution of CCTV national safety identification and tracking system. As a result, we propose a solution that can track objects by recognizing and re-identification objects in real-time within situation of a Korean public multi-CCTV environment through a set of algorithm combinations.