928 research outputs found

    Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov Random Fields Using Sensor Networks

    Full text link
    The detection of hidden two-dimensional Gauss-Markov random fields using sensor networks is considered. Under a conditional autoregressive model, the error exponent for the Neyman-Pearson detector satisfying a fixed level constraint is obtained using the large deviations principle. For a symmetric first order autoregressive model, the error exponent is given explicitly in terms of the SNR and an edge dependence factor (field correlation). The behavior of the error exponent as a function of correlation strength is seen to divide into two regions depending on the value of the SNR. At high SNR, uncorrelated observations maximize the error exponent for a given SNR, whereas there is non-zero optimal correlation at low SNR. Based on the error exponent, the energy efficiency (defined as the ratio of the total information gathered to the total energy required) of ad hoc sensor network for detection is examined for two sensor deployment models: an infinite area model and and infinite density model. For a fixed sensor density, the energy efficiency diminishes to zero at rate O(area^{-1/2}) as the area is increased. On the other hand, non-zero efficiency is possible for increasing density depending on the behavior of the physical correlation as a function of the link length.Comment: To appear in the Proceedings of the 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, March 30 - April 4, 200

    Information, Energy and Density for Ad Hoc Sensor Networks over Correlated Random Fields: Large Deviations Analysis

    Full text link
    Using large deviations results that characterize the amount of information per node on a two-dimensional (2-D) lattice, asymptotic behavior of a sensor network deployed over a correlated random field for statistical inference is investigated. Under a 2-D hidden Gauss-Markov random field model with symmetric first order conditional autoregression, the behavior of the total information [nats] and energy efficiency [nats/J] defined as the ratio of total gathered information to the required energy is obtained as the coverage area, node density and energy vary.Comment: Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 200

    Optimal Node Density for Two-Dimensional Sensor Arrays

    Full text link
    The problem of optimal node density for ad hoc sensor networks deployed for making inferences about two dimensional correlated random fields is considered. Using a symmetric first order conditional autoregressive Gauss-Markov random field model, large deviations results are used to characterize the asymptotic per-node information gained from the array. This result then allows an analysis of the node density that maximizes the information under an energy constraint, yielding insights into the trade-offs among the information, density and energy.Comment: Proceedings of the Fifth IEEE Sensor Array and Multichannel Signal Processing Workshop, Darmstadt, Germany, July 21 - 23, 200

    Estimating the granularity coefficient of a Potts-Markov random field within an MCMC algorithm

    Get PDF
    This paper addresses the problem of estimating the Potts parameter B jointly with the unknown parameters of a Bayesian model within a Markov chain Monte Carlo (MCMC) algorithm. Standard MCMC methods cannot be applied to this problem because performing inference on B requires computing the intractable normalizing constant of the Potts model. In the proposed MCMC method the estimation of B is conducted using a likelihood-free Metropolis-Hastings algorithm. Experimental results obtained for synthetic data show that estimating B jointly with the other unknown parameters leads to estimation results that are as good as those obtained with the actual value of B. On the other hand, assuming that the value of B is known can degrade estimation performance significantly if this value is incorrect. To illustrate the interest of this method, the proposed algorithm is successfully applied to real bidimensional SAR and tridimensional ultrasound images

    Distributed field estimation in wireless sensor networks

    Get PDF
    This work takes into account the problem of distributed estimation of a physical field of interest through a wireless sesnor networks

    Distributed field estimation in wireless sensor networks

    Get PDF
    This work takes into account the problem of distributed estimation of a physical field of interest through a wireless sesnor networks

    A review of computer vision-based approaches for physical rehabilitation and assessment

    Get PDF
    The computer vision community has extensively researched the area of human motion analysis, which primarily focuses on pose estimation, activity recognition, pose or gesture recognition and so on. However for many applications, like monitoring of functional rehabilitation of patients with musculo skeletal or physical impairments, the requirement is to comparatively evaluate human motion. In this survey, we capture important literature on vision-based monitoring and physical rehabilitation that focuses on comparative evaluation of human motion during the past two decades and discuss the state of current research in this area. Unlike other reviews in this area, which are written from a clinical objective, this article presents research in this area from a computer vision application perspective. We propose our own taxonomy of computer vision-based rehabilitation and assessment research which are further divided into sub-categories to capture novelties of each research. The review discusses the challenges of this domain due to the wide ranging human motion abnormalities and difficulty in automatically assessing those abnormalities. Finally, suggestions on the future direction of research are offered

    EXPLORING DEEP LEARNING METHODS FOR LOW NUMERICAL APERTURE TO HIGH NUMERICAL APERTURE RESOLUTION ENHANCEMENT IN CONFOCAL MICROSCOPY

    Get PDF
    Confocal microscopy is a widely used tool that provides valuable morphological and functional information within cells and tissues. A major advantage of confocal microscopy is its ability to record multi-color and optically sectioned images. A major drawback to confocal microscopy is its diffraction-limited spatial resolution. Though techniques have been developed that break this limit in confocal microscopy, they require additional hardware or accurate estimates of the system’s impulse response (e.g., point spread function). Here we investigate two deep learning-based models, the cGAN and cycleGAN, trained with low-resolution (LR) and high-resolution (HR) confocal images to improve spatial resolution in confocal microscopy. Our findings conclude that the cGAN can accurately produce HR images if the training set contains images with a high signal-to-noise ratio. We have also found that the cycleGAN model has the potential to perform as the cGAN model but without the requirement of using paired inputs
    • 

    corecore