• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.194-199
• /
• 2009

This paper proposes a face detection algorithm that uses geometrical information on face and hair region. This information that face adjoins hair regions can be the important one for face detection. It is also kept in images with frontal, rotated and lateral face. The face candidates are founded by the analysis of skin regions after detecting the skin and hair color regions in an image. Next, the intersected lesions between face candidates and hair's are created. Finally, the face candidates that include the subsets of these regions turn out to be face. Experimental results showed the high detection rates for frontal and lateral faces as well as faces geometrically distorted.

• Communications of Mathematical Education
• /
• v.37 no.2
• /
• pp.199-212
• /
• 2023

The purpose of this study is to find out whether there is a difference in achievement between blocked practice and interleaved practice according to the difference in domain and type of learning content in mathematics subject, and through this result, it is to confirm whether the effect of interleaved practice in mathematics learning is due to the 'Discriminative-contrast Hypothesis' or the 'Distributed-practice Hypothesis'. Although interleaved practice is more effective than blocked practice, previous studies have not shown consistent results regarding the cause. Therefore, in this study, 103 first-year middle school students were randomly assigned to blocked practice, interleaved practice, remote blocked practice, and remote interleaved practice groups had learning activities over 4 times. The results reveals that the effect of interleaved practice appeared in similar types in the same domain, but the effect of interleaved practice did not appear in different types in different domain. In addition, through this result, it was confirmed that the effect of interleaved practice was due to the 'Discriminative-contrast hypothesis' rather than the 'Distributed-practice hypothesis'. Further research topics were suggested after the issues on the research method and the findings were discussed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.269-272
• /
• 2009

본 논문에서는 변이지도의 정확도 향상을 위하여, 비용 함수를 이용한 교차 일치성 검사 기법을 제안하고, 다양한 조건의 실험을 통하여 제안한 알고리듬이 효율적임을 보였다. 좌우 변이정보를 이용하는 교차 일치성 검사로 오정합을 검출하는 방법을 시도해왔다. 하지만 이러한 방법은 물체의 경계에서 발생하는 오정합을 찾기가 어렵다. 본 논문에서는 최종 변이의 신뢰도 향상을 위해 교차 일치성 검사의 정확도를 높이는 방법을 제안하였다. 일반적으로 영역 기반 스테레오정합 방법은 물체의 경계에서 정확도 높지 못하다. 이러한 문제점을 해결하기 위해 정합창의 크기를 늘리거나 특징 점을 이용한 적응적 가변 정합창을 적용하는 방법을 시도하였다. 하지만, 여전히 기존 교차 일치성 검사를 통한 오정합 검출은 부정확하다. 이러한 영역의 비용 함수 값들을 비교한 결과 첫 번째와 두 번째 값의 차이가 적거나 크게 나타난다. 제안한 방법은 기존 방법에 비해 오정합 검출 능력을 향상 시킨다. 제안한 방법의 결과를 확인하기 위해 스테레오 비전에서 많이 사용되는 영상을 적용하고 분석하였다. 또한, 기존 교차 일치성 검사 방법과 제안한 방법의 객관적으로 비교하기 위해 전체 영역에 대한 오차율 (error ratio)과 교차 일치성 검사로 유효하다고 판단된 변이 값 중 실제 변이 값과 일치하지 않은 변이값의 오차율을 비교하였다. 실험 결과 기존 방법에 비해 제안한 방법이 1~5%정도 낮은 오차율을 보였다

• Journal of Korea Spatial Information System Society
• /
• v.1 no.2 s.2
• /
• pp.137-149
• /
• 1999

Spatial database systems in client-server environment have network overload due to the large amount of spatial data transmission. Users use the window query that loads partial region of a whole map for quick response time in the environment. A series of window query such as screen movement, enlargement or shrinkage requires data in similar region and this increases network overload by re-transmitting the same data in intersected region with the earlier transmitted region. Removing the transmitted data from query results can solve this problem. In this paper, we design and implement a spatial object manager in order to remove the intersected region occurred by a series of window query. The spatial object manager manages the object identifiers of transmitted objects and removes transmitted objects from spatial objects of the query result by using the removal technique of the intersected region for the transmission and comparison. We utilize GEOMania Millennium server, an open client-server spatial database system, as spatial object manager in this paper. The result of the performance evaluation shows that the spatial object manager removes the transmission of the data redundancy, reduces network overload and improves the overall system performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.233-237
• /
• 1992

본 연구에서는 offset곡면의 Intersection check 알고리즘중 최근에 발표된 Barnhill의 알고리즘을 곡면간의 교차곡선 계산에 이용하고, 교차가능 영역의 판정은, Bezier 특성다각형의 성징을 이용해 계산속도를 높였다. 여기서 얻어지는 교차곡선 사이의 간섭영역 제거로 간섭없는 공구경로를 산출해 내므로서 가공 data의 저장에 필요한 memory의 크기도 줄일 수 있었으며, 공구경로의 선정에도 유연성을 가질 수 있다.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.369-378
• /
• 2005

Document image is segmented and classified into text, picture, or table by a document layout analysis, and the words in table regions are significant for keyword spotting because they are more meaningful than the words in other regions. This paper proposes a method to extract words from table regions in document images. As word extraction from table regions is practically regarded extracting words from cell regions composing the table, it is necessary to extract the cell correctly. In the cell extraction module, table frame is extracted first by analyzing connected components, and then the intersection points are extracted from the table frame. We modify the false intersections using the correlation between the neighboring intersections, and extract the cells using the information of intersections. Text regions in the individual cells are located by using the connected components information that was obtained during the cell extraction module, and they are segmented into text lines by using projection profiles. Finally we divide the segmented lines into words using gap clustering and special symbol detection. The experiment performed on In table images that are extracted from Korean documents, and shows $99.16\%$ accuracy of word extraction.

• Proceedings of the Korean Society for the Gifted Conference
• /
• 2004.11a
• /
• pp.19-34
• /
• 2004

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1344-1352
• /
• 1999

본 논문에서는 두 단순 다각형의 교차 영역을 구하는 문제를 재구성메쉬(RMESH) 상에서 상수 시간에 해결하는 두 개의 알고리즘을 제시한다. 먼저, 두 다각형이 모두 볼록 다각형일 때, N$\times$N RMESH에서 상수 시간에 교차 영역을 구하는 알고리즘을 제시한다, 여기서 N은 두 다각형의 정점의 개수의 합이다. 그리고, 두 일반적인 단순 다각형의 교차 영역을 구하는 문제에 대해서 (N+T)$\times$(N+T)2 RMESH에서 수행되는 상수 시간 알고리즘을 제시한다, 여기서 T는 최악의 경우 두 다각형의 경계선 상의 교차점의 개수로서 두 다각형의 정점의 개수가 각각 n과 m일 때 n.m에 해당한다. 두 다각형 중 하나가 볼록 다각형인 경우는 T = 2.max{n, m}이다. 이 알고리즘은 두 다각형의 모든 교차 영역 조각들을 구한 후 RMESH의 0번째 열에 차례로 배치해 준다. Abstract In this paper, we consider two constant time algorithms for polygon intersection problems on a reconfigurable mesh(in short, RMESH). First, we present a constant time algorithm for computing the intersection of two convex polygons on an N$\times$N RMESH, where N is the total number of vertices in both polygons. Second, we present a constant time algorithm for computing the intersection of two simple polygons on an (N+T)$\times$(N+T)2 RMESH, where T is the worstcase number of intersection points between the boundaries of them. T = n m, where n and m are the numbers of vertices of two polygons respectively. If either of them is convex, then T = 2 max{n,m}. The algorithm computes the intersection of them, and then arranges each intersection component onto the 0-th column of the mesh.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.296-301
• /
• 2020

Three types of traffic signal systems are two-color signal systems that flash red and green and are mainly used on crosswalks, next, three-color equalization systems mainly used at T-shaped intersections with red and yellow lights and a green arrow, and third, four-color intersections that generally have red, yellow and green colored lights and a green arrow. In what is known as the "dilemma zone" area, a driver collects information that influences his/her decision whether to stop, speed, tail, interrupt, or violate a traffic light, depending on the intersection width, vehicle speed, cognitive response time and reference yellow signal time. This study examined the impact of changes in the length of the dilemma zone areas based on changes in yellow signal times, the speed of the intersection passages, and signal lamps. Downward adjustments of 50km/h and 60km/h affected yellow signal time. The yellow signal time increased by 0.1 to 2.3[s] due to this effect and the dilemma zone area increased by 1.22 to 26[m]. The driver of the dilemma zone could quickly decide to reduce the time remaining of the straight (3color, 4color) green signal to reduce the potential of a traffic accident at the intersection traffic. Safe entry of red (LED palm) and left-turn signals for entering flashed at the intersection and operated at midnight.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2831-2838
• /
• 2014

This paper proposes the off-line handwritten flowchart symbol recognition algorithm by type and strength of a cross region of the straight line strokes that is extracted based the normalized dominant slope vectors. In the proposed algorithm, first of all, a connector symbol which consisted only curves is recognized by the special features, and the other symbols with straight line strokes are recognized by type and strength of a cross region, and that is extracted by extension of minimum bounding rectangle of the clusters of the normalized dominant slope vectors, and the straight line strokes of the symbols is extracted by the normalized dominant slope vectors. To confirm the validity of the proposed algorithm, the experiments are conducted for 10 different kinds of flowchart symbols that mainly used for computer program, and the number of symbols is 198. Experiment results were obtained the recognition rate of 99.5%, and the flowchart symbols is recognized correctly robust to variations, and then the proposed algorithm were found very effective for off-line handwritten flowchart symbol recognition.