Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Gaussian mixture model" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    On an Improvement of the Model-Based Clustering Method
    O pewnej modyfikacji w metodzie taksonomii opartej na modelach mieszanych
    Autorzy:
    Witek, Ewa
    Powiązania:
    https://bibliotekanauki.pl/articles/906293.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
    Tematy:
    Model-based clustering (MBC)
    Gaussian mixture models
    EM algorithm
    MLE
    MAP
    BIC
    conjugate prior
    Opis:
    W artykule przedstawiona została modyfikacja metody taksonomii opartej na modelach mieszanych, w przypadku gdy niemożliwym staje się oszacowanie parametrów modelu za pomocą algorytmu EM. Gdy liczba obiektów przypisanych do klasy jest mniejsza niż liczba zmiennych opisujących te obiekty, niemożliwym staje się oszacowanie parametrów modelu. By uniknąć tej sytuacji estymatory największej wiarygodności zastępowane są estymatorami o największym prawdopodobieństwie a posteriori. Wybór modelu o najlepszej parametryzacji i stosownej liczbie klas dokonywany jest wówczas za pomocą zmodyfikowanej statystyki BIC.
    An improvement o f the model-based clustering (MBC) method in the case when EM algorithm fails as a result o f singularities is the basic aim o f this paper. Replacement o f the maximum likelihood (MLE) estimator by a maximum a posteriori (MAP) estimator, also found by the EM algorithm is proposed. Models with different number o f components are compared using a modified version o f BIC, where the likelihood is evaluated at the MAP instead o f MLE. A highly dispersed proper conjugate prior is shown to avoid singularities, but when these are not present it gives similar results to the standard method o f MBC.
    Źródło:
    Acta Universitatis Lodziensis. Folia Oeconomica; 2009, 228
    0208-6018
    2353-7663
    Pojawia się w:
    Acta Universitatis Lodziensis. Folia Oeconomica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Automated tracking and real time following of moving person for robotics applications
    Autorzy:
    Patoliya, Jignesh J.
    Mewada, Hiren K.
    Powiązania:
    https://bibliotekanauki.pl/articles/384835.pdf
    Data publikacji:
    2019
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    visual tracking
    robot operating system
    identity retention
    Gaussian Mixture Model
    Opis:
    Presently the interaction of robots with human plays an important role in various social applications. Reliable tracking is an important aspect for the social robots where robots need to follow the moving person. This paper proposes the implementation of automated tracking and real time following algorithm for robotic automation. Occlusion and identity retention are the major challenges in the tracking process. Hence, a feature set based identity retention algorithm is used and integrated with robot operating system. The tracking algorithm is implemented using robot operating system in Linux and using OpenCV. The tracking algorithm achieved 85% accuracy and 72.30% precision. Further analysis of tracking algorithm corresponds to the integration of ROS and OpenCV is presented. The analysis of tracking algorithm concludes that ROS linking required 0.64% more time in comparison with simple OpenCV code based tracking algorithm.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2019, 13, 4; 31-37
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fitting a Gaussian mixture model through the Gini index
    Autorzy:
    López-Lobato, Adriana Laura
    Avendaño-Garrido, Martha Lorena
    Powiązania:
    https://bibliotekanauki.pl/articles/2055144.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    Gini index problem
    Gaussian mixture model
    clustering
    indeks Giniego
    model mieszaniny Gaussa
    grupowanie
    Opis:
    A linear combination of Gaussian components is known as a Gaussian mixture model. It is widely used in data mining and pattern recognition. In this paper, we propose a method to estimate the parameters of the density function given by a Gaussian mixture model. Our proposal is based on the Gini index, a methodology to measure the inequality degree between two probability distributions, and consists in minimizing the Gini index between an empirical distribution for the data and a Gaussian mixture model. We will show several simulated examples and real data examples, observing some of the properties of the proposed method.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 3; 487--500
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Estimation of parameters of Gaussian mixture models by a hybrid method combining a self-adaptive differential evolution with the EM algorithm
    Estymacja parametrów modeli mieszanin rozkładów normalnych przy pomocy metody hybrydowej łączącej samoadaptacyjną ewolucję różnicową z algorytmem EM
    Autorzy:
    Kwedlo, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/88410.pdf
    Data publikacji:
    2014
    Wydawca:
    Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
    Tematy:
    mieszaniny rozkładów normalnych
    ewolucja różnicowa
    algorytm EM
    grupowanie danych
    Gaussian mixture models
    differential evolution
    expectation maximization
    model-based clustering
    Opis:
    In the paper the problem of learning of Gaussian mixture models (GMMs) is considered. A new approach based on hybridization of a self-adaptive version of differential evolution (DE) with the classical EM algorithm is described. In this approach, called DEEM, the EM algorithm is run until convergence to fine-tune each solution obtained by the mutation and crossover operators of DE. To avoid the problem with parameter representation and infeasible solutions we use a method in which the covariance matrices are encoded using their Cholesky factorizations. In a simulation study GMMs were used to cluster synthetic datasets differing by a degree of separation between clusters. The results of experiments indicate that DE-EM outperforms the standard multiple restart expectation-maximization algorithm (MREM). For datasets with high number of features it also outperforms the state of-the-art random swap EM (RSEM).
    W pracy poruszono problem uczenia modeli mieszanin rozkładów normalnych. Zaproponowano nowe podejście, nazwane DE-EM, oparte na hybrydyzacji samoadaptacyjnego algorytmu ewolucji różnicowej i klasycznego algorytmu EM. W nowej metodzie rozwiązanie otrzymane jako wynik operatorów mutacji i krzyżowania jest poddawane optymalizacji lokalnej, prowadzonej aż do momentu uzyskania zbieżności, przez algorytm EM. Aby uniknąć problemu z reprezentacją macierzy kowariancji i niedopuszczalności rozwiązań użyto metody, w której macierze kowariancji są kodowane przy pomocy dekompozycji Cholesky’ego. W badaniach symulacyjnych modele mieszanin rozkładów normalnych zastosowano do grupowania danych syntetycznych. Wyniki eksperymentów wskazują, że metoda DE-EM osiąga lepsze wyniki niż standardowa technika wielokrotnego startu algorytmu ˙ EM. Dla zbiorów danych z dużą liczbą cech, metoda osiąga lepsze wyniki niż technika losowej wymiany rozwiązań połączona z algorytmem EM.
    Źródło:
    Advances in Computer Science Research; 2014, 11; 109-123
    2300-715X
    Pojawia się w:
    Advances in Computer Science Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Speech emotion recognition under white noise
    Autorzy:
    Huang, C.
    Chen, G.
    Yu, H.
    Bao, Y.
    Zhao, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/177301.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    speech emotion recognition
    speech enhancement
    emotion model
    Gaussian mixture model
    Opis:
    Speaker‘s emotional states are recognized from speech signal with Additive white Gaussian noise (AWGN). The influence of white noise on a typical emotion recogniztion system is studied. The emotion classifier is implemented with Gaussian mixture model (GMM). A Chinese speech emotion database is used for training and testing, which includes nine emotion classes (e.g. happiness, sadness, anger, surprise, fear, anxiety, hesitation, confidence and neutral state). Two speech enhancement algorithms are introduced for improved emotion classification. In the experiments, the Gaussian mixture model is trained on the clean speech data, while tested under AWGN with various signal to noise ratios (SNRs). The emotion class model and the dimension space model are both adopted for the evaluation of the emotion recognition system. Regarding the emotion class model, the nine emotion classes are classified. Considering the dimension space model, the arousal dimension and the valence dimension are classified into positive regions or negative regions. The experimental results show that the speech enhancement algorithms constantly improve the performance of our emotion recognition system under various SNRs, and the positive emotions are more likely to be miss-classified as negative emotions under white noise environment.
    Źródło:
    Archives of Acoustics; 2013, 38, 4; 457-463
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Hybrid texture and gradient modeling for dynamic background subtraction identification systemin tobacco plant using 5G data service
    Autorzy:
    Gowda Thirthe, M.T.
    Chandrika, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/38699145.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Podstawowych Problemów Techniki PAN
    Tematy:
    background subtraction
    local binary pattern
    tobacco plant
    texture
    Gaussian mixture model
    illumination change
    plant disease identification system
    usuwanie tła
    lokalny wzorzec binarny
    tytoń
    tekstura
    model mieszaniny Gaussa
    zmiana oświetlenia
    system identyfikacji chorób roślin
    Opis:
    Background: Detecting the plants as objects of interest in any vision-based input sequence is highly complex due to nonlinear background objects such as rocks, shadows,etc. Therefore, it is a difficult task and an emerging one with the development of precision agriculture systems. The nonlinear variations of pixel intensity with illuminationand other causes such as blurs and poor video quality also make the object detection taskchallenging. To detect the object of interest, background subtraction (BS) is widely usedin many plant disease identification systems, and its detection rate largely depends on thenumber of features used to suppress and isolate the foreground region and its sensitivitytoward image nonlinearity. Methodology: A hybrid invariant texture and color gradient-based approach is proposed to model the background for dynamic BS, and its performance is validated byvarious real-time video captures covering different kinds of complex backgrounds and various illumination changes. Based on the experimental results, a simple multimodal featureattribute, which includes several invariant texture measures and color attributes, yieldsfinite precision accuracy compared with other state-of-art detection methods. Experimental evaluation of two datasets shows that the new model achieves superior performanceover existing results in spectral-domain disease identification model. 5G assistance: After successful identification of tobacco plant and its analysis, the finalresults are stored in a cloud-assisted server as a database that allows all kinds of 5G servicessuch as IoT and edge computing terminals for data access with valid authentication fordetailed analysis and references.
    Źródło:
    Computer Assisted Methods in Engineering and Science; 2023, 30, 1; 41-54
    2299-3649
    Pojawia się w:
    Computer Assisted Methods in Engineering and Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Preprocessing large datasets using Gaussian mixture modelling to improve prediction accuracy of truck productivity at mine sites
    Autorzy:
    Fan, Chengkai
    Zhang, Na
    Jiang, Bei
    Liu, Wei Victor
    Powiązania:
    https://bibliotekanauki.pl/articles/2203342.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    kopalnia
    samochód ciężarowy
    piasek roponośny
    oil sands mining
    mine truck productivity
    Gaussian mixture model
    latent variable
    prediction accuracy
    relative importance
    Opis:
    The historical datasets at operating mine sites are usually large. Directly applying large datasets to build prediction models may lead to inaccurate results. To overcome the real-world challenges, this study aimed to handle these large datasets using Gaussian mixture modelling (GMM) for developing a novel and accurate prediction model of truck productivity. A large dataset of truck haulage collected at operating mine sites was clustered by GMM into three latent classes before the prediction model was built. The labels of these latent classes generated a latent variable. Two multiple linear regression (MLR) models were then constructed, including the ordinary-MLR (O-MLR) and the hybrid GMM-MLR models. The GMM-MLR model incorporated the observed input variables and a latent variable in the form of interaction terms. The O-MLR model was the baseline model and did not involve the latent variable. The GMM-MLR model performed considerably better than the O-MLR model in predicting truck productivity. The interaction terms quantitatively measured the differences in how the observed input variables affected truck productivity in three classes (high, medium, and low truck productivity). The haul distance was the most crucial input variable in the GMM-MLR model. This study provides new insights into handling massive amounts of data in truck haulage datasets and a more accurate prediction model for truck productivity.
    Źródło:
    Archives of Mining Sciences; 2022, 67, 4; 661--680
    0860-7001
    Pojawia się w:
    Archives of Mining Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An improved ant colony optimization algorithm and its application to text-independent speaker verification system
    Autorzy:
    Aghdam, M. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/91678.pdf
    Data publikacji:
    2012
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    ant colony
    optimization
    ant colony optimization
    ACO
    security
    automatic speaker verification
    ASV
    feature space
    Gaussian mixture model universal background model
    GMM-UBM
    Opis:
    With the growing trend toward remote security verification procedures for telephone banking, biometric security measures and similar applications, automatic speaker verification (ASV) has received a lot of attention in recent years. The complexity of ASV system and its verification time depends on the number of feature vectors, their dimensionality, the complexity of the speaker models and the number of speakers. In this paper, we concentrate on optimizing dimensionality of feature space by selecting relevant features. At present there are several methods for feature selection in ASV systems. To improve performance of ASV system we present another method that is based on ant colony optimization (ACO) algorithm. After feature selection phase, feature vectors are applied to a Gaussian mixture model universal background model (GMM-UBM) which is a text-independent speaker verification model. The performance of proposed algorithm is compared to the performance of genetic algorithm on the task of feature selection in TIMIT corpora. The results of experiments indicate that with the optimized feature set, the performance of the ASV system is improved. Moreover, the speed of verification is significantly increased since by use of ACO, number of features is reduced over 80% which consequently decrease the complexity of our ASV system.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 4; 301-315
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies