|
|
Computer Generated Holograms
Tvarog, Drahoslav ; Jákl, Petr (referee) ; Kotačka, Libor (advisor)
The presented Diploma thesis deals with the computer-generated diffractive structures or rather called computer generated holograms (CGH). We follow basic principles of classical holography and in the context of which we define a synthetic holography. We then show various types of digital holograms and methods of measurement of their quality. We deal with several iterative algorithms useful for computation of the Fourier transform as well as with methods of phase quantization. In the second part of the work, we describe briefly our computer code for iterative Fourier transform computation. With respect to the mentioned techniques, we further present the usability of the method for design of computer generated holograms in reflection regime. After a short introduction to the electron beam lithography and its exploitation for the origination of computer generated diffractive optical elements. We analyze reconstructions of produced holograms and evaluate its quality.
|
|
|
Real-Time Data Exchange technology and its applications
Meluzín, Ivo ; Šilhavý, Pavel (referee) ; Krajsa, Ondřej (advisor)
Bachelor ‘s thesis target the analysis of the Real-Time Data eXchange technology. There are mentioned some preferences for using kit development of TMS320C6416 DSK invented by Texas Instruments Inc., in the way of signal porcessing with help of some software applications. On these basis, there is built a model in Simulink. Sequentially, we activate whole system, which is running on developer‘s kit for methods of counting, processing and reading data from interface RTDX.
|
|
|
Non-contact detection of physiological parameters from image sequences
Bršlicová, Tereza ; Janoušek, Oto (referee) ; Kolář, Radim (advisor)
This thesis deals with the study of contactless and non-invasive methods for estimating heart and respiratory rate. Non-contact measurement involves sensing persons by using camera and the values of the physiological parameters are then assessed from the sets of image sequences by using suitable approaches. The theoretical part is devoted to description of the various methods and their implementation. The practical part describes the design and realization of the experiment for contactless detection of heart and respiratory rate. The experiment was carried out on 10 volunteers with a known heart and respiratory rate, which was covered by using of a sophisticated system BIOPAC. Processing and analysis of the measured data was conducted in software environment Matlab. Finally, results from contactless detection were compared with the reference from measurement system BIOPAC. Experiment results are statistically evaluated and discussed.
|
|
|
FFT implementation in FPGA and ASIC
Dvořák, Vojtěch ; Bohrn, Marek (referee) ; Fujcik, Lukáš (advisor)
The aim of this thesis is to design the implementation of fast Fourier transform algorithm, which can be used in FPGA or ASIC circuits. Implementation will be done in Matlab and then this form of implementation will be used as a reference model for implementation of fast Fourier transform algorithm in VHDL. To verify the correctness ofdesign verification enviroment will be created and verification process wil be done. Program that will generate source code for various parameters of the module performing a fast Fourier transform will be created in the last part of this thesis.
|
|
|
Automatic Recognition of Logopaedic Defect in Speech Utterances
Dušil, Lubomír ; Atassi, Hicham (referee) ; Smékal, Zdeněk (advisor)
The thesis is aimed at an analysis and automatic detection of logopaedic defects in speech utterance. Its objective is to facilitate and accelerate the work of logopaedists and to increase percentage of detected logopaedic defects in children of the youngest possible age followed by the most successful treatment. It presents methods of speech work, classification of the defects within individual stages of child development and appropriate words for identification of the speech defects and their subsequent remedy. After that there are analyses of methods of calculating coefficients which reflect human speech best. Also classifiers which are used to discern and determine whether it is a speech defect or not. Classifiers exploit coefficients for their work. Coefficients and classifiers are being tested and their best combination is being looked for in order to achieve the highest possible success rate of the automatic detection of the speech defects. All the programming and testing jobs has been conducted in the Matlab programme.
|
|
|
FFT and FEM
Okrouhlík, Miloslav
The contribition deals with applications of Fourier series, Fourier integral and Fast Fourier transform to stress wave phenomena in solid mechanics.
|
|
|
Výpočet determinantu rozměrné matice Sylvesterova typu
Kujan, Petr ; Hromčík, M. ; Šebek, Michael
This work is devoted to computation of large n-D polynomial determinants with a special structure. Applications involve n-D systems theory (e.g. coprimeness test for two n-D polynomials) or the theory of algebraic equations. More specifically, these determinants were exploited by Chiasson recently to solve the practical problem of multilevel converter by a special computational procedure. To tackle the concerned problem it is essential to solve a system of polynomial equations with many unknowns.
|
|
|
New algorithm for spectral factorization and its application in signal processing
Ježek, Jan ; Hromčík, Martin ; Šebek, Michael
In this report a new algorithm is presented for the spectral factorization of a two-sided symmetric polynomial. The method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques, namely the famous fast Fourier transform routine (FFT), brings high computational efficiency and reliability. The power of the proposed procedure is employed in a particular practical signal processing application.
|
|
|
The computing complexity (the speed of the computation)
Práger, Milan
A short elementary description of the problems of computing complexity for nonspecialists. On simple examples the number of arithmetic operations (determining the speed of the computation) is considered and possible ways of its reduction are shown. E.g. the dyadic reduction that is used to the construction of FFT.
|
|
| |
guest ::
