Loading...
Search for: mutual-informations
0.012 seconds
Total 52 records

    Designing an Estimation of Distribution Algorithm Based on Data Mining Methods

    , M.Sc. Thesis Sharif University of Technology Akbari Azirani, Elham (Author) ; Beigy, Hamid (Supervisor)
    Abstract
    Estimation of distribution algorithms (EDA) are optimization methods that search the solution space by building and sampling probabilistic models. The linkage tree genetic algorithm (LTGA), which can be considered an estimation of distribution algorithm, uses hierarchical clustering to build a hierarchical linkage model called the linkage tree, and gene-pool optimal mixing algorithm to generate new solutions. While the LTGA performs very well on problems with separable sub-problems, its performance deteriorates on ones with overlapping sub-problems. This thesis presents a comparison of the effect of different pre-constructed models in the LTGA's performance. Several important factors that... 

    Predicting the Optimal Operation Pattern of Municipal Wastewater Treatment Plant Using Artificial Intelligence Approaches

    , M.Sc. Thesis Sharif University of Technology Hakimi, Mahdi (Author) ; Torkian, Ayoub (Supervisor)
    Abstract
    With the growth of the population and the significant expansion of industries in the last century, many environmental problems have plagued developed and developing countries. One of these environmental problems is water pollution. Observing the effects of water pollution over time, sanitary and industrial wastewater treatment was proposed as a reliable solution. With technology development, wastewater treatment requirements have become stricter. The increase in energy consumption and wastewater treatment costs due to population growth and industrialization on the one hand and strict regulations, on the other hand, have forced those involved in this field to employ a variety of technical and... 

    On Different Information Theoretic Security Measures in Communication Network

    , M.Sc. Thesis Sharif University of Technology Kavian, Masoud (Author) ; Aref, Mohammad Reza (Supervisor) ; Mirmohseni, Mahtab (Co-Supervisor)
    Abstract
    Reliable and secure communication requires low error probability and low information leakage, respectively. In this thesis we study different security parameters in communication networks. Three important security metrics are noted by weak, strong, and perfect secrecy. A weak condition on secrecy requires the percentage of the message leaked to the adversary vanish as the code length increases, while a strong condition on secrecy requires the total amount of leaked information (not its percentage) vanish as length increases. Perfect secrecy requires absoloutely zero leakage of information for every given block length. An intriguing question is to determine the secrecy rate under secrecy... 

    Using the Echo of Rotating Parts to Recognize a Radar Target

    , M.Sc. Thesis Sharif University of Technology Johari, Mohammad Mahdi (Author) ; Nayebi, Mohammad Mahdi (Supervisor)
    Abstract
    Target recognition techniques based on micro Doppler phenomenon are popular because they are applicable even on low resolution radars, in contrast to other techniques such as High Resolution Range Profile (HRRP) which need high resolution in range or angle. Usually, main purpose of such techniques is generating robust features against target initial state, velocity, aspect angle, etc. rather than features which exactly identify a target. Main approaches in the literature are based on time-frequency transforms (TFT) such as spectrogram in order to generate features to classify targets, but in this thesis, we propose a totally different method using Recurrence Plot for generating features... 

    Non-Rigid Medical Image Registration Based on Information Theory

    , M.Sc. Thesis Sharif University of Technology Khorsandi, Rahman (Author) ; Fatemizadeh, Emadoddin (Supervisor)
    Abstract
    The registration of images is a fundamental task in numerous applications in medical image processing. The importance of medical image registraiton due to the imaging systems development in last decades is obvious to every one. Especially the wide employment and different capabilities of these systems has caused more attention to this field of image processing. Th e application of medical image registraiton is extended from clinical diagnosis and treatment evaluation, to image guided surgery. The dimension of images as well as modalities of imaging and imaging subjectshas made a wide variety of problems in this branch of image processing. Registration, briefly speaking, is a geometrical... 

    Quantum Estimation: Properties and Calculation of the Quantum Fisher Information and Adaptive Scheme

    , Ph.D. Dissertation Sharif University of Technology Hassani, Majid (Author) ; Rezakhani, Ali (Supervisor)
    Abstract
    In this thesis , we study quantum estimation , its primary tools and different approaches . To this end , along with reviewing the main concepts of classical and quantum estimation , the Cramer-Rao inequlity which establishes a lower bound on the precision of estimation has been used . This lower bound can be calculated using the quantum Fisher information . In order to explore properties of the quantum Fisher information , we study the continuity relation of this quantity in the most general case and we calculate it for different quantum states . To underline the importance of the continuity relation , one can demonstrate an estimate of the value of the quantum Fisher information... 

    Recognizing Center of Siezur with Clustering Algorithm

    , M.Sc. Thesis Sharif University of Technology Akhshi, Amin (Author) ; Rahimitabar, Mohammad Reza (Supervisor)
    Abstract
    Complex systems are composed of a large number of subsystems behaving in a collective manner. In such systems, which are usually far from equilibrium, collective behavior arises due to self-organization and results in the formation of temporal, spatial, spatio-temporall structures. Examples of complex systems are turbulent flow, stock markets, dynamics of a brain, etc. In study of the complex systems, we always encounter with handling and analysing of a Big-Data set. There are several approaches to overcome this problem, among which the most powerful method is the clustering analysis. Clustering algorithm is based on the classifying of dynamics of complex system using some similarity... 

    Multivariate Mutual Information via Secret-key Agreement

    , M.Sc. Thesis Sharif University of Technology Mostafa Zadflah Chobari, Mohammad (Author) ; Ebrahimi, Javad (Supervisor)
    Abstract
    Shannon (1948) for the first time defined the "mutual information'' parameter for two random variables, but still there is no common definition for multivariate mutual information has been agreed upon, despite the multitude of research on the subject and various proposed definitions. In 2015, a study suggested that the maximum rate of secret-key, in the secret-key agreement problem, is a suitable candidate for defining multivariate mutual information. Csiszár and Narayan's research on the secret-key agreement problem provides an accessible bound for the maximum rate of secret-key rate, which in the bivariate case is the shannon's mutual information. The proposed definition has all expected... 

    Online undersampled dynamic MRI reconstruction using mutual information

    , Article 2014 21st Iranian Conference on Biomedical Engineering, ICBME 2014 ; 17 February , 2014 , Pages 241-245 ; ISBN: 9781479974177 Farzi, M ; Ghaffari, A ; Fatemizadeh, E ; Sharif University of Technology
    Abstract
    We propose an algorithm based on mutual information to address the problem of online reconstruction of dynamic MRI from partial k-space measurements. Most of previous compressed sensing (CS) based methods successfully leverage sparsity constraint for offline reconstruction of MR images, yet they are not used in online applications due to their complexities. In this paper, we formulate the reconstruction as a constraint optimization problem and try to maximize the mutual information between the current and the previous time frames. Conjugate gradient method is used to solve the optimization problem. Using Cartesian mask to undersample k-space measurements, the proposed method reduces... 

    Sparse-induced similarity measure: Mono-modal image registration via sparse-induced similarity measure

    , Article IET Image Processing ; Volume 8, Issue 12 , 1 December , 2014 , Pages 728-741 ; ISSN: 17519659 Ghaffari, A ; Fatemizadeh, E ; Sharif University of Technology
    Abstract
    Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g. sum-of-squared-differences, correlation coefficient, mutual information and correlation ratio) assume a stationary image and pixel-by-pixel independence. These similarity measures ignore the correlation among pixel intensities; hence, a perfect image registration cannot be achieved especially in the presence of spatially varying intensity distortions and outlier objects that appear in one image but not in the other. It is supposed here that non-stationary intensity distortion (such as bias field) has a sparse representation in the transformation domain. Based on this... 

    Application of 3D-wavelet statistics to video analysis

    , Article Multimedia Tools and Applications ; Volume 65, Issue 3 , 2013 , Pages 441-465 ; 13807501 (ISSN) Omidyeganeh, M ; Ghaemmaghami, S ; Shirmohammadi, S ; Sharif University of Technology
    2013
    Abstract
    Video activity analysis is used in various video applications such as human action recognition, video retrieval, video archiving. In this paper, we propose to apply 3D wavelet transform statistics to natural video signals and employ the resulting statistical attributes for video modeling and analysis. From the 3D wavelet transform, we investigate the marginal and joint statistics as well as the Mutual Information (MI) estimates. We show that marginal histograms are approximated quite well by Generalized Gaussian Density (GGD) functions; and the MI between coefficients decreases when the activity level increases in videos. Joint statistics attributes are applied to scene activity grouping,... 

    On hypercontractivity and the mutual information between Boolean functions

    , Article 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Monticello, IL ; Oct , 2013 , Pages 13-19 ; 9781479934096 (ISBN) Anantharam, V ; Gohari, A. A ; Kamath, S ; Nair, C ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    Hypercontractivity has had many successful applications in mathematics, physics, and theoretical computer science. In this work we use recently established properties of the hypercontractivity ribbon of a pair of random variables to study a recent conjecture regarding the mutual information between binary functions of the individual marginal sequences of a sequence of pairs of random variables drawn from a doubly symmetric binary source  

    Mono-modal image registration via correntropy measure

    , Article Iranian Conference on Machine Vision and Image Processing, MVIP ; Sept , 2013 , Pages 223-226 ; 21666776 (ISSN) ; 9781467361842 (ISBN) Ghaffari, A ; Fatemizadeh, E ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    The registration of images is a fundamental task in numerous applications in medical image processing. Similarity measure is an important key in intensity based image registration. Here, we propose correntropy measure as similarity measure in mono modal setting. Correntropy is a important measure between two random variables based on information theoretic learning and kernel methods. This measure is useful in non-Gaussian signal processing. In this paper, this measure is used in image registration. Here, we analytically illustrate that this measure is robust in presence of spiky noise (impulsive noise). The experimental results show that the proposed similarity has better performance than... 

    Landmark and intensity based image registration using free form deformation

    , Article 2012 IEEE-EMBS Conference on Biomedical Engineering and Sciences, IECBES 2012 ; 2012 , Pages 768-771 ; 9781467316668 (ISBN) Ghaffari, A ; Khorsandi, R ; Fatemizadeh, E ; University Malaya; CBMTI University Malaya; Tourism Malaysia; Kumpulan ABEX Sdn Bhd; AMAN kampus ; Sharif University of Technology
    2012
    Abstract
    The registration of images is a fundamental task in numerous applications in medical image processing. In this paper, a novel registration technique is proposed which combines landmark and intensity based approaches. In this framework, the free form deformation (FFD) is used as transformation which is the key point of our algorithm. Landmarks with FFD transformation define the guidance surface which increases robustness of intensity based registration to bias field (bias noise). In fact, the performance of registration is improved by matching both landmark and intensity information. The experimental results show that the proposed method is more accurate than only intensity based method... 

    Is independent component analysis appropriate for multivariate resolution in analytical chemistry?

    , Article TrAC - Trends in Analytical Chemistry ; Volume 31 , 2012 , Pages 134-143 ; 01659936 (ISSN) Parastar, H ; Jalali Heravi, M ; Tauler, R ; Sharif University of Technology
    2012
    Abstract
    In this article, we examine Independent Component Analysis (ICA) and the concept of Mutual information (MI) as a quantitative measure of independence from the point of view of analytical chemistry. We compare results obtained by different ICA methods with results obtained by Multivariate Curve Resolution Alternating Least Squares (MCR-ALS). These results have shown that, when non-negativity constraints are applied, values of MI increase considerably and the resolved components cannot anymore be considered to be independent (i.e. they can only be considered to be the " least dependent" components). MI values of profiles resolved by MCR-ALS and ICA did not differ significantly when... 

    Filter-bank design based on dependencies between frequency components and phoneme characteristics

    , Article European Signal Processing Conference, 29 August 2011 through 2 September 2011 ; Septembe , 2011 , Pages 2142-2145 ; 22195491 (ISSN) Mohammadi, S. H ; Sameti, H ; Tavanaei, A ; Soltani Farani, A ; Sharif University of Technology
    2011
    Abstract
    Mel-frequency Cepstral coefficients are widely used for feature extraction in speech recognition systems. These features use Mel-scaled filters. A new filter-bank based on dependencies between frequency components and phoneme characteristics is proposed. F-ratio and mutual information are used for this purpose. A new filter-bank is designed in which frequency resolution of sub-band filters is inversely proportional to the computed dependency values. These new filterbank is used instead of Mel-scaled filters for feature extraction. A phoneme recognition experiment on FARSDAT Persian language database showed that features extracted using the proposed filter-bank reach higher accuracy (63.92%)... 

    Zero error coordination

    , Article ITW 2015 - 2015 IEEE Information Theory Workshop, 11 October 2015 through 15 October 2015 ; 2015 , Pages 202-206 ; 9781467378529 (ISBN) Abroshan, M ; Gohari, A ; Jaggi, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    In this paper, we consider a zero error coordination problem wherein the nodes of a network exchange messages to be able to perfectly coordinate their actions with the individual observations of each other. While previous works on coordination commonly assume an asymptotically vanishing error, we assume exact, zero error coordination. Furthermore, unlike previous works that employ the empirical or strong notions of coordination, we define and use a notion of set coordination. This notion of coordination bears similarities with the empirical notion of coordination. We observe that set coordination, in its special case of two nodes with a one-way communication link is equivalent with the Hide... 

    ECG denoising using mutual information based classification of IMFs and interval thresholding

    , Article 2015 38th International Conference on Telecommunications and Signal Processing, TSP 2015, 9 July 2015 through 11 July 2015 ; July , 2015 , Page(s): 1 - 6 ; 9781479984985 (ISBN) Taghavi, M ; Shamsollahi, M. B ; Senhadji, L ; Molnar K ; Herencsar N ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    The Electrocardiogram (ECG) is widely used for diagnosis of heart diseases. Therefore, the quality of information extracted from the ECG has a vital role. In real recordings, ECG is corrupted by artifacts such as prolonged repolarization, respiration, changes of electrode position, muscle contraction, and power line interface. In this paper, a denoising technique for ECG signals based on Empirical Mode Decomposition (EMD) is proposed. We use Ensemble Empirical Mode Decomposition (EEMD) to overcome the limitations of EMD. Moreover, to overcome the limitations of thresholding methods we use the combination of mutual information and two EMD based interval thresholding approaches. Our new method... 

    One-shot achievability via fidelity

    , Article IEEE International Symposium on Information Theory - Proceedings, 14 June 2015 through 19 June 2015 ; Volume 2015-June , 2015 , Pages 301-305 ; 21578095 (ISSN) ; 9781467377041 (ISBN) Yassaee, M. H ; Sharif University of Technology
    2015
    Abstract
    This paper provides a universal framework for establishing one-shot achievability results for coordination and secrecy problems. The framework is built on our previous framework [Yassaee et al. 13] for proving one-shot achievability results in the context of source and channel coding problems. In the coordination and secrecy problems, one needs to compare an induced distribution by encoding/decoding with an ideal distribution (satisfying some desirable properties) using a suitable criterion. In this paper, we use fidelity as a criterion for measuring the closeness of induced distribution with the ideal distribution. The framework exploits the stochastic mutual information coders at the... 

    On the duality of additivity and tensorization

    , Article IEEE International Symposium on Information Theory - Proceedings, 14 June 2015 through 19 June 2015 ; Volume 2015-June , 2015 , Pages 2381-2385 ; 21578095 (ISSN) ; 9781467377041 (ISBN) Beigi, S ; Gohari, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    A function is said to be additive if, similar to mutual information, expands by a factor of n, when evaluated on n i.i.d. repetitions of a source or channel. On the other hand, a function is said to satisfy the tensorization property if it remains unchanged when evaluated on i.i.d. repetitions. Additive rate regions are of fundamental importance in network information theory, serving as capacity regions or upper bounds thereof. Tensorizing measures of correlation have also found applications in distributed source and channel coding problems as well as the distribution simulation problem. Prior to our work only two measures of correlation, namely the hypercontractivity ribbon and maximal...