Global ETD Search

61	Software pro biometrické rozpoznávání duhovky lidského oka / Software for Biometric Recognition of a Human Eye Iris Maruniak, Lukáš January 2015 (has links) In my thesis, I focus on the task of recognizing human iris from an image.In the beginning, the work deals with a question of biometrics, its importance and basic concepts, which are necessary for use in following text. Subsequently process of human Iris detection is described together with theory of evolution algorithms. In the implementation part, is described the design of implemented solution, which uses evolution algorithms, where is emphasis on correct pupil and iris boundary detection.
62	Joint Source-Channel Coding Reliability Function for Single and Multi-Terminal Communication Systems Zhong, Yangfan 15 May 2008 (has links) Traditionally, source coding (data compression) and channel coding (error protection) are performed separately and sequentially, resulting in what we call a tandem (separate) coding system. In practical implementations, however, tandem coding might involve a large delay and a high coding/decoding complexity, since one needs to remove the redundancy in the source coding part and then insert certain redundancy in the channel coding part. On the other hand, joint source-channel coding (JSCC), which coordinates source and channel coding or combines them into a single step, may offer substantial improvements over the tandem coding approach. This thesis deals with the fundamental Shannon-theoretic limits for a variety of communication systems via JSCC. More specifically, we investigate the reliability function (which is the largest rate at which the coding probability of error vanishes exponentially with increasing blocklength) for JSCC for the following discrete-time communication systems: (i) discrete memoryless systems; (ii) discrete memoryless systems with perfect channel feedback; (iii) discrete memoryless systems with source side information; (iv) discrete systems with Markovian memory; (v) continuous-valued (particularly Gaussian) memoryless systems; (vi) discrete asymmetric 2-user source-channel systems. For the above systems, we establish upper and lower bounds for the JSCC reliability function and we analytically compute these bounds. The conditions for which the upper and lower bounds coincide are also provided. We show that the conditions are satisfied for a large class of source-channel systems, and hence exactly determine the reliability function. We next provide a systematic comparison between the JSCC reliability function and the tandem coding reliability function (the reliability function resulting from separate source and channel coding). We show that the JSCC reliability function is substantially larger than the tandem coding reliability function for most cases. In particular, the JSCC reliability function is close to twice as large as the tandem coding reliability function for many source-channel pairs. This exponent gain provides a theoretical underpinning and justification for JSCC design as opposed to the widely used tandem coding method, since JSCC will yield a faster exponential rate of decay for the system error probability and thus provides substantial reductions in complexity and coding/decoding delay for real-world communication systems. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2008-05-13 22:31:56.425 Common and private message Common randomization Correlated sources Discrete memoryless sources and channels Error exponent Excess distortion exponent Feedback Fenchel transform Probability of error Probability of excess distortion Fenchel duality theorem Hamming distortion measure Joint source-channel coding Markov types Multiple-access channel Reliability function Separation principle Stationary ergodic Mrkov source/channel Tandem coding Type packing lemma Broadcast channel
63	Program för frekvensanalys / Program for Frequency Analysis Rodesten, Stephan January 2017 (has links) Denna rapport täcker arbetsprocessen bakom att skapa en spektrumanalysator. Läsaren kommer att få läsa om den valda metoden men även alternativa metoder. Utöver detta kommer även de teoretiska delarna bakom varje moment att undersökas samt jämföras med potentiella alternativa lösningar. Projektet har utförts på uppdrag av KA Automation. Syftet med projektet var att skapa en basplattform för analys av ljudfrekvenser. Målet med detta var att kunna identifiera ljudegenskaper i form av frekvenserna hos exempelvis servomotorer i vattenpumpar. Tanken var att i ett senare utvecklingsskede kunna identifiera om och när nya frekvenser dykt upp i ljudprofilen vilket i sådana fall kan resultera i att motorn är i behov av service. Basplattformen är uppbyggd med hjälp av C# och ljudbehandlingsbiblioteket NAudio. Från resultatet kan slutsatsen dras att detta program kan analysera ljud och visa de olika frekvensernas styrka och därmed är en lämplig basplattform för vidareutveckling. / This report will cover the work process behind creating a spectrum analyzer. The reader will be able to read about the chosen method but also the alternative methods. Apart from this the theoretical parts behind every moment will also be covered and compared to potential alternative solutions. The project has been carried out on behalf of KA Automation. The purpose of the project was to create a base for analyzing sound frequencies. The goal was to be able to identify sound properties in the form of frequencies in servo motors in for example water pumps. The idea was to be able to in a later development stage be able to identify when new frequencies have entered the audio profile which might result in the motor to be in need of service. The base is created with the help of C# and the sound library NAudio. From the result one can conclude that this program can analyze sound and display the magnitude of its frequency components and is therefore a suitable base for future development. frequency analyzer analyze spectrum signal processing discrete fourier transform fast radix-2-fft radix-2 cooley tukey window function magnitude normalize hamming hann hanning complex number sampling sample sound wave microphone rate size format audio byte frekvensanalys spektrum dsp digital signalbehandling fouriertransform dft fft cooley-tukey fönsterfunktion amplitud decibel normalisering komplex komplexa tal sampel bit ljud våg mikrofon analys samplingshastighet samplingsstorlek ljudformat frekvenser frekvens spektra analog Computer Sciences Datavetenskap (datalogi)
64	Visualization of live search / Visualisering av realtidssök Nilsson, Olof January 2013 (has links) The classical search engine result page is used for many interactions with search results. While these are effective at communicating relevance, they do not present the context well. By giving the user an overview in the form of a spatialized display, in a domain that has a physical analog that the user is familiar with, context should become pre-attentive and obvious to the user. A prototype has been built that takes public medical information articles and assigns these to parts of the human body. The articles are indexed and made searchable. A visualization presents the coverage of a query on the human body and allows the user to interact with it to explore the results. Through usage cases the function and utility of the approach is shown. search technology search engine information retrieval live search query completion facet recall precision machine learning document classification linear classifier document categorization document clustering multi-label classification labelling hamming loss f-score visualization information visualization distance-similarity metaphor spatialized display visual information-seeking mantra user interface spatialization document processing Interaction Technologies Interaktionsteknik Computer Sciences Datavetenskap (datalogi) Information Systems Human Computer Interaction
65	Automatické rozpoznávání logopedických vad v řečovém projevu / Automatic Recognition of Logopaedic Defect in Speech Utterances Dušil, Lubomír January 2009 (has links) 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.

Page generated in 0.0737 seconds