• Journal of Advanced Navigation Technology
• /
• v.20 no.3
• /
• pp.203-209
• /
• 2016

Among the various fields in the communications, navigation, and surveillance/air traffic management (CNS/ATM) scheme, the surveillance field, which includes an automatic dependent surveillance - broadcast (ADS-B) system and a multilateration (MLAT) system, is implemented using satellite and digital communications technology. These systems provide better performance than radar, but still incur position error. To reduce the error, we propose an efficient information fusion method called the reweighted convex combination method for ADS-B and MLAT systems. The reweighted convex combination method improves aircraft tracking performance compared to the original convex combination method by readjusting the weights given to these systems. In this paper, we prove that the reweighted convex combination method always provides better performance than the original convex combination method. Performance from the fusion of ADS-B and MLAT improves an average of 51.51% when compared to the original data.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.133-139
• /
• 2013

Convex combination of two adaptive filters is an efficient method to improve adaptive filter performances. In this paper, a subband convex combination method of two adaptive filters for fast convergence rate in the transient state and low steady state error is presented. The cost function of mixing parameter for a subband convex combination is defined, and from this, the coefficient update equation is derived. Steady state analysis is used to prove the stability of the subband convex combination. Some simulation examples in system identification scenario show the validity of the subband convex combination schemes.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.72-77
• /
• 2017

This paper proposes the explicit tuning rule of multi-loop PID controller for brushless direct current motors to predict the system behaviors in time and frequency domains, using properties of the convex combination method. The convex set of the proposed controllers formulates the envelope to satisfy the performances in time and frequency domains. The final control parameters are determined by solving the convex optimization problem subject to the constraints which are represented as convex set of time domain performances. The effectiveness of the proposed control method is shown in the numerical simulation, in which controller tuning algorithm and dynamics of brushless DC motor are well taken into account.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.2
• /
• pp.97-101
• /
• 2010

FIR type system identification with noisy input and output data can be solved by a total least squares (TLS) estimation. However, the performance of the TLS estimation is very sensitive to the ratio between the variances of the input and output noises. In this paper, we propose an iterative convex combination algorithm between TLS and least squares (LS). This combined algorithm shows robustness against the noise variance ratio. Consequently, the practical workability of the TLS method with noisy data has been significantly broadened.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.117-127
• /
• 2000

In this paper, we propose a new convex combination weight rule for the cross decomposition method which is known to be one of the most reliable and promising strategies for the large scale optimization problems. It is called generalized cross decomposition, a modification of linear mean value cross decomposition for specially structured linear programming problems. This scheme puts more weights on the recent subproblem solutions other than the average. With this strategy, we are having more room for selecting convex combination weights depending on the problem structure and the convergence behavior, and then, we may choose a rule for either faster convergence for getting quick bounds or more accurate solution. Also, we can improve the slow end-tail behavior by using some combined rules. Also, we provide some computational test results that show the superiority of this strategy to the mean value cross decomposition in computational time and the quality of bounds.

• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.147-157
• /
• 2015

We consider a sparse high-dimensional linear regression model. Penalized methods using LASSO or non-convex penalties have been widely used for variable selection and estimation in high-dimensional regression models. In penalized regression, the selection and prediction performances depend on which penalty function is used. For example, it is known that LASSO has a good prediction performance but tends to select more variables than necessary. In this paper, we propose an additive sparse penalty for variable selection using a combination of LASSO and minimax concave penalties (MCP). The proposed penalty is designed for good properties of both LASSO and MCP.We develop an efficient algorithm to compute the proposed estimator by combining a concave convex procedure and coordinate descent algorithm. Numerical studies show that the proposed method has better selection and prediction performances compared to other penalized methods.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1302-1311
• /
• 2003

This paper presents a more stable method of multiresolution editing for a triangular mesh. The basic idea of our paper is to embed an editing area of a mesh onto a 2D region and to produce 3D surfaces which interpolate the editing-information. In this paper, we adopt the extended convex combination approach based on the shape-preserving parameterization for the embedding, which guarantees no self-intersection on the 2D embedded mesh. That is, the result of the embedding is stable. Moreover, we adopt the multi-level B-spline approach to generate the surface containing all of 3D editing-information, which can make us control the editing area in several levels. Hence, this method supports interactive editing and thus can produce intuitive editing results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.12-21
• /
• 2006

In this paper, we propose a technique for extracting attentive objects in images using feature maps, regardless of the complexity of images and the position of objects. The proposed method uses feature maps with edge and color information in order to extract attentive objects. We also propose a reference map which is created by integrating feature maps. In order to create a reference map, feature maps which represent visually attentive regions in images are constructed. Three feature maps including edge map, CbCr map and H map are utilized. These maps contain the information about boundary regions by the difference of intensity or colors. Then the combination map which represents the meaningful boundary is created by integrating the reference map and feature maps. Since the combination map simply represents the boundary of objects we extract the candidate object regions including meaningful boundaries from the combination map. In order to extract candidate object regions, we use the convex hull algorithm. By applying a segmentation algorithm to the area of candidate regions to separate object regions and background regions, real object regions are extracted from the candidate object regions. Experiment results show that the proposed method extracts the attentive regions and attentive objects efficiently, with 84.3% Precision rate and 81.3% recall rate.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.4
• /
• pp.305-314
• /
• 2015

The work presented in this paper deals with a navigation problem for multiple mobile robot system in unknown indoor environments. The environment is completely unknown for all the robots and the surrounding information should be detected by the proximity sensors installed on the robots' bodies. In order to guide all the robots to move along collision-free paths and reach the goal positions, a navigation method based on the combination of a set of primary strategies has been developed. The indoor environments usually contain convex and concave obstacles. In this work, a danger judgment strategy in accordance with the sensors' data is used for avoiding small convex obstacles or moving objects which include both dynamic obstacles and other robots. For big convex obstacles or concave ones, a wall following strategy is designed for dealing with these special situations. In this paper, a state memorizing strategy is also proposed for the "infinite repetition" or "dead cycle" situations. Finally, when there is no collision risk, the robots will be guided towards the targets according to a target positioning strategy. Most of these strategies are achieved by the means of fuzzy logic controllers and uniformly applied for every robot. The simulation experiments verified that the proposed method has a positive effectiveness for the navigation problem.

• Journal of Biomedical Engineering Research
• /
• v.36 no.5
• /
• pp.211-220
• /
• 2015

Recently, model-based iterative reconstruction (MBIR) has played an important role in transmission tomography by significantly improving the quality of reconstructed images for low-dose scans. MBIR is based on the penalized-likelihood (PL) approach, where the penalty term (also known as the regularizer) stabilizes the unstable likelihood term, thereby suppressing the noise. In this work we further improve MBIR by using a more expressive regularizer which can restore the underlying image more accurately. Here we used a spline regularizer derived from a linear combination of the two-dimensional splines with first- and second-order spatial derivatives and applied it to a non-quadratic convex penalty function. To derive a PL algorithm with the spline regularizer, we used a separable paraboloidal surrogates algorithm for convex optimization. The experimental results demonstrate that our regularization method improves reconstruction accuracy in terms of both regional percentage error and contrast recovery coefficient by restoring smooth edges as well as sharp edges more accurately.