• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.3
• /
• pp.15-21
• /
• 2009

In this paper, we consider the design problem of robust stabilization and robust guaranteed cost state feedback controller for discrete-time singular systems with parameter uncertainties by LMI(linear matrix inequality) approach without semi-definite condition and decomposition of system matrices. The objective of robust stabilization controller is to construct a state feedback controller such that the closed-loop system is regular, causal, and stable. In the case of robust guaranteed cost control, the optimal value of guaranteed cost and controller design method are presented on the basis of robust stabilization control technique. Finally, a numerical example is provided to show the validity of the design methods.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.5
• /
• pp.1-7
• /
• 2008

This paper presents not only the robust stabilization technique but also robust non-fragile controller design method for discrete-time singular systems and static state feedback controller with multiplicative uncertainty. The condition for the existence of robust stabilization controller, the admissible controller design method, and the measure of non-fragility in controller are proposed via LMI(linear matrix inequality) approach. In order to get the maximum measure of non-fragility, the obtained sufficient condition can be rewritten as LMI optimization form in terms of transformed variable. Therefore, the presented robust non-fragile controller for discrete-time singular systems guarantees robust stability in spite of parameter uncertainty and controller fragility. Finally, a numerical example is given to show the validity of the design method.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.111-118
• /
• 2021

This paper proposes a novel method of caching contents that can be encoded into multiple quality levels in device-to-device (D2D)-assisted caching networks. Different from the existing caching schemes, the author allows caching fractions of an individual file and considers the self cache hit event, which the user can find the desired content in its device. The author analyzes the tradeoff between the quality of cached contents and the cache hit rate, and proposes the device caching method maximizing the expected quality that the user can enjoy. Depending on the parameter of the relationship between the quality and the file size, the optimal caching method can be obtained by solving the convex optimization problem and the DC programming problem. If the file size increases faster than the quality, the cached fractions of the contents continuously increase as the popularity grows. Meanwhile, if the file size increases slower than the quality, some of the high-popularity files are entirely cached but others are not cached at all.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.38-45
• /
• 2001

In this paper, numerical stability analysis methodology for the singleton-type linguistic fuzzy control systems is proposed. The proposed stability analysis is not the analytical method but the numerical method using the convex optimization of Quadratic Programming (QP) and Linear Matrix Inequalities (LMI). Finally, the applicability of the suggested methodology is highlighted via simulation results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.212-215
• /
• 2008

In this paper, we develop the optimal path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. The MAKLINK is a set of edges which consist of the convex set. Some of the edges come from the edges of the obstacles. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1] through the experiment.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.53-56
• /
• 2000

The problem ( Ρ ) of optimizing a linear function d$\^$T/x over the set of efficient set for a multiple objective linear program ( Μ ) is difficult because the efficient set is nonconvex. There some interesting properties between the objective linear vector ｄ and the matrix of multiple objectives C and those properties lead us to establish criteria to solve ( Ρ ) with a linear program. In this paper we investigate a system of the linear equations C$\^$T/${\alpha}$=d and construct two linearly independent positive vectors ${\mu}$, ν such that ${\alpha}$=${\mu}$-ν. From those vectors ${\mu}$, ν, solving an weighted sum linear program for finding an efficient extreme point for the ( Μ ) is a way to get an optimal solution ( Ρ ). Therefore our theory gives an easy way of solving nonconvex program ( Ρ ) with a weighted sum linear program.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.4 s.37
• /
• pp.657-666
• /
• 1998

This study presents an effective dual algorithm for the optimal design of steel structures with displacement constraints. The dual method can replace a primary optimization problem with a sequence of approximate explicit subproblems with a simple algebraic structure. Since being convex and separable, each subproblem can be solved efficiently by the dual method. Specifically, this study uses the principle of virtual work to obtain the displacement constraint equations with an explicit form and adds the linear regression equation expressing the relationships between the cross-section properties to the dual algorithm to reduce the number of design variables. Furthermore, this study deals with the discrete optimization problem to select members with the standard steel sections. Through numerical analyses, the proposed method will be compared with the conventional optimality criteria method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.81-83
• /
• 2015

객관적 영상 화질 측정(Image Quality Assessment: IQA)방법은 영상 화질 최적화 문제해결을 목적으로 하는 영상 처리 및 컴퓨터 비전 분야에 매우 중요하게 사용된다. 이를 위해, 저복잡도, 고성능 및 좋은 수학적 특성(예를 들어, 척도성(metricability), 미분가능성(differentiability) 및 볼록 성질(convexity))을 모두 만족시키는 객관적 IQA 방법이 활발히 연구되어 왔다. 그러나, 위해 위에서 언급한 좋은 수학적 특성을 가지는 대부분의 객관적 IQA 방법들은 좋은 수학적 특성을 만족시키기 위해 상당한 예측성능의 감소를 초래했다. 본 논문은 위에서 언급한 좋은 수학적 특성을 모두 만족시키면서, 예측 성능이 향상된 새로운 IQA 방법을 제안한다. 인간 시각 체계의 감수영역은 광도 입력에 대해 공간 도메인에서 미분 형태의 응답을 가지므로, 제안 방법은 이러한 시각 체계 응답을 모방하여 기울기 연산자를 도입한다. 제안한 방법에서 도입한 기울기 연산자는 매우 단순하게 설계되어, 계산 복잡도가 매우 낮다. 광범위한 실험 결과, 제안하는 IQA 방법은 기존 수학적 특성이 좋은 IQA 방법들 대비 더 좋은 성능을 보이면서 계산 복잡도 또한 낮았다. 따라서 제안 IQA 방법은 다양한 영상 화질 최적화 문제에 매우 효과적으로 적용될 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.155-162
• /
• 2015

This paper proposes a deterministic optimization algorithm to solve economic load dispatch problem with quadratic convex fuel cost function. The proposed algorithm primarily partitions a generator with prohibited zones into multiple generators so as to place them afield the prohibited zone. It then sets initial values to $P_i{\leftarrow}P_i^{max}$ and reduces power generation costs of those incurring the maximum unit power cost. It finally employs a swap optimization process of $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$ where $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_j+{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}=1.0,0.1,0.01,0.001$. When applied to 3 different 15-generator cases, the proposed algorithm has consistently yielded optimized results compared to those of heuristic algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1972-1978
• /
• 2010

AAM(Active Appearance Model) is one of the most effective ways to detect deformable 2D objects and is a kind of mathematical optimization methods. The cost function is a convex function because it is a least-square function, but the search space is not convex space so it is not guaranteed that a local minimum is the optimal solution. That is, if the initial value does not depart from around the global minimum, it converges to a local minimum, so it is difficult to detect face contour correctly. In this study, an AAM-based face tracking algorithm is proposed, which is robust to various lighting conditions and backgrounds. Eye detection is performed using SIFT and Genetic algorithm, the information of eye are used for AAM's initial matching information. Through experiments, it is verified that the proposed AAM-based face tracking method is more robust with respect to pose and background of face than the conventional basic AAM-based face tracking method.