| dc.date.accessioned |
2015-10-06T08:31:08Z |
und |
| dc.date.accessioned |
2017-10-24T12:21:47Z |
|
| dc.date.available |
2015-10-06T08:31:08Z |
und |
| dc.date.available |
2017-10-24T12:21:47Z |
|
| dc.date.issued |
2015-10-06T08:31:08Z |
|
| dc.identifier.uri |
http://radr.hulib.helsinki.fi/handle/10138.1/5075 |
und |
| dc.identifier.uri |
http://hdl.handle.net/10138.1/5075 |
|
| dc.title |
Learning Image Dictionary using Non-negative Matrix Factorization and K-SVD |
en |
| ethesis.discipline |
Mathematics |
en |
| ethesis.discipline |
Matematiikka |
fi |
| ethesis.discipline |
Matematik |
sv |
| ethesis.discipline.URI |
http://data.hulib.helsinki.fi/id/44bc4f03-6035-4697-993b-cfc4cea667eb |
|
| ethesis.department.URI |
http://data.hulib.helsinki.fi/id/61364eb4-647a-40e2-8539-11c5c0af8dc2 |
|
| ethesis.department |
Institutionen för matematik och statistik |
sv |
| ethesis.department |
Department of Mathematics and Statistics |
en |
| ethesis.department |
Matematiikan ja tilastotieteen laitos |
fi |
| ethesis.faculty |
Matematisk-naturvetenskapliga fakulteten |
sv |
| ethesis.faculty |
Matemaattis-luonnontieteellinen tiedekunta |
fi |
| ethesis.faculty |
Faculty of Science |
en |
| ethesis.faculty.URI |
http://data.hulib.helsinki.fi/id/8d59209f-6614-4edd-9744-1ebdaf1d13ca |
|
| ethesis.university.URI |
http://data.hulib.helsinki.fi/id/50ae46d8-7ba9-4821-877c-c994c78b0d97 |
|
| ethesis.university |
Helsingfors universitet |
sv |
| ethesis.university |
University of Helsinki |
en |
| ethesis.university |
Helsingin yliopisto |
fi |
| dct.creator |
Luukkonen, Petri Samuel |
|
| dct.issued |
2015 |
|
| dct.language.ISO639-2 |
eng |
|
| dct.abstract |
In this thesis, a theoretical background of algorithms called NLS-BB-NMF and K-SVD for computing the image dictionary have been introduced. The NLS-BB-NMF algorithm computes the matrix factorization V ≈ WH of the training data matrix V (in our case the set of image patches from training image) using gradient descent methods by applying non-negative constraint on matrices W and H. The K-SVD in turn computes the matrix factorization WH applying sparsity constraint on the coefficient matrix H using Orthogonal Matching Pursuit (OMP) and Singular Value Decomposition (SVD). In the factorization, matrix W is the so called dictionary and it contains features, also called atoms, of the data V . The atoms serve as a building blocks of the original data, and they are also assumed to represent data that is similar to the training data V .
The testing of the methods were carried in two phases. Initially, in the so called training phase, the dictionary was learned by the algorithms from a training image. The visual structure of the atoms learned by the algorithms were notably different although the approximations WH made by both dictionaries were visually very close to the original image. The visual difference between the learned dictionaries was seen as a consequence of the sparsity constraint that was forced for the coefficient matrix in K-SVD but not in NLS-BB-NMF.
Secondly, in the test phase, a test image with various noise levels was approximated using the learned dictionary. The algorithms were able to produce approximations that were closer to the clean test image than the noisy test image. This was seen as the effect of dictionaries whose atoms were representing only the features of clean images.
This observation led to a second test where the algorithms were tested to compute the denoised reconstructions of the test image with varying noise levels by using an extended dictionary containing additionally atoms learned from a noise sample.
The qualities of the reconstructions were evaluated by using the Frobenius matrix norm and Structural Similarity (ssim) index that has been observed to adapt better the visual perception of human eyes. |
en |
| dct.language |
en |
|
| ethesis.language.URI |
http://data.hulib.helsinki.fi/id/languages/eng |
|
| ethesis.language |
English |
en |
| ethesis.language |
englanti |
fi |
| ethesis.language |
engelska |
sv |
| ethesis.thesistype |
pro gradu-avhandlingar |
sv |
| ethesis.thesistype |
pro gradu -tutkielmat |
fi |
| ethesis.thesistype |
master's thesis |
en |
| ethesis.thesistype.URI |
http://data.hulib.helsinki.fi/id/thesistypes/mastersthesis |
|
| dct.identifier.urn |
URN:NBN:fi-fe2017112251390 |
|
| dc.type.dcmitype |
Text |
|
