• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.803-806
• /
• 2000

The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. We solve the correspondence problem as the optimal graph search problem, by considering false feature points and by properly reflecting motion characteristics. The proposed algorithm finds a local optimal correspondence so that the effect of false feature points can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O(m$^2$n) in the worst case, where m and n are the number of feature points in two consecutive frames. The proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2310-2325
• /
• 2016

In this paper, we provide a trajectory-generation algorithm that can identify pedestrians in real time. Typically, the contours for the extraction of pedestrians from the foreground of images are not clear due to factors including brightness and shade; furthermore, pedestrians move in different directions and interact with each other. These issues mean that the identification of pedestrians and the generation of trajectories are somewhat difficult. We propose a new method for trajectory generation regarding multiple pedestrians. The first stage of the method distinguishes between those pedestrian-blob situations that need to be merged and those that require splitting, followed by the use of trained decision trees to separate the pedestrians. The second stage generates the trajectories of each pedestrian by using the point-correspondence method; however, we introduce a new point-correspondence algorithm for which the A* search method has been modified. By using fuzzy membership functions, a heuristic evaluation of the correspondence between the blobs was also conducted. The proposed method was implemented and tested with the PETS 2009 dataset to show an effective multiple-pedestrian-tracking capability in a pedestrian-interaction environment.

• Communications for Statistical Applications and Methods
• /
• v.19 no.4
• /
• pp.547-558
• /
• 2012

Social network analysis is a graphical technique to search the relationships and characteristics of nodes (people, companies, and organizations) and an important node for positioning a visualized social network figure; however, it is difficult to characterize nodes in a social network figure. Therefore, their relationships and characteristics could be presented through an application of correspondence analysis to an affiliation matrix that is a type of similarity matrix between nodes. In this study, we provide the relationships and characteristics around authors and keywords in the JKSS(Journal of the Korean Statistical Society) of the Korean Statistical Society through the use of social network analysis and correspondence analysis.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.8
• /
• pp.156-167
• /
• 1995

In this paper, we propose a 3-D range finding method for situation that stereo camera has small translational motion. Binocular stereo generally tends to produce stereo correspondence errors and needs huge amount of computation. The former drawback is because the additional constraints to regularize the correspondence problem are not always true for every scene. The latter drawback is because they use either correlation or optimization to find correct disparity. We present a method which overcomes these drawbacks by moving the stereo camera actively. The method utilized a motion parallax acquired by monocular motion stereo to restrict the search range of binocular disparity. Using only the uniqueness of disparity makes it possible to find reliable binocular disparity. Experimental results with real scene are presented to demonstrate the effectiveness of this method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.25-37
• /
• 2000

The trajectories of feature points can be defined by the correspondences between points in consecutive frames. The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O($m^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.388-396
• /
• 2016

Through the correspondence works with international electrotechnical vocabulary(IEV) in the smart grid field and power information technology field, we analyzed cases for discussion of terms and definitions in the IEV and then proposed an advanced procedure and computing system for standardization of International Electronical Committee(IEC) terminologies. The standardization procedure consists of processes for existing terminology, new terminology and correspondent terminology which have different structures. An example of the standardization work of correspondent terminology is given. The standardization computing system are based on the process for terminology extraction, terminology verification and terminology management which could provide the Wikipedia type terminology search function. In order to prevent that there exist multiple terminologies in IEV, the database search system is needed to be developed. We proposed the 'IEV_Term_Search' program which is the database search system. Terminology standardization of different technical committees(TC) and completion of the IEV to promote cooperation between TC 1 and the TCs must be followed by revision and standardization using the standardization computing system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.105-108
• /
• 1999

렌즈를 통하여 촬영하는 모든 영상은 근본적으로 렌즈에 의한 기하학적인 왜곡이 발생하게 된다. 특히 방송영상에 있어서 더 넓은 영역을 촬영하기 위하여 어안렌즈를 사용하게 되면 왜곡은 더욱 심각해진다. 이러한 기하학적인 렌즈 왜곡은 반지름 r에 대한 다항식으로 모델링될 수 있고 여기서 각 항의 계수를 구함으로써 왜곡은 보정될 수 있다. 각항의 계수는 Block-Matching Algorithm(BMA)을 이용한 대응 화소 검출을 통해서 얻어 질 수 있는데 기존의 BMA는 사각형의 정해진 크기의 탐색 영역(search region)을 가지게 되므로 렌즈왜곡과 같은 특수한 상황에서는 비효율적이다. 따라서 본 논문에서는 렌즈 왜곡에 적응적인 탐색 영역(search region)을 갖는 새로운 BMA를 제안한다. 이는 렌즈 왜곡의 특성을 분석하여 렌즈 왜곡이 많이 일어나는 부분만을 특별히 정해서 대응 화소를 찾으므로 찾는 속도는 현저히 증가하고 성능은 기존의 BMA와 같은 성능을 보인다. 이러한 알고리즘은 하드웨어 구현에도 많은 도움이 될 것이다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2389-2392
• /
• 2005

We present fast stereo matching algorithm using edge projection. Traditional stereo matching algorithm uses 2D template for the search of corresponding point thus it requires huge the computational cost. In this paper, we reduce the 2D search problem into 1D using edge projection along vertical and horizontal direction inside the region of interest. Also, by accumulation of edge projection along vertical and horizontal direction, the edge projection within the region of interest could simply be obtained by just subtracting two values. Experimental results show that matching algorithm using edge projection also gives comparable discriminating power compared to that of using intensity.

• 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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.4
• /
• pp.515-522
• /
• 2015

Through the correspondence works with IEC in the smart grid fields and power IT fields, we set up the interpretation work procedure and defined the work rule for correspondence by analyzing the work results. In addition, we suggest cases for discussion of terms and definitions in the IEC and analyze them and then propose a matrix classification system for standardization to solve the cases for discussion. The matrix classification system with 3-axes of classification has been applied to newly emerging terminologies followed by smart gird. We drew the usefulness in search of terms in application fields and showed the cases of applying the matrix classification. The IEC Electropedia classification standard is unclear and the classification is mixed with principle, application and product areas. We proposed a new working group in IEC TC1 for research on the matrix classification system and then TC 1 decided to organize a new WG titled in the "IEV structure and supporting tools".