An Optimal Decomposition Algorithm for Convex Structuring Elements

溫承燁(Syng-Yup Ohn) 대한전기학회 1999 전기학회논문지A Vol.48 No.9

Study on Algorithms for Morphological Operation

Ohn,Syng Yup Research Institute for Science & Technology HONG- 1999 Hongik Journal of Science and Technology Vol.3 No.-

Mathematical morphology provides powerful tools in image and signal processing. The two basic operations of mathematical morphological transformations are dilation and erosion. Due to their regularity and simplicity, morphological operations are often implemented on parallel processing architectures for fast processing of images. In this paper, we survey parallel processing architectures and present the algorithms to compute the morphological operations on the architectures. We also analyse the computational complexity for the algorithms.

화상회의 카메라 제어를 위한 안면 검출 알고리듬

온승엽(Syng-Yup Ohn),박재현(Jae-Hyun Park),박규식(Kyu-Sik Park),이준희(Jun-Hee Lee) 대한전자공학회 2000 대한전자공학회 학술대회 Vol.2000 No.6

study of survey and research directions on 3-D morphological structuring element decomposition

Ohn,Syng-Yup Research Institute for Science & Technology HONG-I 1997 Hongik Journal of Science and Technology Vol.1 No.-

In this paper, we presented the method on the decomposition of 3D convex structuring elements, 3D structuring elements are used in 3D morphological operations are known to have enormous computational complexity. The decomposition of 3D convex structuring elements reduces the computational complexity. The optional decomposition guarantees the minimal amount of computation. Morphological operations can be implemented on various computer architectures and we need an algorithm to find the optimal decomposition for ach computer architecture. Furthermore, we proposed the method on the decomposition if 2D grayscale structuring elements.

Optimal Decomposition of Convex Structuring Elements on a Hexagonal Grid

Ohn, Syng-Yup The Acoustical Society of Korea 1999 韓國音響學會誌 Vol.18 No.e3

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

An Algorithm for Decomposition of Convex Gray Scale Structuring Elements

Ohn,Syng Yup Research Institute for Science & Technology HONG-I 1998 Hongik Journal of Science and Technology Vol.2 No.-

Gray scale Morphology provides powerful tools in image and signal processing areas. Dilation and erosion operations are two basic transformations in gray scale Morphology. The structuring elements which characterize the transformations are often decomposed for effective and efficient implementations. We presents a new algorithm for decomposition of structuring elements with convex-shaped umbra. Our algorithm is general and flexible that it results in optimal decompositions for various computation environments by defining proper cost functions for each environment. The optimal decomposition results 1)make it possible to implement dilation and erosion operations with large structuring elements on pipelined parallel computers and 2)gives the minimal computation time for the operations on many parallel processing architectures.

Genetic Algorithm과 다중부스팅 Classifier를 이용한 암진단 시스템

온승엽,지승도,Ohn, Syng-Yup,Chi, Seung-Do 한국시뮬레이션학회 2011 한국시뮬레이션학회 논문지 Vol.20 No.2

생물 및 의학계에서는 생물정보학(bioinformatics)의 데이터 중 혈청 단백질(proteome)에서 추출한 데이터가 질병의 진단에 관련된 정보를 가지고 있고, 이 데이터를 분류 분석함으로 질병을 조기에 진단 할 수 있다고 믿고 있다. 본 논문에서는 혈청 단백질(2-D PAGE: Two-dimensional polyacrylamide gel electrophoresis)로부터 암과 정상을 판별하는 새로운 복합분류기를 제안한다. 새로운 복합 분류기에서는 support vector machine(SVM)와 다층 퍼셉트론(multi-layer perceptron: MLP)와 k-최근 접 이웃(k-nearest neighbor: k-NN)분류기를 앙상블(ensemble) 방법으로 통합하는 동시에 다중 부스팅(boosting) 방법으로 각 분류기를 확장하여 부분류기(subclassifier)의 배열(array)으로서 복합분류기를 구성하였다. 각 부분류기에서는 최적 특성 집합 (feature set)을 탐색하기 위하여 유전 알고리즘(genetic algorithm: GA)를 적용하였다. 복합분류기의 성능을 측정하기 위하여 암연구에서 얻어진 임상 데이터를 복합분류기에 적용하였고 결과로서 단일 분류기 보다 높은 분류 정확도와 안정성을 보여 주었다. It is believed that the anomalies or diseases of human organs are identified by the analysis of the patterns. This paper proposes a new classification technique for the identification of cancer disease using the proteome patterns obtained from two-dimensional polyacrylamide gel electrophoresis(2-D PAGE). In the new classification method, three different classification methods such as support vector machine(SVM), multi-layer perceptron(MLP) and k-nearest neighbor(k-NN) are extended by multi-boosting method in an array of subclassifiers and the results of each subclassifier are merged by ensemble method. Genetic algorithm was applied to obtain optimal feature set in each subclassifier. We applied our method to empirical data set from cancer research and the method showed the better accuracy and more stable performance than single classifier.

단백체 스펙트럼 데이터의 분류를 위한 랜덤 포리스트 기반 특성 선택 알고리즘

온승엽,지승도,한미영,Ohn, Syng-Yup,Chi, Seung-Do,Han, Mi-Young 한국시뮬레이션학회 2013 한국시뮬레이션학회 논문지 Vol.22 No.4

본 논문에서는 질량 분석 방법에 의하여 산출된 단백체 데이터(mass spectrometric proteomic data)의 분류 분석(classification analysis)을 위한 새로운 특성 선택(feature selection) 방법을 제안한다. 이 방법은 i)높은 상관관계를 가지는 중복된 특성을 효과적으로 제거하는 전처리 단계와 ii)토너먼트(tournament) 전략을 사용하여 최적 특성 부분집합(optimal feature subset)을 탐색해 내는 단계로 구성되어 있다. 제안되는 방법을 실제 암진단에 사용되는 공개된 혈액 단백체 데이터에 적용하였으며 널리 사용되는 타 방법과 비교할 때 우수한 성능과 균형된 특이도와 민감도를 달성함을 실증하였다. This paper proposes a novel method for feature selection for mass spectrometric proteomic data based on Random Forest. The method includes an effective preprocessing step to filter a large amount of redundant features with high correlation and applies a tournament strategy to get an optimal feature subset. Experiments on three public datasets, Ovarian 4-3-02, Ovarian 7-8-02 and Prostate shows that the new method achieves high performance comparing with widely used methods and balanced rate of specificity and sensitivity.

이미지 처리기법 및 레이저 센서를 이용한 휴대용 콘크리트 균열 측정 장치 개발에 관한 연구

서승환(Seunghwan Seo),온승엽(Syng-Yup Ohn),김동현(Dong-Hyun Kim),곽기석(Kiseok Kwak),정문경(Moonkyung Chung) 한국지반신소재학회 2020 한국지반신소재학회 논문집 Vol.19 No.4

콘크리트 구조물의 균열은 장기간 지속 시 철근의 부식을 촉진시키므로 구조적 사용성을 보장하고 열화를 방지하기 위해 정기적인 현장 점검이 필수적이다. 대부분의 시설물 안전점검은 육안 검사에 의존하고 있어 비용과 시간 소모가 심하고 점검자에 따라 결과의 신뢰도 차이가 발생한다. 본 연구에서는 카메라로 촬영된 균열의 이미지 분석을 통해 콘크리트 균열의 폭과 길이를 측정하는 장치로서 안전진단 및 유지관리에 사용할 수 있는 휴대용 측정 장치를 개발하였다. 이 장치는 측정자가 육안으로 발견한 균열을 가까운 거리 (3m) 이내에서 촬영하고 레이저 거리측정으로 단위 픽셀크기를 정확히 산정하여, 본 연구에서 개발한 이미지 처리 알고리즘으로 균열 길이와 폭을 자동으로 산정할 수 있다. 측정결과 실험에 적용한 균열 이미지를 이용하여 3m 거리 이내에서 0.3mm 균열의 길이 측정은 약 10% 오차 범위에서 측정 가능하였다. 균열 폭의 경우 이진화 과정에서 진동 및 Blurring에 의한 주변픽셀을 검출해 과대평가되는 경향을 나타내었으나, 균열 폭 감소함수를 적용하여 효과적으로 보정할 수 있었다. Since cracks in concrete structures expedite corrosion of reinforced concrete over a long period of time, regular on-site inspections are essential to ensure structural usability and prevent degradation. Most of the safety inspections of facilities rely on visual inspection with naked eye, so cost and time consuming are severe, and the reliability of results differs depending on the inspector. In this study, a portable measuring device that can be used for safety diagnosis and maintenance was developed as a device that measures the width and length of concrete cracks through image analysis of cracks photographed with a camera. This device captures the cracks found within a close distance (3 m), and accurately calculates the unit pixel size by laser distance measurement, and automatically calculates the crack length and width with the image processing algorithm developed in this study. In measurement results using the crack image applied to the experiment, the measurement of the length of a 0.3 mm crack within a distance of 3 m was possible with a range of about 10% error. The crack width showed a tendency to be overestimated by detecting surrounding pixels due to vibration and blurring effect during the binarization process, but it could be effectively corrected by applying the crack width reduction function.

얼굴 기하에 기반한 얼굴 검출 알고리듬

류세진(Se-Jin Ryu),온승엽(Syng yup Ohn) 대한전자공학회 2002 대한전자공학회 학술대회 Vol.2002 No.6