• 대한전자공학회논문지SP
• /
• 제42권6호
• /
• pp.133-140
• /
• 2005

본 논문에서는 3차원 얼굴 인식기에서의 입력 데이터로 적합한 얼굴 데이터의 유클리디안 복원 시스템을 제안한다. 카메라 영상을 통한 유클리디안 복원을 위해서는 카메라의 보정정보와 복원할 특징 점의 대응 쌍 정보가 필요한데, 보정정보는 시스템의 변경이 없다면 불변한다. 따라서 고속의 유클리디안 복원을 위해서는 스테레오 영상간의 대응 쌍 정보 획득이 가장 중요하다. 시스템은 두 개의 카메라와 프로젝터 한 대로 구성하며, 피사체에 패턴을 투사하고 두 개의 카메라로부터 영상을 획득함으로써 동작한다. 사용 패턴은 단일 투사 줄무늬 패턴을 사용하며 줄무늬의 색도 정보와 채도 정보를 이용하여 '절대 코드 패턴'을 생성한다. 사용 시스템은 두 개의 카메라를 사용하기 때문에 색도 정보와 채도 정보가 비슷한 두 개의 영상을 얻을 수 있으며 이것은 획득한 두 개의 영상에 있는 줄무늬들에 대해 동일한 절대 라벨을 얻을 수 있게 한다. 절대 라벨링 된 줄무늬는 에피폴라 라인(epipolar line)상의 점들과 일대일 정합을 통해 고속의 3차원 데이터 복원을 가능하게 한다. 제안 방식은 얼굴 데이터에 적용되었으며 정확도와 총 소요 시간의 측정을 통해 제안 방식이 기존 방식에 비해 정확도 면에서 뒤지지 않으면서도 복원 속도 면에서 장점을 가짐을 확인할 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.999-1004
• /
• 1989

This paper discusses a new method of recognizing patterns employing consistent labeling. A consistent labeling problem is a generalized expression of constraint satisfaction problems. When a pattern is recognized by pattern matching, the matching between a reference pattern and an acquired pattern resolves itself into finding correspondence between the pixels on the former and those on the latter. This can be expressed as a consistent labeling problem. Pattern association, a variation of pattern recognition, is also described employing consistent labeling. The proposed technique is supported by experimental results, yet further studies need to be done before its practical use.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제15권2호
• /
• pp.181-196
• /
• 2011

In mathematical modeling tasks, where students are exposed to model-eliciting for real and open problems, students are supposed to formulate and use a variety of mathematical skills and tools at hand to achieve feasible and meaningful solutions using appropriate problem solving strategies. In contrast to problem solving activities in conventional math classes, math modeling tasks call for varieties of mathematical ability including mathematical creativity. Mathematical creativity encompasses complex and compound traits. Many researchers suggest the exhaustive list of criterions of mathematical creativity. With regard to the research considering the possibility of enhancing creativity via math modeling instruction, a quantitative scheme to scale and calibrate the creativity was investigated and the assessment of math modeling activity was suggested for practical purposes.

• 대한수학회지
• /
• 제37권1호
• /
• pp.55-72
• /
• 2000

In this paper, we develop the Grobner-Shirshov basis theory for the representations of associative algebras by introducing the notion of Grobner-Shirshov pairs. Our result can be applied to solve the reduction problem in representation theory and to construct monomial bases of representations of associative algebras. As an illustration, we give an explicit construction of Grobner-Shirshov pairs and monomial bases for finite dimensional irreducible representations of the simple tie algebra sl$_3$. Each of these monomial bases is in 1-1 correspondence with the set of semistandard Young tableaux with a given shape.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1192-1197
• /
• 1991

This paper describes a method of extracting the 3-D coordinates of feature points of an object from two images taken by one camera. The first image is from a CCD camera before approaching the object and the second image is from same camera after approaching the object along the optical axis. In the two images, the feature points appear at different position on the screen due to image enlargement. From the change of positions of feature points their world coordinates are calculated. In this paper, the correspondence problem is solved by image shrinking and correlation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2295-2298
• /
• 2003

The correspondence problem for stereo image matching plays an important role in expanding view points as multi view video applications become more popular. The conventional disparity estimation algorithms have limitation to find exact disparities because they consider not image features but similiar intensity points. Thus we propose an efficient disparity estimation algorithm considering features of stereo image pairs. As simulation results, our proposed method confirms better intermediate views than the existing block-matching methods.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2010년 춘계학술발표회 논문집
• /
• pp.11-13
• /
• 2010

Combined with the indeterminate boundaries of spatial objects, n:m correspondences makes an object-based matching be a complex problem. In this study, we model the boundary of a polygon object with fuzzy model and describe their overlapping relations as a weighted bipartite graph. Then corresponding pairs including 1:0, 1:1, 1:n and n:m relations are identified using a spectral singular value decomposition.

• 대한기계학회논문집
• /
• 제19권6호
• /
• pp.1431-1438
• /
• 1995

In this paper, we present a multiple-view stereo matching method in case of moving in the direction of optical axis with stereo camera. Also we analyze the obtainable depth precision to show that multiple-view stereo increases the virtual baseline with single-view stereo. This method decides candidate points for correspondence in each image pair and then search for the correct combinations of correspondences among them using the geometrical consistency they must satisfy. Adantages of this method are capability in increasing the accuracy in matching by using the multiple stereo images and less computation due to local processing. This method computes 3-D depth by averaging the depth obtained in each multiple-view stereo. We show that the resulting depth has more precision than depth obtainable by each independent stereo when the position of image feature is uncertain due to image noise. This paper first defines a multipleview stereo agorithm in case of moving in the direction of optical axis with stereo camera and analyze the obtainable precision of computed depth. Then we represent the effect of removing the incorrect matching candidate and precision enhancement with experimental result.

• 농업과학연구
• /
• 제37권3호
• /
• pp.471-479
• /
• 2010

Forest roads of 16,424km have been constructed as infrastructure for efficient management of forest. The demand of forest road have been also increased steadily with SOC conception for forest management and wood production. But, accuracy verification by completion drawing of forest road needed aspects extration of geographic information to sound like forest road construction and completion drawing. However, verification for completion drawing has not ascertained. This study carried out the evaluation for position accuracy about constructed forest road in Chungcheongnam-do for evaluating horizontal position accuracy of completion drawing of forest road. In result, first of distance of completion drawing and real route designed completion drawing longer than the real route as Gongju 83m, Seosan 66m, Nonsan 27m and Dangjin 19m, respectively. Second, RMSE by point-correspondence was 11m~14.7m, buffering analysis appeared difference of 18~24m. Finally, index of shape was the similar completion and real route through 6.5~7.4 and data information of forest road corresponds to be perfect. For such reasons, the existing completion drawings have a problem that it cannot use graphic information for drawing digital map according to the regulation, and there is an urgent need for improvement to solve this problem in the process of design and construction.

• 융합신호처리학회논문지
• /
• 제13권1호
• /
• pp.12-18
• /
• 2012

스테레오 대응성은 스테레오 비전에서 중요한 문제이다. 본 논문은 다해상도 기법과 AD-Census를 이용한 유전 알고리즘 기반의 스테레오 정합 기법을 제안한다. 정합 환경을 최적화 문제로 간주하여 유전 알고리즘으로 변위를 탐색한다. 그리고 에지 픽셀을 이용한 적응적 염색체 구조와 교배 방식을 적용한다. 비용함수는 스테레오 정합에서 주로 고려할 수 있는 제약 조건으로 구성하였고, 변위오차를 줄이기 위해 AD-Census 척도를 사용하였다. 처리의 효율을 높이기 위해 영상 피라미드 방법을 적용하여 최저해상도에서 최초 변위 도를 계산한다. 그리고 최초 변위도는 다음 해상도 단계로 전파되어, 보간된 후 지역 특징 벡터를 이용하여 정제를 수행한다. 실험을 통해 제안한 방법이 다른 유전 알고리즘 기반 기법들에 비해 변위 탐색 시간을 감소시킬 뿐만 아니라 정합의 타당성을 보증함을 확인하고자 한다.