Cílem diplomové práce je navrhnout levný, avšak dostatečně výkonný a univerzální systém, schopný snímání a zpracování obrazu z digitální kamery. Další částí je návrh a implementace funkcí pro zpracování obrazu a komunikace s nadřazeným systémem.

This master's thesis deals with acceleration of geometrical image transforms using the GPU and NVIDIA (R) CUDA TM architecture. Time critical parts of the code are moved on the GPU and executed in parallel. One of the results is a demonstrational application for performance comparison of both architectures: the CPU, and GPU in combination with the CPU. As a reference implementation, there are used highly optimized routines from the OpenCV library, made by the Intel company.

V oblasti zpracování signálů se v současné době čím dál více využívají tzv. řídké reprezentace signálů, tzn. že daný signál je možné vyjádřit přesně či velmi dobře aproximovat lineární kombinací velmi malého počtu vektorů ze zvoleného reprezentačního systému. Tato práce se zabývá využitím řídkých reprezentací pro rekonstrukci poškozených zvukových záznamů, ať už historických nebo nově vzniklých. Především historické zvukové nahrávky trpí zarušením jako praskání nebo šum. Krátkodobé poškození zvukových nahrávek bylo doposud řešeno interpolačními technikami, zejména pomocí autoregresního modelování. V nedávné době byl představen algoritmus s názvem Audio Inpainting, který řeší doplňování chybějících vzorků ve zvukovém signálu pomocí řídkých reprezentací. Zmíněný algoritmus využívá tzv. hladové algoritmy pro řešení optimalizačních úloh. Cílem této práce je porovnání dosavadních interpolačních metod s technikou Audio Inpaintingu. Navíc, k řešení optimalizačních úloh jsou využívány algoritmy založené na l1-relaxaci, a to jak ve formě analyzujícího, tak i syntetizujícího modelu. Především se jedná o proximální algoritmy. Tyto algoritmy pracují jak s jednotlivými koeficienty samostatně, tak s koeficienty v závislosti na jejich okolí, tzv. strukturovaná řídkost. Strukturovaná řídkost je dále využita taky pro odšumování zvukových nahrávek. Jednotlivé algoritmy jsou v praktické části zhodnoceny z hlediska nastavení parametrů pro optimální poměr rekonstrukce vs. výpočetní čas. Všechny algoritmy popsané v práci jsou na praktických příkladech porovnány pomocí objektivních metod odstupu signálu od šumu (SNR) a PEMO-Q. Na závěr je úspěšnost rekonstrukce poškozených zvukových signálů vyhodnocena.

This thesis studies the volume of the unit ball of finite-dimensional Lorentz sequence spaces p,q n . Lorentz spaces are a generalisation of Lebesgue spaces with a quasinorm described by two parameters 0 < p, q ≤ ∞. The volume of the unit ball Bp,q n of a general finite-dimensional Lorentz space was so far an unknown quantity, even though for the Lebesgue spaces it has been well-known for many years. We present the explicit formula for Vol(Bp,∞ n ) and Vol(Bp,1 n ). We also describe the asymptotic behaviour of the n-th root of Vol(Bp,q n ) with respect to the dimension n and show that [Vol(Bp,q n )]1/n ≈ n−1/p for all 0 < p < ∞, 0 < q ≤ ∞. Furthermore, we study the ratio of Vol(Bp,∞ n ) and Vol(Bp n). We conclude by examining the decay of entropy numbers of embeddings of the Lorentz spaces.

This master's thesis deals with acceleration of pixel interpolation methods using the GPU and NVIDIA (R) CUDA TM architecture. Graphic output is represented by a demonstrational application for geometrical image transforms using chosen interpolation method. Time critical parts of the code are moved on the GPU and executed in parallel. There are used highly optimized routines from the OpenCV library, made by the Intel company for an image and video processing.

This term project is aimed on analysis of graphic pipeline which can rasterize required picture. Document is specialized to drawing algorithms that are used in rasterization block. Major aim of this project is describing of rasterization algorithms that can be implemented on hardware. Type of aimed hardware is field-programmable gate array FPGA.

The first part of this Master’s Thesis deals with the theory of digital signal processing and describes the JUCE library. In this part some basic operations are explained with digital audio signals, such as polarity inversion, delay and linear interpolation of signal samples. The creation of new audio applications using the JUCE library in the C++ programming language is explained too. The next parts of this thesis describe the implemented audio application that allows the user to provide the described basic operations with digital audio signals in real time. For multiple channel audio signals the channels can be processed independently.

Interlacing is the process of frame scanning and frame displaying being based on the even and uneven lines‘ interchanging. This framework originated along with the PAL and NTSC television standards‘ formation in the course of 1930s. The process mentioned above stopped frames displayed on older TV sets from flashing. Nevertheless, there is a disadvantage of the frame processed after this manner, consisting in its attribute to be displayed in a clean-cut way just on classical TV sets. However, plasma and LCD television appliances, projectors and computer monitors always display the entire frame all at once, therefore composing it of the both fields, yet not being acquired concurrently, differing in moving objects‘ positions, moreover their contours are doubled, frayed and unfocussed. This master´s thesis deals with fundamentals of the interlaced video signal‘s formation, problems coming about at featuring the interlaced video like this, followed by operating methods of deinterlacing itself. In conclusion, there are my own softwares presented, having been developed in MATLAB computer environment and software command language C, and implementing some of the operating methods designed for deinterlacing in uncompressed digital video sequences.

Various methods describes an image by specific shapes, which are called basis or frames. With these basis can be transformed the image into a representation by transformation coefficients. The aim is that the image can be described by a small number of coefficients to obtain so-called sparse representation. This feature can be used for example for image compression. But basis are not able to describe all the shapes that may appear in the image. This lack increases the number of transformation coefficients describing the image. The aim of this thesis is to study the general principle of calculating the transformation coefficients and to compare classical methods of image analysis with some of the new methods of image analysis. Compares effectiveness of method for image reconstruction from a limited number of coefficients and a noisy image. Also, compares image interpolation method using characteristics of two different transformations with bicubic transformation. Theoretical part describes the transformation methods. Describes some methods from aspects of multi/resolution, localization in time and frequency domains, redundancy and directionality. Furthermore, gives examples of transformations on a particular image. The practical part of the thesis compares efficiency of the Fourier, Wavelet, Contourlet, Ridgelet, Radon, Wavelet Packet and WaveAtom transform in image recontruction from a limited number of the most significant transformation coefficients. Besides, ability of image denoising using these methods with thresholding techniques applied to transformation coefficients. The last section deals with the interpolation of image interpolation by combining of two methods and compares the results with the classical bicubic interpolation.

Registration of medical images is technique, which is developing with new hybrid diagnostic imaging systems. Nowadays is a trend in image registration focused on monomodality and multimodality images registration. The first part of this master’s thesis is intent on present basic information about image registration. Concretely is intending on image transformation, interpolation, criteria function and at optimalization. Further part present realized Optical Flow technique and used “Demon” algorithm for image registration. The next part is focused on presentation of program solution and GUI. In the last section of this master’s thesis is verifying of created program on usual images and real CT images.