• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.310-310
• /
• 2000

The main problem in stereo vision is to find corresponding points in left and right image known as correspondence problem. Once correspondences determined, the depth information of those points are easily computed form the pairs of points in both image. In this paper, dynamic programming considering half-occluded region is used fer solving correspondence problem.

• 대한수학회논문집
• /
• 제27권2호
• /
• pp.425-430
• /
• 2012

In this paper, we will prove a social equilibrium existence theorem of a generalized Nash game with affine constraint correspondences which is comparable with Nash's equilibrium existence theorem in several aspects.

• 충청수학회지
• /
• 제24권2호
• /
• pp.213-219
• /
• 2011

In this paper, we will prove an equilibrium existence theorem of a non-compact acyclic strategic game with affine constraint correspondences which is comparable with equilibrium existence theorems due to Debreu, Nash, Kim-Kum, and Lu in several aspects.

• Journal of Computing Science and Engineering
• /
• 제6권3호
• /
• pp.219-226
• /
• 2012

Recently, shape analysis of human organs has achieved much attention, owing to its potential to localize structural abnormalities. For a group-wise shape analysis, it is important to accurately restore the shape of a target structure in each subject and to build the inter-subject shape correspondences. To accomplish this, we propose a shape modeling method based on the Laplacian deformation framework. We deform a template model of a target structure in the segmented images while restoring subject-specific shape features by using Laplacian surface representation. In order to build the inter-subject shape correspondences, we implemented the progressive weighting scheme for adaptively controlling the rigidity parameter of the deformable model. This weighting scheme helps to preserve the relative distance between each point in the template model as much as possible during model deformation. This area-preserving deformation allows each point of the template model to be located at an anatomically consistent position in the target structure. Another advantage of our method is its application to human organs of non-spherical topology. We present the experiments for evaluating the robustness of shape modeling against large variations in shape and size with the synthetic sets of the second cervical vertebrae (C2), which has a complex shape with holes.

• Journal of Computing Science and Engineering
• /
• 제8권2호
• /
• pp.94-106
• /
• 2014

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

• 한국지능시스템학회논문지
• /
• 제24권3호
• /
• pp.298-303
• /
• 2014

본 논문에서는 해양환경에서 취득한 열상 영상에서 물표를 강건하게 탐지하고 추적하는 알고리즘을 제안한다. 먼저 2-D 이산 Harr 웨이블렛 변환(DHWT) 기법을 이용하여 수평, 수직에지를 얻은 다음 수직 및 수평 에지들을 서로 곱하여 하나의 영상으로 결합해 돌출지도를 생성한다. 그런 다음 돌출지도를 이진화하여 물표를 추출한다. 물표를 추적하기 위하여 인접한 프레임에 존재하는 물체간의 가중치가 부여된 유클리디언 거리를 정합척도로 사용하였으며, 정합결과에 대해 물체의 나타남, 사라짐, 잘못된 물체 추출 등을 고려한 궤적관리를 통하여 최종적인 물체 궤적을 얻는다. 실험결과는 제안하는 알고리즘이 물체를 강건하게 추적함을 보인다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2017년도 하계학술대회
• /
• pp.83-84
• /
• 2017

We propose a novel high dynamic range (HDR) video synthesis algorithm from alternatively exposed low dynamic range (LDR) videos. We first estimate correspondences between input fames using an illumination invariant descriptor. Then, we synthesize an HDR frame with the weights computed to maximize detail preservation in the output HDR frame. Experimental results demonstrate that the proposed algorithm provides high-quality HDR videos without noticeable artifacts.

• 전자공학회논문지S
• /
• 제34S권11호
• /
• pp.93-101
• /
• 1997

A Hausdorff distance (HD) is one of commonly used measures for object matching. It calculates the distance between two point sets of edges in two-dimensional binary images without establishing correspondences. This paper proposes three object matching algorithm using robust HD measures based on M-estimation, least trimmed square (LTS), and .alpha.-trimmed mean methods, which are more efficient than the conventional HD measures. By computer simulation with synthetic and real images, the matching performance of the conventional HD smeasures and proposed' robust ones is compared.

• Kyungpook Mathematical Journal
• /
• 제54권4호
• /
• pp.655-665
• /
• 2014

The number of topologies (non-homeomorphic topologies) on a fixed finite set having n elements are now known up to n = 18 (n = 16 respectively) but still no complete formula yet. There are one to one correspondences among topologies, preorders and transitive digraphs on a given finite set. In this article, we enumerate topologies and non-homeomorphic topologies whose underlying graph is a given finite simple graph.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 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.