• Title/Summary/Keyword: Minimum description length

Search Result 22, Processing Time 0.025 seconds

Prediction of Childhood Asthma Using Expectation Maximization and Minimum Description Length Algorithm

  • Kim, Hyo Seon;Park, Jong Suk;Nam, Dong Kyu;Jung, Yong Gyu
    • International Journal of Advanced Culture Technology
    • /
    • v.8 no.3
    • /
    • pp.275-279
    • /
    • 2020
  • Due to the recent rapid industrialization worldwide, the number of pediatric asthma patients is increasing. And the fine dust containing heavy metals is linked to the characteristics of high toxic lead due to the increase heating in factory operation and automobile driving. It is the reason of arsenic increasing. In the treatment of pediatric asthma patients, drug administration, oral drug entry, and HMPC (Home Management Plan of Care) are used. In this paper, we analyze the relationship between the onset of asthma and the method of prescription for specific childhood asthma in the United States using EM (Expectation Maximization) and MDL (Minimum Description Length) algorithms. And the association is also analyzed by comparing the nature of specific congestion between the past prevalence of digestive asthma and the recent prevalence of environmental pollution.

A New Distance Measure for a Variable-Sized Acoustic Model Based on MDL Technique

  • Cho, Hoon-Young;Kim, Sang-Hun
    • ETRI Journal
    • /
    • v.32 no.5
    • /
    • pp.795-800
    • /
    • 2010
  • Embedding a large vocabulary speech recognition system in mobile devices requires a reduced acoustic model obtained by eliminating redundant model parameters. In conventional optimization methods based on the minimum description length (MDL) criterion, a binary Gaussian tree is built at each state of a hidden Markov model by iteratively finding and merging similar mixture components. An optimal subset of the tree nodes is then selected to generate a downsized acoustic model. To obtain a better binary Gaussian tree by improving the process of finding the most similar Gaussian components, this paper proposes a new distance measure that exploits the difference in likelihood values for cases before and after two components are combined. The mixture weight of Gaussian components is also introduced in the component merging step. Experimental results show that the proposed method outperforms MDL-based optimization using either a Kullback-Leibler (KL) divergence or weighted KL divergence measure. The proposed method could also reduce the acoustic model size by 50% with less than a 1.5% increase in error rate compared to a baseline system.

A Study on Improved MDL Technique for Optimization of Acoustic Model (향상된 MDL 기법에 의한 음향모델의 최적화 연구)

  • Cho, Hoon-Young;Kim, Sang-Hun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.29 no.1
    • /
    • pp.56-61
    • /
    • 2010
  • This paper describes optimization methods of acoustic models in HMM-based continuous speech recognition. Most of the conventional speech recognition systems use the same number of Gaussian mixture components for each HMM state. However, since the number of data samples available for each state is different from each other, it is possible to reduce the overall number of model parameters and the computational cost at the decoding step by optimizing the number of Gaussian mixture components. In this study, we introduced the Gaussian mixture weight term at the merging stage of Gaussian components in the minimum description length (MDL) based acoustic modeling optimization. Experimental results showed that the proposed method can obtain better ASR accuracy than the previous optimization method which does not consider the Gaussian mixture weight term.

Minimum Message Length and Classical Methods for Model Selection in Univariate Polynomial Regression

  • Viswanathan, Murlikrishna;Yang, Young-Kyu;WhangBo, Taeg-Keun
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.747-758
    • /
    • 2005
  • The problem of selection among competing models has been a fundamental issue in statistical data analysis. Good fits to data can be misleading since they can result from properties of the model that have nothing to do with it being a close approximation to the source distribution of interest (for example, overfitting). In this study we focus on the preference among models from a family of polynomial regressors. Three decades of research has spawned a number of plausible techniques for the selection of models, namely, Akaike's Finite Prediction Error (FPE) and Information Criterion (AIC), Schwartz's criterion (SCH), Generalized Cross Validation (GCV), Wallace's Minimum Message Length (MML), Minimum Description Length (MDL), and Vapnik's Structural Risk Minimization (SRM). The fundamental similarity between all these principles is their attempt to define an appropriate balance between the complexity of models and their ability to explain the data. This paper presents an empirical study of the above principles in the context of model selection, where the models under consideration are univariate polynomials. The paper includes a detailed empirical evaluation of the model selection methods on six target functions, with varying sample sizes and added Gaussian noise. The results from the study appear to provide strong evidence in support of the MML- and SRM- based methods over the other standard approaches (FPE, AIC, SCH and GCV).

  • PDF

Comparisons of AIC and MDL on Estimation Reliability of Number of Soureces in Direction Finding Problem (Direction Finding Problem에서의 신호원 갯수 추정 신뢰도에 관한 AIC와 MDL의 비교)

  • 이일근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.10
    • /
    • pp.842-849
    • /
    • 1990
  • In this paper, a couple of well-known methods for determination of the number of source signals impinging on sersor array in array processing are introduced and compared in terms of estimation accuracy. The one is the procedure issued by Akaike(Akaike's Information Criterion : AIC) and the other one by Schwartz and Rissanen(Minimum Description Length:MDL). This paper demonstrates, through computer simulation, that the AIC is more reliable than the MDL in such troublesome cases as very closely spaced source signlas, very limited number of sensors in the array, finite data sequences and/or low Signal-to-Noise ratio(S/N).

  • PDF

Reversible Data Hiding Using a Piecewise Autoregressive Predictor Based on Two-stage Embedding

  • Lee, Byeong Yong;Hwang, Hee Joon;Kim, Hyoung Joong
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.974-986
    • /
    • 2016
  • Reversible image watermarking, a type of digital data hiding, is capable of recovering the original image and extracting the hidden message with precision. A number of reversible algorithms have been proposed to achieve a high embedding capacity and a low distortion. While numerous algorithms for the achievement of a favorable performance regarding a small embedding capacity exist, the main goal of this paper is the achievement of a more favorable performance regarding a larger embedding capacity and a lower distortion. This paper therefore proposes a reversible data hiding algorithm for which a novel piecewise 2D auto-regression (P2AR) predictor that is based on a rhombus-embedding scheme is used. In addition, a minimum description length (MDL) approach is applied to remove the outlier pixels from a training set so that the effect of a multiple linear regression can be maximized. The experiment results demonstrate that the performance of the proposed method is superior to those of previous methods.

AIC & MDL Algorithm Based on Beamspace, for Efficient Estimation of the Number of Signals (효율적인 신호개수 추정을 위한 빔공간 기반 AIC 및 MDL 알고리즘)

  • Park, Heui-Seon;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.4
    • /
    • pp.617-624
    • /
    • 2021
  • The accurate estimation of the number of signals included in the received signal is required for the AOA(: Angle-of-Arrival) estimation, the interference suppression, the signal reception, etc. AIC(: Akaike Information Criterion) and MDL(: Minimum Description Length) algorithms, which are known as the typical algorithms to estimate the signal number, estimate the number of signals according to the minimum of each criterion. As the number of antenna elements increased, the estimation performance is enhanced, but the computational complexity is increased because values of criteria for entire antenna elements should be calculated for finding their minimum. In order to improve this problem, in this paper, we propose AIC and MDL algorithms based on the beamspace, which efficiently estimate the number of signals while reducing the computational complexity by reducing the dimension of an array antenna through the beamspace processing. In addition, we provide computer simulation results based on various scenarios for evaluating and analysing the estimation performance of the proposed algorithms.

Estimation of Optimal Mixture Number of GMM for Environmental Sounds Recognition (환경음 인식을 위한 GMM의 혼합모델 개수 추정)

  • Han, Da-Jeong;Park, Aa-Ron;Baek, Sung-June
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.2
    • /
    • pp.817-821
    • /
    • 2012
  • In this paper we applied the optimal mixture number estimation technique in GMM(Gaussian mixture model) using BIC(Bayesian information criterion) and MDL(minimum description length) as a model selection criterion for environmental sounds recognition. In the experiment, we extracted 12 MFCC(mel-frequency cepstral coefficients) features from 9 kinds of environmental sounds which amounts to 27747 data and classified them with GMM. As mentioned above, BIC and MDL is applied to estimate the optimal number of mixtures in each environmental sounds class. According to the experimental results, while the recognition performances are maintained, the computational complexity decreases by 17.8% with BIC and 31.7% with MDL. It shows that the computational complexity reduction by BIC and MDL is effective for environmental sounds recognition using GMM.

Geometric Regualrization of Irregular Building Polygons: A Comparative Study

  • Sohn, Gun-Ho;Jwa, Yoon-Seok;Tao, Vincent;Cho, Woo-Sug
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.6_1
    • /
    • pp.545-555
    • /
    • 2007
  • 3D buildings are the most prominent feature comprising urban scene. A few of mega-cities in the globe are virtually reconstructed in photo-realistic 3D models, which becomes accessible by the public through the state-of-the-art online mapping services. A lot of research efforts have been made to develop automatic reconstruction technique of large-scale 3D building models from remotely sensed data. However, existing methods still produce irregular building polygons due to errors induced partly by uncalibrated sensor system, scene complexity and partly inappropriate sensor resolution to observed object scales. Thus, a geometric regularization technique is urgently required to rectify such irregular building polygons that are quickly captured from low sensory data. This paper aims to develop a new method for regularizing noise building outlines extracted from airborne LiDAR data, and to evaluate its performance in comparison with existing methods. These include Douglas-Peucker's polyline simplication, total least-squared adjustment, model hypothesis-verification, and rule-based rectification. Based on Minimum Description Length (MDL) principal, a new objective function, Geometric Minimum Description Length (GMDL), to regularize geometric noises is introduced to enhance the repetition of identical line directionality, regular angle transition and to minimize the number of vertices used. After generating hypothetical regularized models, a global optimum of the geometric regularity is achieved by verifying the entire solution space. A comparative evaluation of the proposed geometric regulator is conducted using both simulated and real building vectors with various levels of noise. The results show that the GMDL outperforms the selected existing algorithms at the most of noise levels.

Optimization Method of Building Energy Performance and Construction Cost Using Kuhn-Tucker Conditions (쿤-터커 조건을 이용한 건물의 에너지성능과 비용 최적화방법)

  • Won, Jong-Seo;Koo, Jae-Oh
    • KIEAE Journal
    • /
    • v.3 no.2
    • /
    • pp.51-58
    • /
    • 2003
  • The purpose of this study is to present rational methods of multi-criteria optimization of the shape of energy saving buildings. The object is to determine the optimum dimension of the shape of a building, based on the following criteria: minimum building costs (including the cost of materials and construction) and yearly heating costs. Mathematical model described heat losses and gains in a building during the heating season. It takes into consideration heat losses through wall, roof, floor and windows. Particular attention was paid to have a more detailed description of heat gains due to solar radiation. On the assumption that shape of building is rectangle in order to solve the problem, the proportions of wall length and building height are determined by using non-linear programing methods(Kuhn-Tucker Conditions). The results constitute information for designers on the optimum proportions of wall lengths, height, and the ratios of window to wall areas for energy saving buildings.