Optimal Sampling in Compressed Sensing
|
|
- Elvin Bennett
- 5 years ago
- Views:
Transcription
1 Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In the context of MRI, this techniqe is appealing since a smaller dataset implies faster imaging. This work seeks to explore the mathematics of compressed sensing and to look for ways to generate optimal sampling patterns. The content of this report incldes the following: A simplified overview of compressed sensing Optimality measres for sampling patterns Methodology sed for optimally sampling 1x1 images Analyses and simlation reslts based on optimal sampling of 1x1 images Overview In order to recover an object x R N from a measrement set f R M is where M << N, we have to solve an extremely ill-posed problem: Φ x = f, (1) where Φ R MxN is the measrement system (the ndersampled Forier basis in the case of MRI). This is an nderdetermined system and has infinitely many soltions. So how do we make this problem tractable? The sccess of compressed sensing rests on two key tenets. The first key idea of compressed sensing is to add more information to the inverse problem by exploiting the idea that we can find a basis Ψ R NxN, in which, the objects we intend to image will have a sparse representation. In other words, x = Ψs, () where s R N and has at most K non-zero elements. How this extra information is added will be explained shortly, in the context of the inverse problem formlation. Before that, we are still to find a way to prevent aliasing artifacts in the reconstrcted image de to severe ndersampling in the dataset f. This leads s to the second key idea, which is to make sre that the systems Φ and Ψ are incoherent. This ensres that the aliasing artifacts will appear noise-like in the Ψ domain and are spread ot over all the bases. Ths, the K dominant elements of s are less likely to be corrpted by aliasing. Now, let s look at the formlation of the complete inverse problem:
2 minimize s.t. Ψ x 1 Φ x f < ε (3) The first condition involving the minimization of the L 1 norm of s = Ψ x imposes the sparseness condition as illstrated in Figre 1 [1]. The second condition, where ε is a small positive nmber, ensres that the soltion is consistent with the data f. Figre 1: (a) A sparse vector s lies on a K-dimensional hyperplane aligned with the coordinate axes in R N and ths close to the axes. (b) L minimization gives s the point where the largest hypersphere toches the nllspace (green hyperplane), (c) L 1 minimization will give s a point near the coordinate axes, which is where the sparse vector s is located. [1] Optimal Sampling The primary qestion this work is aiming to tackle is this: How do we choose the best sampling pattern and hence the ndersampling measrement operator, Φ? The existing literatre point at two main approaches: Correlation-based approach Assming Φ, Ψ R NxN are orthobases, the coherence between the two is given by eqation () [,3]. ( Φ, Ψ) = N max φk ψ j µ, 1 k, j N () The idea is to choose Φ for a fixed Ψ sch that they are maximally incoherent, for reasons mentioned before. It can be shown that µ ( Φ, Ψ) [ 1, N ]. Also, random matrices are largely incoherent with any given basis Φ. Herein lies the sccess of random sampling schemes. Another way to measre the coherence is to look at the maximm side-lobe-to-peak ratio in the transform point spread fnction defined in [] as:
3 TPSF( i, j) = e j Ψ Φ ΦΨe i, (5) The two measres have similar connotations and similar comptational costs (as we shall see later). Combinatorial approach As illstrated in Figre, we may look at the measrement, f, as a linear combination of K colmns of Θ =ΦΨ, where Θ, Φ R MxN, Ψ R NxN. If we knew beforehand which of the K elements of s are non-zero, we cold have constrcted a stable, well-conditioned system Θ, by making sre it preserves the lengths of the particlar K-sparse vectors, as given by the restricted isometry property [] in eqation (): Θs δ s = s () In real life, we do not know the particlar K non-zero locations. Ths we wold have to verify eqation () for every one of the grops of colmns in every possible Φ N CK MxN R. This appears to be a danting task considering the prohibitively expensive comptations involved! f f Figre : Representation of f as a linear combination of K colmns of Θ = ΦΨ, where Θ,Φ R MxN, Ψ R NxN, and s is K-sparse. [1] Methodology Let s now look at the reslts presented so far in the context of MRI. To simplify comptation, let s assme we are trying to recover a small 1x1 image (a total of N = 5 pixels) from ndersampled Forier (k-space) data. Or focs is on a DFT Cartesian readot scheme, widely sed in MRI, in which ndersampling is restricted to the phase-encodes, while the readots are flly sampled. The D Forier and Wavelet transforms F and S of the image X R nxn (n = 1) may be written as: F = Φ XΦ S = Ψ XΨ (7) Here Φ R nxn and Ψ R nxn are the Forier and Wavelet operators respectively. In order to be able to apply eqations 1- to or problem, we mst first represent the D
4 transforms in the eqations (7) as linear transformations of the stacked image vector x R N (N=5). We se the fact that the separable D transform matrix can be written as the Kronecker tensor prodct of the transforms: Φ =Φ Φ Ψ =Ψ Ψ () Once these operators have been constrcted, we can formlate or problem in the form described in Figre. We pose or analysis as a series of qestions, which will be answered in the next section: 1. For given N and Φ (the fll Forier operator in this case), what Ψ shold we chose?. What are the comptational costs involved in sing the two different approaches for finding optimal patterns for a given object size N? 3. For given N, Φ, and Ψ, and for M samples, what Φ shold be optimal? Reslts The Wavelet Transform We look for an answer to qestion 1 assming N = 5 and Φ is the fll (orthonormal) Forier matrix. The answer will decide two key things: the sparsity, K, of s and the natral coherence µ ( Φ, Ψ) between the two bases. The first of these is primarily determined by the coarseness level. Figre 3 shows or 1x1 test object, and its level Haar transform. Figre shows plots of the level, 3, and Haar coefficients (the level coefficients being the pixel intensities in the object itself). Figre 5 shows the level Coiflet- transform coefficients and the image reconstrcted from the 15 largest of these indicating the compressibility of or test object. Test Object Level Haar Transform of the Test Object Figre 3: The 1x1 test object (left) and its level Haar transform (right)
5 (a) (b) (c) Figre : Haar Coefficients for levels (a), (b) 3, and (c) (actal pixel intensities) respectively Level Coiflet Transform of the Test Object Image Constrcted from the 15 Largest Coiflet Coefficients Figre 5: (a) Level transform sing Coiflet- wavelets (b) Image constrcted from the 15 largest coefficients indicating compressibility
6 The coefficients were compted for different wavelets generated sing WaveLab 50, and it was observed that the fraction of nonzero coefficients was abot 7% for level and abot 0% with level 3. Next we se eqation to compte the coherence of different wavelet bases with the Forier bases. The reslts are shown in tables I and II for N = 5 and N = respectively. Table I Coherence measres between wavelet bases and the Forier bases for N = 5 Level K Haar- Coiflet- Dabechies- Symmlet- ~7% ~0% Table II Coherence measres between wavelet bases and the Forier bases for N = Level Haar- Coiflet- Dabechies- Symmlet The analysis gives s similar reslts for different wavelet types. Also, it indicates a tradeoff between sparsity and incoherence. So we shall be looking at optimal sampling patterns for both levels and 3. Also, we choose the Haar bases for their inherent simplicity and ease of implementation. Comptational Costs Next, we address qestion and look at the comptational costs involved in sing the two different approaches for finding optimal patterns for a given object size N. Table III lists the nmber of iterations in the combinatorial approach and the correlation-based approaches. Table III Nmber of iterations reqired by different approaches Nmber of ways to pick m samples from n: n C m 1 C = 10 3 C = Combinatorial Coherence SPR 5 C 1 ~ C 3 ~ In order to handle larger images and more phase encodes, we wold have to resort to Monte Carlo simlations as was done in []. Crrently, we are restricting orselves to a 1x1 image and phase encodes. Optimal Sampling Patterns The coherence comptations revealed a minimm coherence level of 1. There was a set of patterns corresponding to this coherence level. Masks for the corresponding
7 sampling patterns were generated and the Forier matrix, Φ, was zero-padded. This zero-padded matrix is then sed to generate ndersampled k-space data and to reconstrct the object. The Sparse MRI V0. set of Matlab fnctions was sed for reconstrction. Figre shows the first test object. Figre 7 shows a set of phase encode levels that lead to minimm coherence and lastly the reconstrcted image Figre : The first test object (same as the one sed before for analyzing wavelets) (a) (b) Figre 7: (a) A set of phase encode levels that lead to minimm coherence, and (b) the reconstrcted image. The reconstrcted image does not look too good obviosly becase data arond center of k-space is missing. To get arond this, we pick a different sampling pattern that gives the same minimm coherence, bt incldes the central phase encode levels. Figre shows this sampling pattern, the initial gess generated from a backward projection of the zero-padded Forier matrix on the ndersampled data, and lastly the reconstrcted image. A second test object is shown in Figre 9. The reconstrction reslts for this object for the sampling pattern in Figre (a) is shown in Figre.
8 (a) (b) (c) Figre : (a) Optimal sampling pattern that incldes central phase encode levels, (b) the initial gess generated from a backward projection of the zero-padded Forier matrix on the ndersampled data, and (c) the mch smoother reconstrcted image Figre 9: Second test object: Another 1x1 image derived from a web icon.
9 Figre : (a) The blrry initial gess generated from a backward projection of the zeropadded Forier matrix on the ndersampled data and (b) the reconstrcted image. Conclsion The main goals of this project were to develop an nderstanding of compressed sensing in the context of its application in MRI, to explore optimal sampling, and to develop optimal sampling patterns for small images with 1x1 pixels. The reconstrcted images look reasonably good and certainly better than those generated by back-projecting the zero-padded Forier matrix on the ndersampled data. Overall, this project was a great learning experience, and I wold like to stdy ahead and frther explore the intricacies of the mathematics behind compressed sensing. References [1] R. G. Baranik, Compressive Sensing [Lectre Notes], IEEE SPM, vol., no., pp , Jly, 007. [] E. Candès and M. B. Wakin, People Hearing Withot Listening: An Introdction To Compressive Sampling, (To appear in IEEE SPM). [3] E. Candès, Compressive sampling, Proceedings of the International Congress of Mathematicians, Madrid, Spain, 00. [] M. Lstig, D. Donoho, and J. M. Paly, Sparse MRI: The application of compressed sensing for rapid MR imaging, Magn. Reson Med., vol. 5, no., pp , Dec., 007.
A sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationSeismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia
Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Colmbia SUMMARY Approximate message passing (AMP) is a comptationally
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationImage Denoising Algorithms
Image Denoising Algorithms Xiang Hao School of Compting, University of Utah, USA, hao@cs.tah.ed Abstract. This is a report of an assignment of the class Mathematics of Imaging. In this assignment, we first
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationAn Introduction to GPU Computing. Aaron Coutino MFCF
An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationPARALLEL MRI RECONSTRUCTION USING SVD-AND- LAPLACIAN TRANSFORM BASED SPARSITY REGULARIZATION
PARALLEL MRI RECONSTRUCTION USING SVD-AND- LAPLACIAN TRANSFORM BASED SPARSITY REGULARIZATION JING BIAN, YAMING WANG, HUAXIONG ZHANG, LITAO ZHU, MINGFENG JIANG School of Information Science and Technology,
More information10.2 Solving Quadratic Equations by Completing the Square
. Solving Qadratic Eqations b Completing the Sqare Consider the eqation We can see clearl that the soltions are However, What if the eqation was given to s in standard form, that is 6 How wold we go abot
More informationDIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES
DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More informationObject Pose from a Single Image
Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the
More informationStatistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem
Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationImage Restoration Image Degradation and Restoration
Image Degradation and Restoration hxy Image Degradation Model: Spatial domain representation can be modeled by: g x y h x y f x y x y Freqency domain representation can be modeled by: G F N Prepared By:
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationRequirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems
Reqirements Engineering Objectives An introdction to reqirements Gerald Kotonya and Ian Sommerville To introdce the notion of system reqirements and the reqirements process. To explain how reqirements
More informationAlliances and Bisection Width for Planar Graphs
Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationOCIS codes: ( ) Microscopy; ( ) Partial coherence in imaging; ( ) Image reconstruction techniques
Sparsity based sb-wavelength imaging with partially incoherent light via qadratic compressed sensing Yoav Shechtman 1, Yonina C. Eldar, Alexander Szameit 1 and Mordechai Segev 1 1 Physics Department and
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationA GENERIC MODEL OF A BASE-ISOLATED BUILDING
Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes
More informationEFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th
EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES Crtis D. Mobley and Lydia Sndman Seqoia Scientific, Inc. th 15317 NE 90 Street Redmond, WA 98052 USA mobley@seqoiasci.com phone: 425-867-2464
More informationMETAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY
VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationTOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS
TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS Bastien Pasdelop, Réda Alami, Vincent Gripon Telecom Bretagne UMR CNRS Lab-STICC name.srname@telecom-bretagne.e Michael Rabbat McGill University ECE
More informationNash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns.
Convergence of Gradient Dynamics in General-Sm Games Satinder Singh AT&T Labs Florham Park, NJ 7932 bavejaresearch.att.com Michael Kearns AT&T Labs Florham Park, NJ 7932 mkearnsresearch.att.com Yishay
More informationCollaborative Sparsity and Compressive MRI
Modeling and Computation Seminar February 14, 2013 Table of Contents 1 T2 Estimation 2 Undersampling in MRI 3 Compressed Sensing 4 Model-Based Approach 5 From L1 to L0 6 Spatially Adaptive Sparsity MRI
More informationG Practical Magnetic Resonance Imaging II Sackler Institute of Biomedical Sciences New York University School of Medicine. Compressed Sensing
G16.4428 Practical Magnetic Resonance Imaging II Sackler Institute of Biomedical Sciences New York University School of Medicine Compressed Sensing Ricardo Otazo, PhD ricardo.otazo@nyumc.org Compressed
More informationImage Compression Compression Fundamentals
Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers
More informationSignal Reconstruction from Sparse Representations: An Introdu. Sensing
Signal Reconstruction from Sparse Representations: An Introduction to Compressed Sensing December 18, 2009 Digital Data Acquisition Suppose we want to acquire some real world signal digitally. Applications
More informationEMC ViPR. User Guide. Version
EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate
More informationNew-Sum: A Novel Online ABFT Scheme For General Iterative Methods
New-Sm: A Novel Online ABFT Scheme For General Iterative Methods Dingwen Tao (University of California, Riverside) Shaiwen Leon Song (Pacific Northwest National Laboratory) Sriram Krishnamoorthy (Pacific
More informationInvestigation of turbulence measurements with a continuous wave, conically scanning LiDAR Abstract 1. Introduction
Investigation of trblence measrements with a continos wave, conically scanning LiDAR Rozenn Wagner 1, Torben Mikkelsen 1, Michael Cortney Risø DTU, PO Box 49,DK4000 Roskilde, Denmark rozn@risoe.dt.dk Abstract
More informationFunctions of Combinational Logic
CHPTER 6 Fnctions of Combinational Logic CHPTER OUTLINE 6 6 6 6 6 5 6 6 6 7 6 8 6 9 6 6 Half and Fll dders Parallel inary dders Ripple Carry and Look-head Carry dders Comparators Decoders Encoders Code
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationAUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING
AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationCompressive Sensing Based Image Reconstruction using Wavelet Transform
Compressive Sensing Based Image Reconstruction using Wavelet Transform Sherin C Abraham #1, Ketki Pathak *2, Jigna J Patel #3 # Electronics & Communication department, Gujarat Technological University
More informationCompound Catadioptric Stereo Sensor for Omnidirectional Object Detection
Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,
More informationSTABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION
STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH
More informationContinuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function
J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction
More informationConstructing and Comparing User Mobility Profiles for Location-based Services
Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,
More informationSwitched state-feedback controllers with multi-estimators for MIMO systems
Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November - 6 89 witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR
More informationPARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT
PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationMultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny
MltiView: Improving Trst in Grop Video Conferencing Throgh Spatial Faithflness David T. Ngyen, John F. Canny CHI 2007, April 28 May 3, 2007, San Jose, California, USA Presented by: Stefan Stojanoski 1529445
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More informationLecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat
Lectre 4: Roting CSE 222A: Compter Commnication Networks Alex C. Snoeren Thanks: Amin Vahdat Lectre 4 Overview Pop qiz Paxon 95 discssion Brief intro to overlay and active networking 2 End-to-End Roting
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationStereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection
Stereo Matching and 3D Visalization for Gamma-Ray Cargo Inspection Zhigang Zh *ab, Y-Chi H bc a Department of Compter Science, The City College of New York, New York, NY 3 b Department of Compter Science,
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationProf. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:
EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationAAA CENTER FOR DRIVING SAFETY & TECHNOLOGY
AAA CENTER FOR DRIVING SAFETY & TECHNOLOGY 2017 FORD MUSTANG PREMIUM CONVERTIBLE INFOTAINMENT SYSTEM* DEMAND RATING Very High Demand The Ford Mstang Convertible s SYNC 3 (version 2.20) infotainment system
More informationNETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS
ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French
More informationTowards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions
Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationTowards applications based on measuring the orbital angular momentum of light
CHAPTER 8 Towards applications based on measring the orbital anglar momentm of light Efficient measrement of the orbital anglar momentm (OAM) of light has been a longstanding problem in both classical
More informationA Frequency-optimized Discontinuous Formulation for Wave Propagation Problems
th Flid Dynamics Conference and Ehibit 8 Jne - Jly, Chicago, Illinois AIAA -55 A Freqency-optimized Discontinos Formlation for Wave Propagation Problems Yi Li and Z. J. Wang Department of Aerospace Engineering
More informationCS 251, Winter 2018, Assignment % of course mark
CS 25, Winter 28, Assignment 3.. 3% of corse mark De onday, Febrary 26th, 4:3 P Lates accepted ntil : A, Febrary 27th with a 5% penalty. IEEE 754 Floating Point ( points): (a) (4 points) Complete the following
More informationA choice relation framework for supporting category-partition test case generation
Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593
More informationCost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks
Cost Based Local Forwarding Transmission Schemes for Two-hop Celllar Networks Zhenggang Zhao, Xming Fang, Yan Long, Xiaopeng H, Ye Zhao Key Lab of Information Coding & Transmission Sothwest Jiaotong University,
More informationLayered Light Field Reconstruction for Defocus Blur
Layered Light Field Reconstrction for Defocs Blr KARTHIK VAIDYANATHAN, JACOB MUNKBERG, PETRIK CLARBERG and MARCO SALVI Intel Corporation We present a novel algorithm for reconstrcting high qality defocs
More informationDiscrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX
More informationCompressive Sensing for Multimedia. Communications in Wireless Sensor Networks
Compressive Sensing for Multimedia 1 Communications in Wireless Sensor Networks Wael Barakat & Rabih Saliba MDDSP Project Final Report Prof. Brian L. Evans May 9, 2008 Abstract Compressive Sensing is an
More informationASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES
ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES Workgrop Metrology of CNRS research network 2519 a MCIMS, Presented by Larent Robert and Jean-José Orte b a http://www.ifma.fr/lami/gdr2519/ b CROMeP,
More informationCS 153 Design of Operating Systems Spring 18
CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit
More informationQoS-driven Runtime Adaptation of Service Oriented Architectures
Qo-driven Rntime Adaptation of ervice Oriented Architectres Valeria ardellini 1 Emiliano asalicchio 1 Vincenzo Grassi 1 Francesco Lo Presti 1 Raffaela Mirandola 2 1 Dipartimento di Informatica, istemi
More informationDiscretized Approximations for POMDP with Average Cost
Discretized Approximations for POMDP with Average Cost Hizhen Y Lab for Information and Decisions EECS Dept., MIT Cambridge, MA 0239 Dimitri P. Bertsekas Lab for Information and Decisions EECS Dept., MIT
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationMaximum Weight Independent Sets in an Infinite Plane
Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 11 Fall, 2018
Assigned: 11/14/18 Lectre 24 De: 11/21/18 Lectre 26 11-1) A 200 mm x 300 mm monochrome monitor is to be viewed b an observer at a distance of 0.5 m. The desired image qalit is to be excellent as determined
More informationSignal and Image Recovery from Random Linear Measurements in Compressive Sampling
Signal and Image Recovery from Random Linear Measurements in Compressive Sampling Sarah Mazari and Kamel Belloulata Abstract In many applications, including audio or digital imaging, the Nyquist rate is
More informationAn Extensive Study of Static Regression Test Selection in Modern Software Evolution
An Extensive Stdy of Static Regression Test Selection in Modern Software Evoltion Owolabi Legnsen 1, Farah Hariri 1, Agst Shi 1, Yafeng L 2, Lingming Zhang 2, and Darko Marinov 1 1 Department of Compter
More informationImage Enhancement in the Frequency Domain Periodicity and the need for Padding:
Prepared B: Dr. Hasan Demirel PhD Image Enhancement in the Freqenc Domain Periodicit and the need for Padding: Periodicit propert of the DFT: The discrete Forier Transform and the inverse Forier transforms
More informationCOMPRESSIVE VIDEO SAMPLING
COMPRESSIVE VIDEO SAMPLING Vladimir Stanković and Lina Stanković Dept of Electronic and Electrical Engineering University of Strathclyde, Glasgow, UK phone: +44-141-548-2679 email: {vladimir,lina}.stankovic@eee.strath.ac.uk
More informationMinimum Spanning Trees Outline: MST
Minimm Spanning Trees Otline: MST Minimm Spanning Tree Generic MST Algorithm Krskal s Algorithm (Edge Based) Prim s Algorithm (Vertex Based) Spanning Tree A spanning tree of G is a sbgraph which is tree
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationCS 251, Spring 2018, Assignment 3.0 3% of course mark
CS 25, Spring 28, Assignment 3. 3% of corse mark De onday, Jne 25th, 5:3 P. (5 points) Consider the single-cycle compter shown on page 6 of this assignment. Sppose the circit elements take the following
More informationReal-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance
POSTPRINT OF: IEEE TRANS. SYST., MAN, CYBERN., B, 383), 28, 884 893. 1 Real-Time Robot Path Planning ia a Distance-Propagating Dynamic System with Obstacle Clearance Allan R. Willms, Simon X. Yang Member,
More informationComparison of memory write policies for NoC based Multicore Cache Coherent Systems
Comparison of memory write policies for NoC based Mlticore Cache Coherent Systems Pierre Gironnet de Massas, Frederic Petrot System-Level Synthesis Grop TIMA Laboratory 46, Av Felix Viallet, 38031 Grenoble,
More informationData/Metadata Data and Data Transformations
A Framework for Classifying Scientic Metadata Helena Galhardas, Eric Simon and Anthony Tomasic INRIA Domaine de Volcea - Rocqencort 7853 Le Chesnay France email: First-Name.Last-Name@inria.fr Abstract
More informationThis chapter is based on the following sources, which are all recommended reading:
Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationarxiv: v1 [cs.cg] 27 Nov 2015
On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More information