• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.283-290
• /
• 2003

Andras Bezdek proved that if a convex n-gon and n points are given, then the points and the sides of the polygon can be renumbered so that at least[${\frac{n}{3}}$] triangles spanned by the ith point and the ith side (i = 1,2,...n) are mutually non-overlapping. In this paper, we show that at least [${\frac{n}{2}}$] mutually non-overlapping triangles can be constructed. This lower bound is best possible.

• International Journal of Contents
• /
• 제1권1호
• /
• pp.40-44
• /
• 2005

This paper introduces region partitioning method of non-perfect nested loops with non-uniform dependences. This kind of loop normally can't be parallelized by existing parallelizing compilers and transformations. Even when parallelized in rare instances, the performance is very poor. Based on the Convex Hull theory which has adequate information to handle non-uniform dependences, this paper proposes an enhanced region partitioning method which divides the iteration space into minimum parallel regions where all the iterations inside each parallel region can be executed in parallel by using variable renaming after copying.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권1호
• /
• pp.87-92
• /
• 2003

This paper describes a system for tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

• 대한전자공학회논문지SP
• /
• 제39권2호
• /
• pp.69-78
• /
• 2002

본 논문에서는 복잡한 배경에서의 얼굴 추출 방법을 제안한다. 제안된 알고리즘은 적응 퍼지 색 분할기법을 사용하여 얼굴색과 머리색을 분할시킨다. 얼굴색 분포는 Y,Cb,Cr 색 공간내에서 유도되어지고, 조명값에 적응적인 퍼지 시스템을 사용하여 얼굴색을 구분해낸다. 머리색은 RGB 색 공간내에서 구분되어진다. 전처리 과정을 거쳐 추출되어진 얼굴색과 머리색 영역에 컨벡스 헐을 적용하여 그들의 관계를 통해 최종적인 얼굴 영역이 추출되어진다. 제안된 방법은 기존의 패턴 매칭 방법에 비해 효율적인 성능을 나타낸다. 제안된 알고리즘의 유효성을 실험을 통해 증명하며, 색 영역에서의 제한 조건 없이 성공적으로 얼굴 영역을 추출해 냄을 알 수 있다.

• 대한수학회보
• /
• 제55권3호
• /
• pp.957-965
• /
• 2018

We study the class $C{\mathcal{V}} ({\Omega})$ of analytic functions f in the unit disk ${\mathbb{D}}=\{z{\in}{\mathbb{C}}$ : ${\mid}z{\mid}$ < 1} of the form $f(z)=z+{\sum}_{n=2}^{\infty}a_nz^n$ satisfying $$1+\frac{zf^{{\prime}{\prime}}(z)}{f^{\prime}(z)}{\in}{\Omega},\;z{\in}{\mathbb{D}}$$, where ${\Omega}$ is a convex and proper subdomain of $\mathbb{C}$ with $1{\in}{\Omega}$. Let ${\phi}_{\Omega}$ be the unique conformal mapping of $\mathbb{D}$ onto ${\Omega}$ with ${\phi}_{\Omega}(0)=1$ and ${\phi}^{\prime}_{\Omega}(0)$ > 0 and $$k_{\Omega}(z)={\displaystyle\smashmargin{2}{\int\nolimits_{0}}^z}{\exp}\({\displaystyle\smashmargin{2}{\int\nolimits_{0}}^t}{\zeta}^{-1}({\phi}_{\Omega}({\zeta})-1)d{\zeta}\)dt$$. Let $z_0,z_1{\in}{\mathbb{D}}$ with $z_0{\neq}z_1$. As the first result in this paper we show that the region of variability $\{{\log}\;f^{\prime}(z_1)-{\log}\;f^{\prime}(z_0)\;:\;f{\in}C{\mathcal{V}}({\Omega})\}$ coincides wth the set $\{{\log}\;k^{\prime}_{\Omega}(z_1z)-{\log}\;k^{\prime}_{\Omega}(z_0z)\;:\;{\mid}z{\mid}{\leq}1\}$. The second result deals with the case when ${\Omega}$ is the right half plane ${\mathbb{H}}=\{{\omega}{\in}{\mathbb{C}}$ : Re ${\omega}$ > 0}. In this case $CV({\Omega})$ is identical with the usual normalized class of convex univalent functions on $\mathbb{D}$. And we derive the sharp upper bound for ${\mid}{\log}\;f^{\prime}(z_1)-{\log}\;f^{\prime}(z_0){\mid}$, $f{\in}C{\mathcal{V}}(\mathbb{H})$. The third result concerns how far two functions in $C{\mathcal{V}}({\Omega})$ are from each other. Furthermore we determine all extremal functions explicitly.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.1-23
• /
• 2005

The decentralized static output feedback design problem is considered. A constrained trust region method is developed that solves this optimal control problem when a complete set of state variables is not available. The considered problem is interpreted as a non-linear (non-convex) constrained matrix optimization problem. Then, a decentralized constrained trust region method is developed for this problem class exploiting the diagonal structure of the problem and using inexact computations. Finally, numerical results are given for the proposed method.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.632-635
• /
• 2003

This paper describes a system fur tracking multiple faces in an input video sequence using facial convex hull based facial segmentation and robust hausdorff distance. The algorithm adapts skin color reference map in YCbCr color space and hair color reference map in RGB color space for classifying face region. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, this algorithm computes displacement of the point set between frames using a robust hausdorff distance and the best possible displacement is selected. Finally, the initial face model is updated using the displacement. We provide an example to illustrate the proposed tracking algorithm, which efficiently tracks rotating and zooming faces as well as existing multiple faces in video sequences obtained from CCD camera.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.197-202
• /
• 1992

In this paper, we consider the synthesis of mixed H$_{2}$/H$_{\infty}$ controllers such that the closed-loop poles are located in a specified region in the complex plane. Using solution to a generalized Riccati equation and a change of variable technique, it is shown that this synthesis problem can be reduced to a convex optimization problem over a bounded subset of matrices. This convex programming can be further reduced to Generalized Eigenvalue Minimization Problem where Interior Point method has been recently developed to efficiently solve this problem..

• Advances in aircraft and spacecraft science
• /
• 제1권4호
• /
• pp.443-454
• /
• 2014

An experimental study was conducted to investigate the effect of Reynolds number on compressible convex-corner flows, which correspond to an upper surface of a deflected flap of an aircraft wing. The flow is naturally developed along a flat plate with two different lengths, resulting in different incoming boundary layer thicknesses or Reynolds numbers. It is found that boundary layer Reynolds number, ranging from $8.04{\times}10^4$ to $1.63{\times}10^5$, has a minor influence on flow expansion and compression near the corner apex in the transonic flow regime, but not for the subsonic expansion flow. For shock-induced separated flow, higher peak pressure fluctuations are observed at smaller Reynolds number, corresponding to the excursion phenomena and the shorter region of shock-induced boundary layer separation. An explicit correlation of separation length with deflection angle is also presented.

• 호남수학학술지
• /
• 제35권1호
• /
• pp.37-49
• /
• 2013

Consider a non-degenerate open convex cone C with vertex the origin in the $n$2-dimensional Euclidean space $E^n$. We study volume properties of strictly convex hypersurfaces in the cone C. As a result, for example, if the volume of the region of an elliptic cone C cut off by the tangent hyperplane P of M at $p$ is independent of the point $p{\in}M$, then it is shown that the hypersurface M is part of an elliptic hyperboloid.