• 대한전자공학회논문지SP
• /
• 제44권4호통권316호
• /
• pp.78-85
• /
• 2007

영역들로 구성된 영상의 국부정규화처리 알고리즘에 내재된 분할 구도를 소개한다. 이동창에서 산출되는 국부통계치에 근거한 정규화적 접근은 선형 또는 비선형함수를 발생시켜 잡음 오염된 영역들의 화소분포와 근접유사 유형을 변형한다. 현재와 정규화된 영상신호 사이의 최근접 화소 이격거리에 대하여 평균과 표준편차를 조정하고 국부통계치와 파리미터 변동을 연계하여 영역간 분할 상태를 변화시킨다. 이러한 특성에 대하여 기존의 정규화 기법들과 본 연구에서 새로 고안한 국부정규화 기법이 비교 고찰된다. 그리고 실험결과는 국부정규화처리 실현에 의한 영역분할 성능을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2302-2316
• /
• 2015

We propose an efficient method of extracting targets within a region of interest in non-homogeneous infrared images by using a principal component analysis (PCA) plane and adaptive Gaussian kernel. Existing approaches for extracting targets have been limited to using only the intensity values of the pixels in a target region. However, it is difficult to extract the target regions effectively because the intensity values of the target region are mixed with the background intensity values. To overcome this problem, we propose a novel PCA based approach consisting of three steps. In the first step, we apply a PCA technique minimizing the total least-square errors of an IR image. In the second step, we generate a binary image that consists of pixels with higher values than the plane, and then calculate the second derivative of the sum of the square errors (SDSSE). In the final step, an iteration is performed until the convergence criteria is met, including the SDSSE, angle and labeling value. Therefore, a Gaussian kernel is weighted in addition to the PCA plane with the non-removed data from the previous step. Experimental results show that the proposed method achieves better segmentation performance than the existing method.

• Journal of Information Processing Systems
• /
• 제17권5호
• /
• pp.905-917
• /
• 2021

In recent years, edge computing technology consists of several Internet of Things (IoT) devices with embedded sensors that have improved significantly for monitoring, detection, and management in an environment where big data is commercialized. The main focus of edge computing is data optimization or task offloading due to data and task-intensive application development. However, existing offloading approaches do not consider correlations and associations between data and tasks involving edge computing. The extent of collaborative offloading segmented without considering the interaction between data and task can lead to data loss and delays when moving from edge to edge. This article proposes a range segmentation of dynamic offloading (RSDO) algorithm that isolates the offload range and collaborative edge node around the edge node function to address the offloading issue.The RSDO algorithm groups highly correlated data and tasks according to the cause of the overload and dynamically distributes offloading ranges according to the state of cooperating nodes. The segmentation improves the overall performance of edge nodes, balances edge computing, and solves data loss and average latency.

• 한국가시화정보학회지
• /
• 제19권1호
• /
• pp.28-35
• /
• 2021

In this study, an image processing method for the measurement of two-phase bubbly flow is developed. Shadowgraphy images obtained by high-speed camera are used for analysis. Some bubbles are generated as single unit and others are overlapped or clustered. Single bubbles can be easily analyzed using parameters such as bubble shape, centroid, and area. But overlapped bubbles are difficult to transform clustered bubbles into segmented bubbles. Several approaches were proposed for the bubble segmentation such as Hough transform, connection point method and watershed. These methods are not enough for bubble segmentation. In order to obtain the size distribution of bubbles, we present a method of splitting overlapping bubbles using watershed and approximating them to ellipse. There is only 5% error difference between manual and automatic analysis. Furthermore, the error can be reduced down to 1.2% when a correction factor is used. The ellipse fitting algorithm developed in this study can be used to measure bubble parameters accurately by reflecting the shape of the bubbles.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권10호
• /
• pp.2718-2731
• /
• 2023

This paper presents a method of using syntax and shallow semantic analysis for Vietnamese question generation (QG). Specifically, our proposed technique concentrates on investigating both the syntactic and shallow semantic structure of each sentence. The main goal of our method is to generate questions from a single sentence. These generated questions are known as factoid questions which require short, fact-based answers. In general, syntax-based analysis is one of the most popular approaches within the QG field, but it requires linguistic expert knowledge as well as a deep understanding of syntax rules in the Vietnamese language. It is thus considered a high-cost and inefficient solution due to the requirement of significant human effort to achieve qualified syntax rules. To deal with this problem, we collected the syntax rules in Vietnamese from a Vietnamese language textbook. Moreover, we also used different natural language processing (NLP) techniques to analyze Vietnamese shallow syntax and semantics for the QG task. These techniques include: sentence segmentation, word segmentation, part of speech, chunking, dependency parsing, and named entity recognition. We used human evaluation to assess the credibility of our model, which means we manually generated questions from the corpus, and then compared them with the generated questions. The empirical evidence demonstrates that our proposed technique has significant performance, in which the generated questions are very similar to those which are created by humans.

• 한국멀티미디어학회논문지
• /
• 제15권9호
• /
• pp.1075-1085
• /
• 2012

영상분할은 의료 임상연구에서 가장 중요한 과정 중의 하나이다. 특히 뇌 MRI영상에서 해마의 위축은 알츠하이머병 진행과정의 초기 특정 표지자로서 해마의 볼륨은 초기 알츠하이머병의 임상적 진단에 도움이 된다. 정확한 볼륨 측정에 있어서 해마 영역의 분할은 중요한 역할을 한다. 하지만 MRI 영상에서 해마영역은 낮은 대조도, 낮은 신호 대 잡음 비율, 불연속성 경계의 특징을 보이며, 이러한 특징들은 MRI 영상에서 해마의 정확한 분할을 어렵게 만든다. 이 문제를 해결하기 위해 전처리 과정으로 실험영상에서 관심영역을 선택한 후 반전영상과 원본영상과의 차영상 대조도를 향상시킨 후 비등방성 확산(Anisotropic diffusion) 필터링, 가우시안(Gaussian) 필터링을 수행하였다. 마지막으로 두 개의 레벨 셋(Level Set)기반의 동적 윤곽선(Active Contour) 모델을 결합하여 해마를 분할하는 방법을 제안하였다. 제안된 해마분할방법의 유효성을 다양한 방법으로 평가한 결과 제안된 해마분할방법은 분할 속도와 정확도 면에서 뚜렷하게 개선이 되었음을 확인하였다. 결론적으로 제안된 방법이 해마와 같은 특징을 가진 영역을 분할하는데 적합하다고 할 수 있다. 향후 다른 연구 기법들과 결합할 경우 더욱 잠재성이 증대될 수 있을 것이다.

• 한국측량학회지
• /
• 제27권1호
• /
• pp.723-733
• /
• 2009

This study proposes a sequence of procedures to extract building boundaries and planar patches through segmentation of rasterized lidar data. Although previous approaches to building extraction have been shown satisfactory, there still exist needs to increase the degree of automation. The methodologies proposed in this study are as follows: Firstly, lidar data are rasterized into grid form in order to exploit its rapid access to neighboring elevations and image operations. Secondly, propagation of errors in raw data is taken into account for in assessing the quality of gradients-driven properties and further in choosing suitable parameters. Thirdly, extraction of planar patches is conducted through a sequence of processes: histogram analysis, least squares fitting, and region merging. Experimental results show that the geometric components of building models could be extracted by the proposed approach in a streamlined way.

• 대한임베디드공학회논문지
• /
• 제16권5호
• /
• pp.215-223
• /
• 2021

3D data can be categorized into two parts : Euclidean data and non-Euclidean data. In general, 3D data exists in the form of non-Euclidean data. Due to irregularities in non-Euclidean data such as mesh and point cloud, early 3D deep learning studies transformed these data into regular forms of Euclidean data to utilize them. This approach, however, cannot use memory efficiently and causes loses of essential information on objects. Thus, various approaches that can directly apply deep learning architecture to non-Euclidean 3D data have emerged. In this survey, we introduce various deep learning methods for mesh and point cloud data. After analyzing the operating principles of these methods designed for irregular data, we compare the performance of existing methods for shape classification and segmentation tasks.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제36권11호
• /
• pp.936-946
• /
• 2009

그래프 컷(graph cuts) 방법은 주어진 사전정보와 각 픽셀간의 유사도를 나타내는 데이터 항(data term)과 이웃하는 픽셀간의 유사도를 나타내는 스무드 항(smoothness term)으로 구성된 에너지 함수를 전역적으로 최소화하는 방법으로, 최근 영상 분할에 많이 이용되고 있다. 기존 그래프 컷 기반의 영상 분할 방법에서 데이터 항을 설정하기 위해 GMM(Gaussian mixture model)을 주로 이용하였으며, 평균과 공분산을 각 클래스를 위한 사전정보로 이용하였다. 이 때문에 클래스의 모양이 초구(hyper-sphere) 또는 초타원(hyper-ellipsoid)일 때만 좋은 성능을 보이는 단점이 있다. 다양한 클래스의 모양에서 좋은 성능을 보이기 위해, 본 논문에서는 mean shift 분석 방법을 이용한 그래프 컷 기반의 자동 영상분할 방법을 제안한다. 데이터 항을 설정하기 위해 $L^*u^*{\upsilon}^*$ 색상공간에서 임의로 선택된 초기 mean으로부터 밀도가 높은 지역인 모드(mode)로 이동하는 mean의 집합들을 사전정보로 이용한다. Mean shift 분석 방법은 군집화에서 좋은 성능을 보이지만, 오랜 수행시간이 소요되는 단점이 있다. 이를 해결하기 위해 특징공간을 3차원 격자로 변형하였으며, mean의 이동은 격자에서 모든 픽셀이 아닌 3차원 윈도우내의 1차원 모멘트(moment)를 이용한다. 실험에서 GMM을 이용한 그래프 컷 기반의 영상분할 방법과 최근 많이 이용되고 있는 mean shift와 normalized cut기반의 영상분할 방법을 제안된 방법과 비교하였으며, Berkeley dataset을 기반으로 앞의 세 가지 방법보다 좋은 성능을 보였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.915-918
• /
• 1998

Region based coding consistsof image segmentation contour and texture coding. Contour coding techniques can be classified into contour or shape-oriented approaches. In this paper, geodesic skeleton based on shape-oriented approach is used for contour coding. Efficient application of geodesic skeleton for contour coding based on the characteristics of regions in segmented image will be discussed.