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

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2
• /
• pp.66-76
• /
• 1999

This paper proposes that can take at high speed the information of binocular disparity with moving translational and forward stereo camera to the extent that does not occur the problem of a correspondence point. It shows that in case of stereo vision with translational motion, can take the information of binocular disparity being devoid of error and putting high confidence in, and that in case of stereo vision with forward motion, can take the horizontal component which can not be detected in common stereo vision. Besides, the stereo vision can be done at high speed due to being bright and small a correspondence point comparing not to do, because a correspondence between right and left images is previously limited. But there are problem that a resonable information of binocular disparity can not be taken, if the vicinity of center of image is in accord with the region of occlusion in stereo vision with forward motion.

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

Many service robots which is interacting with human at home and in buildings have been developed. Few of them are shown in of the United States and of Japan. These robots are supposed to have a powerful indoor navigation performance in places where human beings live and work. The overall capability of service robots to move around in this environment is called environment correspondence, in which localization problem to find the accurate position and orientation is the most critical problem. While users set up a proper or a best environment for industrial robots, but for services robots at home and in buildings, it is very difficult to change the environment for robots. The expanded workspace due to mobility is difficult to be covered by means of those used for industrial robots because the cost increases and human beings do not want their environment to be changed for robots. This fact has made many researchers study efficient and effective environment correspondence problems. Among these problems, localization is the most difficult. Goal of localization study includes (1) Accurate detection of position and orientation (2) Minimum cost of the additional devices (3) Minimum change of human environment. In this study, as a solution of the above, we propose "Artificial Stars" which are attached on room ceiling as landmarks. In addition, we solve an adoption problem raised when a robot is delivered to a customer site and before it can perform its full navigation capability. We call this as "Initialization Problem" of service robots. We solve the initialization problem for both cases of environment with the map and without map. The proposed system is experimented and has shown how well it handles the initialization problem.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.116-123
• /
• 1990

Most algorithms utilized the horizontal epipolar lines for solving the correspondence problem in 3-D computer vision. However, the requirement is very difficult to be satisfied in real situations. In this paper, we propose a binocular-stereo matching algorithm, based on line matching method, which does not require the horizontal epipolar lines of the extreme pixels of a given line segment and two circles whose radius is equal to the maximum disparity. And we use the features including the direction of line segments, edge strength and cross-correlation for line matching. The experimental results show that the proposed algorithm can be a useful tool for solving the correspondence problem in 3-D computer vision.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_1
• /
• pp.529-536
• /
• 2007

Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

• Proceedings of the Korean Fiber Society Conference
• /
• 2002.04a
• /
• pp.57-61
• /
• 2002

점탄성학은 고분자물과 같이 기계적 성질이 시간에 따라 변하는 물질의 응력과 변형해석에 관한 학문이다. 이에 대한 이전의 문헌들은 균일변형시의 조성식에 대한 주제를 주로 다룬 반면, 경계조건 문제(boundary value problem)로서의 불균일 변형해석에 대한 논의가 부족한 편이다. 본 논문에서는 불균일 변형해석에 유용한 상응원리 (correspondence theorem)[1]을 보이론(beam theory)에 적용하는 경우, 적용가능조건을 유도하는 한편 상응원리를 적용 예를 들어 설명하였다. (중략)

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.124-131
• /
• 1994

In this paper, we propose a new approach of solving the stereopsis problem with a discrete-time cellular neural network(DTCNN) where each node has connections only with its local neithbors. Because the matching process of stereo correspondence depends on its geometrically local characteristics, the DTCNN is suitable for the stereo correspondence. Moreover, it can be easily implemented in VLSI. Therefore, we employed a two-layer DTCNN with dual templates, which are determined with the back propagation learning rule. Based on evaluation of the proposed approach for several random-dot stereograms, its performance is better than that of the Marr-Poggio algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.673-676
• /
• 2003

This paper deals with the problem of moving object detection and location in computer vision. We describe a new object-dependent motion analysis method for tracking target in an image sequence taken from a moving platform. We tackle these tasks with three steps. First, we make an active contour model of a target in order to build some of low-energy points, which are called kernels. Then we detect interest points in two windows called tracking windows around a kernel respectively. At the third step, we decide the correspondence of those detected interest points between tracking windows by the probabilistic relaxation method In this algorithm, the detecting process is iterative and begins with the detection of all potential correspondence pair in consecutive image. Each pair of corresponding points is then iteratively recomputed to get a globally optimum set of pairwise correspondences.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.101.1-101
• /
• 2001

This paper describes a grid mapping for a vision based mobile robot in uncertain indoor environment. The map building is a prerequisite for navigation of a mobile robot and the problem of feature correspondence across two images is well known to be of crucial Importance for vision-based mapping We use a stereo matching algorithm obtained by singular value decomposition of an appropriate correspondence strength matrix. This new correspondence strength means a correlation weight for some local measurements to quantify similarity between features. The visual range data from the reconstructed disparity image form an occupancy grid representation. The occupancy map is a grid-based map in which each cell has some value indicating the probability at that location ...

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.8
• /
• pp.848-855
• /
• 2008

In this paper, we describe correspondence among multiple images taken by multiple cameras. The correspondence among multiple views is an interesting problem which often appears in the application like visual surveillance or gesture recognition system. We use the principal axis and the ground plane homography to estimate foot of human. The principal axis belongs to the subtracted silhouette-based region of human using subtraction of the predetermined multiple background models with current image which includes moving person. For the calculation of the ground plane homography, we use landmarks on the ground plane in 3D space. Thus the ground plane homography means the relation of two common points in different views. In the normal human being, the foot of human has an exactly same position in the 3D space and we represent it to the intersection in this paper. The intersection occurs when the principal axis in an image crosses to the transformed ground plane from other image. However the positions of the intersection are different depend on camera views. Therefore we construct the correspondence that means the relationship between the intersection in current image and the transformed intersection from other image by homography. Those correspondences should confirm within a short distance measuring in the top viewed plane. Thus, we track a person by these corresponding points on the ground plane. Experimental result shows the accuracy of the proposed algorithm has almost 90% of detecting person for tracking based on correspondence of intersections.