• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.133-140
• /
• 2005

This paper presents a rapid face shape acquisition system. The system is composed of two cameras and one projector. The technique works by projecting a pattern on the object and capturing two images with two cameras. We use a 'one shot' system which provides 3D data acquired by single image per camera. The system is good for rapid data acquisition as our purpose. We use the 'absolutely coded pattern' using the hue and saturation of pattern lines. In this 'absolutely coded pattern' all patterns have absolute identification numbers. We solve the correspondence problem between the two images by using epipolar geometry and absolute identification numbers. In comparison to the 'relatively coded pattern' which uses relative identification numbers, the 'absolutely coded pattern' helps obtain rapid 3D data by one to one point matching on an epipolar line. Because we use two cameras, we obtain two images which have similar hue and saturation. This enables us to have the same absolute identification numbers in both images, and we can use the absolutely coded pattern for solving the correspondence problem. The proposed technique is applied to face data and the total time for shape acquisition is estimated.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• 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.

• Research in Mathematical Education
• /
• v.15 no.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.

• Journal of the Korean Mathematical Society
• /
• v.37 no.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.10a
• /
• 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.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• 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.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• 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.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.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.

• Korean Journal of Agricultural Science
• /
• v.37 no.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.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.12-18
• /
• 2012

Stereo correspondence is the central problem of stereo vision. In this paper, we propose a stereo matching scheme based on a genetic algorithm using a multi-resolution method and AD-Census. The proposed approach considers the matching environment as an optimization problem and finds the disparity by using a genetic algorithm And adaptive chronosome structure using edge pixels and crossover mechanism are employed in this technique. A cost function is composes of certain constraints whice are commonly used in stereo matching. AD-Census measure is applied to reduce disparity error. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement using local feature vector. We valid our method not only reduces the search time for correspondence compared with conventional GA-based method but also ensures the validity of matching.