• Journal of Digital Convergence
• /
• v.12 no.8
• /
• pp.345-350
• /
• 2014

The most important decision of process planning for the manufacturing system is the machine selection problem to minimize machining costs. Each machine has its own different machining performance indicating a different fraction of scrap, making the cost of scrap generated by machining is different for each machine. Therefore, when we decide on machine selection, we must consider the machining cost and the cost of scrap generated. This paper describes the statistical model for the fraction of scrap generated by machining and the machine selection algorithm considering the total cost including the machining cost and the cost of scrap generated.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.849-858
• /
• 2013

In this paper, we propose a new adaptive single model to track a maneuvering target with abrupt accelerations. We utilize the stochastic differential equation to model acceleration of a maneuvering target with stochastic volatility (SV). We assume the generalized autoregressive conditional heteroscedasticity (GARCH) process as the model for the tracking procedure of the SV. In the proposed scheme, to track a high maneuvering target, we modify the Kalman filtering by introducing a new GARCH model for estimating SV. The proposed tracking algorithm operates in both the non-maneuvering and maneuvering modes, and, unlike the traditional decision-based model, the maneuver detection procedure is eliminated. Furthermore, we stress that the improved performance using the GARCH acceleration model is due to properties inherent in GARCH modeling itself that comply with maneuvering target trajectory. Moreover, the computational complexity of this model is more efficient than that of traditional methods. Finally, the effectiveness and capabilities of our proposed strategy are demonstrated and validated through Monte Carlo simulation studies.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.227-239
• /
• 2014

This paper proposes an enhance prediction for conventional near-lossless coder to effectively lower external memory bandwidth in image processing SoC. First, we utilize an already reconstructed green component as a base of predictor of the other color component because high correlation between RGB color components usually exists. Next, we can improve prediction performance by applying variable block size prediction. Lastly, we use minimum internal memory and improve a temporal prediction performance by using a template dictionary that is sampled in previous frame. Experimental results show that the proposed algorithm shows better performance than the previous works. Natural images have approximately 30% improvement in coding efficiency and CG images have 60% improvement on average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.65-71
• /
• 2012

An OS-CFAR (Ordered Statistics CFAR) based on a sorting algorithm is useful for automotive radar systems in a multi-target situation. However, while the typical cell-averaging CFAR has low computational complexity, the OS-CFAR has much higher computation effort. In this paper, we design the new OS-CFAR architecture with a low computational effort. In the proposed method, since one time sorting processing is performed for the decision of the CFAR threshold, the whole processing effort can be reduced. When the fast sorting technique is employed, the computing time of the proposed OS-CFAR is always much shorter compared with typical OS-CFAR method regardless of the data size. We also present the processing result of proposed architecture using the real radar data.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1048-1052
• /
• 2004

In this work, we have investigated a role of linking parameter in Pulse-Coupled Neural Network(PCNN) which is suggested to explain the synchronous activities among neurons in the cat cortex. Then we have found a method to determine the linking parameter for a satisfactory face detection performance in a given color image. Face detection algorithm which uses the color information is independent on pose, size and obstruction of a face. But the use of color information encounters some problems arising from skin-tone color in the background, intensity variation within faces, and presence of random noise and so on. Depending on these conditions, PCNN's linking parameters should be selected an appropriate values. First we obtained the mean and variance of the skin-tone colors by experiments. Then, we introduced a preprocess that the pixel with a mean value of skin-tone colors has the highest level value (255) and the other pixels have values between 0 and 255 according to normal distribution with a variance. This preprocessing leads to an easy decision of the linking parameter of the Pulse-Coupled Neural Network. Through experiments, it is verified that the proposed method can improve the face detection performance compared to the existing methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.663-667
• /
• 2004

This paper presents new pruning and learning methods for the fuzzy rule-based classifier. The structure of the proposed classifier is framed from the fuzzy sets in the premise part of the rule and the Bayesian classifier in the consequent part. For the simplicity of the model structure, the unnecessary features for each fuzzy rule are eliminated through the iterative pruning algorithm. The quality of the feature is measured by the proposed correctness method, which is defined as the ratio of the fuzzy values for a set of the feature values on the decision region to one for all feature values. For the improvement of the classification performance, the parameters of the proposed classifier are finely adjusted by using the gradient descent method so that the misclassified feature vectors are correctly re-categorized. The cost function is determined as the squared-error between the classifier output for the correct class and the sum of the maximum output for the rest and a positive scalar. Then, the learning rules are derived from forming the gradient. Finally, the fuzzy rule-based classifier is tested on two data sets and is found to demonstrate an excellent performance.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.355-358
• /
• 2005

Fingerprint recognition systems are the most widely used in biometrics for personal authentication. As they become more familiar, the security weaknesses of fingerprint sensors are becoming better known. In this paper, we propose a liveness detection method that applies correlation filter to the fingerprint recognition systems. The physiological characteristic of sweat pore, observed only in live people, is used as a measure to classify 'live' fingers from 'spoof' fingers. Previous works show that detection of sweat pores and perspiration patterns in fingerprint images can be used as an anti-spoofing measure. These methods don't consider the characteristic of pores in each individual. We construct the correlation filters of each individual which are composed of their pore information. We make the final decision about the "livens" of fingerprint using correlation output. The proposed algorithm was applied to a data set of 110 live, 110 spoof fingerprint images from optical fingerprint scanner and achieved classification rate of 80%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1693-1713
• /
• 2018

An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2963-2978
• /
• 2017

The Top-K query is currently played a key role in a wide range of road network, decision making and quantitative financial research. In this paper, a Top-K recommendation algorithm is proposed to solve the cold-start problem and a tag generating method is put forward to enhance the semantic understanding of the OLAP session. In addition, a recommendation system for OLAP sessions called "OLAP4R" is designed using collaborative filtering technique aiming at guiding the user to find the ultimate goals by interactive queries. OLAP4R utilizes a mixed system architecture consisting of multiple functional modules, which have a high extension capability to support additional functions. This system structure allows the user to configure multi-dimensional hierarchies and desirable measures to analyze the specific requirement and gives recommendations with forthright responses. Experimental results show that our method has raised 20% recall of the recommendations comparing the traditional collaborative filtering and a visualization tag of the recommended sessions will be provided with modified changes for the user to understand.

• Journal of the Korea Convergence Society
• /
• v.8 no.2
• /
• pp.27-33
• /
• 2017

To efficiently provide cloud computing services to users over the Internet, IT resources must be configured in the data center based on virtualization and distributed computing technology. This paper focuses specifically on the problem that new training data can be added at any time in a wide range of fields, and new attributes can be added to training data at any time. In such a case, rule generated by the training data with the former attribute set can not be used. Moreover, the rule can not be combined with the new data set(with the newly added attributes). This paper proposes further development of the new inference engine that can handle the above case naturally. Rule generated from former data set can be combined with the new data set to form the refined rule.