• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.456-463
• /
• 2021

In this paper, Ultra Wide-Band(UWB) radar sensor is employed to detect flying drones and avoid collision in dense clutter environments. UWB signal is preferred when high resolution range measurement is required for moving targets. However, the time varying motion of flying drones may increase clutter noises in return signals and deteriorates the target detection performance, which lead to the performance degradation of anti-collision radars. We adopt a dynamic clutter suppression algorithm to estimate the time-varying distances to the moving drones with enhanced accuracy. A modified Constant False Alarm Rate(CFAR) is developed using an adaptive filter algorithm to suppress clutter while the false detection performance is well maintained. For this purpose, a velocity dependent CFAR algorithm is implemented to eliminate the clutter noise against dynamic target motions. Experiments are performed against flying drones having arbitrary trajectories to verify the performance improvement.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.29-38
• /
• 2005

In this paper, a new modified and optimized AntNet algorithm which can be implemented efficiently onto network processor is proposed. The AntNet that mimics the activities of the social insect is an adaptive agent-based routing algorithm. This method requires a complex arithmetic calculating system. However, since network processors have simple arithmetic units for a packet processing, it is very difficult to implement the original AntNet algorithm on network processors. Therefore, the proposed AntNet algorithm is a solution of this problem by decreasing arithmetic executing cycles for calculating a reinforcement value without loss of the adaptive performance. The results of the simulations show that the proposed algorithm is more suitable and efficient than the original AntNet algorithm for commercial network processors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.376-378
• /
• 2001

영상 정보에 기반한 지능형 교통 정보 시스템(ITS)의 응용 분야에서, 차량의 그림자 제거와 겹침 차량을 분리하기 위하여 3차원 물체의 특징을 이용하며 차량 형상을 분리하는 기법을 제안한다. 제안하는 기법은 차량을 분리하기 위하여 연속 프레임에서 배경을 수정하고, 배경 영상과 현재 입력 영상의 차이를 이용한다. 또한 그림자를 제거하고 겹침 차량을 분리하기 위하여, 1) 3차원 증거를 차량 증거 영역에서 검출하여 군집화하고, 2) 독립 차량의 중심 위치를 판단하고, 3) 다시 임계치에 의해 차량의 형상을 분리한다. 단순 임계치에 의해 차량을 분리하는 기법은 기상조건 등에 민감하기 때문에 여러 조건에 따라 다른 알고리즘을 적용해야 하지만 제안하는 기법은 동일한 알고리즘으로 여러 기상조건에 적응이 가능하다.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.119-142
• /
• 2015

With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.95-108
• /
• 2011

TThis is a study of the personalization method that intelligently adapts the level of clustering considering purchasing index of a customer. In the e-biz era, many companies gather customers' demographic and transactional information such as age, gender, purchasing date and product category. They use this information to predict customer's preferences or purchasing patterns so that they can provide more customized services to their customers. The previous Customer-Segmentation method provides customized services for each customer group. This method clusters a whole customer set into different groups based on their similarity and builds predictive models for the resulting groups. Thus, it can manage the number of predictive models and also provide more data for the customers who do not have enough data to build a good predictive model by using the data of other similar customers. However, this method often fails to provide highly personalized services to each customer, which is especially important to VIP customers. Furthermore, it clusters the customers who already have a considerable amount of data as well as the customers who only have small amount of data, which causes to increase computational cost unnecessarily without significant performance improvement. The other conventional method called 1-to-1 method provides more customized services than the Customer-Segmentation method for each individual customer since the predictive model are built using only the data for the individual customer. This method not only provides highly personalized services but also builds a relatively simple and less costly model that satisfies with each customer. However, the 1-to-1 method has a limitation that it does not produce a good predictive model when a customer has only a few numbers of data. In other words, if a customer has insufficient number of transactional data then the performance rate of this method deteriorate. In order to overcome the limitations of these two conventional methods, we suggested the new method called Intelligent Customer Segmentation method that provides adaptive personalized services according to the customer's purchasing index. The suggested method clusters customers according to their purchasing index, so that the prediction for the less purchasing customers are based on the data in more intensively clustered groups, and for the VIP customers, who already have a considerable amount of data, clustered to a much lesser extent or not clustered at all. The main idea of this method is that applying clustering technique when the number of transactional data of the target customer is less than the predefined criterion data size. In order to find this criterion number, we suggest the algorithm called sliding window correlation analysis in this study. The algorithm purposes to find the transactional data size that the performance of the 1-to-1 method is radically decreased due to the data sparity. After finding this criterion data size, we apply the conventional 1-to-1 method for the customers who have more data than the criterion and apply clustering technique who have less than this amount until they can use at least the predefined criterion amount of data for model building processes. We apply the two conventional methods and the newly suggested method to Neilsen's beverage purchasing data to predict the purchasing amounts of the customers and the purchasing categories. We use two data mining techniques (Support Vector Machine and Linear Regression) and two types of performance measures (MAE and RMSE) in order to predict two dependent variables as aforementioned. The results show that the suggested Intelligent Customer Segmentation method can outperform the conventional 1-to-1 method in many cases and produces the same level of performances compare with the Customer-Segmentation method spending much less computational cost.

• Korean Journal of Cognitive Science
• /
• v.16 no.4
• /
• pp.369-386
• /
• 2005

Although Intelligent Tutoring System(ITS) offers individualized learning environment that overcome limited function of existent CAI, and consider many learners' variable, there is little development to be using at the sites of schools because of inefficiency of investment and absence of pedagogical content knowledge representation techniques. To solve these problem, we should study a method, which represents knowledge for ITS, and which reuses knowledge base. On the pedagogical content knowledge, the knowledge in education differs from knowledge in a general sense. In this paper, we shall primarily address the multi-complex structure of knowledge and explanation of learning vein using multi-complex structure. Multi-Complex, which is organized into nodes, clusters and uses by knowledge base. In addition, it grows a adaptive knowledge base by self-learning. Therefore, in this paper, we propose the 'Extended Neural Logic Network(X-Neuronet)', which is based on Neural Logic Network with logical inference and topological inflexibility in cognition structure, and includes pedagogical content knowledge and object-oriented conception, verify validity. X-Neuronet defines that a knowledge is directive combination with inertia and weights, and offers basic conceptions for expression, logic operator for operation and processing, node value and connection weight, propagation rule, learning algorithm.

• International Journal of Highway Engineering
• /
• v.1 no.1
• /
• pp.107-119
• /
• 1999

The joints in the jointed concrete pavement provide a control against transverse or longitudinal cracking at slab, which may be caused by temperature or moisture variation during or after hydration. Without control of cracking, random cracks cause more serious distresses and result in structural or functional failure of pavement system. However, joints nay cause distresses due to its inherent weakness in structural integrity. Thus, the evaluation at joint is very important. and the joint-related distresses should be evaluated reasonably for economic rehabilitation. The purpose of this paper was to develop an evaluation system at joints of jointed concrete pavement using finite element analysis program, ILLI-SLAB, and nondestructive testing device. FWD. To develop an evaluation system for JCP, a sensitivity analysis was performed using ILLI-SLAB program with a selected variables which might affect fairly to on the performance of transverse joints. The most significant variables were selected from precise analysis. An evaluation charts were made for jointed concrete pavement by adopting the field FWD data. It was concluded that the variables which most significantly affect to pavement deflections are the modulus of subgrade reaction(K) and the modulus of dowel/concrete interaction(G), and limiting criteria on the performance of joints at JCP are 300pci. 500,000 lb/in. respectively. Using these variables and FWD test, a charts of load transfer ratio versus surface deflection at joints were made in order to evaluate the performance of JCP. Practically, Chungbu highway was evaluated by these evaluation charts and FWD field data for jointed concrete pavement. For Chungbu highway, only one joint showed smaller value than limiting criterion of the modulus of dowel/concrete interaction(G). The rest joints showed larger values than limiting criteria of the modulus of subgrade reaction(K) and the modulus of dowel/concrete interaction(G).