DOCSLIB.ORG

Mathematics Behind Image Compression

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Journal of Student Research (2014) Volume 3, Issue 1: pp. 46-62 Mathematics Behind Image Compression Stefany Franco1, Dr. Tanvir Prince1, Ildefonso Salva2, and Charlie Windolf3 Image compression is fundamental to NASA and the world’s daily operations. Images are transmitted to NASA from satellites and even Mars, making it very important to send data as efficiently as possible through the low-bandwidth links to these locations. This project focuses its studies in three areas. First, a hands-on mathematical analysis of the singular value decomposition (SVD) compression. Second, on the area of two field experiments that explore the effect of light conditions, shot composition and content, as well as the time of day and other variables on the file sizes of images generated in a digital camera that implements JPEG compression. Third, is about an in-depth study of the JPEG algorithm. In the SVD study, the team analyzed mathematically how matrices are manipulated to return to its equivalent original matrix and the theory about SVD is reinforced by using the software Wolfram Mathematica to compress images from NASA satellites and Mars rover. Mathematica analyzed the file size and timing data for the compression process. In the field experiment, a camera with fixed focus, aperture, and other shooting parameters was used to take pictures at various times of day of the same scene to see how the amount and quality of daylight influenced JPEG’s ability to compress images. The same camera with the parameters still fixed was used to shoot various locations, indoors and outdoors, at the same time of day to see how the content of the photo influenced JPEG file sizes. Finally, the team looked at JPEG’s compression algorithm using Wolfram Mathematica to better understand its efficiency and power, since NASA’s radiation-hardened computer processors are generally not powerful enough to compress images with JPEG. Loosely, the team found that JPEG is best able to compress images with little variation pixel to pixel in color or brightness, and that it provides better looking images at the same file size than SVD compression. Keywords: Image Compression; compression ratio; Singular Value Decomposition (SVD); JPEG; Decompression; Huffman Coding; Discrete Cosine Transform; quantization. Introduction Wolfram Mathematica program is significant for storing the digital files and transmission of information to NASA and to This research project is in connection to computer the unman robot from Mars. science and information theory. When something is Two field experiments have to be conducted to infer compressed, it simply means information is stored in fewer whether the JPEG file size of an image has relation with time bits than the original data. Compression can be classified in and various locations both indoors and outdoors provided that two categories: lossless or lossy. Lossless compression is the settings of the digital camera are constant. The results of when the data is compressed but the original information these two field experiments will be analyzed and will be remains intact. Lossy compression however, is when the illustrated through scatter plots and bar graphs. information is compressed but some data is lost along the The JPEG field experiments' outcomes will serve as a process. Compression is useful because it can save storage motivation to further the study of JPEG compression. space and also increases transmission capacity. Moreover, the team will examine the algorithm of JPEG The team focuses on three areas of study namely: the compression by transforming mathematically the given image exploration and manipulation of the mathematical algorithm and apply Wolfram Mathematica to perform JPEG of SVD and hands-on experiment of image compression using compression. To learn more about the mathematica software, SVD with the help of Wolfram Mathematica program; the please see (Purdue University) and (Wolfram Mathematica, actual two field experiments using digital camera with fixed 2013). settings to determine if there are changes in the files size of the same image from 9 AM to 2:00 PM with 30 minutes Importance of compression interval and to determine the files sizes of different images Data is something very useful in the present stage. done at fixed time of the day; and the analysis of the Basically everybody has access to it, some however need it mathematical algorithm and hands-on experiment of JPEG more than others. Some can be threatened by the amount of compression using Wolfram Mathematica program. space needed and their available budget for it. Others are SVD is applicable to image compression using the threatened not only by the budget, but by available technology principles and operation of matrices. The image can be and human patience. With this in mind many will rely on data represented by a matrix of m by n size and can be compression as a way to meet certain requirements and decomposed into three matrices. The result of the affordable data handling. multiplication of these matrices will reconstruct the original Image/Video data compression is a very critical image when all singular values in decreasing order are technology for many operations in NASA (White). The goal utilized. In order to compress the image, the first few singular of NASA is not only to lower the data amount by values are sufficient to produce a reduced file size of an compressing it, because this will save money and save space. image but still preserving the important elements of the said They also want to improve the time it takes to access that data image. The more detail procedure can be seen on (Cooper & as some people might need the data to be available right Lorenc, 2006). This principle of SVD compression using away, or their real time science may demand it. 1. Department of Mathematics, Hostos Community College, City University of New York. Bronx, NY 10451 2. Mott Haven Village Preparatory High School. Bronx NY 10466 3. Collegiate School. New York, NY 10024 Journal of Student Research (2014) Volume 3, Issue 1: pp. 46-62 In NASA, image compression is used for three main high rate video, low rate video, science imaging data, and reasons. First, compression saves space. NASA receives telerobotics video. millions of bits of data each day that require a huge storage Some of the image/video data mentioned before can facility. NASA also has two or more backups for all the benefit greatly from compression because it would take up information they have. By using compression, NASA saves less space and therefore can be transmitted faster. Other an enormous amount of hard drive space. Second, image/video data such as scientific data and telerobotics image/video compression saves transmission time. For videos are very valuable and irreplaceable, so NASA is example, the NASA Mars Rovers sends back pictures and reluctant to consider any type of compression on these data which can take up to years to reach Earth if (Group). uncompressed due to the massive distance between the two. Distance also has a direct relationship with transmission rate, Mathematics behind Singular Value Decomposition for example Mars is 3.74x108 km away from Earth, as (SVD): Here we will only summarize the known result. opposed to the moon that is only 4.05x103 km. Lastly, Readers are encouraged to consult any introductory books on compression saves money by saving hard drive space and linear algebra, for example, (Strang, 2009). A nice time (Rahman Z.). chronological history of “Singular Value Decomposition” can NASA identified various lunar/Mars mission be found on (Stewart, 1993). SVD is based on a theorem from requirements that involve transmission of image/video, these linear algebra that says that a rectangular matrix, “A”, can be can be categorized into several types; high rate video, edited decomposed into the product of three matrices. Where: Am,n is a given matrix that represents an image T Um,m is an orthogonal matrix wherein the columns of matrix U are the orthonormal eigenvectors of AA T T Vn,n is the transpose of an orthogonal matrix V wherein the columns of matrix V are the orthonormal eigenvectors of A A. Dm,n is a diagonal matrix wherein the diagonal elements are singular value, σi, equal to the square root of the eigenvalue associated with the eigenvectors ui and vi in descending order. σ1 ≥ σ2 ≥ .… ≥ σn ≥ 0 Mathematica Lab experiment for SVD compression In this experiment, the team used Wolfram Mathematica contain more information about the original matrix A than the to study the effects of SVD compression on an image. SVD later values. compression uses singular value decomposition of matrices to This decomposition can be used to compress images. reduce the amount of information stored in an image so that it Images are represented as matrices inside computers. Since can be stored in much less space than the original image was. the first singular values contain more information than the In singular value decomposition, a matrix – call it A – is later ones, by taking only the first few singular values it is decomposed into a series of coefficients multiplied by two possible to reduce the amount of information contained in an other matrices derived from A. These coefficients are that image and compress that image (Image Compression, 2011). matrix A’s singular values. The series of singular values is In Mathematica, we took an image of Hyperion, a small moon arranged in decreasing order, so that the first singular values of Saturn, displayed below (Spacetelescope, 2013) and (Space): Figure 1: Hyperion image - a small moon of Saturn We then used Mathematica to compress the image with SVD, varying the number of coefficients. A series of compressed picture using increasing number of singular values are given below, where we specify the number of singular value coefficients.
Recommended publications
  • The General Linear Group

    The General Linear Group

    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
  • Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L

    Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L

    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 96, Number 2, February 1986 NORMAL SUBGROUPS OF THE GENERAL LINEAR GROUPS OVER VON NEUMANN REGULAR RINGS L. N. VASERSTEIN1 ABSTRACT. Let A be a von Neumann regular ring or, more generally, let A be an associative ring with 1 whose reduction modulo its Jacobson radical is von Neumann regular. We obtain a complete description of all subgroups of GLn A, n > 3, which are normalized by elementary matrices. 1. Introduction. For any associative ring A with 1 and any natural number n, let GLn A be the group of invertible n by n matrices over A and EnA the subgroup generated by all elementary matrices x1'3, where 1 < i / j < n and x E A. In this paper we describe all subgroups of GLn A normalized by EnA for any von Neumann regular A, provided n > 3. Our description is standard (see Bass [1] and Vaserstein [14, 16]): a subgroup H of GL„ A is normalized by EnA if and only if H is of level B for an ideal B of A, i.e. E„(A, B) C H C Gn(A, B). Here Gn(A, B) is the inverse image of the center of GL„(,4/S) (when n > 2, this center consists of scalar invertible matrices over the center of the ring A/B) under the canonical homomorphism GL„ A —►GLn(A/B) and En(A, B) is the normal subgroup of EnA generated by all elementary matrices in Gn(A, B) (when n > 3, the group En(A, B) is generated by matrices of the form (—y)J'lx1'Jy:i''1 with x € B,y £ A,l < i ^ j < n, see [14]).
  • Variational Problems on Flows of Diffeomorphisms for Image Matching

    Variational Problems on Flows of Diffeomorphisms for Image Matching

    QUARTERLY OF APPLIED MATHEMATICS VOLUME LVI, NUMBER 3 SEPTEMBER 1998, PAGES 587-600 VARIATIONAL PROBLEMS ON FLOWS OF DIFFEOMORPHISMS FOR IMAGE MATCHING By PAUL DUPUIS (LCDS, Division of Applied Mathematics, Brown University, Providence, RI), ULF GRENANDER (Division of Applied Mathematics, Brown University, Providence, Rl), AND MICHAEL I. MILLER (Dept. of Electrical Engineering, Washington University, St. Louis, MO) Abstract. This paper studies a variational formulation of the image matching prob- lem. We consider a scenario in which a canonical representative image T is to be carried via a smooth change of variable into an image that is intended to provide a good fit to the observed data. The images are all defined on an open bounded set GcR3, The changes of variable are determined as solutions of the nonlinear Eulerian transport equation ==v(rj(s;x),s), r)(t;x)=x, (0.1) with the location 77(0;x) in the canonical image carried to the location x in the deformed image. The variational problem then takes the form arg mm ;||2 + [ |Tor?(0;a;) - D(x)\2dx (0.2) JG where ||v|| is an appropriate norm on the velocity field v(-, •), and the second term at- tempts to enforce fidelity to the data. In this paper we derive conditions under which the variational problem described above is well posed. The key issue is the choice of the norm. Conditions are formulated under which the regularity of v(-, ■) imposed by finiteness of the norm guarantees that the associated flow is supported on a space of diffeomorphisms. The problem (0.2) can Received March 15, 1996.
  • Design and Implementation of Image Processing and Compression Algorithms for a Miniature Embedded Eye Tracking System Pavel Morozkin

    Design and Implementation of Image Processing and Compression Algorithms for a Miniature Embedded Eye Tracking System Pavel Morozkin

    Design and implementation of image processing and compression algorithms for a miniature embedded eye tracking system Pavel Morozkin To cite this version: Pavel Morozkin. Design and implementation of image processing and compression algorithms for a miniature embedded eye tracking system. Signal and Image processing. Sorbonne Université, 2018. English. NNT : 2018SORUS435. tel-02953072 HAL Id: tel-02953072 https://tel.archives-ouvertes.fr/tel-02953072 Submitted on 29 Sep 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Sorbonne Université Institut supérieur d’électronique de Paris (ISEP) École doctorale : « Informatique, télécommunications & électronique de Paris » Design and Implementation of Image Processing and Compression Algorithms for a Miniature Embedded Eye Tracking System Par Pavel MOROZKIN Thèse de doctorat de Traitement du signal et de l’image Présentée et soutenue publiquement le 29 juin 2018 Devant le jury composé de : M. Ales PROCHAZKA Rapporteur M. François-Xavier COUDOUX Rapporteur M. Basarab MATEI Examinateur M. Habib MEHREZ Examinateur Mme Maria TROCAN Directrice de thèse M. Marc Winoc SWYNGHEDAUW Encadrant Abstract Human-Machine Interaction (HMI) progressively becomes a part of coming future. Being an example of HMI, embedded eye tracking systems allow user to interact with objects placed in a known environment by using natural eye movements.
  • On Generalizations of Sylow Tower Groups

    On Generalizations of Sylow Tower Groups

    Pacific Journal of Mathematics ON GENERALIZATIONS OF SYLOW TOWER GROUPS ABI (ABIADBOLLAH)FATTAHI Vol. 45, No. 2 October 1973 PACIFIC JOURNAL OF MATHEMATICS Vol. 45, No. 2, 1973 ON GENERALIZATIONS OF SYLOW TOWER GROUPS ABIABDOLLAH FATTAHI In this paper two different generalizations of Sylow tower groups are studied. In Chapter I the notion of a fc-tower group is introduced and a bound on the nilpotence length (Fitting height) of an arbitrary finite solvable group is found. In the same chapter a different proof to a theorem of Baer is given; and the list of all minimal-not-Sylow tower groups is obtained. Further results are obtained on a different generalization of Sylow tower groups, called Generalized Sylow Tower Groups (GSTG) by J. Derr. It is shown that the class of all GSTG's of a fixed complexion form a saturated formation, and a structure theorem for all such groups is given. NOTATIONS The following notations will be used throughont this paper: N<]G N is a normal subgroup of G ΛΓCharG N is a characteristic subgroup of G ΛΓ OG N is a minimal normal subgroup of G M< G M is a proper subgroup of G M<- G M is a maximal subgroup of G Z{G) the center of G #>-part of the order of G, p a prime set of all prime divisors of \G\ Φ(G) the Frattini subgroup of G — the intersec- tion of all maximal subgroups of G [H]K semi-direct product of H by K F(G) the Fitting subgroup of G — the maximal normal nilpotent subgroup of G C(H) = CG(H) the centralizer of H in G N(H) = NG(H) the normalizer of H in G PeSy\p(G) P is a Sylow ^-subgroup of G P is a Sy-subgroup of G PeSγlp(G) Core(H) = GoreG(H) the largest normal subgroup of G contained in H= ΓioeoH* KG) the nilpotence length (Fitting height) of G h(G) p-length of G d(G) minimal number of generators of G c(P) nilpotence class of the p-group P some nonnegative power of prime p OP(G) largest normal p-subgroup of G 453 454 A.
  • LM2931-N SNOSBE5G –MARCH 2000–REVISED APRIL 2013 LM2931-N Series Low Dropout Regulators Check for Samples: LM2931-N

    LM2931-N SNOSBE5G –MARCH 2000–REVISED APRIL 2013 LM2931-N Series Low Dropout Regulators Check for Samples: LM2931-N

    LM2931-N www.ti.com SNOSBE5G –MARCH 2000–REVISED APRIL 2013 LM2931-N Series Low Dropout Regulators Check for Samples: LM2931-N 1FEATURES DESCRIPTION The LM2931-N positive voltage regulator features a 2• Very Low Quiescent Current very low quiescent current of 1mA or less when • Output Current in Excess of 100 mA supplying 10mA loads. This unique characteristic and • Input-output Differential Less than 0.6V the extremely low input-output differential required for • Reverse Battery Protection proper regulation (0.2V for output currents of 10mA) make the LM2931-N the ideal regulator for standby • 60V Load Dump Protection power systems. Applications include memory standby • −50V Reverse Transient Protection circuits, CMOS and other low power processor power • Short Circuit Protection supplies as well as systems demanding as much as • Internal Thermal Overload Protection 100mA of output current. • Mirror-image Insertion Protection Designed originally for automotive applications, the LM2931-N and all regulated circuitry are protected • Available in TO-220, TO-92, TO-263, or SOIC-8 from reverse battery installations or 2 battery jumps. Packages During line transients, such as a load dump (60V) • Available as Adjustable with TTL Compatible when the input voltage to the regulator can Switch momentarily exceed the specified maximum operating voltage, the regulator will automatically shut down to protect both internal circuits and the load. The LM2931-N cannot be harmed by temporary mirror-image insertion. Familiar regulator features such as short circuit and thermal overload protection are also provided. The LM2931-N family includes a fixed 5V output (±3.8% tolerance for A grade) or an adjustable output with ON/OFF pin.
  • Institute for Clinical and Economic Review

    Institute for Clinical and Economic Review

    INSTITUTE FOR CLINICAL AND ECONOMIC REVIEW FINAL APPRAISAL DOCUMENT CORONARY COMPUTED TOMOGRAPHIC ANGIOGRAPHY FOR DETECTION OF CORONARY ARTERY DISEASE January 9, 2009 Senior Staff Daniel A. Ollendorf, MPH, ARM Chief Review Officer Alexander Göhler, MD, PhD, MSc, MPH Lead Decision Scientist Steven D. Pearson, MD, MSc President, ICER Associate Staff Michelle Kuba, MPH Sr. Technology Analyst Marie Jaeger, B.S. Asst. Decision Scientist © 2009, Institute for Clinical and Economic Review 1 CONTENTS About ICER .................................................................................................................................. 3 Acknowledgments ...................................................................................................................... 4 Executive Summary .................................................................................................................... 5 Evidence Review Group Deliberation.................................................................................. 17 ICER Integrated Evidence Rating.......................................................................................... 25 Evidence Review Group Members........................................................................................ 27 Appraisal Overview.................................................................................................................. 30 Background ................................................................................................................................ 33
  • Quasi P Or Not Quasi P? That Is the Question

    Quasi P Or Not Quasi P? That Is the Question

    Rose-Hulman Undergraduate Mathematics Journal Volume 3 Issue 2 Article 2 Quasi p or not Quasi p? That is the Question Ben Harwood Northern Kentucky University, [email protected] Follow this and additional works at: https://scholar.rose-hulman.edu/rhumj Recommended Citation Harwood, Ben (2002) "Quasi p or not Quasi p? That is the Question," Rose-Hulman Undergraduate Mathematics Journal: Vol. 3 : Iss. 2 , Article 2. Available at: https://scholar.rose-hulman.edu/rhumj/vol3/iss2/2 Quasi p- or not quasi p-? That is the Question.* By Ben Harwood Department of Mathematics and Computer Science Northern Kentucky University Highland Heights, KY 41099 e-mail: [email protected] Section Zero: Introduction The question might not be as profound as Shakespeare’s, but nevertheless, it is interesting. Because few people seem to be aware of quasi p-groups, we will begin with a bit of history and a definition; and then we will determine for each group of order less than 24 (and a few others) whether the group is a quasi p-group for some prime p or not. This paper is a prequel to [Hwd]. In [Hwd] we prove that (Z3 £Z3)oZ2 and Z5 o Z4 are quasi 2-groups. Those proofs now form a portion of Proposition (12.1) It should also be noted that [Hwd] may also be found in this journal. Section One: Why should we be interested in quasi p-groups? In a 1957 paper titled Coverings of algebraic curves [Abh2], Abhyankar conjectured that the algebraic fundamental group of the affine line over an algebraically closed field k of prime characteristic p is the set of quasi p-groups, where by the algebraic fundamental group of the affine line he meant the family of all Galois groups Gal(L=k(X)) as L varies over all finite normal extensions of k(X) the function field of the affine line such that no point of the line is ramified in L, and where by a quasi p-group he meant a finite group that is generated by all of its p-Sylow subgroups.
  • A Fast Diffeomorphic Image Registration Algorithm

    A Fast Diffeomorphic Image Registration Algorithm

    www.elsevier.com/locate/ynimg NeuroImage 38 (2007) 95–113 A fast diffeomorphic image registration algorithm John Ashburner Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, WC1N 3BG, UK Received 26 October 2006; revised 14 May 2007; accepted 3 July 2007 Available online 18 July 2007 This paper describes DARTEL, which is an algorithm for diffeo- Many registration approaches still use a small deformation morphic image registration. It is implemented for both 2D and 3D model. These models parameterise a displacement field (u), which image registration and has been formulated to include an option for is simply added to an identity transform (x). estimating inverse consistent deformations. Nonlinear registration is considered as a local optimisation problem, which is solved using a Φ x x u x 1 Levenberg–Marquardt strategy. The necessary matrix solutions are ð Þ ¼ þ ð Þ ð Þ obtained in reasonable time using a multigrid method. A constant In such parameterisations, the inverse transformation is sometimes Eulerian velocity framework is used, which allows a rapid scaling and approximated by subtracting the displacement. It is worth noting that squaring method to be used in the computations. DARTEL has been this is only a very approximate inverse, which fails badly for larger applied to intersubject registration of 471 whole brain images, and the deformations. As shown in Fig. 1, compositions of these forward resulting deformations were evaluated in terms of how well they encode and “inverse” deformations do not produce an identity transform. the shape information necessary to separate male and female subjects Small deformation models do not necessarily enforce a one-to-one and to predict the ages of the subjects.
  • Acronyms Abbreviations &Terms

    Acronyms Abbreviations &Terms

    Acronyms Abbreviations &Terms A Capability Assurance Job Aid FEMA P-524 / July 2009 FEMA Acronyms Abbreviations and Terms Produced by the National Preparedness Directorate, National Integration Center, Incident Management Systems Integration Division Please direct requests for additional copies to: FEMA Publications (800) 480-2520 Or download the document from the Web: www.fema.gov/plan/prepare/faat.shtm U.S. Department of Homeland Security Federal Emergency Management Agency The FEMA Acronyms, Abbreviations & Terms (FAAT) List is not designed to be an authoritative source, merely a handy reference and a living document subject to periodic updating. Inclusion recognizes terminology existence, not legitimacy. Entries known to be obsolete (see new “Obsolete or Replaced” section near end of this document) are included because they may still appear in extant publications and correspondence. Your comments and recommendations are welcome. Please electronically forward your input or direct your questions to: [email protected] Please direct requests for additional copies to: FEMA Publications (800) 480-2520 Or download the document from the Web: www.fema.gov/plan/prepare/faat.shtm 2SR Second Stage Review ABEL Agent Based Economic Laboratory 4Wd Four Wheel Drive ABF Automatic Broadcast Feed A 1) Activity of Isotope ABHS Alcohol Based Hand Sanitizer 2) Ampere ABI Automated Broker Interface 3) Atomic Mass ABIH American Board of Industrial Hygiene A&E Architectural and Engineering ABIS see IDENT A&FM Aviation and Fire Management ABM Anti-Ballistic Missile
  • Parallel Heterogeneous Computing a Case Study on Accelerating JPEG2000 Coder

    Parallel Heterogeneous Computing a Case Study on Accelerating JPEG2000 Coder

    Parallel Heterogeneous Computing A Case Study On Accelerating JPEG2000 Coder by Ro-To Le M.Sc., Brown University; Providence, RI, USA, 2009 B.Sc., Hanoi University of Technology; Hanoi, Vietnam, 2007 A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in The School of Engineering at Brown University PROVIDENCE, RHODE ISLAND May 2013 c Copyright 2013 by Ro-To Le This dissertation by Ro-To Le is accepted in its present form by The School of Engineering as satisfying the dissertation requirement for the degree of Doctor of Philosophy. Date R. Iris Bahar, Ph.D., Advisor Date Joseph L. Mundy, Ph.D., Advisor Recommended to the Graduate Council Date Vishal Jain, Ph.D., Reader Approved by the Graduate Council Date Peter M. Weber, Dean of the Graduate School iii Vitae Roto Le was born in Duc-Tho, Ha-Tinh, a countryside area in the Midland of Vietnam. He received his B.Sc., with Excellent Classification, in Electronics and Telecommunications from Hanoi University of Technology in 2007. Soon after re- ceiving his B.Sc., Roto came to Brown University to start a Ph.D. program in Com- puter Engineering in Fall 2007. His Ph.D. program was sponsored by a fellowship from the Vietnam Education Foundation, which was selectively nominated by the National Academies’ scientists. During his Ph.D. program, he earned a M.Sc. degree in Computer Engineering in 2009. Roto has been studying several aspects of modern computing systems, from hardware architecture and VLSI system design to high-performance software design. He has published several articles in designing a parallel JPEG2000 coder based on heterogeneous CPU-GPGPU systems and designing novel Three-Dimensional (3D) FPGA architectures.
  • Move Ban for Industry Types

    Move Ban for Industry Types

    Urm twr MATAWAN, N. J., THURSDAY, MARCH 7, 1963 M«mbnr 84th YEAR — 36th WEEK National Editorial Au o c IqUom New Jtrte y I*rca»a Association Single Copy Tea Cent* Cliffwood Beach Man Killed hi Houle 35 rl. ruck-Car Accident Ifr ) w ; r Smoky Blaze lakes Three Lives In Keyport M m m i lyes Candidates Kowalski, Devino i Seek Nominations ^ , Frank Devmo-und bi^numd Ko- i walskt ihis week announced they i ! will seek the Republican nominii-! Peter C. Olson, 71, ot Cliffwood Beach was fatally injured Friday i highway.' The (ruck driver, Richard Watkins, Brooklyn, Juckkmfed his evening <vlu>n his car collided with a ttiictor-traller on Route 33, mirth, vehicle an ho attempted to avoid tlie crash. The Olsen car is shown m of lluilet Ave-, Rarltun Township. The accident occurred when Mr.: Ihe background. Olsen was leaving a parking lot, attempting to enter the snow-sllckcd • j . _ ‘ FRANK DEVINO At School R e g io n a l Bill M e e t lion m next month s pi unary elec­ Applegate, H yrne tion as candidates tor two seats Beginning next month, ull reg- 1 on the M aiaw an low nship u>mm>i. Assemblyman Clifton T. Barka- i irst aid oTuirts to save the lives of three persons t men and-M r. Klelnschnm ll was found in an upstair* uiarly scheduled meetings of (lie i let? to be idled this year. 1 lnw, Monmouth. and Joseph Min- • faded last night when a smoky wall fire charred and; bedroom.