Posts Tagged ‘thesis’

Master Thesis Defense 2013

Master Thesis Defense:
Date:
February 21st, 2011 Time: 14:55 – 15:55
Place:
Media Room, Department of Computer Science, Gunma University Kiryu Campus
*This paper has been accepted for publication in the Asian Conference on Pattern Recognition 2013 (in conjunction with IAPR–International Association of Pattern Recognition).
Thesis: Pdf file will be available soon

Title:
“Performance Evaluation of Feature Descriptors for Application in
Outdoor-scene Visual Navigation”

Abstract: During the past decades, scientists
have made numerous efforts in developing autonomous mobile robots.
One of the popular method to be applied for visual navigation is
scene matching algorithm. The idea is to localize the robot
position by finding out matching between the input running scenes
and a set of reference images. However, to achieve an appropriate
matching between the compared images is not an easy task. A
frequent change in the illumination intensity is one of the biggest
challenge during the experiment of scene matching. Unfortunately,
there is no quantitative evaluation of feature matching
performance, especially focusing in the problem of illumination
changes. This thesis presents an investigation of a number of
popular feature detectors and descriptors in matching the outdoor
environment and observe the performance in three different lighting
scenes, i.e., sunny, cloudy daytime, and cloudy evening, captured
within the same route by the autonomous mobile robot. To give an
equality comparison, we applied the Lowe’s matching procedure
[Low04] for all compared methods. The matching percentage and ROC
curve are used for the evaluation measurements. As for the
experimental results, the hybrid performance of FAST detector and
SURF descriptor gives the best evaluation measurement by showing
the largest value of area under ROC curve. In addition, FAST, and
SURF show advantages on their speed in extracting local image
features which is favorable for real time application. On the other
hand, SIFT achieves its stability in nearly all situations. ASIFT
presents the highest number of extracted keypoints although it
suffers from the problem of computation complexity and redundant
matches. Video

Bachelor Thesis 2011

Bachelor Thesis Presentation:
Date: February 23rd, 2011
Time: 13:00 – 15:00. 7 sessions. (10 minutes presentation & 5 minutes discussion)
Place: Media Room, Department of Computer Science, Gunma University Kiryu Campus

Thesis:
Dzulfahmi_Bachelor_Thesis.pdf 
(in Japanese)
Title:
“Polygon recognition algorithm for the purpose of image pattern matching and its application to autonomous mobile robot”

『図形パターン照合 のための多角形認識アルゴリズムとその自律走行ロボットへの応用』

Abstract:
The problem of detecting and recognizing polygon shapes in images becomes one of important research topics in the field of image processing. In this paper, we present an effective approach to recognize polygon shapes based on object contour approximation. Its application is then deployed into our participation in The Tsukuba Challenge autonomous mobile robot competition. Experimental results indicate that the proposed technique shows promising achievement on recognizing a unique (triangle) shape on the automatic door near the Goal area.
【概要】
画像認識の様々な状況で必要とされる図形パターンの照合を行うため、本研究では多角形の認識を用いたアルゴリズムを考案し、実験 した。このアルゴリズムでは、画像内にある物体の輪郭と認識目的の形状との類似度を計算することによって図形を認識する。このアルゴリズ ムを自律型走行ロボット大会「つくばチャレンジ」のロボットの環境認識に適用して例を述べる。このアルゴリズムによってゴール付近の自動 ドアにある特徴的な形状(三角形)を認識し、ロボットをゴールへと誘導する。

Power Point Slide
File = Presentation.pptx

Presentation:

%d bloggers like this: