• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.15-19
• /
• 2001

A dedicated reverse engineering(RE) system for rapid manufacturing of human head in a 3D bust has been developed. The first step in the process is to capture the surface details of a human head and shoulder by three scanners based upon the digital moire fringe technique. Then the multiple scans captured from different angles are aligned and merged into a single polygonal mesh, and the aligned data set is refined by smoothing, subdividing or hole filling process. Finally, the refined data set is sent to a 4-axis computer numerically control(NC) machine to manufacture a replica. In this paper, we mainly describe on the algorithms and software for aligning multiple data sets. The method is based on the recently popular Iterative Closest Point(ICP) algorithm that aligns different polygonal meshes into one common coordinate system. The ICP algorithm finds the nearest positions on one scan to a collection of points on the other scan by minimizing the collective distance between different scans. We also integrate some heuristics into the ICP to enhance the aligning process. A typical example is presented to validate the system and further research work is also discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.429-431
• /
• 1998

본 논문에서는 의료 영상 중에서 성대 운동의 불규칙적인 움직임을 판단하여 자동으로 진단 파라미터를 구하는 비디오스트로보키모그래피(Videostrobokymography) 시스템에서 관심 영역을 추출하는 방법을 소개하고자 한다. CCD카메라에 의해 촬영된 영상은 비디오 테이프에 저장된 후 이미지 캡쳐 보드에서 그레이 이미지(gray-level)로 변환되어 저장된다. 입력된 영상은 움직이는 영상을 촬영한 것이므로 관심 영역의 위치가 각 프레임마다 다르다. 또한 실제로 입력된 성대영상들이 점진적인 농도 변화를 보이기 때문에 에지에 의해 영역을 추출하는 일반적인 영역 추출방법은 사용하기 어렵다. 본 논문에서는 두 번의 단계를 통하여 관심 영역을 추출하고 있다. 첫 번째는 입력된 영상에서 노이즈를 제거한 후 각 프레임에서 영상의 최소 에너지를 구한다. 두 번째로 농도 변화 값을 특징 값으로 이용하는 분할-합병 알고리즘(Split-merge Algorithm)을 적용하여 관심 영역을 추출하였다. 제안한 알고리즘을 19명의 성대 영상에 적용하여 분석한 결과 성대의 관심 영역을 추출할 수 있었다. 그리고, 영상의 에너지 값을 이용하는 스네이크 알고리즘(Snake Algorithm)에 적용하여 비교해본 결과 본 연구에서 제안하는 스네이크 알고리즘보다 좋은 성능을 보임을 확인할 수 있었다. 본 연구에서 제안하는 관심 영역 추출 방법은 동적인 변화를 보이는 영상에서 관심 영역을 추출할 수 있을 뿐 아니라 계산 량이 적어 200x280크기의 이미지를 초당 약 40프레임에 대한 관심 영역을 추출할 수 있는 장점이 있다.

• Journal of Information Processing Systems
• /
• v.18 no.3
• /
• pp.374-388
• /
• 2022

Database systems usually have many parameters that must be configured by database administrators and users. RocksDB achieves fast data writing performance using a log-structured merged tree. This database has many parameters associated with write and space amplifications. Write amplification degrades the database performance, and space amplification leads to an increased storage space owing to the storage of unwanted data. Previously, it was proven that significant performance improvements can be achieved by tuning the database parameters. However, tuning the multiple parameters of a database is a laborious task owing to the large number of potential configuration combinations. To address this problem, we selected the important parameters that affect the performance of RocksDB using random forest. We then analyzed the effects of the selected parameters on write and space amplifications using analysis of variance. We used a genetic algorithm to obtain optimized values of the major parameters. The experimental results indicate an insignificant reduction (-5.64%) in the execution time when using these optimized values; however, write amplification, space amplification, and data processing rates improved considerably by 20.65%, 54.50%, and 89.68%, respectively, as compared to the performance when using the default settings.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.655-657
• /
• 1998

합병 문제는 정렬된 두 개의 리스트 A=(a1, a2,....,al)와 B=(b1, b2,....,bm)가 주어질 때, 이두 리스트를 합병하여 하나의 정렬된 리스트 C=(c1, c2,....,cn),n=l+m,로 만드는 문제이다. 지금까지는 {{{{ SQRT {n} }}}}$\times${{{{ SQRT {n} }}}} 메쉬 상에서 odd-even 합병을 재귀적으로 수행하는 O({{{{ SQRT {n} }}}})시간 합병 알고리즘이 주로 사용되었는데, 이 재귀적 합병 알고리즘은 그 기본정책은 간단하나, 메쉬 상에 구현 될때 라우팅과 같은 복잡한 연산이 필요하게 된다. 따라서 본 논문에서는 간단한 행, 열 연산 만을 사용하여 메쉬 상에서 쉽게 구현가능한 O({{{{ SQRT {n} }}}})시 간의 최적 분할 합병 알고리즘을 제안한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.357-362
• /
• 2004

In the case that we do not have enough number of training patterns because of limitation such as time consuming, economic problem, and so on, we geneterate a new patterns using the brain-style information processing algorithm, that is, supervised and unsupervised learning methods. The proposed method is verified through the simulation of handwritten digits.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.75-82
• /
• 2002

Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper Propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with χ2 histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1003-1004
• /
• 2008

In this paper, we propose a 3D modeling method using Laser Slit Beam and Stereo Camera. We can get depth information of image by analyzing projected Laser Slit Beam on object. 3D modeling is demanded exquisite merge of 3D data. In our approach, we can get the depth image where the reliability is high. Each reconstructed 3D modeling is combined by the sink information which is acquired by SIFT (Scale Invariant Feature Transform) Algorithm. We perform experiments using indoor images. The results show that the proposed method works well in indoor environments

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.558-566
• /
• 2005

We propose a feature-based multi-resolution representation of B-rep solid models using history-based Boolean operations based on the merge-and-select algorithm. Because union and subtraction are commutative in the history-based Boolean operations, the integrity of the models at various levels of detail (LOD) is guaranteed for the reordered features regardless of whether the features are subtractive or additive. The multi-resolution solid representation proposed in this paper includes a non-manifold topological merged-set model of all feature primitives as well as a feature-modeling tree reordered consistently with a given LOD criterion. As a result, a B-rep solid model for a given LOD can be provided quickly, because the boundary of the model is evaluated without any geometric calculation and extracted from the merged set by selecting the entities contributing to the LOD model shape.

• International Journal of CAD/CAM
• /
• v.12 no.1
• /
• pp.29-37
• /
• 2012

A new algorithm has been developed to construct surface from the contours having branches and the final smooth surface is obtained by the reversible Catmull-Clark subdivision. In branching, a particular layer has more than one contour that correspond with at least one contour at the adjacent layer. In the next step, three-dimensional composite curve is constructed from contours of a layer having correspondence with at least one contour at the adjacent layer by inserting points between them and joining the contours. The points are inserted in such a way that the geometric center of the contours should merge at the center of the contours at the adjacent layer. This process is repeated for all layers having branching problems. Polyhedra are constructed in the next step with the help of composite curves and the contours at adjacent layer. The required smooth surface is obtained in the proposed work by providing the level of smoothness.