Fast image compression using matrix K-L transform
|
|
- Luke Harrison
- 5 years ago
- Views:
Transcription
1 Fast image compression using matrix K-L transform Daoqiang Zhang, Songcan Chen * Department of Computer Science an Engineering, Naning University of Aeronautics & Astronautics, Naning 2006, P.R. China. Abstract: A novel matrix K-L transform (MatKL) is propose as an extension to the conventional K-L transform (KL) in this paper for fast image compression. Experimental results on 8 publicly available benchmark images show that the MatKL is tens to hunres times faster than stanar KL with comparable image compression quality. Keywors: Karhunen-Loeve transform (KL); Matrix KL (MatKL); Image compression; Fast algorithm. Introuction ransform coing is one of the most important methos for lossy image compression. However, as an optimal linear imension-reuction transform in the mean-square error or reconstructe error sense, the Karhunen-Loeve transform (KL) [] or principal component analysis (PCA) [2] can harly be use in image compression ue to its slow spee in seeking the transform from the covariance matrix constructe by given training ata. Assume we are given a set of n-imensional training ata { x, x,..., x }, then for any n-imensional vector x,the Karhunen-Loeve transform is efine as: 2 L y =Φ ( x m x ) () where L mx = (/ L) xi i= is the mean vector of training ata, an the column vector of Φ is the eigenvector corresponing to the covariance matrix L C = x (/ L) ( x )( ) i i mx x i m = x. he larger the scale or imension of the covariance matrix is, the slower the spee of computing the eigenvectors an hence transform is, an then so is performing compressing or encoing transform. o mitigate this problem, two methos are usually aopte. he first one is to replace KL with Discrete Cosine ransform (DC) as use in the JPEG stanar []. Although able to achieve much faster compression than KL, DC leas to relatively great egraation of compression quality at the same compression ratio compare to KL. he secon is to use the parallelism technique [3][4] such * Corresponing author: el: ; Fax: qzhang@nuaa.eu.cn (D.Q. Zhang), s.chen@nuaa.eu.cn (S.C. Chen)
2 as neural networks incluing associative memories [5] an the aaptive principal component extraction (APEX) [2]. Despite of being a powerful parallelism metho, neural networks [5] must also seek a traeoff between the compression spee an quality. In aition, in orer to obtain enough accurate approximation to classical KL, more training steps an thus more time are neee in realization of neural networks for the KLs. Apart from the above-mentione methos, to reuce the scale of the covariance matrix of the original KL is obviously a cheaper alternative. o the best of our knowlege no other researchers have mae attempts in this irection. In orer to introuce our iea, let us recall construction of the covariance matrix in KL for image compression: First, partition an image to be compresse into a set of non-overlapping subimage blocks with specifie size an then for each block, row by row concatenate it into a vector, finally collect all these concatenate vectors to construct a so-neee covariance matrix with which the eigenvalues an corresponing eigenvectors, hence so-neee transform, can be foun. Obviously, the scale of the block etermines efficiency of computation. he smaller the block is, the faster the computation for the covariance matrix, an hence also the faster getting the transform. However, smaller block limits, in turn, the improvement of the compression ratio so that makes the KL inapplicable in low-bit-rate encoing cases. In orer to improve this situation, we change the traitional constructing metho irectly from the concatenate vectors. Encourage by the successes on previous results [6], in this paper, a matrix K-L (linear) transform technique is propose as an extension to the KL for fast image compression. Its main iea is to use irectly a matrix-type rather than vector-type representation to construct the covariance matrix, calle as generalize covariance matrix (GCM), so that its scale is smaller than that of the covariance matrix constructe by those concatenate vectors. As a consequence, the spee of computing the transform from the GCM is greatly promote. aking an image block concatenate to a n-imension vector as an example, the scale of the KL covariance matrix is n n, while that of the GCM is ust m m, when it is constructe by the m p-imensional matrix which is a rearrangement for that n-imensional vector, where the m an p meet m p=n. Obviously the reuction ratio of both scales reaches p 2, which is an impressive result for large p. Such a reuction naturally greatly spees up fining the transform. Experimental results on 8 publicly available benchmark images show that MatKL is tens to hunres times faster than stanar KL with comparable image compression quality. he rest of this paper is organize as following: We first formulate the matrix K-L transform
3 (MatKL) in Section 2. An in Section 3, image compression experiments base on MatKL is introuce an results are given. At last, we raw our conclusions in Section Matrix K-L transform A. Formulation of MatKL here are two main steps in our propose MatKL. he first is the reassemble or rearrange step which rearranges the components of a concatenate subimage-block vector into a new matrix with imensionality m p, which will irectly use the subimage block matrix as a special case an thus be more flexible. For example, a vector x=[,2,3,3,5,2,7,0,2,] can be rearrange into A=[,2,3,3,5,2,7,0,2,] an , corresponing to p= an 5 respectively. An the secon step is performing MatKL on these matrices obtaine in the first step. Below is a erivation of our MatKL. Suppose that we are given a matrix-type ranom variable A = [ a i ] with imension m p, an inten to fin a linear transform Φ to compress A to B escribe by B =Φ ( A A) (2) m Φ = L R 2 where A= E( A) is the mean of A, E(.) is an mathematical expectation, an ( φ, φ,, φ ) is a transform to be foun. Equation (2) implements a imensionality-reuction from A to B. Reversing the process for solving B, we can reconstruct A by A = Φ B + A by means of Eq. (2). Now the key to implementing compression is to fin the transform Φ. We still aopt the reconstructe error criterion (REC) as use in the KL an minimize it to seek such an optimal transform Φ. Define the RCE as follows: 2 2 { } { } 2 REC( Φ ) = E A A = E A ΦB A = E A A ΦΦ( A A) { (( ( ))( ( )) } = E tr A A Φ Φ A A A A Φ Φ A A 2 ( ) = E A A tr( Φ E(( A A)( A A) ) Φ ) (3) where tr(.) enotes the trace of a matrix, an I the ientity with imension, an A m p 2 ( a ) /2 i= = i = is the Frobenius norm. An the latter two lines of Eq. (3) are from the following two characters of trace an Frobenius norm: ) A = tr( AA ); 2) tr( AB) = tr( BA). Set
4 R = E(( A A)( A A) ), i.e., a GCM for matrix-type ranom variable A. From Eq.(3), the minimization of REC with respect to Φ is equivalent to maximization of J(Φ ) efine by J( Φ ) = tr( Φ RΦ ) (4) subect to the constraints that ΦΦ = I. Equations (3) an (4) give an ientical optimization formulation to the KL except that the KL covariance matrix constructe by vector-type ranom variables is replace with a new GCM by matrix-type ones. In fact, the following erivation of the transform is ientical to that of the KL. However for completeness of escription, we still give the following reformulation. o maximize J ( Φ ) subect to the constraints, we efine a Lagrangian function as follows: = L( Φ ) = J( Φ ) λ ( φ φ ) (5) where λ s are Lagrange multipliers. Differentiating Eq.(5) with respect to φ s an setting the corresponing erivatives to 0, we have Rφ = λφ =, 2,, (6) his is an eigenvalue-eigenvector system with respect to (λ, φ ). aking into account that R is symmetric an positive semi-efinite, therefore its eigenvalues are non-negative, which leas Eq.(6) to a maximum value of J ( Φ ) = λ, equivalently, a minimum of REC( Φ ) = = m λ. Here we = + take the eigenvectors of R corresponing to the first largest eigenvalues to construct the so-neee transform Φ = ( φ, φ2, L, φ ), which achieves the REC minimization an at the same time retain maximally the original information of ata. As a result, the original ata is effectively compresse. B. Un-correlation Analysis As we have known, the KL can remove correlation between the original ata components to achieve a goal of compression. In fact, our MatKL also possesses such a property as analyze below. Rewriting B in row to [(b ), (b 2 ),, (b ) ], where b = φ ( A A ) =,2,,. hen for any b i an b,
5 λ E( bb i ) = E[ φi ( A A)( A A) φ] = φi Rφ = λφi φ = 0 i = i (7) In the above erivation, we use Eq.(4). Equation (7) tells us that any two ifferent row vectors, b i an b, of B are inee uncorrelate, which is helpful to the subsequent compression. In particular, when the matrix A is concatenate into a vector, our MatKL reuces to the orinary KL. C. Real Reconstruction In a real implementation, generally, we are only given a limite sample set of matrix ata {A i, i=,2,,n}. hen the covariance matrix or GCM R an the mean A will respectively be estimate by the given sample ataset as follows: R = N N i= ( Ai A )( Ai A ) an A = N N A i i= (8) Substituting them into Eq.(6) an then solving it, we can obtain a transform Φ for the given ataset. o implement ecompression or reconstruction, we use the following equation Aˆ =Φ B+ A (9) It implements a restoration for the original image with minimal errors. Now let us iscuss the effect of p on the compression spee. Accoring to the efinition of R, its scale becomes smaller ue to the relation of m p=n as p increases. herefore, to obtain a high speeup for MatKL, we require p to take a value as large as possible. On the other han, as can be seen from Eq. (2), in orer to achieve a high compression ratio, the value of p cannot be too large. So p controls the traeoff between the spee an compression ratio or compression quality. In the next section, we will give comparison experimental results on 8 publicly available benchmark images to illustrate characteristic of our MatKL. 3. Image compression experiments A. Configuration In our experiments, we compare propose MatKL with classical KL an DC algorithms on 8 benchmark images. Specifically, we compare the compresse image quality evaluate by peak signal-to-noise ratio (PSNR), an the corresponing run-time of the algorithms. All the algorithms are execute on the same computer equippe with.7 G Intel Pentium 4 processor, 256 M memory, an 40G har isk, an simulate using Matlab 6.5 by Mathworks Inc. It is important to note that no
6 optimizations regaring execution time are consiere in all algorithms, an we are only concerne on the relative execution spee of KL an MatKL. On the other han, we only compare the compresse image quality performances between DC an the other two algorithms. We o not list the execution time of DC because the program structure of DC is much ifferent from those of KL an MatKL an hence the comparison between them is of little sense. he size of the images use in the experiments are 52x52, except for the images barbara (720x580), boats (720x576), camera (256x256), columbia (480x480) an golhill (720x576). For all images, we use block size of 6x6, except for the image barbara (20x20). At last, we use =6 in Eqs. (4) an (5) for KL (p=) for all images except for the image barbara (=20). o maintain the same compression ratio, =8 (p=2) an =4 (p=4) are use in Eqs (4) an (5) for MatKL (for babara, =0 (p=2) or =5 (p=4)). Similarly, 6 components (20 for barbara ) are kept in the transforme image matrix. Furthermore, no quantization steps are use in all algorithms an 8-bits are use to represent components of the compresse matix B in Eq. (2). hus for all images the compression ratio is 6:, except for the image barbara (20:). B. Results able shows the comparisons of compresse image quality (in PSNR) an execution times between KL, MatKL. Here we compute PSNR as follows: PSNR( b) = 0log ( ˆ i i ) 0 m p 2 (/ mp) a a i= = (0) where a i an a ˆi represent the pixel values of original image A= [ a i ] m p an reconstructe image Aˆ = [ a ˆi ] m p respectively. From able, it can be observe that KL achieves the best reconstructe image quality, which proves its optimum in transform image coing. he reconstructe image using MatKL ( p=2) is a little worse than KL, in which case only about 0.5 b egraation is incurre compare with KL. Even if p=4, the egraation in MatKL is still ust about -2 b. As a comparison, the compresse image quality is very poor when using DC. As shown in table, generally, there is about 5 b egraation in DC compare to KL, an for some images such as 'woman2', the egraation is even b. Fig. gives the reconstructe images of KL, MatKL an DC on the image 'Lena'. From Fig., there are no apparent visual ifferences between the reconstructe images using KL an MatKL, while the DC reconstructe image is much egrae.
7 able Comparisons of the algorithm performances: PSNR an spee (in the bracket, unit: secon) est image KL (p=) MatKL (p=2) MatKL (p=4) DC Baboon 22.89(3.3) 22.7(0.) 22.43( 0.02) Barbara 24.5(3.28) 23.84(0.44) 23.32(0.03) Boats 28.63(2.8) 27.95(0.) 26.9(0.02) Brige 23.73(3.09) 23.40(0.) 22.9(0.03) 2.3 Camera 24.37(2.47) 23.39(0.09) 22.83(0.03) Columbia 29.38(2.49) 28.53(0.06) 26.73(0.02) 22.6 Couple 26.52(2.88) 26.07(0.08) 25.38(0.02) 23.6 Crow 27.23(2.67) 26.64(0.08) 25.57(0.02) 2.45 Golhill 29.33(3.02) 28.96(0.09) 28.20(0.03) 24.9 Lake 26.06(2.86) 25.47(0.08) 24.50(0.02) 2.8 Lax 23.26(3.25) 23.09(0.09) 22.87(0.02) 2.98 Lena 30.8(2.89) 30.39(0.09) 29.6(0.02) 25.7 Man 27.43(3.05) 27.2(0.08) 26.48(0.02) Milkrop 23.26(3.25) 23.09(0.09) 22.87(0.02) 2.98 Peppers 29.73(3.08) 28.86(0.09) 27.70(0.02) Plane 27.48(2.6) 26.95(0.08) 25.67(0.02) Woman 27.68(3.05) 27.29(0.09) 26.63(0.02) On the other han, the execution spee of MatKL (p=2, 4) is much improve compare to KL (p=). From the same table, the improvement of spee of MatKL (p=2) over KL (p=) is about 30:, an that of MatKL (p=4) over KL (p=) is about 300: for most images. o achieve so great improvement in spee, the pai price is only -2 b egraation of the reconstructe image compare with that of KL. Fig. 2 shows a comparison of performances of MatKL uner ifferent values of p for 'Lena' image with block size 32x32. Seen from the figure, as p grows, the quality of reconstructe image egraes graually, while the execution time is greatly reuce. However, in orer to keep a balance among the spee, compression ratio an image quality, we confine ourselves to only p=2 an 4 in this paper. 4. Conclusions We presente a novel matrix K-L transform an applie it into image compression. he experimental results show that the MatKL metho requires much less computation time than KL at the price of a little egraation of compresse image quality. his metho has the potentiality to be a faster metho for image ata reuction, especially for real-time an progressive ecoing applications. he next research is to compare the execution time of MatKL, KL an DC algorithms
8 implemente with optimizations, e.g aopting the C programming language instea of the Matlab use in this paper. It is worth to mention for the K-L transform or PCA implementation that although we employe the so-calle batch methos [2] for the transform computation in our experiments; however, in practice, we can use the Hebbian-base neural networks to more effectively an aaptively implement the MatKL algorithm, which will become one of our subects in the next research. Acknowlegements We woul like to thank the reviewers for their valuable suggestions for improving the presentation of this paper. Meanwhile we also thank National Science Founations of China an of Jiangsu uner Grant Nos an BK , Jiangsu Natural Science Key Proect (BK200400), Jiangsu QingLan Proect Founation an the Returnee s Founation of China Scholarship Council for partial supports respectively. References [] R.C. Gonzalez, R.E. Woos, Digital Image Processing, 2n Eition, Prentice-Hall, Jan [2] S. Haykin, Neural Networks: A Comprehensive Founation, 2n Eition, Prentice-Hall, Jul [3] S. Bhama, H. Singh, N.D. Phate, "Parallelism for the faster implementation of the K-L transform for image compression", Pattern Recognition Letters, vol. 4, pp , Aug [4] S. Costa, S. Fiori, "Image compression using principal component neural networks", Image an Vision Computing, vol. 9, pp , Aug [5] C.C. Wang, C.R. sai, Data compression by the recursive algorithm of exponential biirectional associative memory, IEEE rans. Syst. Man. Cybern., vol.28, no. 4,pp , Apr [6] Jian Yang, Jingyu Yang, "From image vector to matrix: a straightforwar image proection technique-impca vs. PCA", Pattern Recognition, vol. 35, no. 9, pp , Sep
9 (a) (b) (c) () Fig. Compresse images at 0.5 bpp without quantization. (a) original 'Lena' image, (b) KL result (PSNR=30.8), (c) MatKL (p=2, PSNR=30.4), () MatKL (p=4, PSNR=29.6), (e) DC result (PSNR=25.2). (e) Fig. 2 Comparisons of performance of five methos:. KL (i.e. MatKL with p=), 2. MatKL (p=2), 3. MatKL (p=4), 4. MatKL (p=8), 5. MatKL (p=6).
Least-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationInfluence of weight initialization on multilayer perceptron performance
Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationA Hybrid Approach for Modeling High Dimensional Medical Data
A Hybri Approach for Moeling High Dimensional Meical Data Alok Sharma 1, Gofrey C. Onwubolu 1 1 University of the South Pacific, Fii sharma_al@usp.ac.f, onwubolu_g@usp.ac.f Abstract. his work presents
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More informationParameter estimation: A new approach to weighting a priori information
Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationLagrangian and Hamiltonian Mechanics
Lagrangian an Hamiltonian Mechanics.G. Simpson, Ph.. epartment of Physical Sciences an Engineering Prince George s Community College ecember 5, 007 Introuction In this course we have been stuying classical
More informationSYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. where L is some constant, usually called the Lipschitz constant. An example is
SYSTEMS OF DIFFERENTIAL EQUATIONS, EULER S FORMULA. Uniqueness for solutions of ifferential equations. We consier the system of ifferential equations given by x = v( x), () t with a given initial conition
More informationImage Coding Algorithm Based on All Phase Walsh Biorthogonal Transform
Image Coding Algorithm Based on All Phase Walsh Biorthogonal ransform Chengyou Wang, Zhengxin Hou, Aiping Yang (chool of Electronic Information Engineering, ianin University, ianin 72 China) wangchengyou@tu.edu.cn,
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationProblem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs
Problem Sheet 2: Eigenvalues an eigenvectors an their use in solving linear ODEs If you fin any typos/errors in this problem sheet please email jk28@icacuk The material in this problem sheet is not examinable
More informationLie symmetry and Mei conservation law of continuum system
Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationComparative Approaches of Calculation of the Back Water Curves in a Trapezoidal Channel with Weak Slope
Proceeings of the Worl Congress on Engineering Vol WCE, July 6-8,, Lonon, U.K. Comparative Approaches of Calculation of the Back Water Curves in a Trapezoial Channel with Weak Slope Fourar Ali, Chiremsel
More informationHyperbolic Systems of Equations Posed on Erroneous Curved Domains
Hyperbolic Systems of Equations Pose on Erroneous Curve Domains Jan Norström a, Samira Nikkar b a Department of Mathematics, Computational Mathematics, Linköping University, SE-58 83 Linköping, Sween (
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationImage Denoising Using Spatial Adaptive Thresholding
International Journal of Engineering Technology, Management an Applie Sciences Image Denoising Using Spatial Aaptive Thresholing Raneesh Mishra M. Tech Stuent, Department of Electronics & Communication,
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationState observers and recursive filters in classical feedback control theory
State observers an recursive filters in classical feeback control theory State-feeback control example: secon-orer system Consier the riven secon-orer system q q q u x q x q x x x x Here u coul represent
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationSituation awareness of power system based on static voltage security region
The 6th International Conference on Renewable Power Generation (RPG) 19 20 October 2017 Situation awareness of power system base on static voltage security region Fei Xiao, Zi-Qing Jiang, Qian Ai, Ran
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationHyperbolic Moment Equations Using Quadrature-Based Projection Methods
Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationOptimal CDMA Signatures: A Finite-Step Approach
Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp Inst. for Comp. Engr. an Sci. (ICES) 1 University Station C000 Austin, TX 7871 jtropp@ices.utexas.eu Inerjit. S. Dhillon Dept. of Comp. Sci.
More informationOne-dimensional I test and direction vector I test with array references by induction variable
Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science
More informationIntegration Review. May 11, 2013
Integration Review May 11, 2013 Goals: Review the funamental theorem of calculus. Review u-substitution. Review integration by parts. Do lots of integration eamples. 1 Funamental Theorem of Calculus In
More informationA Review of Multiple Try MCMC algorithms for Signal Processing
A Review of Multiple Try MCMC algorithms for Signal Processing Luca Martino Image Processing Lab., Universitat e València (Spain) Universia Carlos III e Mari, Leganes (Spain) Abstract Many applications
More informationTHE ACCURATE ELEMENT METHOD: A NEW PARADIGM FOR NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS
THE PUBISHING HOUSE PROCEEDINGS O THE ROMANIAN ACADEMY, Series A, O THE ROMANIAN ACADEMY Volume, Number /, pp. 6 THE ACCURATE EEMENT METHOD: A NEW PARADIGM OR NUMERICA SOUTION O ORDINARY DIERENTIA EQUATIONS
More informationMulti-View Clustering via Canonical Correlation Analysis
Keywors: multi-view learning, clustering, canonical correlation analysis Abstract Clustering ata in high-imensions is believe to be a har problem in general. A number of efficient clustering algorithms
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationNonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain
Nonlinear Aaptive Ship Course Tracking Control Base on Backstepping an Nussbaum Gain Jialu Du, Chen Guo Abstract A nonlinear aaptive controller combining aaptive Backstepping algorithm with Nussbaum gain
More informationQuantum mechanical approaches to the virial
Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More informationarxiv: v1 [cs.lg] 22 Mar 2014
CUR lgorithm with Incomplete Matrix Observation Rong Jin an Shenghuo Zhu Dept. of Computer Science an Engineering, Michigan State University, rongjin@msu.eu NEC Laboratories merica, Inc., zsh@nec-labs.com
More informationState-Space Model for a Multi-Machine System
State-Space Moel for a Multi-Machine System These notes parallel section.4 in the text. We are ealing with classically moele machines (IEEE Type.), constant impeance loas, an a network reuce to its internal
More informationSymbolic integration with respect to the Haar measure on the unitary groups
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 65, No., 207 DOI: 0.55/bpasts-207-0003 Symbolic integration with respect to the Haar measure on the unitary groups Z. PUCHAŁA* an J.A.
More informationStrength Analysis of CFRP Composite Material Considering Multiple Fracture Modes
5--XXXX Strength Analysis of CFRP Composite Material Consiering Multiple Fracture Moes Author, co-author (Do NOT enter this information. It will be pulle from participant tab in MyTechZone) Affiliation
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationPredictive Control of a Laboratory Time Delay Process Experiment
Print ISSN:3 6; Online ISSN: 367-5357 DOI:0478/itc-03-0005 Preictive Control of a aboratory ime Delay Process Experiment S Enev Key Wors: Moel preictive control; time elay process; experimental results
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationAn Iterative Incremental Learning Algorithm for Complex-Valued Hopfield Associative Memory
An Iterative Incremental Learning Algorithm for Complex-Value Hopfiel Associative Memory aoki Masuyama (B) an Chu Kiong Loo Faculty of Computer Science an Information Technology, University of Malaya,
More informationTRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS
TRAJECTORY TRACKING FOR FULLY ACTUATED MECHANICAL SYSTEMS Francesco Bullo Richar M. Murray Control an Dynamical Systems California Institute of Technology Pasaena, CA 91125 Fax : + 1-818-796-8914 email
More informationCS9840 Learning and Computer Vision Prof. Olga Veksler. Lecture 2. Some Concepts from Computer Vision Curse of Dimensionality PCA
CS9840 Learning an Computer Vision Prof. Olga Veksler Lecture Some Concepts from Computer Vision Curse of Dimensionality PCA Some Slies are from Cornelia, Fermüller, Mubarak Shah, Gary Braski, Sebastian
More informationAPPROXIMATE SOLUTION FOR TRANSIENT HEAT TRANSFER IN STATIC TURBULENT HE II. B. Baudouy. CEA/Saclay, DSM/DAPNIA/STCM Gif-sur-Yvette Cedex, France
APPROXIMAE SOLUION FOR RANSIEN HEA RANSFER IN SAIC URBULEN HE II B. Bauouy CEA/Saclay, DSM/DAPNIA/SCM 91191 Gif-sur-Yvette Ceex, France ABSRAC Analytical solution in one imension of the heat iffusion equation
More informationA Second Time Dimension, Hidden in Plain Sight
A Secon Time Dimension, Hien in Plain Sight Brett A Collins. In this paper I postulate the existence of a secon time imension, making five imensions, three space imensions an two time imensions. I will
More informationUsing LSTM Network in Face Classification Problems
Using LS Network in Face Classification Problems Débora C. Corrêa, Denis H. P. Salvadeo, Alexandre L.. Levada, José H. Saito, Nelson D. A. ascarenhas, Jander oreira Departamento de Computação, Universidade
More informationAPPLICATION of compressed sensing (CS) in radar signal
A Novel Joint Compressive Single Target Detection an Parameter Estimation in Raar without Signal Reconstruction Alireza Hariri, Massou Babaie-Zaeh Department of Electrical Engineering, Sharif University
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationEntanglement is not very useful for estimating multiple phases
PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The
More informationConservation laws a simple application to the telegraph equation
J Comput Electron 2008 7: 47 51 DOI 10.1007/s10825-008-0250-2 Conservation laws a simple application to the telegraph equation Uwe Norbrock Reinhol Kienzler Publishe online: 1 May 2008 Springer Scienceusiness
More informationOptimized Schwarz Methods with the Yin-Yang Grid for Shallow Water Equations
Optimize Schwarz Methos with the Yin-Yang Gri for Shallow Water Equations Abessama Qaouri Recherche en prévision numérique, Atmospheric Science an Technology Directorate, Environment Canaa, Dorval, Québec,
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationWhy Bernstein Polynomials Are Better: Fuzzy-Inspired Justification
Why Bernstein Polynomials Are Better: Fuzzy-Inspire Justification Jaime Nava 1, Olga Kosheleva 2, an Vlaik Kreinovich 3 1,3 Department of Computer Science 2 Department of Teacher Eucation University of
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationAnalytic Scaling Formulas for Crossed Laser Acceleration in Vacuum
October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945
More informationOn the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography Christophe Doche Department of Computing Macquarie University, Australia christophe.oche@mq.eu.au. Abstract. The
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More informationPolynomial Inclusion Functions
Polynomial Inclusion Functions E. e Weert, E. van Kampen, Q. P. Chu, an J. A. Muler Delft University of Technology, Faculty of Aerospace Engineering, Control an Simulation Division E.eWeert@TUDelft.nl
More informationEXACT TRAVELING WAVE SOLUTIONS FOR A NEW NON-LINEAR HEAT TRANSFER EQUATION
THERMAL SCIENCE, Year 017, Vol. 1, No. 4, pp. 1833-1838 1833 EXACT TRAVELING WAVE SOLUTIONS FOR A NEW NON-LINEAR HEAT TRANSFER EQUATION by Feng GAO a,b, Xiao-Jun YANG a,b,* c, an Yu-Feng ZHANG a School
More informationON THE OPTIMALITY SYSTEM FOR A 1 D EULER FLOW PROBLEM
ON THE OPTIMALITY SYSTEM FOR A D EULER FLOW PROBLEM Eugene M. Cliff Matthias Heinkenschloss y Ajit R. Shenoy z Interisciplinary Center for Applie Mathematics Virginia Tech Blacksburg, Virginia 46 Abstract
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationHomework 2 Solutions EM, Mixture Models, PCA, Dualitys
Homewor Solutions EM, Mixture Moels, PCA, Dualitys CMU 0-75: Machine Learning Fall 05 http://www.cs.cmu.eu/~bapoczos/classes/ml075_05fall/ OUT: Oct 5, 05 DUE: Oct 9, 05, 0:0 AM An EM algorithm for a Mixture
More informationON ISENTROPIC APPROXIMATIONS FOR COMPRESSIBLE EULER EQUATIONS
ON ISENTROPIC APPROXIMATIONS FOR COMPRESSILE EULER EQUATIONS JUNXIONG JIA AND RONGHUA PAN Abstract. In this paper, we first generalize the classical results on Cauchy problem for positive symmetric quasilinear
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationOn the number of isolated eigenvalues of a pair of particles in a quantum wire
On the number of isolate eigenvalues of a pair of particles in a quantum wire arxiv:1812.11804v1 [math-ph] 31 Dec 2018 Joachim Kerner 1 Department of Mathematics an Computer Science FernUniversität in
More informationELEC3114 Control Systems 1
ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.
More informationThe Ehrenfest Theorems
The Ehrenfest Theorems Robert Gilmore Classical Preliminaries A classical system with n egrees of freeom is escribe by n secon orer orinary ifferential equations on the configuration space (n inepenent
More informationComputing the Longest Common Subsequence of Multiple RLE Strings
The 29th Workshop on Combinatorial Mathematics an Computation Theory Computing the Longest Common Subsequence of Multiple RLE Strings Ling-Chih Yao an Kuan-Yu Chen Grauate Institute of Networking an Multimeia
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationMath 1B, lecture 8: Integration by parts
Math B, lecture 8: Integration by parts Nathan Pflueger 23 September 2 Introuction Integration by parts, similarly to integration by substitution, reverses a well-known technique of ifferentiation an explores
More informationExponential Tracking Control of Nonlinear Systems with Actuator Nonlinearity
Preprints of the 9th Worl Congress The International Feeration of Automatic Control Cape Town, South Africa. August -9, Exponential Tracking Control of Nonlinear Systems with Actuator Nonlinearity Zhengqiang
More informationGeneralization of the persistent random walk to dimensions greater than 1
PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,
More informationSparse Reconstruction of Systems of Ordinary Differential Equations
Sparse Reconstruction of Systems of Orinary Differential Equations Manuel Mai a, Mark D. Shattuck b,c, Corey S. O Hern c,a,,e, a Department of Physics, Yale University, New Haven, Connecticut 06520, USA
More informationSolving the Schrödinger Equation for the 1 Electron Atom (Hydrogen-Like)
Stockton Univeristy Chemistry Program, School of Natural Sciences an Mathematics 101 Vera King Farris Dr, Galloway, NJ CHEM 340: Physical Chemistry II Solving the Schröinger Equation for the 1 Electron
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationA Probabilistic Data Association Based MIMO Detector Using Joint Detection of Consecutive Symbol Vectors
A Probabilistic Data Association Base IO Detector Using Joint Detection of Consecutive Symbol Vectors Shaoshi Yangieun Lv ember IEEE Xiang Yun Xinghui Su an Jinhuan Xia School of Information an Communication
More informationPlacement and tuning of resonance dampers on footbridges
Downloae from orbit.tu.k on: Jan 17, 19 Placement an tuning of resonance ampers on footbriges Krenk, Steen; Brønen, Aners; Kristensen, Aners Publishe in: Footbrige 5 Publication ate: 5 Document Version
More informationTransmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency
Transmission Line Matrix (TLM network analogues of reversible trapping processes Part B: scaling an consistency Donar e Cogan * ANC Eucation, 308-310.A. De Mel Mawatha, Colombo 3, Sri Lanka * onarecogan@gmail.com
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationDelocalization of boundary states in disordered topological insulators
Journal of Physics A: Mathematical an Theoretical J. Phys. A: Math. Theor. 48 (05) FT0 (pp) oi:0.088/75-83/48//ft0 Fast Track Communication Delocalization of bounary states in isorere topological insulators
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More informationNecessary and Sufficient Conditions for Sketched Subspace Clustering
Necessary an Sufficient Conitions for Sketche Subspace Clustering Daniel Pimentel-Alarcón, Laura Balzano 2, Robert Nowak University of Wisconsin-Maison, 2 University of Michigan-Ann Arbor Abstract This
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationAssignment 1. g i (x 1,..., x n ) dx i = 0. i=1
Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition
More information