• Annual Conference of KIPS
• /
• 2006.11a
• /
• pp.85-88
• /
• 2006

본 논문에서는 강의 영상에 포함되어 있는 텍스트 정보를 바탕으로 학습에 의미 있는 영역을 추출한다. 실시간으로 입력되는 컬러 영상에서 Canny 연산자를 이용하여 에지 정보를 구하고, 모폴로지 연산(Morphological Operation)과 연결 성분(Connected Component)을 통해 후보 영역을 검색한다. 그리고 검색된 후보 영역내의 색 정보 분석을 통해서 의미 있는 학습 영역을 추출하였다. 본 논문에서 제안한 학습에 의미 있는 영역을 추출한 결과, 비교적 단순한 강의 영상과 복잡한 강의 영상 모두에서 정확한 학습 영역의 추출이 가능함을 알 수 있고, 학습에 의미 있는 정보만을 구성함으로써 적은 용량으로 최적화된 강의 영상을 제공할 수 있음을 확인할 수 있다.

• Korean Journal of Cognitive Science
• /
• v.29 no.3
• /
• pp.161-192
• /
• 2018

Retrieving temporal information of encoded events is one of the core control processes in episodic memory. Despite much prior neuroimaging research on episodic retrieval, little is known about how large-scale connectivity patterns are involved in the retrieval of sequentially organized episodes. Task-related functional connectivity multivariate pattern analysis was used to distinguish the different sequential retrieval. In this study, participants performed temporal episodic memory tasks in which they were required to retrieve the encoded items in either the forward or backward direction. While separately parsed local networks did not yield substantial efficiency in classification performance, the large-scale patterns of interactivity across the cortical and sub-cortical brain regions implicated in both the cognitive control of memory and goal-directed cognitive processes encompassing lateral and medial prefrontal regions, inferior parietal lobules, middle temporal gyrus, and caudate yielded high discriminative power in classification of temporal retrieval processes. These findings demonstrate that mnemonic control processes across cortical and subcortical regions are recruited to re-experience temporally-linked series of memoranda in episodic memory and are mirrored in the qualitatively distinct global network patterns of functional connectivity.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.596-605
• /
• 1997

The synamic systrm emplohing the self-squared function, , $f(Z)=z^2+c$, provides the Mandelbrot set which classifies constants c using the divergence of the sequence starting from the origin.To speed-up the generation of Mandelbrot set images, two approaches , called as the divide-and-conquer technique and the triangular boundary tracing technique, have been developed.However , the divede-and-conquer technique genrates sequences of some pixels that so not affect graphical representations of the Mandelbrot set.The triangular boundary tracing tech-mique does noot represent some 8-connected components of the Mandelbrost set.In this paper, we prorose a new ;method which solves the 8-connectivity problem of triangular boundary tracing technique.This algorithm considers the divergence for only pixels which are essential to the graphical repressentation of the Mandelbrot set.It also foves good representations for 8-connected components like hairly structures.

• Journal of KIISE:Software and Applications
• /
• v.26 no.2
• /
• pp.273-283
• /
• 1999

래스터 지도에서 직선 또는 곡선과 중첩되어 있는 경우의 문자는 추출하기가 쉽지 않다. 따라서 본 논문에서는 고립되어 있는 문자뿐만 아니라 문자이외의 요소와 중첩되어 있는 문자도 효과적으로 추출할수 있는 분할 정복(divide and conquer) 개념에 기반한 문자 추출방법을 제시한다. 이를 위해 먼저 이미지의 연결 요소로부터 볼록다각형(convex hull)을 생성한다. 그리고 이 다각형이 충분한게 문자영역만을 포함할때가지 볼록 다각형을 이등분하면서 가장 긴 선분(투사 선분)을 기준으로 두 영역으로 분할한다. 다음으로 문자를 추출하기 위해서 이 선분을 기준으로 연결 요소상의 픽셀의 밀집도를 계산하는 알고리즘(프로파일링)을 적용한다. 또한 지도상에서 추출된 개별적인 문자들을 의미있는 단어들로 묶기(grouping)한 새로운 알고리즘을 소개한다. 특히 지도상에 나타나는 문자의 종류는 매우 다양하고 또한 이 문자들이 놓여있는 방향 역시 일정하지 않기 때문에 이러한 단어를 찾는 kd법은 쉽지 않다. 이를 위해 본 논문에서는 3차원 인접 그래프(3-D neighborhood graph)G를 소개한다. 이 그래프 G에서 각 노드는 하나의 분리된 문자를 나타내며 자신의 크기와 위치에 따라서 3차원 공간상에서 위치하게된다. 따라서, 크기가 큰 (작은)문자들은 보다 큰 (작은) z값을 가지고 되며 이 그래프 G에서 서로 인접한 노드들을 연결함으로써 지도상에 존재하는 서로 다른 종류의 문자 스트링을 추출할수 있다. 실험결과는 서로 다른 지도 이미지에 대해서 약 95% 이상의 단어 추출율을 보여준다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.497-498
• /
• 2017

기존의 영상 복원 방법에서는 영상에 퍼지 스트레칭 기법을 이용하여 명암 대비를 강조하였다. 강조된 영상에서 Max-Min 연산을 위해서 칼라 채널의 최대값을 이용하여 각 픽셀 값을 정규화 하였다. 정규화 된 픽셀 값에 Min 연산을 적용하여 연결 가중치를 계산하여 훼손된 영상의 복원에 적용하였다. 그러나 일부 손실된 영상에서 손실된 부분을 탐색하기 위해 $10{\times}10$을 가진 마스크를 이용하여 훼손된 영역을 탐색한 후, 탐색된 훼손된 영역에 연결 가중치를 적용하여 임계값보다 적은 경우에는 임계값으로 설정하여 손실된 부분을 복원하였으나 원 영상과의 차이가 나는 경우가 자주 발생하여 복원의 정확성이 낮아지는 문제점이 있다. 따라서 본 논문에서는 영상의 복원의 정확성을 높이기 위하여 그레이 영상뿐만 아니라 칼라 영상에서도 복원의 정확성을 높일 수 있는 방법을 제안한다. 제안된 방법을 다양한 칼라 영상을 대상으로 실험한 결과, 제안된 방법이 기존의 방법보다 복원의 정확성이 높아진 것을 확인할 수 있었다.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.409-416
• /
• 2006

In this paper, we propose an algorithm for extracting text regions from spam-mail images using color layer. The CLTE(color layer-based text extraction) divides the input image into eight planes as color layers. It extracts connected components on the eight images, and then classifies them into text regions and non-text regions based on the component sizes. We also propose an algorithm for recovering damaged text strokes from the extracted text image. In the binary image, there are two types of damaged strokes: (1) middle strokes such as 'ㅣ' or 'ㅡ' are deleted, and (2) the first and/or last strokes such as 'ㅇ' or 'ㅁ' are filled with black pixels. An experiment with 200 spam-mail images shows that the proposed approach is more accurate than conventional methods by over 10%.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.2
• /
• pp.12-21
• /
• 2013

This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.

• Journal of Korea Water Resources Association
• /
• v.39 no.2 s.163
• /
• pp.89-98
• /
• 2006

To evaluate the pipe failure impact, current methodologies consider only a broken pipe as the impacted area. However, these approaches are accurate if the broken pipe is the only area isolated from tile system. Depending on the number and locations of on-off valves, more pipes which are adjacent to a broken pipe may be isolated. Using the concept of Segment suggested by Walski, the methodology evaluating the pipe failure impact incorporated with on-off valve locations has been suggested by Jun. However, a segment cannot account for all possible pipe failure impacted areas since it does not consider additional failures, namely the network topological failure and the hydraulic pressure failure. For this reason, a methodology which can consider the network topology and hydraulic pressure limitation as well as on-off valve locations is suggested. The suggested methodology is applied to a real network to verify its applicability As results, it is found that a single pipe failure can affect huge areas depending on the configuration of on-off valves and the network topology. Thus, the applicability of the suggested methodology for evaluating the pipe failure impacts on a water distribution network is proved.

• Science of Emotion and Sensibility
• /
• v.13 no.1
• /
• pp.121-128
• /
• 2010

This study is to analyze change of connectivity between brain positions caused by relaxation through EEG coherence. EEG spectrum analysis method has been used to analyze brain activity when relaxation was experienced. However, the spectrum analysis method has a limit that could not observe interactive reaction between brain-functional positions. Therefore, coherence between positions was analyzed to observe connectivity between the measurement positions in this study. Through the method, the reaction of the central nervous system caused by the emotion change was observed. Twenty-four undergraduates of both genders(12 males and 12 females) were asked to close their eyes and listen to the sound. During experiment, EEG was measured at eight positions. The eight positions were F3, F4, T3, T4, P3, P4, O1, and O2 in accordance with International 10-20 system. The sounds with white noise and without were used for relaxation experience. Subjective emotion was measured to verify whether or not they felt relaxation. Subjective emotion of participants were analyzed by ANOVA method(Analysis of Variance). In the result, it was proved that relaxation was subjectively evoked when participants heard sound. Accordingly, it was proved that relaxation could be enhanced by the mixed white noise. EEG coherence between the measurement positions was analyzed. T-test was performed to find its significant difference between relaxation and not-relaxation. In the results of EEG coherence, connectivity with occipital lobes has been increased with relaxation, and connectivity with parietal lobes has been increased with non-relaxed state. Therefore, brain connectivity has shown different pattern between relaxed emotion and non-relaxed emotion.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.47-52
• /
• 2007

Conventional pixel based region segmentation methods have problems of long processing time and incorrect region split on account of performing region split through comparison of neighboring pixels. In this paper, we propose the method which segments a large size of satellite image effectively using modified centroid linkage method. This method is a sort of region split and merge. The proposed method merges pixels and makes them as a new region through only two directional comparing the current positioning pixel with neighbor ones, if they are satisfied with given conditions. Therefore, this method has less comparing time than the cases of previous ones. The experimental result shows that the proposed method is very efficient because of having less processing time and more exact segmented regions than the previous ones.