• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.1-11
• /
• 2006

This paper presents a digital auto-focusing method using a priori estimated point-spread-functions (PSF) database. The proposed algorithm efficiently removes out-of-focus blur in a degraded input image by selecting the optimal PSF from the database. The database consists of optical characteristics of image formation system. The PSF selection Process is performed based on a novel focusing measure. The proposed method includes a spatially adaptive filter for removing both noise and ringing artifacts. Experimental results show that the proposed method efficiently removes out-of-focus blur using significantly reduced computational load compared with the existing method.

• Geophysics and Geophysical Exploration
• /
• v.16 no.1
• /
• pp.27-35
• /
• 2013

In this study, we developed the trial product on 3D magnetic inversion tentatively named 'KMag3D'. Also, we briefly introduced its own function and graphic user interface on which especially focused through the development in the form of user manual. KMag3D is consisted of two fundamental frame for the 3D magnetic inversion. First, algebraic reconstruction technique was selected as a 3D inversion algorithm instead of least square method conventionally used in various magnetic inversion. By comparison, it was turned out that algebraic reconstruction algorithm was more effective and economic than that of least squares in aspect of both computation time and memory. Second, for the effective determination of the 3D initial and a-priori information model required in the execution of our algorithm, we proposed the practical technique based on the assemblage of 2D forward modeling and inversion results for individual user-selected 2D profiles. And in succession, initial and a-priori information model were constructed by appropriate interpolation along the strke direction. From this, we concluded that our technique is both suitable and very practical for the application of 3D magentic inversion problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1259-1262
• /
• 1998

This paper introduced a scheme for finding the relationships between the measurements and tracks in multi-target tracking (MTT). We considered the relationships between targets and measurements as MRF and assumed a priori as a Gibbs distribution. An energy function is defined over the measurement space, as accurately as possible so that it may incorporate most of the important natural constraints. To find the minimizer of the energy function, we derived a new equation of closed form.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.343-350
• /
• 2003

This paper presents a new agent which convert HTML contents to VXML contents automatically for voice services via web. In this paper, I propose an interactive hybrid sequential contents selection method to select desired contents fast and robustly from known web pages. It uses real time structural features as well as embedded text and/or priori structural knowledge such as link symbol position. To verify its effectiveness, a full agent system is implemented and tested. The method reflects user intention more accurately than conventional selections using structural features and is more robust to variations of HTML programming techniques. The agent is fast and has less computational burden than methods use XML or XHTML conversion as intermediate stage.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.157-163
• /
• 2017

The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.251-261
• /
• 2010

This paper deals with a predator-prey model with Holling type III response function and cross-diffusion subject to the homogeneous Neumann boundary condition. We first give a priori estimates (positive upper and lower bounds) of positive steady states. Then the non-existence and existence results of non-constant positive steady states are given as the cross-diffusion coefficient is varied, which means that stationary patterns arise from cross-diffusion.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.159.1-159
• /
• 2001

A new time-domain FIR parameter estimation called the receding horizon least square estimation (RHLSE) is suggested for stochastic systems by combining the well known least square estimation with the receding horizon strategy. It can be always obtained without the requirement of any \textit{a priori} information about the horizon initial parameter. A fast algorithm for the suggested estimation is also presented which is remarkable in the view of computational advantage and simple implementation. It is shown that the proposed estimation is robust against temporary modeling uncertainties due to their FIR structure through simulation studies.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3E
• /
• pp.32-36
• /
• 1997

This study models mobile communication channels as a discrete finite Markovian process, and Markovian jump linear system having parallel Kalman filter type is applied. What is newly proposed in this paper is an equation for obtaining the transition matrix according to sampling time by using a weighted Gaussian sum approximation and its simple calculation process. Experiments show that the proposed method has superior performance and reuires computation compared to the existing MJLS using the ransition matrix given by a statistical method or from priori information.