• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.10
• /
• pp.1445-1450
• /
• 2002

In the present study, a new pattern recognition algorithm was proposed to size spray particles using the boundary curvature information. Conceptually, this algorithm has an advantage over the others because it can identify the particle size and shape simultaneously, and also can separate the overlapped particles more effectively. Curvature of a boundary was obtained from the change of the slopes of two neighboring segments at the corresponding part. The algorithm developed in this study was tested by using an artificially prepared image of a group of spherical particles which were either isolated or overlapped. Particle sizes obtained from the measured curvatures agreed well with the true values. By detecting abrupt changes of the curvature along the image boundary, the element particles could be separated out from their overlapped images successfully.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2188-2195
• /
• 2000

This paper deals with the problem of determining small-bands enclosing a given set of points on the sphere. The small-band is a spherical region, whose boundary is composed of two circles, and which does not contain any great circle. It is a kind of domains that is derived from formalizing the local accessibility problems for 3-axis NC machining into sperical containment problems so as to avoid the grouping. It also can be generated in 4- and 5-axis machine. When a set of points U and the size of a great-band are given, the methods for computing a feasible band and all feasible bands enclosing U in O(n) and O(n log n) time have been suggested, respectively. The methods can be applied into the cases of small bands since the solution region may contain holes. In this paper, we concentrate on the method for determining the smallest small-band enclosing U and suggest an O(n long n) time algorithm, where n is the number of points on the sphere.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.214-218
• /
• 2004

본 논문은 fuzzy C 원형 윤곽선(fuzzy C spherical shells 이하 FCSS) 알고리즘을 확장한 interval 제2종 fuzzy C원형 윤곽선 알고리즘에 관한 연구이다. 본 논문에서는 FCSS의 클러스터 윤곽선과의 관계에 의해 패턴이 할당 받은 퍼지 소속도(fuzzy 소속도) 값 결정에 존재하는 불확실성(uncertainty)은 표현하고, 관리하여 플러스터링 성능을 향상하고자 한다. 이러한 과정을 통하여 확장된 interval 제2종 FCSS는 패턴 집합에 존재할 수 있는 노이즈(noise)의 존재에 대해 기존의 FCSS보다 좀더 안정적이고, 바람직한 클러스터 윤곽선을 검출해낼 수 있도록 할 수 있을 것이다.

• Progress in Superconductivity and Cryogenics
• /
• v.23 no.4
• /
• pp.39-43
• /
• 2021

This study deals with the ferromagnetic shims design based on the spherical harmonic coefficient reduction method. The design method using the sequential search method is an intuitive method and has the advantage of quickly reaching the optimal result. The study was conducted for a 400 MHz all-REBCO magnet, which had difficulty in shimming due to the problem of SCF (screening current induced field). The initial field homogeneity of the magnet was measured to be 233.76 ppm at 20 mm DSV (Diameter Spherical Volume). In order to improve the field homogeneity of the magnet, the ferromagnetic shim with a thickness of 1 mil to 11 mil was constructed by a design method in which sequential search algorithm was applied. As a result, the field homogeneity of the magnet could be significantly improved to 0.24 ppm at 20 mm DSV and 0.05 ppm at 10 mm DSV.

• Journal of Astronomy and Space Sciences
• /
• v.35 no.4
• /
• pp.287-293
• /
• 2018

This paper presents a satellite relative navigation strategy for formation flying, which chooses an appropriate navigation algorithm according to the operating environment. Not only global positioning system (GPS) measurements, but laser measurements can also be utilized to determine the relative positions of satellites. Laser data is used solely or together with GPS measurements. Numerical simulations were conducted to compare the relative navigation algorithm using only laser data and laser data combined with GPS data. If an accurate direction of laser pointing is estimated, the relative position of satellites can be determined using only laser measurements. If not, the combined algorithm has better performance, and is irrelevant to the precision of the relative angle data between two satellites in spherical coordinates. Within 10 km relative distance between satellites, relative navigation using double difference GPS data makes more precise relative position estimation results. If the simulation results are applied to the relative navigation strategy, the proper algorithm can be chosen, and the relative position of satellites can be estimated precisely in changing mission environments.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.4
• /
• pp.353-360
• /
• 2010

In this paper, an efficient algorithm is established in order to estimate the plastic properties of power-law hardening bulk specimen materials with one simple spherical indentation impression test. This work is based on a new formulation of representative strain and, therefore, compare to the preceding approaches the fitting parameters are significantly reduced. Moreover, the new definition of representative strain endowed more physical meaning to the representative strain. In order to verify the reliability of the reverse analysis, we have studied a broad set of materials whose property ranges cover essentially all engineering metals and alloys. Based on the indentation force-displacement P-${\delta}$ curves obtained from numerical simulations, the characteristics of the indentation response and material elastoplastic properties are bridged via explicit functions. Next, through the procedure of reverse analysis the yield stress and power-law hardening exponent of bulk specimen materials can be determined. Finally, good agreement between the result from reverse analysis and initial input data from experiment can be observed.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.850-853
• /
• 2017

In this paper, we propose an image analysis system based on omnidirectional image and object tracking image display using super wide angle camera. In order to generate spherical images, the projection process of converting from two wide-angle images to the equirectangular panoramic image was performed and the spherical image was expressed by converting rectangular to spherical coordinate system. Object tracking was performed by selecting the desired object initially, and KCF(Kernelized Correlation Filter) algorithm was used so that robust object tracking can be performed even when the object's shape is changed. In the initial dialog, the file and mode are selected, and then the result is displayed in the new dialog. If the object tracking mode is selected, the ROI is set by dragging the desired area in the new window.

• ETRI Journal
• /
• v.27 no.2
• /
• pp.235-238
• /
• 2005

A new mesh reconstruction scheme for approximating a surface from a set of unorganized 3D points is proposed. The proposed method, called a shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. SWBF surmounts the genus-0 spherical topology restriction of previous shrink-wrapping-based mesh generation techniques and can be applied to any type of surface topology. Furthermore, SWBF is significantly faster than a related algorithm of Jeong and others, as SWBF requires only a local nearest-point-search in the shrinking process. Our experiments show that SWBF is very robust and efficient for surface reconstruction from an unorganized point cloud.

• Journal of the Korean Society of Radiology
• /
• v.14 no.6
• /
• pp.725-731
• /
• 2020

A radiation spectroscopy detector using a spherical scintillator was designed, and a system was developed to track the position of a radiation source using several detectors. The position tracking algorithm was designed based on the theory that the number of radiations decreases according to the inverse square law of distance, and the position of the radiation source was calculated by measuring the number of radiations generated from the radiation sources at various positions. The radiation generated from the radiation source is detected by different coefficients in each detector, and the difference between these detected coefficients varies in proportion to the inverse square of the distance. Geant4 Application for Tomographic Emission (GATE) simulation was performed to verify and evaluate the performance of the designed radiation source position tracking system, and radiation generated from radiation sources placed at different positions was counted with each detector. The number of measured radiations was tracked through the radiation source position tracking algorithm, and the error between the actual radiation source position and the position calculated by the algorithm was evaluated. The error between the position of the actual radiation source and the calculated position was measured as an average of 0.11% on the X-axis and 0.37% on the Y-axis, and it was verified that the position can be measured very accurately.