• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.527-535
• /
• 2016

Statistical optimization algorithms have been variously developed to estimate the 3D shape and motion. However, statistical approaches are limited to analyze the sensitive effects of SfM(Shape from Motion) according to the camera's geometrical position or viewing angles and so on. This paper propose the quantitative estimation method about the uncertainties of an observation matrix by using camera imaging configuration factors predict the reconstruction ambiguities in SfM. This is a very efficient method to predict the final reconstruction performance of SfM algorithm. Moreover, the important point is that our method show how to derive the active guidelines in order to set the camera imaging configurations which can be expected to lead the reasonable reconstruction results. The experimental results verify the quantitative estimates of an observation matrix by using camera imaging configurations and confirm the effectiveness of our algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.441-447
• /
• 2012

This paper presents a design technique of a Takagi-Sugeno (T-S) fuzzy-model-based $H_{\infty}$ controller for autonomous underwater vehicles (AUVs). The design procedure aims to render the stabilizing controller which satisfies performance of the diving control for AUVs in the presence of the disturbance. A nonlinear AUV is modeled by the T-S fuzzy system through the sector nonlinearity. By using Lyapunov function, the sufficient conditions are derived to guarantee the performance of robust depth control in the format of linear matrix inequality (LMI). To succeed for diving control of AUV, we add the constraints on the diving and pitch angles in the LMI conditions. Through the simulation, we confirm the effectiveness of the proposed methodology.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.6
• /
• pp.15-26
• /
• 2001

Visual cryptography is a simple method in which secret information can be directly decoded in human visual system without any cryptographic computations. When the secret image is scattered to n random shares(slides), this scheme has some week point such as pixel expansion and contrast degradation. Therefore, it is necessary to reduce the pixel expansion and improve the contrast in recovered image. In this paper, we propose a new construction method for (k, n) visual cryptography using the cumulative matrix. In case k is odd, we can construct the cumulative matrix perfectly. For even k, the contrast of special pair in decoded image can be achieved best by permitting multiple contract. The proposed method is more simple than that of S. Droste\`s in construction and the average contrast of decoded image is improved for the most part. Also, we show that the basis matrices depending on the cumulative matrix are able to be applied for the general access structure.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.69-80
• /
• 2024

In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

• Journal of the Korea Society for Simulation
• /
• v.33 no.1
• /
• pp.19-26
• /
• 2024

The phase-type, PH, distribution is defined as the time to absorption into a terminal state in a continuous-time Markov chain. As the PH distribution includes family of exponential distributions, it has been widely used in stochastic models. Since the PH distribution is represented and generated by an initial probability vector and a generator matrix which is called the Markovian representation, we need to find a vector and a matrix that are consistent with given set of moments if we want simulate a PH distribution. In this paper, we propose an approach to simulate a PH distribution based on distribution function which can be obtained directly from moments. For the simulation of PH distribution of order 2, closed-form formula and streamlined procedures are given based on the Jordan decomposition and the minimal Laplace transform which is computationally more efficient than the moment matching methods for the Markovian representation. Our approach can be used more effectively than the Markovian representation in generating higher order PH distribution in queueing network simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1393-1400
• /
• 2006

This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.209-210
• /
• 2008

본 논문에서는 제어기에 승산형 섭동을 가지는 제어기와 이산시간 특이시스템을 안정화시키는 비약성 제어기 설계방법을 제시한다. 강인 비약성 제어기가 존재할 조건과 제어기 설계방법을 블록최적화가 가능한 선형 행렬부등식 접근방법으로 제안한다. 또한, 제어기의 약성 성도를 표시하는 비약성 척도를 동시에 계산함으로 승산형 섭동의 제어기 최대 변동정도를 제시한다. 제안한 비약성 제어기는 제어기의 이득 변동에도 불구하고 이산 시간 특이시스템의 강인 안정성을 보장한다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1298-1301
• /
• 2007

The problem of designing dynamic output feedback sliding mode controllers for uncertain multivariable linear systems is considered. Using linear matrix inequalities(LMIs), a feasibility condition for the design problem is derived. Explicit fomulas of the gain matrices of a full order output feedback sliding mode controller in terms of the solution matrices of the LMI condition is given. A simple LMI-based algorithm for designing output feedback sliding mode controllers is also given. Finally, numerical design examples are given to show the effectiveness of the proposed method.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.143-147
• /
• 2001

본 논문은 연속된 이미지로부터 고속 영상 모자익을 구성하는 새로운 접근을 기술한다. 제안하는 알고리듬은 전체 영상이 아닌, 종첩영역에서 특징점 및 대응점을 찾아 초기 변한 행렬을 구함으로 좀더 정확한 변환식을 표현하도록 하고 계산량을 감소시킨다. 또한 고속으로 모자익을 수행하도록 하기 위해 OpenGL 기반 텍스쳐 매핑을 이용하였다. 기존의 방법은 모든 영상의 픽셀에 변환식을 곱함으로 인해 많은 계산시간을 초래했다. 본 논문에서 제안하는 방법은 OpenGL 기반 텍스쳐 매핑을 이용해 영상의 각 버텍스에 변환식을 곱함으로서 계산시간을 단축시켰다. 그 결과, PC에서 카메라로부터 영상을 받아들여 고속으로 모자익을 구성할 수 있다.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.730-732
• /
• 1999

전류원을 포함한 대형회로망의 컴퓨터적 해법을 위한 도형적 접근 방법을 제시하였다. 기본적인 회로망 해석법으로 망로해석법을 사용하였고, 전류원은 등가변환이 어려운 병렬 임피던스가 없는 경우로 한정하였다. 방향성 그래프의 기하학적 작도와 전류원 전류 흐름도 작성에 의해 회로망 행렬을 구성하였다.