• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.118-126
• /
• 1996

In object analysis by image processing, finding lines plays a universal role. And these lines can be easily found by detecting ridges and valleys in digital gray scale images. In this paper, a new method of detecting ridges and valleys by using local min/max operations was presented. This method detects ridges and valleys of desired width by using erosion and dilation properties of local min/max operations, and requires no information of ridge or valley direction. Therefore the method is efficient and computationally simple in comparision with the conventional analytical method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.7 no.4
• /
• pp.386-391
• /
• 1983

Two-dimensional slow viscous flow due to a stokeslet near a slit is investigated on the basis of Stokes approximation. Velocity fields and stream function are obtained in closed forms by finding two sectionally holomorphic functions which are determined by reducing the problem to Riemann-Hilbert problems. The force exerted on a small cylinder is calculated for the arbitrary position of the cylinder translating in an arbitrary direction. The features of fluid flow are also investigated.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.507-512
• /
• 1992

This paper presents a method for the automatic generation of assembly sequences based on the recursive extraction of a preferred part along with the verification of its disassemblability. To verify the disassemblability of the part we inference the geometric precedence constraints using a method of extracting separable directions for the part and determine the disassemblability cost by the separability and stability cost. The proosed method provides a local optimal solution of finding a cost effective assembly plan, and the feasibility of calculating robot motion programs by evaluating separable directions in flexible manufacturing application. A case study is given to illustrate the concepts and procedure of the proposed scheme.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.27-28
• /
• 2010

Finding shortest path technique running time differs depending on applying of the algorithm and data, and also used a lot of difference in effectiveness depending on the environment occurs. Therefore, the algorithm and environment based on this study, the relationship between optimal solutions and compare running time.

• Journal of Biomedical Engineering Research
• /
• v.10 no.2
• /
• pp.102-105
• /
• 1989

In electrical impedance tomography(EIT), we use boundary current and voltage measurements toprovide the information about the cross-sectional distribution of electrical impedance or resistivity. One of the major problems in EIT has been the inaccessibility of internal voltage or current data in finding the internal impedance values. We propose a new image reconstruction method using internal current density data measured by NMR. We obtained a two-dimensional current density distribution within a phantom by processing the real and imaginary MR images from a 4.77 NMR machine. We implemented a resistivity mage reconstruction algorithm using the finite element method and sensitivity matrix. We presented computer simulation results of the mage reconstruction algorithm and furture direction of the research.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1574-1578
• /
• 1997

In this paper, some problems that occur from faulty elements in a direction finding system composed of the linear array are studied and the method which improves the performance is proposed. The faulty element means the sensor that has no output or highly reduced gain than other normal sensors. In the presence method, the ocrrecting vector is calculated by maximizing the spatial spectrum subject to a constraint. The compensated spatial spectrum is obtained by this vector. The computer simulations have been performance to study the performance of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5B
• /
• pp.623-631
• /
• 2001

본 논문에서는 등간격 선형어레이로 입사한 인코히어런트신호의 도래각을 추정하기 위하여 행렬특성매핑을 기본으로 한 알고리듬을 제안한다. 알로리듬의 기본 개념은 공분산 행렬 초정값과 Frobenius norm 면에서 가장 가까운 공분산 행렬 (혹은 스펙트럼 밀도행렬)을 찾는 것이다. 제안된 알고리듬의 우수한 성능을 보여주기 위하여 협대역 신호인 경우에는 MUSIC과 광대역 신호인 경우에는 CSM-MUSIC과 컴퓨터 시뮬레이션을 통하여 통계적 성능을 비교하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.4
• /
• pp.42-50
• /
• 1998

본 논문에서는 Gram-Schmidt 구조와 Inverse Power Method를 이용한 고유 부공간 추정 방법을 제안하고 입사각을 추정하는 문제에 적용하여 성능을 평가하였다. 그리고, 어레 이 센서들이 가운데를 중심으로 대칭으로 배열되어 있을 때, 전후방 GS 필터를 이용한 향 상된 고유 부공간 방법을 제안하였다. 그리고, 제안한 방법들을 제한조건을 갖는 gradient search 방법과 비교하였다.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1807-1810
• /
• 2002

This paper presents a technique for avoid- ing indefiniteness in Maximum Likelihood (ML) criteria for Direction-of-Arrival (DOA) finding using a sensor ar- ray with arbitrary configuration. The ML criterion has singular points in the solution space where the criterion becomes indefinite. Solutions fly iterative techniques for ML bearing estimation may oscillate because of numerical instability which occurs due to the indefiniteness, when bearings more than one approach to the identical value. The oscillation makes the condition for terminating iterations complex. This paper proposes a technique for avoiding the indefiniteness in ML criteria.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.4
• /
• pp.185-192
• /
• 2017

In various fields of science, 2-dimensional array data is being generated actively as a result of measurements and simulations. Although various query processing techniques for array data are being studied, the problem of finding similar regions, whose sizes are not known in advance, in 2-dimensional array has not been addressed yet. Therefore, in this paper, we propose an efficient method for finding regions with similar element values, whose size is larger than a user-specified value, for a given 2-dimensional array data. The proposed method, for each pair of elements in the array, expands the corresponding two regions, whose initial size is 1, along the right and down direction in stages, keeping the shape of the two regions the same. If the difference between the elements values in the two regions becomes larger than a user-specified value, the proposed method stops the expansion. Consequently, the proposed method can find similar regions efficiently by accessing only those parts that are likely to be similar regions. Through theoretical analysis and various experiments, we show that the proposed method can find similar regions very efficiently.