• Title/Summary/Keyword: 도형 분할

Search Result 74, Processing Time 0.024 seconds

전환기 사양관리 - 영양적 관점(상)

  • 이도형
    • 월간낙농육우
    • /
    • v.23 no.3 s.251
    • /
    • pp.180-183
    • /
    • 2003
  • 전화기 사양관리시 전환기를 일컫는 기간은 여러 연구자들에 따라 약간의 기간적 차이가 있지만 여기서는 건유기간 $60\~70$일 중 건유후기(분만 전 3주)와 분만 및 분만직후 기간(분만 후 3주간)을 포함한다. 전화기 사양관리는 다음 산차의 유생산에 중요한 요인으로 작용할 뿐만 아니라 젖소의 건강과 번식성적 개선 측면에서도 중요한 요인으로 작용한다.

  • PDF

A new segmentation method for non-manhattan layout document images using connected component (연결요소 특징을 이용한 복잡한 문서영상의 구조 분석)

  • 이상협;이경무
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1997.11a
    • /
    • pp.71-74
    • /
    • 1997
  • 본 논문은 일반적으로 제약 없는 형식 문서 즉, 논-맨하탄(non-manhattan) 형식의 이진문서영상을 분석하는 기법으로서, 연결요소기법에 기반한 특징추출과 이를 이용한 영역분리 및 분류에 관한 새로운 방법을 제안한다. 제안한 방식은 바텀-업(bottom-up)방식으로서 먼저 처리속도의 고속화와 축소시 특징 영역보존을 위해 임계치 축소기법을 사용하고, 축소된 이진 문서영상내의 각 연결된 검은 화소의 집합을 개체화하고 개체의 특성에 따라 텍스트, 신성분, 해프톤, 도형 그리고 표 등으로 분류한다. 영역분류는 두단계로 이루어지는데, 1차분류에서는 우선, B/W 비, 면적, 외각 테두리의 높이와 너비 비, 테두리선유무 등의 특징을 이용하여 해프톤, 수평 수직선, 테두리(표 및 도형)영역을 분리한다. 이후 2차 분류에서는 문자성분의 수평결합을 통한 텍스트행 성분을 추출한다. 마지막 후처리 과정으로 표분석 알고리듬을 통하여 테두리 영역중 표와 도형을 정확히 구분하고, 또한 도형에 관련한 문서성분을 해당 도형 개체에 연결하는 작업을 수행함으로써 완벽한 영역분류를 한다. 다양한 문서영상을 이용한 시뮬레이션을 통해 제안한 알고리듬의 성능을 입증한다.

  • PDF

The Construction of Children's Partitioning Strategy on the Equal Sharing Situation (균등분배 상황에서 아이들의 분할전략의 구성)

  • Kim, Ah-Young
    • School Mathematics
    • /
    • v.14 no.1
    • /
    • pp.29-43
    • /
    • 2012
  • This paper investigated the conceptual schemes in which four children constructed a strategy representing the situation as a figure and partitioning it related to the work which they quantify the result of partitioning to various types of fractions when an equal sharing situation was given to them in contextual or an abstract symbolic form of division. Also, the paper researched how the relationship of factors and multiples between the numerator and denominator, or between the divisor and dividend affected the construction. The children's partitioning strategies were developed such as: repeated halving stage ${\rightarrow}$ consuming all quantity stage ${\rightarrow}$ whole number objects leftover stage ${\rightarrow}$ singleton object analysis/multiple objects analysis ${\rightarrow}$ direct mapping stage. When children connected the singleton object analysis with multiple object analysis, they finally became able to conceptualize division as fractions and fractions as division.

  • PDF

Analysis on the Types of Mathematically Gifted Students' Justification on the Tasks of Figure Division (도형의 최대 분할 과제에서 초등학교 수학 영재들이 보여주는 정당화의 유형 분석)

  • Song Sang-Hun;Heo Ji-Yeon;Yim Jae-Hoon
    • Journal of Educational Research in Mathematics
    • /
    • v.16 no.1
    • /
    • pp.79-94
    • /
    • 2006
  • The purpose of this study is to find out the characteristics of the types(levels) of justification which are appeared by elementary mathematically gifted students in solving the tasks of plane division and spatial division. Selecting 10 fifth or sixth graders from 3 different groups in terms of mathematical capability and letting them generalize and justify some patterns. This study analyzed their responses and identified their differences in justification strategy. This study shows that mathematically gifted students apply different types of justification, such as inductive, generic or formal justification. Upper and lower groups lie in the different justification types(levels). And mathematically gifted children, especially in the upper group, have the strong desire to justify the rules which they discover, requiring a deductive thinking by themselves. They try to think both deductively and logically, and consider this kind of thought very significant.

  • PDF

Dominant Point Detection Algorithm on Digital Contours with Constrained Number of Points (특징점의 수를 제약조건으로 하는 선도형의 특징점 검출 기법)

  • Seo, Won-Chan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.9
    • /
    • pp.2412-2420
    • /
    • 1997
  • An algorithm for detecting dominant points on a digital contour is proposed. The algorithm detects the dominant points from the given contour with the given number of points as a constraint condition. on the basis of the principle of the top-down approach. The dominant points are detected by minimizing the object function that presents the similarity between the given contour and the approximated polygon drawn by connecting the dominant points of candicate. The penalty multiplier method is applied to minimize the augmented Lagrangean function which is made by adding the penalty of the constraint condition to the object function. On the minimization, a local searching method by the partial problem division is considered, and it is clarified that the reasonable solution is obtained by the method. The proposed algorithm has a merit that the dominant points can be detected exactly and stably even for the digital contour composed of multiple-scale features and the similar contours, because it detects them on considering the property of a whole figure of the given contour. It is confirmed that the proposed algorithm is more excellent than other previously proposed algorithms by the comparison and the evaluation through the experiment on suing typical digital curves.

  • PDF

A Study on the Driver's Preferences of Prividing Direction Information in Road Signs (방향표지 정보제공 방법에 대한 운전자 선호도 연구)

  • Chong, Kyusoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.6
    • /
    • pp.69-76
    • /
    • 2015
  • Although traffic information has been actively analyzed using big data, it has not been used as much with the consideration of driver characteristics. Among the various types of information, road signs can directly affect the driver. Road signs must provide the optimal information that enables drivers to reach their destinations with ease as well as information suitable for navigation systems. However, present road sign rules provide standardized information, regardless of the road type or size. This study suggests a method for providing road information that will help drivers determine their behavior. First, the minimum character size that can be used on a road sign for each design speed was obtained with respect to the visibility and decipherability of a road sign. Instead of conventional diagram-based direction guidance, a scenario using split-based direction guidance was created. To verify the effectiveness of the provided information, a three-dimensional simulated road environment was constructed, and a driving simulator was used for the test. At a simple plane intersection, the driver was not greatly influenced by directional guidance, but at a complex, three-dimensional intersection, the driver preferred summary-based directional guidance, which is instinctive guidance, over diagram-based guidance. On the basis of the test results, a secondary verification test that applied split-based guidance at a three-dimensional intersection confirmed that the driver had no problems in making decisions.

Collision detection algorithm by using mesh grouping (메쉬 그룹화를 이용한 충돌 검출 알고리즘)

  • Park, Jong-Seop;Jang, Tae-Jeong
    • Journal of Digital Contents Society
    • /
    • v.19 no.1
    • /
    • pp.199-204
    • /
    • 2018
  • In this paper, we propose a fast collision detection method for interacting with objects in virtual space. First, in the mesh grouping step, the entire space is divided into small spaces of a predetermined size, and the positions and sizes of the smallest basic stereoscopic shapes (cube or sphere) including all of the meshes belonging to each small space are determined. In the collision detection step, it is checked whether a haptic interface point (HIP) is included in a three-dimensional figure representing a group. When a collision with a specific three-dimensional figure is confirmed, searching is performed only for the meshes in the group to find a mesh on which a possible real collision with HIP occurred. The effectiveness of the proposed algorithm is verified by measuring and comparing the computation time of the proposed method with and without the proposed method.

Face Detection Using Shapes and Colors in Various Backgrounds

  • Lee, Chang-Hyun;Lee, Hyun-Ji;Lee, Seung-Hyun;Oh, Joon-Taek;Park, Seung-Bo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.7
    • /
    • pp.19-27
    • /
    • 2021
  • In this paper, we propose a method for detecting characters in images and detecting facial regions, which consists of two tasks. First, we separate two different characters to detect the face position of the characters in the frame. For fast detection, we use You Only Look Once (YOLO), which finds faces in the image in real time, to extract the location of the face and mark them as object detection boxes. Second, we present three image processing methods to detect accurate face area based on object detection boxes. Each method uses HSV values extracted from the region estimated by the detection figure to detect the face region of the characters, and changes the size and shape of the detection figure to compare the accuracy of each method. Each face detection method is compared and analyzed with comparative data and image processing data for reliability verification. As a result, we achieved the highest accuracy of 87% when using the split rectangular method among circular, rectangular, and split rectangular methods.