Credits
6
Types
Compulsory
Requirements
This subject has not requirements
, but it has got previous capacities
Department
ESAII
Teachers
Person in charge
- Isiah Zaplana Agut ( isiah.zaplana@upc.edu )
Weekly hours
Theory
2
Problems
0
Laboratory
2
Guided learning
0
Autonomous learning
6
Competences
Transversals
Basic
Especifics
Generic
Objectives
-
Define and quantify the characteristics of an image
Related competences: CB1, CE04, -
Compare and select the most appropriate image processing tools based on the problem to be solved.
Related competences: CE26, CB1, CE01, CE02, CE03, CE04, CE15, CE19, -
To segment and label image regions
Related competences: CE26, CG2, CG4, CB5, CE01, CE03, CE04, CE13, CE15, -
Find the most significant descriptors to characterize regions or points of interest of an object
Related competences: CE26, CG2, CG4, CG8, CG9, CT6, CB5, CE14, CE15, CE18, -
Detect and recognize the presence of certain items in an image (with and without deep learning)
Related competences: CE26, CG2, CG4, CG6, CG8, CG9, CT6, CE14, CE15, CE18, CE19, -
Correctly carry out experiments to evaluate the proposed methods, their limitations and weak points, based on objective results.
Related competences: CG2, CG4, CG8, CB2, CE01, CE02, CE03, CE14,
Contents
-
Fundamentals of digital imaging
The digital image, properties and characteristics. Discretization and quantification. Color spaces. Distances. -
Linear, non-linear and morphological image processing
Linear processing. Operations with the intensity of the pixels. Geometric transformations. Image filtering. Digital derivatives. Morphological processing. -
Image segmentation
Binarization. Contour and edge detection. Color clustering. Morphological segmentation. -
Descriptors and features
Topological, geometric and statistical descriptors. The feature space. Histogram-based features, Hough and Harris transform. SIFT, ORB, and Haar key points. -
Object recognition
Recognition through the use of templates. Recognition based on classifiers. Local registration. Global registration. -
Deep learning computer vision
Recognition, detection and identification of objects. Architectures: YOLO, Fast/Faster R-CNN, Mask R-CNN. Visual transformers.
Activities
Activity Evaluation act
Fundamental of the digital image
The digital image, properties and characteristics. Discretization and quantization. Color spaces DistancesObjectives: 1
Contents:
Theory
2h
Problems
0h
Laboratory
2h
Guided learning
0h
Autonomous learning
4h
Linear, non-linear and morphological image processing (I)
Linear processing. Operations with intensity. Geometric transformations. Image filtering. Digital derivatives. Morphological processing.Objectives: 2
Contents:
Theory
4h
Problems
0h
Laboratory
4h
Guided learning
0h
Autonomous learning
10h
Linear, non-linear and morphological image processing (II)
Linear processing. Operations with intensity. Geometric transformations. Image filtering. Digital derivatives. Morphological processing.Objectives: 2
Contents:
Theory
4h
Problems
0h
Laboratory
4h
Guided learning
0h
Autonomous learning
8h
Image segmentation
Binarization. Contour extraction. Clustering by color. Morphological segmentation.Objectives: 3
Contents:
Theory
2h
Problems
0h
Laboratory
4h
Guided learning
0h
Autonomous learning
4h
Descriptors and features
Topological, geometric and statistical descriptors. The feature space. Histogram-based features, Hough and Harris transform. SIFT, ORB, and Haar key points.Objectives: 4
Contents:
Theory
6h
Problems
0h
Laboratory
6h
Guided learning
0h
Autonomous learning
10h
Teaching methodology
The theoretical classes will be complemented by putting into practice on PC the techniques presented.In the laboratory classes, real computer vision problems will be solved.
Problems of higher complexity will be raised as homework
Evaluation methodology
- There will be two partial tests P1 and P2 with grades NP1 and NP2. There is no final exam.- There will be a minimum of one exercise set in class (theoretical) and one set in the computer labs (practical) with ET and EP grades.
- There will be a final project with an NPF grade.
The final mark will be obtained in the form NF = 0'3*NP1+0.3*NP2 + 0.05*ET + 0.05*EP + 0.3*NPF.
Bibliography
Basic
-
Concise computer vision: an introduction into theory and algorithms
- Klette, R,
Springer,
2014.
ISBN: 1447163192
https://discovery.upc.edu/discovery/fulldisplay?docid=alma99100516467790671&context=L&vid=34CSUC_UPC:VU1&lang=ca -
Computer vision: algorithms and applications
- Szeliski, R,
Springer Nature Switzerland,
2022.
ISBN: 9783030343712
https://discovery.upc.edu/discovery/fulldisplay?docid=alma991005130575906711&context=L&vid=34CSUC_UPC:VU1&lang=ca
Previous capacities
Linear algebra, vector calculus, and probability.Data structures and programming