<p>This thesis covers topics relevant to model-based coding. Model-based coding is a promising very low bit rate video coding technique. The idea behind this technique is to parameterize a talking head and to extract and transmit the parameters describing facial movements. At the receiver, the parameters are used to reconstruct the talking head. Since only high-level animation parameters are transmitted, very high compression can be achieved with this coding scheme. This thesis covers the following three key problems.</p><p>Although it is a fundamental problem, the initialization problem, has been neglected some extent in the literature. In this thesis, we pay particular attention to the study of this problem. We propose a pseudo-automatic initialization scheme: an Analysis-by-Synthesis scheme based on Simulated Annealing. It has been proved to be an efficient scheme.</p><p>Owing to technical advance today and the newly emerged MPEG-4 standard, new schemes of performing texture mapping and motion estimation are suggested which use sample based direct texture mapping; the feasibility of using active motion estimation is explored which proves to be able to give more than 10 times tracking resolution. Based on the matured face detection technique, Dynamic Programming is introduced to face detection module and work for face tracking.</p><p>Another important problem addressed in this thesis is how to evaluate the face tracking techniques. We studied the evaluation problems by examining the commonly used method, which employs a physical magnetic sensor to provide "ground truth". In this thesis we point out that it is quite misleading to use such a method.</p>

This thesis covers topics relevant to model-based coding. Model-based coding is a promising very low bit rate video coding technique. The idea behind this technique is to parameterize a talking head and to extract and transmit the parameters describing facial movements. At the receiver, the parameters are used to reconstruct the talking head. Since only high-level animation parameters are transmitted, very high compression can be achieved with this coding scheme. This thesis covers the following three key problems. Although it is a fundamental problem, the initialization problem, has been neglected some extent in the literature. In this thesis, we pay particular attention to the study of this problem. We propose a pseudo-automatic initialization scheme: an Analysis-by-Synthesis scheme based on Simulated Annealing. It has been proved to be an efficient scheme. Owing to technical advance today and the newly emerged MPEG-4 standard, new schemes of performing texture mapping and motion estimation are suggested which use sample based direct texture mapping; the feasibility of using active motion estimation is explored which proves to be able to give more than 10 times tracking resolution. Based on the matured face detection technique, Dynamic Programming is introduced to face detection module and work for face tracking. Another important problem addressed in this thesis is how to evaluate the face tracking techniques. We studied the evaluation problems by examining the commonly used method, which employs a physical magnetic sensor to provide "ground truth". In this thesis we point out that it is quite misleading to use such a method.

Nachrichtentechnische Systeme werden stets durch unvermeidbare zufällige Störungen beeinflußt. Neben anderen Komponenten sind davon besonders Oszillatoren betroffen. Die durch die Störungen verursachten zufälligen Schwankungen in der Oszillatorausgabe können als Amplituden- und Phasenabweichungen modelliert werden. Dabei zeigt sich, daß vor allem zufällige Phasenfluktuationen von Bedeutung sind. Zufällige Phasenfluktuationen können unter Verwendung stochastischer Prozesse zweiter Ordnung mit kurzem oder langem Gedächtnis modelliert werden. Inhalt der Dissertation ist die Herleitung eines Verfahrens zur Simulation zufälliger Phasenfluktuationen von Oszillatoren mit kurzem Gedächtnis unter Berücksichtigung von Datenblattangaben.

The objective of this research is to demonstrate how an underlying system's state vector distribution can be determined in a distributed heterogeneous sensor network with reduced subspace observability at the individual nodes. We show how the network, as a whole, is capable of observing the target state vector even if the individual nodes are not capable of observing it locally. The initialization algorithm presented in this work can generate the initial state vector distribution for networks with a variety of sensor types as long as the measurements at the individual nodes are known functions of the target state vector. Initialization is accomplished through a novel distributed implementation of the particle filter that involves serial particle proposal and weighting strategies, which can be accomplished without sharing raw data between individual nodes in the network. The algorithm is capable of handling missed detections and clutter as well as compensating for delays introduced by processing, communication and finite signal propagation velocities. If multiple events of interest occur, their individual states can be initialized simultaneously without requiring explicit data association across nodes. The resulting distributions can be used to initialize a variety of distributed joint tracking algorithms. In such applications, the initialization algorithm can initialize additional target tracks as targets come and go during the operation of the system with multiple targets under track.

Kvantová výpočetní technika je rychle rostoucí obor informatiky, který přenáší principy kvantových jevu do našeho každodenního života. Díky své kvantové podstatě získávají kvantové počítače převahu nad klasickými počítači. V této práci jsme se zaměřili na vysvětlení základů kvantového počítání a jeho implementaci na kvantovém počítači. Zejména se zaměřujeme na popis fungování, konstrukci a implementaci Groverova algoritmu jako jednoho ze základních kvantových algoritmů. Demonstrovali jsme sílu tohoto kvantového algoritmu při prohledávání databáze a porovnávali ho s klasickými nekvantovými algoritmy pomocí implementace prostřednictvím simulačního prostředí QISKit. Pro simulaci jsme použili QASM Simulator a State vector Simulator Aer backends a ukázali, že získané výsledky korelují s dříve diskutovanými teoretickými poznatky. Toto ukazuje, že Groverův algoritmus umožňuje kvadratické zrychlení oproti klasickému nekvantovému vyhledávacímu algoritmu, Použitelnost algoritmu stejně jako ostatních kvantových algoritmů je ale stále omezena několika faktory, mezi které patří vysoké úrovně dekoherence a chyby hradla.

This master's thesis deals with open source PBX security against security attacks. In the theoretical part is detailed description of problematic about attacks that could be used on VoIP systems with high focus on the Denial of Service attack. Furthermore are in theoretical part described methods of security of initialization protocol SIP. Individual chapter is devoted to intrusion detection and prevention of IDS and IPS systems, focusing on Snort and OSSEC. In the practical part of the work was created generator of attacks against various PBX systems, which was subsequently used for detailed testing. Special tests of PBX system are then used against DoS attacks, for which was created protection in form of active elements consisting of IDS Snort & OSSEC. These are capable to provide protection in real-time. The protection was tested on particular PBX systems and in matter of comparison were measured possibilities before and after of security implementation. The output of this work is attacks generator VoIPtester and creation of configuration rules for Snort and OSSEC.

Clustering of observations into groups arises as a fundamental challenge both in academia and industry. Many clustering algorithms exist, and the most widely used clustering algorithm, the K-means, notably suffers from sensitivity to initial allocation of cluster centers. Moreover, many heuristics and algorithms have been developed to find the best initial allocation, and this experimental study compares methods of initialization by measuring how well the initialization methods perform on simulated, small datasets, through various performance criterion. The results show that using the output clusters of a Hierarchical clustering is the best initialization method. Moreover, the most popular methods, Random partitioning and KMeans++, perform poorly. Although the experimental setup may favour some initialization methods over others, the applied researchers are recommended to perform a Hierarchical clustering as an initialization of the K-means algorithm.

Deep neural networks (DNN) have been widely demonstrated to be more powerful than their shallower counterparts in a variety of computer vision tasks and remote sensing applications. However, as many techniques are based on trial-and-error experiments as opposed to systematic evaluation, scientific evidence for the superiority of DNN needs more theoretical and experimental foundations. Recent work has shown that the neural network expressivity, measured by the number of linear regions, is independent of the network structure, suggesting that the success of deep neural networks is attributed to its ease of training. Inspired by this, this project aims to investigate novel approaches to train neural networks and obtain desired properties of the regional properties of linear regions. In particular, it highlights the regional structure of linear regions in different decision regions and seeks to initialize the network in a better position that makes it easier to have this regional structure. By counting the total number of linear regions in the input space, we validated that the shallow wider networks and the deep narrow networks share the same upper-bound expressivity in different synthetic datasets. We also discovered that the linear regions along the decision boundary are larger in shape and fewer in number, while being denser and fitted to the data manifold when close to the data. Our experiments indicate that the proposed initialization method can generate more linear regions at initialization, make the training converge faster, and finally generate linear regions that better fit the data manifold on synthetic data. On the EuroSAT satellite dataset, the proposed initialization method does not facilitate the convergence of ResNet-18, but achieves better performance with an average increase of 0.14% on accuracy compared to pre-trained weights and 0.19% compared to He uniform initialization. / Djupa neurala nätverk (Deep Neural Networks, DNN) har i stor utsträckning visat sig vara mer kraftfulla än sina grunda motsvarigheter i en mängd olika datorseendeuppgifter och fjärranalystillämpningar. Många tekniker är dock baserade på försök och misstag snarare än systematisk utvärdering, och vetenskapliga bevis för DNN:s överlägsenhet behöver mer teoretiska och experimentella grunder. Nyligen utförda arbeten har visat att det neurala nätverkets uttrycksförmåga, mätt som antalet linjära regioner, är oberoende av nätverksstrukturen, vilket tyder på att framgången för djupa neurala nätverk beror på att de är lätta att träna. Inspirerat av detta syftar detta projekt till att undersöka nya metoder för att träna neurala nätverk och få önskade egenskaper hos de regionala egenskaperna hos linjära regioner. I synnerhet belyser det den regionala strukturen hos linjära regioner i olika beslutsregioner och försöker initiera nätverket i ett bättre läge som gör det lättare att få denna regionala struktur. Genom att räkna det totala antalet linjära regioner i ingångsutrymmet validerade vi att de grunda bredare nätverken och de djupa smala nätverken har samma övre gräns för uttrycklighet i olika syntetiska dataset. Vi upptäckte också att de linjära regionerna längs beslutsgränsen är större till formen och färre till antalet, samtidigt som de är tätare och anpassade till datamångfalden när de ligger nära data. Våra experiment visar att den föreslagna initialiseringsmetoden kan generera fler linjära regioner vid initialiseringen, få träningen att konvergera snabbare och slutligen generera linjära regioner som bättre passar datamångfalden på syntetiska data. På EuroSAT-satellitdatamängden underlättar den föreslagna initialiseringsmetoden inte konvergensen för ResNet-18, men uppnår bättre prestanda med en genomsnittlig ökning av noggrannheten med 0,14% jämfört med förtränade vikter och 0,19% jämfört med He uniform initialisering.

[pt] Esta Dissertação procura, sob um enfoque freqüentista, discutir tecnologias para que se imponham restrições no processo de estimação de componentes não observáveis associadas a um modelo em Espaço de Estado (EE) arbitrário. O escopo do texto abrange desde procedimentos propostos pioneiramente por Howard Doran para restrições de igualdade, lineares e/ou não lineares, invariantes ou variantes no tempo, em modelos em EE lineares, até a adoção e o ajuste de estruturas mais delicadas, como os modelos em EE não lineares. Entende-se que estes últimos se constituem em uma alternativa relevante, caso seja requerida, por exemplo, a imposição de restrições de desigualdade. Técnicas e estratégias de implementação são apresentadas, debatidas e comparadas, incluindo-se também o processo de estimação de parâmetros desconhecidos e a questão de diagnósticos. Ao final, são apresentados exercícios empíricos com base nas tecnologias discutidas. Os modelos propostos para esta ilustração visam à realização da análise dinâmica de estilo baseado no retorno para carteiras de investimento brasileiras (a versão estática desses modelos fora introduzida por William Sharpe, para carteiras norte-americanas), os quais devem, eventualmente, abranger dois tipos de restrições nas componentes de interesse, quais sejam, um de igualdade e outro de desigualdade. / [en] This Dissertation aims, in a frequentist way, to discuss technologies for imposing restrictions in non-observable components associated with an arbitrary State Space (SS) model. The text scope ranges from procedures proposed originally by Howard Doran for equality, linear or non- linear, time invariant or time varying restrictions in a linear SS model, to adoption and estimation of more complicated structures like non-linear SS models. It is understood that these last ones are a relevant alternative, in cases of, for instance, inequality restrictions requirement. Implementation techniques and strategies are given, debated and compared, also including unknown parameters estimation and diagnostics analysis. At the end, empirical exercises are presented based on discussed methodologies. The proposed models for this illustration aim at dynamic return based style analysis for Brazilian investment portfolios (the static version of these models had been introduced by William Sharpe, for American portfolios), which shall eventually satisfy two kinds of restrictions on components of interest, namely one of equality and other of inequality.

<p>Signal processing within the neurophysiological field is challenging and requires short processing time and reliable results. In this thesis, three main problems are considered.</p><p>First, a modified line source model for simulation of muscle action potentials (APs) is presented. It is formulated in continuous-time as a convolution of a muscle-fiber dependent transmembrane current and an electrode dependent weighting (impedance) function. In the discretization of the model, the Nyquist criterion is addressed. By applying anti-aliasing filtering, it is possible to decrease the discretization frequency while retaining the accuracy. Finite length muscle fibers are incorporated in the model through a simple transformation of the weighting function. The presented model is suitable for modeling large motor units.</p><p>Second, the possibility of discerning the individual AP components of the concentric needle electromyogram (EMG) is explored. Simulated motor unit APs (MUAPs) are prefiltered using Wiener filtering. The mean fiber concentration (MFC) and jitter are estimated from the prefiltered MUAPs. The results indicate that the assessment of the MFC may well benefit from the presented approach and that the jitter may be estimated from the concentric needle EMG with an accuracy comparable with traditional single fiber EMG.</p><p>Third, automatic, rather than manual, detection and discrimination of recorded C-fiber APs is addressed. The algorithm, detects the Aps reliably using a matched filter. Then, the detected APs are discriminated using multiple hypothesis tracking combined with Kalman filtering which identifies the APs originating from the same C-fiber. To improve the performance, an amplitude estimate is incorporated into the tracking algorithm. Several years of use show that the performance of the algorithm is excellent with minimal need for audit.</p>