• 한국컴퓨터정보학회논문지
• /
• 제18권9호
• /
• pp.1-10
• /
• 2013

본 논문에서는 대표적인 특징점 추출 알고리즘인 SIFT(Scale-Invariant Feature Transform)를 매니코어 프로세서를 이용하여 병렬 구현하고, 이를 실행 시간, 시스템 이용률, 에너지 효율 및 시스템 면적 효율 측면에서 분석하였다. 또한 기존의 고성능 CPU와 GPU(Graphics Processing Unit)와의 성능 비교를 통해 제안하는 매니코어의 잠재가능성을 입증하였다. 모의실험 결과, 매니코어를 이용한 SIFT 알고리즘 구현 결과는 기존의 OpenCV 구현 결과와 정확도면에서 동일하였고, 매니코어 구현은 고성능 CPU 및 GPU 구현보다 실행시간 측면에서 우수하였다. 또한 본 논문에서는 SIFT알고리즘의 옥타브 크기에 따른 에너지 효율 및 시스템 면적 효율을 분석하여 최적의 모델을 제시하였다.

• 호남수학학술지
• /
• 제36권4호
• /
• pp.805-812
• /
• 2014

For unit tangent sphere bundles $T_1M$ with the standard contact metric structure (${\eta},\bar{g},{\phi},{\xi}$), we have two fundamental operators that is, $h=\frac{1}{2}{\pounds}_{\xi}{\phi}$ and ${\ell}=\bar{R}({\cdot},{\xi}){\xi}$, where ${\pounds}_{\xi}$ denotes Lie differentiation for the Reeb vector field ${\xi}$ and $\bar{R}$ denotes the Riemmannian curvature tensor of $T_1M$. In this paper, we study the Reeb ow invariancy of the corresponding (0, 2)-tensor fields H and L of h and ${\ell}$, respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.601-604
• /
• 1997

In this paper, a pole assignment problem in the unit disk for a linear discrete system is discussed. The analysis is based on the Luenberger's canonical form and Gershgorin's disk. The proposed method for pole assignment is convenient for a linear time invariant discrete system.

• Korean Journal of Mathematics
• /
• 제24권4호
• /
• pp.637-645
• /
• 2016

In this paper, we study dynamical Bifurcation of the Burgers-Fisher equation. We show that the equation bifurcates an invariant set ${\mathcal{A}}_n({\beta})$ as the control parameter ${\beta}$ crosses over $n^2$ with $n{\in}{\mathbb{N}}$. It turns out that ${\mathcal{A}}_n({\beta})$ is homeomorphic to $S^1$, the unit circle.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.807-814
• /
• 1996

Let $G = Z_2$. Let X be any compact connected orientable nonsingular real algebraic variety of dim X = k = odd with the trivial G action, and let Y be the unit sphere $S^{2n-k}$ with the antipodal action of G. Then we prove that any G invariant entire rational map $f : x \times Y \to S^{2n}$ is G homotopically trivial. We apply this result to prove that any entire rational map $g : X \times RP^{2n-k} \to S^{2n}$ is homotopically trivial.

• 대한전자공학회논문지
• /
• 제27권6호
• /
• pp.861-870
• /
• 1990

A method of recognizing objects is proposed that uses a concept of modified incremental circle transform. The modified incremental circle transform, which maps bundaries of an object into an unit circle, represnets efficiently the shape of the boundaries detected in digitized binary images of the objects. It is proved that modified incremental circle transform of object, which is invariant under object translation, rotation, and size, can be used as feature information for recognizing two dimensional polygonal object efficiently.

• 제어로봇시스템학회논문지
• /
• 제8권4호
• /
• pp.292-298
• /
• 2002

We focus on the slicing off some sub-nets using the transitive matrix. Control flows in the Petri nets is done based on the token flows. One control f]ow explains the independent tokens status and if the token-in divides into several tokens after firing a transition then the control flow divides to several flows, as well. Accordingly, we define that the basic unit of concur-rency (short BUC) is a set of the executed control flows based on the behavioral properties in the net. The BUC is S-invariant which has one control flow. We show the usefulness of transitive matrix to slice off some subnets from the original net based on BUC-through on an example.

• 대한수학회보
• /
• 제54권1호
• /
• pp.159-175
• /
• 2017

We solve the $Bj{\ddot{o}}rling$ problem for constant mean curvature one surfaces in hyperbolic three-space and in de Sitter three-space. That is, we show that for any regular, analytic (and spacelike in the case of de Sitter three-space) curve ${\gamma}$ and an analytic (timelike in the case of de Sitter three-space) unit vector field N along and orthogonal to ${\gamma}$, there exists a unique (spacelike in the case of de Sitter three-space) surface of constant mean curvature 1 which contains ${\gamma}$ and the unit normal of which on ${\gamma}$ is N. Some of the consequences are the planar reflection principles, and a classification of rotationally invariant CMC 1 surfaces.

• 충청수학회지
• /
• 제20권3호
• /
• pp.333-342
• /
• 2007

Suppose that ${\mu}$ is a finite positive Borel measure on the unit ball $B{\subset}C^n$. The boundary of B is the unit sphere $S=\{z:{\mid}z{\mid}=1\}$. Let ${\sigma}$ be the rotation-invariant measure on S such that ${\sigma}(S)=1$. In this paper, we will show that if $sup_{{\zeta}{\in}S}\;{\int}_{B}\;P(z,{\zeta})d{\mu}(z)$<${\infty}$ where $P(z,{\zeta})$ is the Poission-Szeg$\ddot{o}$ kernel for B, then ${\mu}$ is a Carleson measure. We will also show that if $sup_{{\zeta}{\in}S}\;{\int}_{B}\;P(z,{\zeta})d{\mu}(z)$<${\infty}$, then the operator T such that T(f) = P[f] is compact as a mapping from $L^p(\sigma)$ into $L^p(B,d{\mu})$.

• Journal of information and communication convergence engineering
• /
• 제12권2호
• /
• pp.128-134
• /
• 2014

In this paper, we present a graphics processing unit (GPU)-based matching technique for the purpose of fast feature matching between different images. The scale invariant feature transform algorithm developed by Lowe for various feature matching applications, such as stereo vision and object recognition, is computationally intensive. To address this problem, we propose a matching technique optimized for GPUs to perform computations in less time. We optimize GPUs for fast computation of keypoints to make our system quick and efficient. The proposed method uses a self-organizing map feature matching technique to perform efficient matching between the different images. The experiments are performed on various image sets to examine the performance of the system under varying conditions, such as image rotation, scaling, and blurring. The experimental results show that the proposed algorithm outperforms the existing feature matching methods, resulting in fast feature matching due to the optimization of the GPU.