174 research outputs found

    A Family of Affine Projection Adaptive Filtering Algorithms With Selective Regressors

    Get PDF
    In this paper we present a general formalism for the establishment of the family of selective regressor affine projection algorithms (SR-APA). The SR-APA, the SR regularized APA (SR-RAPA), the SR partial rank algorithm (SR-PRA), the SR binormalized data reusing least mean squares (SR-BNDR-LMS), and the SR normalized LMS with orthogonal correction factors (SR-NLMS-OCF) algorithms are established by this general formalism. We demonstrate the performance of the presented algorithms through simulations in acoustic echo cancellation scenario

    Transform Domain LMS/F Algorithms, Performance Analysis and Applications

    Get PDF

    An Approach Of Features Extraction And Heatmaps Generation Based Upon Cnns And 3D Object Models

    Get PDF
    The rapid advancements in artificial intelligence have enabled recent progress of self-driving vehicles. However, the dependence on 3D object models and their annotations collected and owned by individual companies has become a major problem for the development of new algorithms. This thesis proposes an approach of directly using graphics models created from open-source datasets as the virtual representation of real-world objects. This approach uses Machine Learning techniques to extract 3D feature points and to create annotations from graphics models for the recognition of dynamic objects, such as cars, and for the verification of stationary and variable objects, such as buildings and trees. Moreover, it generates heat maps for the elimination of stationary/variable objects in real-time images before working on the recognition of dynamic objects. The proposed approach helps to bridge the gap between the virtual and physical worlds and to facilitate the development of new algorithms for self-driving vehicles

    Advances in Quantitative MRI: Acquisition, Estimation, and Application

    Full text link
    Quantitative magnetic resonance imaging (QMRI) produces images of potential MR biomarkers: measurable tissue properties related to physiological processes that characterize the onset and progression of specific disorders. Though QMRI has potential to be more diagnostic than conventional qualitative MRI, QMRI poses challenges beyond those of conventional MRI that limit its feasibility for routine clinical use. This thesis first seeks to address two of those challenges. It then applies these solutions to develop a new method for myelin water imaging, a challenging application that may be specifically indicative of certain white matter (WM) disorders. One challenge that presently precludes widespread clinical adoption of QMRI involves long scan durations: to disentangle potential biomarkers from nuisance MR contrast mechanisms, QMRI typically requires more data than conventional MRI and thus longer scans. Even allowing for long scans, it has previously been unclear how to systematically tune the "knobs" of MR acquisitions to reliably enable precise biomarker estimation. Chapter 4 formalizes these challenges as a min-max optimal acquisition design problem and solves this problem to design three fast steady-state (SS) acquisitions for precise T1/T2 estimation, a popular QMRI application. The resulting optimized acquisition designs illustrate that acquisition design can enable new biomarker estimation techniques from established MR pulse sequences, a fact that subsequent chapters exploit. Another QMRI challenge involves the typically nonlinear dependence of MR signal models on the underlying biomarkers: these nonlinearities cause conventional likelihood-based estimators to either scale very poorly with the number of unknowns or risk producing suboptimal estimates due to spurious local minima. Chapter 5 instead introduces a fast, general method for dictionary-free QMRI parameter estimation via regression with kernels (PERK). PERK first uses prior distributions and the nonlinear MR signal model to simulate many parameter-measurement pairs. Inspired by machine learning, PERK then takes these pairs as labeled training points and learns from them a nonlinear regression function using kernel functions and convex optimization. Chapter 5 demonstrates PERK for T1/T2 estimation using one of the acquisitions optimized in Chapter 4. Simulations as well as single-slice phantom and in vivo experiments demonstrated that PERK and two well-suited maximum-likelihood (ML) estimators produce comparable T1/T2 estimates, but PERK is consistently at least 140x faster. Similar comparisons to an ML estimator in a more challenging problem (Chapter 6) suggest that this 140x acceleration factor will increase by several orders of magnitude for full-volume QMRI estimation problems involving more latent parameters per voxel. Chapter 6 applies ideas developed in previous chapters to design a new fast method for imaging myelin water content, a potential biomarker for healthy myelin. It first develops a two-compartment dual-echo steady-state (DESS) signal model and then uses a Bayesian variation of acquisition design (Chapter 4) to optimize a new DESS acquisition for precise myelin water imaging. The precision-optimized acquisition is as fast as conventional SS myelin water imaging acquisitions, but enables 2-3x better expected coefficients of variation in fast-relaxing fraction estimates. Simulations demonstrate that PERK (Chapter 5) and ML fast-relaxing fraction estimates from the proposed DESS acquisition exhibit comparable root mean-squared errors, but PERK is more than 500x faster. In vivo experiments are to our knowledge the first to demonstrate lateral WM myelin water content estimates from a fast (3m15s) SS acquisition that are similar to conventional estimates from a slower (32m4s) MESE acquisition.PHDElectrical and Computer EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/147486/1/gnataraj_1.pd

    Image-set, Temporal and Spatiotemporal Representations of Videos for Recognizing, Localizing and Quantifying Actions

    Get PDF
    This dissertation addresses the problem of learning video representations, which is defined here as transforming the video so that its essential structure is made more visible or accessible for action recognition and quantification. In the literature, a video can be represented by a set of images, by modeling motion or temporal dynamics, and by a 3D graph with pixels as nodes. This dissertation contributes in proposing a set of models to localize, track, segment, recognize and assess actions such as (1) image-set models via aggregating subset features given by regularizing normalized CNNs, (2) image-set models via inter-frame principal recovery and sparsely coding residual actions, (3) temporally local models with spatially global motion estimated by robust feature matching and local motion estimated by action detection with motion model added, (4) spatiotemporal models 3D graph and 3D CNN to model time as a space dimension, (5) supervised hashing by jointly learning embedding and quantization, respectively. State-of-the-art performances are achieved for tasks such as quantifying facial pain and human diving. Primary conclusions of this dissertation are categorized as follows: (i) Image set can capture facial actions that are about collective representation; (ii) Sparse and low-rank representations can have the expression, identity and pose cues untangled and can be learned via an image-set model and also a linear model; (iii) Norm is related with recognizability; similarity metrics and loss functions matter; (v) Combining the MIL based boosting tracker with the Particle Filter motion model induces a good trade-off between the appearance similarity and motion consistence; (iv) Segmenting object locally makes it amenable to assign shape priors; it is feasible to learn knowledge such as shape priors online from Web data with weak supervision; (v) It works locally in both space and time to represent videos as 3D graphs; 3D CNNs work effectively when inputted with temporally meaningful clips; (vi) the rich labeled images or videos help to learn better hash functions after learning binary embedded codes than the random projections. In addition, models proposed for videos can be adapted to other sequential images such as volumetric medical images which are not included in this dissertation
    • …
    corecore