• International journal of advanced smart convergence
• /
• v.11 no.4
• /
• pp.81-87
• /
• 2022

In this paper, we propose a watershed algorithm that applies a high-frequency enhancement filter to emphasize the boundary and a local adaptive threshold to search for minimum points. The previous method causes the problem of over-segmentation, and over- segmentation appears around the boundary of the object, creating an inaccurate boundary of the region. The proposed method applies a high-frequency enhancement filter that emphasizes the high-frequency region while preserving the low-frequency region, and performs a minimum point search to consider local characteristics. When merging regions, a fixed threshold is applied. As a result of the experiment, the proposed method reduced the number of segmented regions by about 58% while preserving the boundaries of the regions compared to when high frequency emphasis filters were not used.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.10
• /
• pp.703-713
• /
• 2004

This paper presents the new obstacle avoidance method that is composed of vision and sonar sensors, also a navigation algorithm is proposed. Sonar sensors provide poor information because the angular resolution of each sonar sensor is not exact. So they are not suitable to detect relative direction of obstacles. In addition, it is not easy to detect the obstacle by vision sensors because of an image disturbance. In This paper, the new obstacle direction measurement method that is composed of sonar sensors for exact distance information and vision sensors for abundance information. The modified splitting/merging algorithm is proposed, and it is robuster for an image disturbance than the edge detecting algorithm, and it is efficient for grouping of the obstacle. In order to verify our proposed algorithm, we compare the proposed algorithm with the edge detecting algorithm via experiments. The direction of obstacle and the relative distance are used for the inputs of the fuzzy controller. We design the angular velocity controllers for obstacle avoidance and for navigation to center in corridor, respectively. In order to verify stability and effectiveness of our proposed method, it is apply to a vision and sonar based mobile robot navigation system.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.159-162
• /
• 2000

Selecting locally optimum thresholds, based on optimizing a criterion composed of the area variation rate and the compactness of the segmented shape, is presented. The method is shown to have the shape-resolving property in the subtraction image, so that overlapped objects may be resolved into bright and dark evidences characterizing each object. As an application a vehicle detection algorithm robust to the operating conditions could be realized by applying simple merging rules to the geometrically correlated bright and dark evidences obtained by this local thresholding.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.151-153
• /
• 2004

점진적 검사점은 페이지 쓰기 보호를 사용하여 검사점에서 변경된 페이지만을 저장한다. 점진적 검사점을 사용하면 검사점 오버헤드가 줄어드는 반면에 프로세스의 메모리 페이지들이 여러 검사점에 걸쳐있기 때문에 오래된 검사점들을 병합하거나 지울 수 없다. 본 논문에서는 점진적 검사점에서 복구와 쓰레기 수집을 위한 효율적인 병합 알고리즘을 제안한다. 제안한 알고리즘으로 점진적 검사점들을 병합하여 복구를 위한 완전 검사점을 만들고 불필요한 검사점들을 지울 수 있다.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.449-452
• /
• 2003

This paper propose a extracting method of the region for image using segmentation and edge information. First propose algorithm extract information using canny edge detector and the image was divided by watershed segmentation. And it extract the mage with edge information by merging region. Finally we compare the proposed method with levelset method. In the result proposed method not only extract the image with accurate region but also reduce operation time.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.191-194
• /
• 2003

The recovery of 3D scene structure from multiple views has been long one of the central problems in computer vision. This paper presents a new projective reconstruction method based on factorization for un-calibrated image sequences. The proposed algorithm provides an effective measure to construct frame groups by using various information between frames. The experimental results show that the proposed method can reconstruct a more precise 3D structure than the precious methods such as the merging method.

• International Journal of CAD/CAM
• /
• v.3 no.1_2
• /
• pp.77-83
• /
• 2003

We propose two algorithms to generate (1) polygonal meshes and (2) developable surface patches far generalized cylinders defined by contours of discrete curves. To solve the contour blending problem of generalized cylinder, the presented algorithms have adopted the algorithm and related properties of LIDM (linear interpolation by direction map) that interpolate geometric shapes based on direction map merging and group scaling operations. Proposed methods are fast to compute and easy to implement.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.5
• /
• pp.20-26
• /
• 1991

본 논문은 병렬 병합 알고리즘 중에서 선형 리스트상에서의 병합 시키기 위한 알고리즘을 제시 하고자 하는데 있어서 다음 두가지에 그 주된 목적이 있다. 1) 병렬 병합 알고리즘을 위한 ADT 를 제시하고 있다. 2) 선형 리스트상에서 병합되어지는 MKLP 알고리즘을 제시코저 한다. 이때 mklp 방 법은 P(1<=P<=N)개의 프로세서를 이용하고 그리고 SIMD-SM(EREW-PRAM) 모델 상에 구현이 되는 병렬 병합 알고리즘을 구현코저 한다.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.11a
• /
• pp.211-215
• /
• 2004

본 연구에서는 2개 이상의 지리 부호화된 영상병합 시 중복 영역의 연결 부분에서 발생하는 방사적 차이를 최소화하여 모자이크 접합선이 최소화하는 알고리즘을 구현하였다. 연구내용을 세부적으로 보면 초기 접합선 및 최적 접합선 탐색을 하는 접합선 추출 알고리즘 구현, 대상 영상의 전체적인 방사 값의 분포 특성을 정규화하는 전역 방사 보정을 위한 알고리즘 구현, 접합선을 자동 탐색하여 탐색된 접합선을 중심으로 단순 중복, 평균화, 블랜딩에 의한 모자이킹 알고리즘 구현이 본 연구의 핵심 내용이다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.267-270
• /
• 2002

본 논문에서는 Support Vector Machines (SVM) 을 이용하여, 빠르고 정확한 두 convex한 클러스터 간의 거리 측정 방법을 제시한다 제시된 방법에서는, SVM에 의해서 생성되는 최적 다차원 평면이 두 클러스터간의 최소 거리를 계산하는데 사용된다. 또한, 본 논문에서는 이러한 두 클러스터 간의 최적의 거리를 사용하여, Fuzzy Convex Clustering (FCC) 방법 (1) 에 의해서 생성되는 Convex 클러스터들을 묶어주는 효과적인 클러스터 결합 알고리즘을 제시하였다. 그러므로, 데이터의 부적절한 표현을 유발하지 않고도 클러스터들의 개수를 좀 더 줄일 수 있었다. 제시한 방법의 타당성을 위하여 여러 실험 결과를 제시하였다