Pub Date : 1994-10-27DOI: 10.1109/WITS.1994.513929
D. M. Ionescu, M. Wickert
The formalism behind a novel additive congruential method (ACM) is described. This method yields uniform random sequences whose outcomes occur more than once throughout the sequence. The approach to generating a uniformly distributed pseudorandom sequence (PS) is presented. For a selected prime, p, the PS is a sequence of random variables (RV) over the Galois field GF(p). The ACM yields a Markov PS, where each valid outcome appears more than once within the main period, and still obeys a uniform distribution.
{"title":"An additive congruential method for generating a multiple occurrence uniform random sequence","authors":"D. M. Ionescu, M. Wickert","doi":"10.1109/WITS.1994.513929","DOIUrl":"https://doi.org/10.1109/WITS.1994.513929","url":null,"abstract":"The formalism behind a novel additive congruential method (ACM) is described. This method yields uniform random sequences whose outcomes occur more than once throughout the sequence. The approach to generating a uniformly distributed pseudorandom sequence (PS) is presented. For a selected prime, p, the PS is a sequence of random variables (RV) over the Galois field GF(p). The ACM yields a Markov PS, where each valid outcome appears more than once within the main period, and still obeys a uniform distribution.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-10-27DOI: 10.1109/WITS.1994.513874
L. Gyorfi
The paper considers a sequence of i.i.d. real valued random variables with common unknown density and examines the histogram estimate. It addresses the problem of estimating an unknown probability density function in information divergence.
{"title":"The asymptotic normality of global errors for a histogram based density estimate","authors":"L. Gyorfi","doi":"10.1109/WITS.1994.513874","DOIUrl":"https://doi.org/10.1109/WITS.1994.513874","url":null,"abstract":"The paper considers a sequence of i.i.d. real valued random variables with common unknown density and examines the histogram estimate. It addresses the problem of estimating an unknown probability density function in information divergence.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"263 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133915569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-10-27DOI: 10.1109/WITS.1994.513911
J. Chen, S. Itoh, T. Hashimoto
This paper proposes a new coding strategy by which the desired quality of reproduced signal can be guaranteed with the minimum cost of coding rate. The idea was successfully introduced to the DOWT-based coding system for the ECG compression application.
{"title":"Wavelet transform based ECG data compression with desired reconstruction signal quality","authors":"J. Chen, S. Itoh, T. Hashimoto","doi":"10.1109/WITS.1994.513911","DOIUrl":"https://doi.org/10.1109/WITS.1994.513911","url":null,"abstract":"This paper proposes a new coding strategy by which the desired quality of reproduced signal can be guaranteed with the minimum cost of coding rate. The idea was successfully introduced to the DOWT-based coding system for the ECG compression application.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115352287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-10-27DOI: 10.1109/WITS.1994.513850
M. Vetterli
Signal expansions play a key role in practical compression schemes, from audio/image/video coding standards to current adaptives bases. Recent developments, especially related to wavelets series expansions, are reviewed, and current work on "best bases" is discussed.
{"title":"Signal expansions for compression","authors":"M. Vetterli","doi":"10.1109/WITS.1994.513850","DOIUrl":"https://doi.org/10.1109/WITS.1994.513850","url":null,"abstract":"Signal expansions play a key role in practical compression schemes, from audio/image/video coding standards to current adaptives bases. Recent developments, especially related to wavelets series expansions, are reviewed, and current work on \"best bases\" is discussed.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1994-10-27DOI: 10.1109/WITS.1994.513849
J. Rissanen
The main objective in universal modeling is to construct a process for a class of model processes which for long strings, generated by any of the models in the class, behaves like the data generating one. Hence, such a universal process may be taken as a representation of the entire model class to be used for statistical inference. If f(x/sup n/) denotes the probability or density it assigns to the data string x/sup n/=x/sub 1/,..,x/sub n/, then the negative logarithm - log f(x/sup n/), which may be viewed as the shortest ideal code length for the data obtainable with the model class, is called the stochastic complexity of the string, relative to the considered model class. Unlike in related universal modeling, where the mean code length is sufficient, we also need an explicit asymptotic formula for the stochastic complexity. This is because it permits a comparison of different model classes by their stochastic complexity in accordance with the MDL (minimum description length) principle.
{"title":"Fisher information, stochastic complexity, and universal modeling","authors":"J. Rissanen","doi":"10.1109/WITS.1994.513849","DOIUrl":"https://doi.org/10.1109/WITS.1994.513849","url":null,"abstract":"The main objective in universal modeling is to construct a process for a class of model processes which for long strings, generated by any of the models in the class, behaves like the data generating one. Hence, such a universal process may be taken as a representation of the entire model class to be used for statistical inference. If f(x/sup n/) denotes the probability or density it assigns to the data string x/sup n/=x/sub 1/,..,x/sub n/, then the negative logarithm - log f(x/sup n/), which may be viewed as the shortest ideal code length for the data obtainable with the model class, is called the stochastic complexity of the string, relative to the considered model class. Unlike in related universal modeling, where the mean code length is sufficient, we also need an explicit asymptotic formula for the stochastic complexity. This is because it permits a comparison of different model classes by their stochastic complexity in accordance with the MDL (minimum description length) principle.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129528111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：