• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1934-1935
• /
• 2011

In order for a service robot to perform several tasks, basically autonomous navigation technique such as localization, mapping, and path planning is required. The localization (estimation robot's pose) is fundamental ability for service robot to navigate autonomously. In this paper, we propose a new system for point pattern matching based visual global localization using spot lightings in ceiling. The proposed algorithm us suitable for system that demands high accuracy and fast update rate such a guide robot in the exhibition. A single camera looking upward direction (called ceiling vision system) is mounted on the head of the mobile robot and image features such as lightings are detected and tracked through the image sequence. For detecting more spot lightings, we choose wide FOV lens, and inevitably there is serious image distortion. But by applying correction calculation only for the position of spot lightings not whole image pixels, we can decrease the processing time. And then using point pattern matching and least square estimation, finally we can get the precise position and orientation of the mobile robot. Experimental results demonstrate the accuracy and update rate of the proposed algorithm in real environments.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.276-284
• /
• 2013

This paper considers the transfer alignment in the inertial navigation system and the observability analysis is performed for velocity matching. The state variable of the Kalman filter is modeled including the lever arm error and the measurement equation is obtained. The SOM(Stripped Observability Matrix) method is used for the observability analysis for various maneuvering conditions of the vehicle, which gives the full state observability condition as a specific maneuver sequence of the vehicle. While the observability analysis of a lever arm effect in the existing papers is mainly performed by simulations, we performed it analytically by the observability analysis method. The analysis result is verified using the computer simulations.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.98-103
• /
• 1997

Given the small bit allocation for motion information in very low bit-rate coding, motion estimation using the block matching algorithm(BMA) fails to maintain an acceptable level of prediction errors. The reson is that the motion model, or spatial transformation, assumed in block matching cannot approximate the motion in the real world precisely with a small number of parameters. In order to overcome the drawback of the conventional block matching algorithm, several triangle-based methods which utilize triangular patches insead of blocks have been proposed. To estimate the motions of image sequences, these methods usually have been based on the combination of optical flow equation, affine transform, and iteration. But the compuataional cost of these methods is expensive. This paper presents a fast motion estimation algorithm using a multiple linear regression model to solve the defects of the BMA and the triange-based methods. After describing the basic 2-D triangle-based method, the details of the proposed multiple linear regression model are presented along with the motion estimation results from one standard video sequence, representative of MPEG-4 class A data. The simulationresuls show that in the proposed method, the average PSNR is improved about 1.24 dB in comparison with the BMA method, and the computational cost is reduced about 25% in comparison with the 2-D triangle-based method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.68-78
• /
• 1999

A new algorithm for tracking feature points in an image sequence is presented. Most existing feature tracking algorithms often produce false trajectories, because the matching measures do not precisely reflect motion characteristics. In this paper, three attributes including spatial coordinate, motion direction and motion magnitude are used to calculate the feature point correspondence. The trajectories of feature points are determined by calculation the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights of the attributes are updated reflecting the motion characteristics, so that the robust tracking of feature points is achieved. The proposed algorithm can find the trajectories correctly which has been shown by experimental results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.2
• /
• pp.43-46
• /
• 2014

A time-series data is the collection of real numbers over the time intervals. One of the main tasks in time-series data is efficiently to find subsequences similar to a given query sequence. In this paper, we propose an efficient subsequence matching method, which is called Instance-Match (I-Match). I-Match constructs a virtual window in order to reduce false alarms. Through the experiment with real data set and query sets, we show that I-Match improves query processing time by up to 2.95 times and significantly reduces the number of candidates comparing to Dual Match.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.143-146
• /
• 2000

Motion Estimation/compensation(ME/MC) is one of the efficient interframe ceding techniques for its ability to reduce the high redundancy between successive frames of an image sequence. Calculating the blocking matching takes most of the encoding time. In this paper a new fast block matching algorithm(BMA) is developed for motion estimation and for reduction of the computation time to search motion vectors. The feature of the new algorithm comes from the center-biased checking concept and the trend of pixel movements. At first, Motion Vector(MV) is searched in ${\pm}$1 of search area and then the motion estimation is exploited in the rest block. The ASP and MSE of the proposed search algorithm show good performance.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.146-156
• /
• 1998

Thispapr proposes hybrid navigation parameter estimation using sequential aerial images. The proposed navigation parameter estimation system is composed of two parts: relative position estimation and absolute position estimation. the relative position estimation recursively computes the current velocity and absolute position estimation. The relative position estimation recursively computes the current velocity and position of an aircraft by accumulating navigation parameters extracted from two succesive aerial images. Simple accumulation of parameter values decreases reliability of the extracted parameters as an aircraft goes on navigating. therefore absolute position estimation is required to compensate for position error generated in the relative position step. The absolute position estimation algorithm combining image matching and digital elevation model(DEM) matching is presented. Computer simulation with real aerial image sequences shows the efficiency of the proposed hybrial algorithm.

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

Due to the temporal correlation of the image sequence, the motion vector of a block is highly related to the motion vector of the same coordinate block in the previous image frame. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous image frames, the total number of search points used to find the motion vector of the current block may be reduced significantly. Using that idea, an efficient new predicted direction search algorithm (PDSA) for block matching motion estimation is proposed in this paper.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2531-2533
• /
• 2005

The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of therm request much memory space and time. Therefore the most reliable neural-network algorithm is drived for real-time matching of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques in moving objects.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.281-286
• /
• 2007

비디오 복원(video completion)은 비디오 영상에서 색상값에 대한 정보가 없는 픽셀에 적절한 색을 채워 영상을 복원하는 기술이다. 본 논문에서는 움직이는 두 물체가 교차하는 입력영상으로부터 하나의 물체를 제거함으로 발생하는 홀(hole)을 채우는 비디오 복원 기술을 제안한다. 입력 영상에서의 두 물체 중 카메라와 가까운 물체를 제거함으로써 영상의 홀이 발생하게 되고, 이 홀을 다른 프레임들의 정보를 이용하여 채움으로써 가려진 물체를 복원한다. 모든 프레임에 대해 각 물체의 중심을 추정하여 물체의 중심을 기준으로 시-공간 볼륨(spatio-temporal volume)을 생성하고, 복셀 매칭(voxel matching)을 통한 시간적 탐색을 수행한 후 두 물체를 분리한다. 가리는 물체 영역으로 판단 된 부분을 삭제하고 공간적 탐색 방법을 이용하여 홀을 채워 가려짐이 있는 물체를 복원하는 과정을 소개한다. 실험 결과를 통해 제안한 기술이 비교적 자연스러운 결과를 얻을 수 있다는 것을 보여준다.