• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.1931-1940
• /
• 2014

In this paper, we propose a new hand shape recognition algorithm based on the geometric features using the convex-hull from the depth image acquired by Kinect system. Kinect is a camera providing a depth image and user's skeleton information and used for detecting hand region. In the proposed algorithm, hand region is detected in a depth image acquired by Kinect and convex-hull of the region is found. Boundary points caused by noise and unnecessary points for recognition are eliminated in the convex-hull that changes depending on hand shape. Hand shape is recognized by the sum of internal angle of a polygon that is matched with convex-hull reconstructed with selected boundary points. Through experiments, we confirm that proposed algorithm shows high recognition rate not only for five models but also those cases rotated.

• 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.

• Communications for Statistical Applications and Methods
• /
• v.27 no.1
• /
• pp.129-140
• /
• 2020

In this paper, we introduce an efficient algorithm for the non-convex penalized multinomial logistic regression that can be uniformly applied to a class of non-convex penalties. The class includes most non-convex penalties such as the smoothly clipped absolute deviation, minimax concave and bridge penalties. The algorithm is developed based on the concave-convex procedure and modified local quadratic approximation algorithm. However, usual quadratic approximation may slow down computational speed since the dimension of the Hessian matrix depends on the number of categories of the output variable. For this issue, we use a uniform bound of the Hessian matrix in the quadratic approximation. The algorithm is available from the R package ncpen developed by the authors. Numerical studies via simulations and real data sets are provided for illustration.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.363-369
• /
• 2001

This paper proposes a convex hull algorithm for 2D patterns. The proposed algorithm is divided ito 2steps; candidate convex point extraction and final convex point extraction. First step removes as many points as possible that cannot be convex points using simple operation. Second step computes final convex hull of 2D patterns. This method accelerates execution time, since it consists of simple operations. Experimental results show that the proposed method is faster than other 2 methods in speed.

• Journal of applied mathematics & informatics
• /
• v.36 no.3_4
• /
• pp.245-256
• /
• 2018

In the paper, we introduce some new classes of generalized logh-convex functions in the first sense and in the second sense. We establish Hermite-Hadamard type inequality for different classes of generalized convex functions. It is shown that the classes of generalized log h-convex functions in both senses include several new and known classes of log h convex functions. Several special cases are also discussed. Results proved in this paper can be viewed as a new contributions in this area of research.

• Bulletin of the Korean Space Science Society
• /
• 2004.10b
• /
• pp.254-257
• /
• 2004

Both ground and space telescopes are being built larger and larger. Accordingly, the secondary mirrors become larger which are convex mostly on the surface form. Testing convex mirrors becomes more difficult and delicate than testing concave mirrors in optics, because additional optical components are needed to make the reflected rays converge. Hindle type tests are frequently used for measuring the surface deforms of convex mirrors, which employs a meniscus lens to reverse the diverted rays from the mirrors. In case of testing large convex mirrors by using Hindle type tests, attention would be needed as larger meniscus lens is required. A method of modified Hindle test has been studied and the characteristics are analyzed. In this paper, current method of testing convex mirrors is presented, and a new method is discussed.

• 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.

• Communications for Statistical Applications and Methods
• /
• v.25 no.1
• /
• pp.79-89
• /
• 2018

In this paper, we study the maximal property of the volume of the convex hull of d-dimensional independent random vectors. We show that the volume of the random convex hull from a multivariate location-scale family indexed by ${\Sigma}$ is stochastically maximized in simple stochastic order when ${\Sigma}$ is diagonal. The claim can be applied to a broad class of multivariate distributions that include skewed/unskewed multivariate t-distributions. We numerically investigate the proven stochastic relationship between the dependent and independent random convex hulls with the Gaussian random convex hull. The numerical results confirm our theoretical findings and the maximal property of the volume of the independent random convex hull.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.1
• /
• pp.1-18
• /
• 2019

In contrast to the well-developed convex splitting schemes for gradient flows of two-component system, there were few efforts on applying the convex splitting idea to gradient flows of multi-component system, such as the vector-valued Cahn-Hilliard (vCH) equation. In the case of the vCH equation, one need to consider not only the convex splitting idea but also a specific method to manage the partition of unity constraint to design an unconditionally energy stable scheme. In this paper, we propose a constrained Convex Splitting (cCS) scheme for the vCH equation, which is based on a convex splitting of the energy functional for the vCH equation under the constraint. We show analytically that the cCS scheme is mass conserving and unconditionally uniquely solvable. And it satisfies the constraint at the next time level for any time step thus is unconditionally energy stable. Numerical experiments are presented demonstrating the accuracy, energy stability, and efficiency of the proposed cCS scheme.

• Honam Mathematical Journal
• /
• v.43 no.1
• /
• pp.130-140
• /
• 2021

In this paper, we introduce and study the concept of trigonometrically quasi-convex function. We prove Hermite-Hadamard type inequalities for the newly introduced class of functions and obtain some new Hermite-Hadamard inequalities for functions whose first derivative in absolute value, raised to a certain power which is greater than one, respectively at least one, is trigonometrically quasi-convex convex. We also extend our initial results to functions of several variables. Next, we point out some applications of our results to give estimates for the approximation error of the integral the function in the trapezoidal formula.