5,901 research outputs found

    Blind deconvolution of medical ultrasound images: parametric inverse filtering approach

    Get PDF
    ©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TIP.2007.910179The problem of reconstruction of ultrasound images by means of blind deconvolution has long been recognized as one of the central problems in medical ultrasound imaging. In this paper, this problem is addressed via proposing a blind deconvolution method which is innovative in several ways. In particular, the method is based on parametric inverse filtering, whose parameters are optimized using two-stage processing. At the first stage, some partial information on the point spread function is recovered. Subsequently, this information is used to explicitly constrain the spectral shape of the inverse filter. From this perspective, the proposed methodology can be viewed as a ldquohybridizationrdquo of two standard strategies in blind deconvolution, which are based on either concurrent or successive estimation of the point spread function and the image of interest. Moreover, evidence is provided that the ldquohybridrdquo approach can outperform the standard ones in a number of important practical cases. Additionally, the present study introduces a different approach to parameterizing the inverse filter. Specifically, we propose to model the inverse transfer function as a member of a principal shift-invariant subspace. It is shown that such a parameterization results in considerably more stable reconstructions as compared to standard parameterization methods. Finally, it is shown how the inverse filters designed in this way can be used to deconvolve the images in a nonblind manner so as to further improve their quality. The usefulness and practicability of all the introduced innovations are proven in a series of both in silico and in vivo experiments. Finally, it is shown that the proposed deconvolution algorithms are capable of improving the resolution of ultrasound images by factors of 2.24 or 6.52 (as judged by the autocorrelation criterion) depending on the type of regularization method used

    Best-fit quasi-equilibrium ensembles: a general approach to statistical closure of underresolved Hamiltonian dynamics

    Get PDF
    A new method of deriving reduced models of Hamiltonian dynamical systems is developed using techniques from optimization and statistical estimation. Given a set of resolved variables that define a model reduction, the quasi-equilibrium ensembles associated with the resolved variables are employed as a family of trial probability densities on phase space. The residual that results from submitting these trial densities to the Liouville equation is quantified by an ensemble-averaged cost function related to the information loss rate of the reduction. From an initial nonequilibrium state, the statistical state of the system at any later time is estimated by minimizing the time integral of the cost function over paths of trial densities. Statistical closure of the underresolved dynamics is obtained at the level of the value function, which equals the optimal cost of reduction with respect to the resolved variables, and the evolution of the estimated statistical state is deduced from the Hamilton-Jacobi equation satisfied by the value function. In the near-equilibrium regime, or under a local quadratic approximation in the far-from-equilibrium regime, this best-fit closure is governed by a differential equation for the estimated state vector coupled to a Riccati differential equation for the Hessian matrix of the value function. Since memory effects are not explicitly included in the trial densities, a single adjustable parameter is introduced into the cost function to capture a time-scale ratio between resolved and unresolved motions. Apart from this parameter, the closed equations for the resolved variables are completely determined by the underlying deterministic dynamics

    A Phase-space Formulation of the Belavkin-Kushner-Stratonovich Filtering Equation for Nonlinear Quantum Stochastic Systems

    Full text link
    This paper is concerned with a filtering problem for a class of nonlinear quantum stochastic systems with multichannel nondemolition measurements. The system-observation dynamics are governed by a Markovian Hudson-Parthasarathy quantum stochastic differential equation driven by quantum Wiener processes of bosonic fields in vacuum state. The Hamiltonian and system-field coupling operators, as functions of the system variables, are represented in a Weyl quantization form. Using the Wigner-Moyal phase-space framework, we obtain a stochastic integro-differential equation for the posterior quasi-characteristic function (QCF) of the system conditioned on the measurements. This equation is a spatial Fourier domain representation of the Belavkin-Kushner-Stratonovich stochastic master equation driven by the innovation process associated with the measurements. We also discuss a more specific form of the posterior QCF dynamics in the case of linear system-field coupling and outline a Gaussian approximation of the posterior quantum state.Comment: 12 pages, a brief version of this paper to be submitted to the IEEE 2016 Conference on Norbert Wiener in the 21st Century, 13-15 July, Melbourne, Australi

    Data driven optimal filtering for phase and frequency of noisy oscillations: application to vortex flowmetering

    Full text link
    A new method for extracting the phase of oscillations from noisy time series is proposed. To obtain the phase, the signal is filtered in such a way that the filter output has minimal relative variation in the amplitude (MIRVA) over all filters with complex-valued impulse response. The argument of the filter output yields the phase. Implementation of the algorithm and interpretation of the result are discussed. We argue that the phase obtained by the proposed method has a low susceptibility to measurement noise and a low rate of artificial phase slips. The method is applied for the detection and classification of mode locking in vortex flowmeters. A novel measure for the strength of mode locking is proposed.Comment: 12 pages, 10 figure

    ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly

    Full text link
    Matrix completion and approximation are popular tools to capture a user's preferences for recommendation and to approximate missing data. Instead of using low-rank factorization we take a drastically different approach, based on the simple insight that an additive model of co-clusterings allows one to approximate matrices efficiently. This allows us to build a concise model that, per bit of model learned, significantly beats all factorization approaches to matrix approximation. Even more surprisingly, we find that summing over small co-clusterings is more effective in modeling matrices than classic co-clustering, which uses just one large partitioning of the matrix. Following Occam's razor principle suggests that the simple structure induced by our model better captures the latent preferences and decision making processes present in the real world than classic co-clustering or matrix factorization. We provide an iterative minimization algorithm, a collapsed Gibbs sampler, theoretical guarantees for matrix approximation, and excellent empirical evidence for the efficacy of our approach. We achieve state-of-the-art results on the Netflix problem with a fraction of the model complexity.Comment: 22 pages, under review for conference publicatio
    corecore