Дисертації з теми "Gaussian process mixture model"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Gaussian process mixture model".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Zhang, Lin. "Semiparametric Bayesian Kernel Survival Model for Highly Correlated High-Dimensional Data." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/95040.
Повний текст джерелаPHD
Xu, Li. "Statistical Methods for Variability Management in High-Performance Computing." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/104184.
Повний текст джерелаDoctor of Philosophy
This dissertation focuses on three projects that are all related to statistical methods in performance variability management in high-performance computing (HPC). HPC systems are computer systems that create high performance by aggregating a large number of computing units. The performance of HPC is measured by the throughput of a benchmark called the IOZone Filesystem Benchmark. The performance variability is the variation among throughputs when the system configuration is fixed. Variability management involves studying the relationship between performance variability and the system configuration. In Chapter 2, we use several existing prediction models to predict the standard deviation of throughputs given different system configurations and compare the accuracy of predictions. We also conduct HPC system optimization using the chosen prediction model as the objective function. In Chapter 3, we use the mixture model to determine the number of modes in the distribution of throughput under different system configurations. In addition, we develop a model to determine the number of additional runs for future benchmark experiments. In Chapter 4, we develop a statistical model that can predict the throughout distributions given the system configurations. We also compare the prediction of summary statistics of the throughput distributions with existing prediction models.
Erich, Roger Alan. "Regression Modeling of Time to Event Data Using the Ornstein-Uhlenbeck Process." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1342796812.
Повний текст джерелаBjarnason, Brynjar Smári. "Clustering metagenome contigs using coverage with CONCOCT." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-208944.
Повний текст джерелаMetagenomik möjliggör analys av arvsmassor i mikrobiella floror utan att först behöva odla mikroorgansimerna. Metoden innebär att man läser korta DNA-snuttar som sedan pusslas ihop till längre genomfragment (kontiger). Genom att gruppera kontiger som härstammar från samma organism kan man sedan återskapa mer eller mindre fullständiga genom, men detta är en svår bioinformatisk utmaning. Målsättningen med det här projektet var att utvärdera precisionen med vilken mjukvaran CONCOCT, som vi nyligen utvecklat, grupperar kontiger som härstammar från samma organism baserat på information om kontigernas sekvenskomposition och abundansprofil över olika prover. Vi testade hur olika parametrar påverkade klustringen av kontiger i artificiella metagenomdataset av olika komplexitet som vi skapade in silico genom att blanda data från tidigare sekvenserade genom. Parametrarna som testades rörde indata såväl som den statistiska modell som CONCOCT använder för att utföra klustringen. Parametrarna varierades en i taget medan de andra parametrarna hölls konstanta. Antalet kluster hölls också konstant och motsvarade antalet olika organismer i flororna. Bäst resultat erhölls då vi använde en låst kovariansmodell och använde principalkomponenter som förklarade 90% av variansen, samt filtrerade bort kontiger som var kortare än 3000 baspar. Vi fick också bäst resultat då vi använde alla tillgängliga prover. Därefter använde vi dessa parameterinställningar och lät CONCOCT själv bestämma lämpligt antal kluster i dataseten med “Bayesian Information Criterion” - metoden som då var implementerad i CONCOCT. Detta gav otillfredsställande resultat med i regel för få och för stora kluster. Därför testade vi en alternativ metod, “Dirichlet Process Gaussian Mixture Model”, för att uppskatta antal kluster. Denna metod gav avsevärt bättre resultat och i senare versioner av CONCOCT har en liknande metod implementerats.
Tang, Man. "Statistical methods for variant discovery and functional genomic analysis using next-generation sequencing data." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/104039.
Повний текст джерелаDoctor of Philosophy
The development of high-throughput next-generation sequencing (NGS) techniques produces massive amount of data and bring out innovations in biology and medicine. A greater concentration is needed in developing novel, powerful, and efficient tools for NGS data analysis. In this dissertation, we mainly focus on three problems closely related to NGS and its applications: (1) how to improve variant calling accuracy, (2) how to model transcription factor (TF) binding patterns, and (3) how to quantify of the contribution of TF binding on gene expression. We develop novel statistical methods to identify sequence variants, find TF binding patterns, and explore the relationship between TF binding and gene expressions. We expect our findings will be helpful in promoting a better understanding of disease causality and facilitating the design of personalized treatments.
Fang, Zaili. "Some Advanced Model Selection Topics for Nonparametric/Semiparametric Models with High-Dimensional Data." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/40090.
Повний текст джерелаPh. D.
Chu, Shuyu. "Change Detection and Analysis of Data with Heterogeneous Structures." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/78613.
Повний текст джерелаPh. D.
Lan, Jing. "Gaussian mixture model based system identification and control." [Gainesville, Fla.] : University of Florida, 2006. http://purl.fcla.edu/fcla/etd/UFE0014640.
Повний текст джерелаVakil, Sam. "Gaussian mixture model based coding of speech and audio." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=81575.
Повний текст джерелаThis work introduces a coding scheme which works in a perceptual auditory domain. The input high dimensional frames of audio and speech are transformed to power spectral domain, using either DFT or MDCT. The log spectral vectors are then transformed to the excitation domain. In the quantizer section the vectors are DCT transformed and decorrelated. This operation gives the possibility of using diagonal covariances in modelling the data. Finally, a GMM based VQ is performed on the vectors.
In the decoder part the inverse operations are done. However, in order to prevent negative power spectrum elements due to inverse perceptual transformation in the decoder, instead of direct inversion, a Nonnegative Least Squares Algorithm has been used to switch back to frequency domain. For the sake of comparison, a reference subband based "Excitation Distortion coder" is implemented and comparing the resulting coded files showed a better performance for the proposed GMM based coder.
Sadarangani, Nikhil 1979. "An improved Gaussian mixture model algorithm for background subtraction." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87293.
Повний текст джерелаIncludes bibliographical references (leaves 71-72).
by Nikhil Sadarangani.
M.Eng.
Stuttle, Matthew Nicholas. "A gaussian mixture model spectral representation for speech recognition." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620077.
Повний текст джерелаWang, Juan. "Estimation of individual treatment effect via Gaussian mixture model." HKBU Institutional Repository, 2020. https://repository.hkbu.edu.hk/etd_oa/839.
Повний текст джерелаLu, Liang. "Subspace Gaussian mixture models for automatic speech recognition." Thesis, University of Edinburgh, 2013. http://hdl.handle.net/1842/8065.
Повний текст джерелаDelport, Marion. "A spatial variant of the Gaussian mixture of regressions model." Diss., University of Pretoria, 2017. http://hdl.handle.net/2263/65883.
Повний текст джерелаDissertation (MSc)--University of Pretoria, 2017.
Statistics
MSc
Unrestricted
Srinivasan, Balaji Vasan. "Gaussian process regression for model estimation." College Park, Md.: University of Maryland, 2008. http://hdl.handle.net/1903/8962.
Повний текст джерелаThesis research directed by: Dept. of Electrical and Computer Engineering E. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Cuesta, Ramirez Jhouben Janyk. "Optimization of a computationally expensive simulator with quantitative and qualitative inputs." Thesis, Lyon, 2022. http://www.theses.fr/2022LYSEM010.
Повний текст джерелаIn this thesis, costly mixed problems are approached through gaussian processes where the discrete variables are relaxed into continuous latent variables. the continuous space is more easily harvested by classical bayesian optimization techniques than a mixed space would. discrete variables are recovered either subsequently to the continuous optimization, or simultaneously with an additional continuous-discrete compatibility constraint that is handled with augmented lagrangians. several possible implementations of such bayesian mixed optimizers are compared. in particular, the reformulation of the problem with continuous latent variables is put in competition with searches working directly in the mixed space. among the algorithms involving latent variables and an augmented lagrangian, a particular attention is devoted to the lagrange multipliers for which a local and a global estimation techniques are studied. the comparisons are based on the repeated optimization of three analytical functions and a mechanical application regarding a beam design. an additional study for applying a proposed mixed optimization strategy in the field of mixed self-calibration is made. this analysis was inspired in an application in radionuclide quantification, which defined an specific inverse function that required the study of its multiple properties in the continuous scenario. a proposition of different deterministic and bayesian strategies was made towards a complete definition in a mixed variable setup
Tran, Denis. "A study of bit allocation for Gaussian mixture model quantizers and image coders /." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=83937.
Повний текст джерелаFirst, a Greedy level allocation algorithm is developed based on the philosophy of the Greedy algorithin but, it does so level by level, considering the best benefit and bit cost yielded by an allocation. The Greedy level allocation algorithm is computationally intensive in general, thus we discuss combining it with other algorithms to obtain lower costs.
Second, another algorithm solving problems of negative bit allocations and integer level is proposed. The level allocations are to keep a certain ratio with respect to each other throughout the algorithm in order to remain closest to the condition for lowest distortion. Moreover, the original formula assumes a 6dB gain for each added bit, which is not generally true. The algorithm presents a new parameter k, which controls the benefit of adding one bit, usually set at 0.5 in the high-rate optimal bit allocation formula for MSE calling the new algorithm, the Two-Stage Iterative Bit Allocation (TSIBA) algorithm. Simulations show that modifying the bit allocation formula effectively brings about some gains over the previous methods.
The formula containing the new parameter is generalized into a, formula introducing a new parameter which weights not only the variances but also the dimensions, training the new parameter on their distribution function. The TSIBA was an a-posteriori decision algorithm, where the decision on which value of k to select for lowest distortion was decided after computing all distortions. The Generalized TSIBA (GTSIBA), on the other hand, uses a training procedure to estimate which weighting factor to set for each dimension at a certain bit rate. Simulation results show yet another improvement when using the Generalized TSIBA over all previous methods.
Seidu, Mohammed Nazib. "Predicting Bankruptcy Risk: A Gaussian Process Classifciation Model." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119120.
Повний текст джерелаAdamou, Maria. "Bayesian optimal designs for the Gaussian Process Model." Thesis, University of Southampton, 2014. https://eprints.soton.ac.uk/373881/.
Повний текст джерелаShashidhar, Sanda, and Amirisetti Sravya. "Online Handwritten Signature Verification System : using Gaussian Mixture Model and Longest Common Sub-Sequences." Thesis, Blekinge Tekniska Högskola, Institutionen för tillämpad signalbehandling, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-15807.
Повний текст джерелаMoradiannejad, Ghazaleh. "People Tracking Under Occlusion Using Gaussian Mixture Model and Fast Level Set Energy Minimization." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/24304.
Повний текст джерелаWebb, Grayson. "A Gaussian Mixture Model based Level Set Method for Volume Segmentation in Medical Images." Thesis, Linköpings universitet, Beräkningsmatematik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148548.
Повний текст джерелаLindström, Kevin. "Fault Clustering With Unsupervised Learning Using a Modified Gaussian Mixture Model and Expectation Maximization." Thesis, Linköpings universitet, Fordonssystem, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-176535.
Повний текст джерелаMalsiner-Walli, Gertraud, Sylvia Frühwirth-Schnatter, and Bettina Grün. "Model-based clustering based on sparse finite Gaussian mixtures." Springer, 2016. http://dx.doi.org/10.1007/s11222-014-9500-2.
Повний текст джерелаFry, James Thomas. "Hierarchical Gaussian Processes for Spatially Dependent Model Selection." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/84161.
Повний текст джерелаPh. D.
Cheng, Nan. "Bayesian Nonparametric Reliability Analysis Using Dirichlet Process Mixture Model." Ohio University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1307988021.
Повний текст джерелаFergie, Martin Paul. "Discriminative pose estimation using mixtures of Gaussian processes." Thesis, University of Manchester, 2013. https://www.research.manchester.ac.uk/portal/en/theses/discriminative-pose-estimation-using-mixtures-of-gaussian-processes(462e72b8-ab98-4517-9649-4c2b9bec4b04).html.
Повний текст джерелаYang, Xiaoke. "Fault-tolerant predictive control : a Gaussian process model based approach." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708784.
Повний текст джерелаKawaguchi, Nobuo, Katsuhiko Kaji, Susumu Fujita, 信夫 河口, 克彦 梶 та 迪. 藤田. "Gaussian Mixture Model を用いた無線LAN位置推定手法". 一般社団法人情報処理学会, 2010. http://hdl.handle.net/2237/15430.
Повний текст джерелаKawaguchi, Nobuo, Katsuhiko Kaji, Susumu Fujita, 信夫 河口, 克彦 梶 та 迪. 藤田. "Gaussian Mixture Model を用いた無線LAN位置推定手法". 一般社団法人情報処理学会, 2011. http://hdl.handle.net/2237/15440.
Повний текст джерелаDahlqwist, Elisabeth. "Birthweight-specific neonatal health : With application on data from a tertiaryhospital in Tanzania." Thesis, Uppsala universitet, Statistiska institutionen, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-227531.
Повний текст джерелаZhang, Huaiye. "Bayesian Approach Dealing with Mixture Model Problems." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/37681.
Повний текст джерелаPh. D.
Su, Weiji. "Flexible Joint Hierarchical Gaussian Process Model for Longitudinal and Recurrent Event Data." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1595850414934069.
Повний текст джерелаRezvani, Arany Roushan. "Gaussian Process Model Predictive Control for Autonomous Driving in Safety-Critical Scenarios." Thesis, Linköpings universitet, Reglerteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-161430.
Повний текст джерелаTomashenko, Natalia. "Speaker adaptation of deep neural network acoustic models using Gaussian mixture model framework in automatic speech recognition systems." Thesis, Le Mans, 2017. http://www.theses.fr/2017LEMA1040/document.
Повний текст джерелаDifferences between training and testing conditions may significantly degrade recognition accuracy in automatic speech recognition (ASR) systems. Adaptation is an efficient way to reduce the mismatch between models and data from a particular speaker or channel. There are two dominant types of acoustic models (AMs) used in ASR: Gaussian mixture models (GMMs) and deep neural networks (DNNs). The GMM hidden Markov model (GMM-HMM) approach has been one of the most common technique in ASR systems for many decades. Speaker adaptation is very effective for these AMs and various adaptation techniques have been developed for them. On the other hand, DNN-HMM AMs have recently achieved big advances and outperformed GMM-HMM models for various ASR tasks. However, speaker adaptation is still very challenging for these AMs. Many adaptation algorithms that work well for GMMs systems cannot be easily applied to DNNs because of the different nature of these models. The main purpose of this thesis is to develop a method for efficient transfer of adaptation algorithms from the GMM framework to DNN models. A novel approach for speaker adaptation of DNN AMs is proposed and investigated. The idea of this approach is based on using so-called GMM-derived features as input to a DNN. The proposed technique provides a general framework for transferring adaptation algorithms, developed for GMMs, to DNN adaptation. It is explored for various state-of-the-art ASR systems and is shown to be effective in comparison with other speaker adaptation techniques and complementary to them
Kullmann, Emelie. "Speech to Text for Swedish using KALDI." Thesis, KTH, Optimeringslära och systemteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189890.
Повний текст джерелаDe senaste åren har olika tillämpningar inom människa-dator interaktion och främst taligenkänning hittat sig ut på den allmänna marknaden. Många system och tekniska produkter stöder idag tjänsterna att transkribera tal och diktera text. Detta gäller dock främst de större språken och sällan finns samma stöd för mindre språk som exempelvis svenskan. I detta examensprojekt har en modell för taligenkänning på svenska ut- vecklas. Det är genomfört på uppdrag av Sveriges Radio som skulle ha stor nytta av en fungerande taligenkänningsmodell på svenska. Modellen är utvecklad i ramverket Kaldi. Två tillvägagångssätt för den akustiska träningen av modellen är implementerade och prestandan för dessa två är evaluerade och jämförda. Först tränas en modell med användningen av Hidden Markov Models och Gaussian Mixture Models och slutligen en modell där Hidden Markov Models och Deep Neural Networks an- vänds, det visar sig att den senare uppnår ett bättre resultat i form av måttet Word Error Rate.
Slifko, Matthew D. "The Cauchy-Net Mixture Model for Clustering with Anomalous Data." Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/93576.
Повний текст джерелаDoctor of Philosophy
We live in the data explosion era. The unprecedented amount of data offers a potential wealth of knowledge but also brings about concerns regarding ethical collection and usage. Mistakes stemming from anomalous data have the potential for severe, real-world consequences, such as when building prediction models for housing prices. To combat anomalies, we develop the Cauchy-Net Mixture Model (CNMM). The CNMM is a flexible tool for identifying and isolating the anomalies, while simultaneously discovering cluster structure and making predictions among the nonanomalous observations. The result is a framework that allows for simultaneously clustering and predicting in the face of the anomalous data. We demonstrate the usefulness of the CNMM in a variety of experimental situations and apply the model for predicting housing prices in Fairfax County, Virginia.
Minh, Tuan Pham, Tomohiro Yoshikawa, Takeshi Furuhashi, and Kaita Tachibana. "Robust feature extractions from geometric data using geometric algebra." IEEE, 2009. http://hdl.handle.net/2237/13896.
Повний текст джерелаYang, Chenguang. "Security in Voice Authentication." Digital WPI, 2014. https://digitalcommons.wpi.edu/etd-dissertations/79.
Повний текст джерелаBekli, Zeid, and William Ouda. "A performance measurement of a Speaker Verification system based on a variance in data collection for Gaussian Mixture Model and Universal Background Model." Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20122.
Повний текст джерелаZhao, David Yuheng. "Model Based Speech Enhancement and Coding." Doctoral thesis, Stockholm : Kungliga Tekniska högskolan, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4412.
Повний текст джерелаBakhtiari, Koohsorkhi Alireza. "Analysis of the Dirichlet Process Mixture Model with Application to Dialogue Act Classification." Thesis, Université Laval, 2011. http://www.theses.ulaval.ca/2011/28503/28503.pdf.
Повний текст джерелаRecognition of user intentions is one of the most challenging problems in the design of dialogue systems. These intentions are usually coded in terms of Dialogue Acts (Following Austin’s work on speech act theory), where a functional role is assigned to each utterance of a conversation. Manual annotation of dialogue acts is both time consuming and expensive, therefore there is a huge interest in systems which are able to automatically annotate dialogue corpora. In this thesis, we propose a nonparametric Bayesian approach for the automatic classification of dialogue acts. We make use of the Dirichlet Process Mixture Model (DPMM), within which each of the components is governed by a Dirichlet-Multinomial distribution. Two novel approaches for hyperparameter estimation in these distributions are also introduced. Results of the application of this model to the DIHANA corpus shows that the DPMM can successfully recover the true number of DA labels with high precision
Liu, Xi. "Semi-parametric Bayesian Inference of Accelerated Life Test Using Dirichlet Process Mixture Model." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1447193154.
Повний текст джерелаKim, Sinae. "Bayesian variable selection in clustering via dirichlet process mixture models." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5888.
Повний текст джерела"ADAPTIVE LEARNING OF NEURAL ACTIVITY DURING DEEP BRAIN STIMULATION." Master's thesis, 2015. http://hdl.handle.net/2286/R.I.29727.
Повний текст джерелаDissertation/Thesis
Masters Thesis Electrical Engineering 2015
(11073474), Bin Zhang. "Data-driven Uncertainty Analysis in Neural Networks with Applications to Manufacturing Process Monitoring." Thesis, 2021.
Знайти повний текст джерелаArtificial neural networks, including deep neural networks, play a central role in data-driven science due to their superior learning capacity and adaptability to different tasks and data structures. However, although quantitative uncertainty analysis is essential for training and deploying reliable data-driven models, the uncertainties in neural networks are often overlooked or underestimated in many studies, mainly due to the lack of a high-fidelity and computationally efficient uncertainty quantification approach. In this work, a novel uncertainty analysis scheme is developed. The Gaussian mixture model is used to characterize the probability distributions of uncertainties in arbitrary forms, which yields higher fidelity than the presumed distribution forms, like Gaussian, when the underlying uncertainty is multimodal, and is more compact and efficient than large-scale Monte Carlo sampling. The fidelity of the Gaussian mixture is refined through adaptive scheduling of the width of each Gaussian component based on the active assessment of the factors that could deteriorate the uncertainty representation quality, such as the nonlinearity of activation functions in the neural network.
Following this idea, an adaptive Gaussian mixture scheme of nonlinear uncertainty propagation is proposed to effectively propagate the probability distributions of uncertainties through layers in deep neural networks or through time in recurrent neural networks. An adaptive Gaussian mixture filter (AGMF) is then designed based on this uncertainty propagation scheme. By approximating the dynamics of a highly nonlinear system with a feedforward neural network, the adaptive Gaussian mixture refinement is applied at both the state prediction and Bayesian update steps to closely track the distribution of unmeasurable states. As a result, this new AGMF exhibits state-of-the-art accuracy with a reasonable computational cost on highly nonlinear state estimation problems subject to high magnitudes of uncertainties. Next, a probabilistic neural network with Gaussian-mixture-distributed parameters (GM-PNN) is developed. The adaptive Gaussian mixture scheme is extended to refine intermediate layer states and ensure the fidelity of both linear and nonlinear transformations within the network so that the predictive distribution of output target can be inferred directly without sampling or approximation of integration. The derivatives of the loss function with respect to all the probabilistic parameters in this network are derived explicitly, and therefore, the GM-PNN can be easily trained with any backpropagation method to address practical data-driven problems subject to uncertainties.
The GM-PNN is applied to two data-driven condition monitoring schemes of manufacturing processes. For tool wear monitoring in the turning process, a systematic feature normalization and selection scheme is proposed for the engineering of optimal feature sets extracted from sensor signals. The predictive tool wear models are established using two methods, one is a type-2 fuzzy network for interval-type uncertainty quantification and the other is the GM-PNN for probabilistic uncertainty quantification. For porosity monitoring in laser additive manufacturing processes, convolutional neural network (CNN) is used to directly learn patterns from melt-pool patterns to predict porosity. The classical CNN models without consideration of uncertainty are compared with the CNN models in which GM-PNN is embedded as an uncertainty quantification module. For both monitoring schemes, experimental results show that the GM-PNN not only achieves higher prediction accuracies of process conditions than the classical models but also provides more effective uncertainty quantification to facilitate the process-level decision-making in the manufacturing environment.
Based on the developed uncertainty analysis methods and their proven successes in practical applications, some directions for future studies are suggested. Closed-loop control systems may be synthesized by combining the AGMF with data-driven controller design. The AGMF can also be extended from a state estimator to the parameter estimation problems in data-driven models. In addition, the GM-PNN scheme may be expanded to directly build more complicated models like convolutional or recurrent neural networks.
Lai, Chu-Shiuan, and 賴竹煖. "Gaussian Mixture of Background and Shadow Model." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/38760050190895130218.
Повний текст джерела國立臺灣師範大學
資訊工程研究所
98
In this paper, we integrate shadow information into the background model of a scene in an attempt to detect both shadows and foreground objects at a time. Since shadows accompanying foreground objects are viewed as parts of the foreground objects, shadows will be extracted as well during foreground object detection. Shadows can distort object shapes and may connect multiple objects into one object. On the other hand, shadows tell the directions of light sources. In other words, shadows can be advantageous as well as disadvantageous. To begin, we use an adaptive Gaussian mixture model to describe the background of a scene. Based on this preliminary background model, we extract foreground objects and their accompanying shadows. Shadows are next separated from foreground objects through a series of intensity and color analyses. The characteristics of shadows are finally determined with the principal component analysis method and are embedded as an additional Gaussian in the background model. Experimental results demonstrated the feasibility of the proposed background model. Keywords: Dynamic scene, Adaptive Gaussian Mixture Model, Foreground detection, Shadow detection
Sue, Yung-Chun, and 蘇詠鈞. "Specified Gestures Identification using Gaussian Mixture Model." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/15219540833691164661.
Повний текст джерела清雲科技大學
電子工程所
100
Sign language recognition technique is composed by the hand images detection and the hand gestures recognition. Hand images detection is locating the sign language select, sign language capture, the palm and fingers part from the sensed image, and rotating them to the appropriate hand posture, both are the important pre-processing for sign language identification and recognition. This paper first introduced sequentially throughout the study practices, as well as the process of image pre-processing instructions. The major work in the hand gestures recognition is to identify the variance of the fingers. In this paper the creation of sign language image of slash encoding, Department of the advantages of slash encoding the difference between your fingers the number of changes, and the Gaussian mixture model (GMM) to establish the model of sign language and identification. Such as poor recognition rate is adjusted probability distribution of weight values to improve the recognition rate. The entire the paper Shushing is the Gaussian mixture model (GMM), slash code, adjust the probability distribution of the weight value. Finally, after adjusting the probability distribution of weight values, we learned from the conclusion that the overall recognition results rose to 98.33%from 92.66% of the original, so changing the probability distribution of the weight value can effectively improve the recognition rate.
莊清乾. "Automatic Bird Songs Recognition using Gaussian Mixture Model." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/09774268339453426682.
Повний текст джерела中華大學
資訊工程學系(所)
96
In this paper, Gaussian mixture models (GMM) were applied to identify bird species from their sounds. First, each syllable corresponding to a piece of vocalization is manually segmented. Two-dimension MFCC (TDMFCC), dynamic two-dimension MFCC (DTDMFCC), and normalized audio spectrum envelope (NASE) modulation coefficients are calculated for each syllable and regarded as the vocalization features of each syllable. Principal component analysis (PCA) is used to reduce the feature space dimension of the original input features vector space. GMM is used to cluster the feature vectors from the same bird species into several groups with each group represented by a Gaussian distribution. The self-splitting Gaussian mixture learning (SGML) algorithm is then employed to find an appropriate number of Gaussian components for each GMM. In addition, a model selection algorithm based on the Bayesian information criterion (BIC) is applied to select the optimal model between GMM and extended VQ (EVQ) according to the amount of training data available. Linear discriminant analysis (LDA) is finally exploited to increase the classification accuracy at a lower dimensional feature vector space. In our experiments, the combination of TDMFCC, DTDMFCC, and NASE modulation coefficients achieve the average classification accuracy of 83.9% for the classification of 28 bird species.
LIN, YU-JUNG, and 林昱融. "Modified Gaussian Mixture Model Applied to Speaker Verification." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/33cbau.
Повний текст джерела中央警察大學
刑事警察研究所
104
Gaussian mixture model (GMM) is a combination of a plurality of Gaussian probability density function, it can be smoothly approximate the probability density distribution of any arbitrary shape. In various areas of pattern recognition, it has a good recognition results. However, during building the speaker model process, we must determine the parameters of each Gaussian probability density function through constantly iterative calculation, the calculation process is quite complex. This paper presents modified Gaussian mixture model, each characteristic for recognition has its own independent Gaussian probability density function. Since the process without iteration, it can significantly reduce the amount of calculation. And the speaker verification results show that it can still maintain a good recognition results. In this paper, we use Mel frequency cepstral coefficients(MFCCs) as the voice characteristic for speaker verification. The average error rate for speaker verification on Gaussian mixture model is 0.5901%, while it on modified Gaussian mixture model is 1.6700%, the gap between them was 1.0799%. The error rate of two methods during the speaker verification has less difference. But in the speaker model build process, modified Gaussian mixture model does not need to go through an iterative calculation. The calculation ways and time are more simple and faster than Gaussian mixture model. It can also be another consideration of algorithm for more speed and convenience.