|
|
Reconstruction of signal modified by fade-in/fade-out
Bača, Petr ; Kiska, Tomáš (referee) ; Rajmic, Pavel (advisor)
This thesis contains the theory needed to solve the special problem of bit-depth expansion. The goal is to reconstruct the signal which suffered from application of the fade-in, fade-out effect. The theory includes information of analog to digital conversion and the theory of sparse representations. Thesis formulates the task of bit-depth expansion and advices the algorithm to solve it. Furthermore, the realization of the issue is discussed and the results are given.
|
|
|
Audio restoration based on sparse signal representations
Záviška, Pavel ; Průša, Zdeněk (referee) ; Rajmic, Pavel (advisor)
This Master's Thesis deals with the issue of audio clipping and the application of sparse represenations model for the task of declipping. First, a general theory of clipping is described, followed by a brief overview of existing methods and a description of the general theory concerning sparse representations of signals and bases, respectively frames. Subsequently, two methods solving declipping problem based on sparse representations are intruduced. The first method uses the Generic proximal algorithm for convex optimization, the second one uses the Douglas-Rachford algorithm. The above mentioned methods have been programmed in the Matlab environment. The results of the declipping methods are evaluated according to SNR, PEMO-Q and also by subjective listening tests.
|
|
|
Determining the optimal patch size for sparse image representation
Šuránek, David ; Zátyik, Ján (referee) ; Špiřík, Jan (advisor)
Introduction of this thesis is dedicated to the description of basic concepts and algorithms for image processing using sparse representation. Furthermore there is mentioned neural network model called Restricted Boltzmann machine, which is in the practical part of the thesis subject of behaving observation in the task of determining the optimal block size for extrapolation using K-SVD algorithm
|
|
|
Decomposition of video-sequences into components with different dynamics
Gebrtová, Karolína ; Druckmüller, Miloslav (referee) ; Rajmic, Pavel (advisor)
The thesis is focused on the decomposition of video sequences, primarily on background and dynamic component separation, where the background remains the same and only small parts are in motion. Such a video is represented by a low-rank and sparse component. Thanks to the low-rank structure, the background can be separated using a median filter and dynamic mode decomposition. Furthermore, the robust principal component analysis, formulated as an optimization problem and its non-convex variant, will be employed. Also mentioned will be the multiresolution DMD, which is capable of decomposing the dynamic component based on its velocity.
|
|
|
Alternative JPEG image decoder
Bureš, Jiří ; Štarha, Pavel (referee) ; Rajmic, Pavel (advisor)
This thesis deals with the JPEG image codec, edge detection in images, sparse signal representations and proximal algorithms. First, the operation of the JPEG encoder and decoder and the theory underlying it are described. Then, based on the theoretical knowledge, a new proximal algorithm is constructed and implemented in an existing JPEG algorithm in order to remove block relics in the decoded image. The programming side is solved in Matlab environment. The results are evaluated using MSE, PSNR and SSIM methods.
|
|
|
Computational methods in single molecule localization microscopy
Ovesný, Martin ; Hagen, Guy Michael (advisor) ; Plášek, Jaromír (referee) ; Fliegel, Karel (referee)
Computational methods in single molecule localization microscopy Abstract Fluorescence microscopy is one of the chief tools used in biomedical research as it is a non invasive, non destructive, and highly specific imaging method. Unfortunately, an optical microscope is a diffraction limited system. Maximum achievable spatial resolution is approximately 250 nm laterally and 500 nm axially. Since most of the structures in cells researchers are interested in are smaller than that, increasing resolution is of prime importance. In recent years, several methods for imaging beyond the diffraction barrier have been developed. One of them is single molecule localization microscopy, a powerful method reported to resolve details as small as 5 nm. This approach to fluorescence microscopy is very computationally intensive. Developing methods to analyze single molecule data and to obtain super-resolution images are the topics of this thesis. In localization microscopy, a super-resolution image is reconstructed from a long sequence of conventional images of sparsely distributed single photoswitchable molecules that need to be sys- tematically localized with sub-diffraction precision. We designed, implemented, and experimentally verified a set of methods for automated processing, analysis and visualization of data acquired...
|
|
|
Separation of dynamic and static structures in a series of images
Gebrtová, Karolína ; Kosová, Petra (referee) ; Rajmic, Pavel (advisor)
This bachelor thesis is focused on the separation of static and dynamic structures of video. While the major part of the video background remains static, a few moving particles can be observed. Such video can be represented by a low-rank and a sparse component. Using a low-rank structure, the background can be separated by applying either the median filter or the dynamic mode decomposition. Furthermore, the thesis includes the robust principal component analysis which can be perceived as an optimization problem. In addition, the thesis is enhanced by result visualization methods.
|
|
|
Modern audio denoising with utilization of phase information
Skyva, Pavel ; Záviška, Pavel (referee) ; Rajmic, Pavel (advisor)
The thesis deals with modern methods of audio denoising. Reconstruction of the audiosignal is primarly based on utilization of phase information of signals and phase derivatives. Denoising methods also use sparse signal representations. In thesis is described the way of searching sparse coefficients using proximal Condat algorithm and following computation of reconstructed signal using this coefficients. The reconstruction algorithms are implemented in the MATLAB software with toolbox LTFAT included. Results of the reconstruction are compared using objective evaluation method Signal-to-Noise Ratio (SNR) and also by subjective evaluation.
|
|
|
Modern methods for restoration of degraded audiosignals
Mokrý, Ondřej ; Koldovský,, Zbyněk (referee) ; Rajmic, Pavel (advisor)
The master's thesis deals with the problem of restoring a block of missing samples in a digital audio signal. This problem is formulated as an optimization task, which seeks the sparsest time-frequency representation of a signal within the set of feasible reconstructed signals. Several particular formulations are discussed, namely the analyzing and the synthesizing model, both for convex and non-convex approaches. Suitable algorithms are proposed for solving these formulations, and in the convex case, the method is further enhanced by various procedures to compensate for the energy drop in the inpainted signal segment. The proposed algorithms are tested on real recordings, and their performance is shown to be competitive with the state-of-the-art.
|
|
|
Restoration of signals after passing through the limiter with the use of psychoacoustic model
Kramář, Denis ; Rajmic, Pavel (referee) ; Záviška, Pavel (advisor)
This bachelor thesis deals with the use of sparse representaions for the purpose of restoration clipping-damaged audiosignal. First, a theory of limiter and signal limiting itself is discussed. Subsequently, some of present methods based on sparse representations theory are given. The theory of sparse representations is discussed in following chapture. After that is here described a psychoacoustic model and it's use for declipping. At the end of theoretical part, two methods dealing with this problem are introduced. First is based on synthesis model of signal using Douglas-Rachford algorithm. Second is based on analysis signal model using Chambolle-Pock algorithm. In the next part is their implementation in the Matlab environment. Finally, the result achieved by both algorithms are evaluated.
|
guest ::
