Thesis Details

Posouzení korespondence zájmových bodů v obraze

Master's Thesis Student: Křehlík Jan Academic Year: 2007/2008 Supervisor: Herout Adam, prof. Ing., Ph.D.
English title
Similarity Measure of Points of Interest in Image
Language
Czech
Abstract

This document deals with experimental verifying to use machine learning algorithms AdaBoost or WaldBoost to make classifier, that is able to find point in the second picture that matches original point in the first picture.

This work also depicts finding points of interest in image as a first step of finding correspondence. Next there are described some descriptors of points of interest. Corresponding points could be useful for 3D modeling of shooted scene.

Keywords

Points of interest, computer vision, image preprocessing, Harris detector, edge detector, Sobel operator, Laplace operator, image correspondence, descriptors, AdaBoost, WaldBoost, ROC, classification

Department
Degree Programme
Information Technology, Field of Study Computer Graphics and Multimedia
Files
Status
defended, grade C
Date
18 June 2008
Reviewer
Committee
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT), předseda
Bartík Vladimír, Ing., Ph.D. (DIFS FIT BUT), člen
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), člen
Fučík Otto, doc. Dr. Ing. (DCSY FIT BUT), člen
Sojka Eduard, doc. Dr. Ing. (VŠB-TUO), člen
Zemčík Pavel, prof. Dr. Ing. (DCGM FIT BUT), člen
Citation
KŘEHLÍK, Jan. Posouzení korespondence zájmových bodů v obraze. Brno, 2008. Master's Thesis. Brno University of Technology, Faculty of Information Technology. 2008-06-18. Supervised by Herout Adam. Available from: https://www.fit.vut.cz/study/thesis/5162/
BibTeX
@mastersthesis{FITMT5162,
    author = "Jan K\v{r}ehl\'{i}k",
    type = "Master's thesis",
    title = "Posouzen\'{i} korespondence z\'{a}jmov\'{y}ch bod\r{u} v obraze",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2008,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/5162/"
}
Back to top