Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Markov tree"”.

  1. A universal hidden Markov tree image model

    Wavelet-domain hidden Markov models have proven to be useful tools for statistical signal and image processing. The hidden Markov tree (HMT) model captures the key features of the joint density of the wavelet coefficients of real-world data. One potential drawback to the HMT framework is the need …

    rice Repository record for A universal hidden Markov tree image model (opens in a new tab)

  2. Multiresolution stochastic models for self-similar textures

    … of the image using an Self-similar Hidden Markov Tree Model (SHMTM). Compared with Crouse's Hidden Markov Tree Model (HMTM), the SHMTM is a much simpler and better description of the wavelet coefficients of the self-similar textures. This is shown by the experimental results of image …

    iastate Repository record for Multiresolution stochastic models for self-similar textures (opens in a new tab)

  3. Development of super resolution techniques for finer scale remote sensing image mapping

    … a Posteriori based on the universal hidden Markov tree model (MAP-uHMT) is developed which can be applied successfully to super-resolve each multi-spectral channel before classification by standard methods. It is believed that this is the first time that a true super resolution algorithm has …

    unsw Repository record for Development of super resolution techniques for finer scale remote sensing image mapping (opens in a new tab)

  4. Large-Scale Content Extraction from Heterogeneous Sources

    … not. We set out with the hypothesis that the DOM tree can be modeled as a hidden Markov tree model where the hidden state of each node indicates if its relevant content or not. Using Gibbs samling we uncover the hidden states of the node, and show that competative performance can be achieved using …

    chalmers Repository record for Large-Scale Content Extraction from Heterogeneous Sources (opens in a new tab)

  5. Compressive brain neural activity detection using functional magnetic resonance images

    … of models including wavelet/contourlet hidden Markov tree, hidden Markov chain and multi-layer/multi-scale neural hemodynamic model. Based on those models, the fMRI data can reveal more statistical patterns with respect to specific subject behavior. 2) Algorithmic tradeoff between performance …

    alabama Repository record for Compressive brain neural activity detection using functional magnetic resonance images (opens in a new tab)

  6. Bayesian max-product expectation maximization algorithm for structured sparse signals reconstruction

    … dependence structure is described by a hidden Markov tree. Gaussian priors are assigned to the signal coefficients given their state variables and the Jeffreys' noninformative prior is assigned to the noise variance. Our signal reconstruction scheme is based on an EM iteration that aims at …

    iastate Repository record for Bayesian max-product expectation maximization algorithm for structured sparse signals reconstruction (opens in a new tab)

  7. Detecting microcalcification clusters in digital mammograms: Study for inclusion into computer aided diagnostic prompting system

    … system. One considers Wavelet Domain Hidden Markov Tree (WHMT) for modeling microcalcification edges. The model is used for differentiation between MC and non-MC edges based on the weighted maximum likelihood (WML) values. The classification of objects is carried out using spatial filters. …

    unlv Repository record for Detecting microcalcification clusters in digital mammograms: Study for inclusion into computer aided diagnostic prompting system (opens in a new tab) Download PDF for Detecting microcalcification clusters in digital mammograms: Study for inclusion into computer aided diagnostic prompting system (opens in a new tab)

  8. Image processing via undecimated wavelet systems

    … undecimated discrete wavelet packet binary tree to select the best basis. Since we believe discarding the small coefficients permits to choose the best basis from the set of coefficients that will really contribute to the reconstructed image, we propose to select the best basis based on the …

    rice Repository record for Image processing via undecimated wavelet systems (opens in a new tab)

  9. Dynamics on trees: entropy and substitutions

    … work has two main parts. In the first, we study Markov tree-shifts given by k transition matrices, one for each of its k directions. We provide a method to characterize the complexity function for these tree-shifts, used to calculate the tree entropies defined by Ban and Chang [4], and Petersen …

    brazil-ufrgs Repository record for Dynamics on trees: entropy and substitutions (opens in a new tab)

  10. Selected Topics In Information Theoretic Security And Compression

    … to be estimated are the roots of a given Gauss-Markov tree and each encoder observes one of the leaves of that tree. We show that a simple compression architecture that performs separate lossy quantization followed by SlepianWolf binning is sum-rate optimal for this problem.

    cornell Repository record for Selected Topics In Information Theoretic Security And Compression (opens in a new tab)

  11. Large Language Models and Networks: Edge Proposal, Synthetic Corpora, and Adaptive Node Generation

    … a suite of synthetic grammar generators—spanning Markov, tree, and graph formalisms—that yield corpora with analytically tractable entropy and cross-entropy complexity. These controllable datasets expose failure modes and scaling laws that remain hidden when evaluation relies solely on organic …

    ucf Repository record for Large Language Models and Networks: Edge Proposal, Synthetic Corpora, and Adaptive Node Generation (opens in a new tab)

  12. Scalable Bayesian Inference and Multiple Hypothesis Testing for Tree-structured Data

    … we address the computational inefficiency of Markov chain Monte Carlo (MCMC) algorithms for hidden Markov models, which often rely on the forward-backward sampler and become slow with increasing time series length. We develop a targeted sub- sampling (TASS) approach that over-samples …

    duke Repository record for Scalable Bayesian Inference and Multiple Hypothesis Testing for Tree-structured Data (opens in a new tab)

  13. Multiscale geometric image processing

    … into the wavelet domain), we develop a quadtree based prototype coder whose rate-distortion performance is asymptotically near-optimal. We use these ideas to implement a full-scale image coder that outperforms JPEG-2000 both in peak signal to noise ratio (by 1--1.5dB at low bitrates) and …

    rice Repository record for Multiscale geometric image processing (opens in a new tab)

  14. Computer Vision on Web Pages: A Study of Man-Made Images

    … process, and our method produces segmentation trees that achieve good performance on a variety of measures. Classification, for our purposes, is identifying the semantic role of regions in the segmentation tree of a page. We achieve promising results with a Bayesian classification algorithm …

    waterloo Repository record for Computer Vision on Web Pages: A Study of Man-Made Images (opens in a new tab)

  15. Social Choice for Partial Preferences Using Imputation

    … of agents, and validate its effectiveness. This Markov-Tree approach is demonstrated to be superior to imputation using conventional machine learning, and has a simple interpretation that characterizes the problems on which it will perform well. Later chapters contain an axiomatic validation of …

    waterloo Repository record for Social Choice for Partial Preferences Using Imputation (opens in a new tab)

  16. Ανάλυση εικόνας και όραση υπολογιστών: θεωρία και εφαρμογές στην αποκατάσταση αρχαίων τοιχογραφιών

    … to a good extent by the multiscale hidden Markov tree (HMT) model which we study in depth. Our main novel contribution in this area is the development of probabilistic image inpainting methods based on the HMT representation. We also propose new algorithms for learning the HMT model …

    greece Repository record for Ανάλυση εικόνας και όραση υπολογιστών: θεωρία και εφαρμογές στην αποκατάσταση αρχαίων τοιχογραφιών (opens in a new tab)

  17. ON THE RELIABILITY AND EFFICIENCY OF INFORMATION TRANSMISSION SYSTEMS

    … Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subject to individual …

    cornell Repository record for ON THE RELIABILITY AND EFFICIENCY OF INFORMATION TRANSMISSION SYSTEMS (opens in a new tab)

  18. Μέθοδοι επεξεργασίας πολυμεσικών σημάτων για βέλτιστη αποθορυβοποίηση και ανίχνευση με εφαρμογές σε δορυφορικά δεδομένα

    … to a good extent by the family of multiscale Markov tree models which we study in depth. One of our main contributions in this area is the development of a novel multiscale nonlinear transform which can decouple the Poisson noise and the image true content. In addition, the proposed transform …

    greece Repository record for Μέθοδοι επεξεργασίας πολυμεσικών σημάτων για βέλτιστη αποθορυβοποίηση και ανίχνευση με εφαρμογές σε δορυφορικά δεδομένα (opens in a new tab)

  19. Mixtures of Tree-Structured Probabilistic Graphical Models for Density Estimation in High Dimensional Spaces

    … The approach selected is to use mixtures of Markov trees. Markov trees are a class of probabilistic graphical models that are constrained in terms of the independence relationships they can encode. Therefore, they are limited in the probability distributions they can model, but both learning …

    liege Repository record for Mixtures of Tree-Structured Probabilistic Graphical Models for Density Estimation in High Dimensional Spaces (opens in a new tab) Download PDF for Mixtures of Tree-Structured Probabilistic Graphical Models for Density Estimation in High Dimensional Spaces (opens in a new tab)

  20. Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework

    Elements of continuous variation such as tremolo, vibrato and portamento enable dimensions of their own in expressive melodic music in styles such as in Indian Classical Music. There is published work on parametrically modeling some of these elements individually, and to apply the modeled …

    gatech Repository record for Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework (opens in a new tab)