In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constraint is imposed for smoothness of the estimated density function. The derivation of the MEEM algorithm requires determination of the covariance matrix in the framework of the maximum-entropy likelihood function, which is difficult to solve analytically. We, therefore, derive the MEEM algorithm by optimizing a lower-bound of the maximum-entropy likelihood function. We note that the classical expectation-maximization (EM) algorithm has been employed previously for 2-D density estimation. We propose to extend the use of the classical EM algorithm for image recovery from randomly sampled data and sensor field estimation from randomly scattered sensor networks. We further propose to use our approach in density estimation, image recovery and sensor field estimation. Computer simulation experiments are used to demonstrate the superior performance of the proposed MEEM algorithm in comparison to existing methods.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1109/TIP.2008.921996 | DOI Listing |
Comput Intell Neurosci
September 2022
Department of Electrical and Electronic Engineering, BRAC University, Dhaka, Bangladesh.
The capacity to carry out one's regular tasks is affected to varying degrees by hearing difficulties. Poorer understanding, slower learning, and an overall reduction in efficiency in academic endeavours are just a few of the negative impacts of hearing impairments on children's performance, which may range from mild to severe. A significant factor in determining whether or not there will be a decrease in performance is the kind and source of impairment.
View Article and Find Full Text PDFComput Intell Neurosci
April 2022
Department of Electrical and Electronic Engineering, Daffodil International University, Ashulia, Savar, Dhaka 1207, Bangladesh.
Retinal abnormalities have emerged as a serious public health concern in recent years and can manifest gradually and without warning. These diseases can affect any part of the retina, causing vision impairment and indeed blindness in extreme cases. This necessitates the development of automated approaches to detect retinal diseases more precisely and, preferably, earlier.
View Article and Find Full Text PDFJ Glob Health
December 2011
Child Health Research Foundation (CHRF), Department of Microbiology, Dhaka Shishu Hospital, Dhaka, Bangladesh.
Background: Neonatal infections annually claim lives of 1.4 million neonates worldwide. Until now, there is no ideal diagnostic test for detecting sepsis and thus management of possible sepsis cases often depends on clinical algorithm leading to empirical treatment.
View Article and Find Full Text PDFIEEE Trans Image Process
June 2008
Multimedia Communications Laboratory, Department of Electrical and Computer Engineering, University of Illinois at Chicago, Chicago, IL 60607-7053, USA.
In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constraint is imposed for smoothness of the estimated density function.
View Article and Find Full Text PDFIEEE Trans Syst Man Cybern B Cybern
December 2005
Department of MEEM, City University of Hong Kong, China.
Many fuzzy control schemes used in industrial practice today are based on some simplified fuzzy reasoning methods, which are simple but at the expense of losing robustness, missing fuzzy characteristics, and having inconsistent inference. The concept of optimal fuzzy reasoning is introduced in this paper to overcome these shortcomings. The main advantage is that an integration of the optimal fuzzy reasoning with a PID control structure will generate a new type of fuzzy-PID control schemes with inherent optimal-tuning features for both local optimal performance and global tracking robustness.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!