Shifted Independent Component Analysis
|
|
- Meagan Cox
- 6 years ago
- Views:
Transcription
1 Downloae rom orbit.tu.k on: Dec 06, 2017 Shite Inepenent Component Analysis Mørup, Morten; Masen, Kristoer Hougaar; Hansen, Lars Kai Publishe in: 7th International Conerence on Inepenent Component Analysis an Signal Separation Publication ate: 2007 Document Version Early version, also known as pre-print Link back to DTU Orbit Citation (APA): Mørup, M., Masen, K. H., & Hansen, L. K. (2007). Shite Inepenent Component Analysis. In 7th International Conerence on Inepenent Component Analysis an Signal Separation: ICA2007 (pp ) General rights Copyright an moral rights or the publications mae accessible in the public portal are retaine by the authors an/or other copyright owners an it is a conition o accessing publications that users recognise an abie by the legal requirements associate with these rights. Users may ownloa an print one copy o any publication rom the public portal or the purpose o private stuy or research. You may not urther istribute the material or use it or any proit-making activity or commercial gain You may reely istribute the URL ientiying the publication in the public portal I you believe that this ocument breaches copyright please contact us proviing etails, an we will remove access to the work immeiately an investigate your claim.
2 Shite Inepenent Component Analysis Morten Mørup, Kristoer H. Masen, an Lars K. Hansen Technical University o Denmark Inormatics an Mathematical Moelling Richar Petersens Plas, Builing 321 DK-2800 Kgs. Lyngby, Denmark {mm,khm,lkh}@imm.tu.k Abstract. Delaye mixing is a problem o theoretical interest an practical importance, e.g., in speech processing, bio-meical signal analysis an nancial ata moelling. Most previous analyses have been base on moels with integer shits, i.e., shits by a number o samples, an have oten been carrie out using time-omain representation. Here, we explore the act that a shit in the time omain correspons to a multiplication o i! e in the requency omain. Using this property an algorithm in the case o sourcessensors allowing arbitrary mixing an elays is evelope. The algorithm is base on the ollowing steps: 1) Fin a subspace o shite sources. 2) Resolve shit an rotation ambiguity by inormation maximization in the complex omain. The algorithm is proven to correctly ientiy the components o synthetic ata. However, the problem is prune to local minima an iculties arise especially in the presence o large elays an high requency sources. A Matlab implementation can be ownloae rom [1]. 1 Introuction Factor analysis is wiely use to reconstruct latent eects rom mixtures o multiple eects base on the moel n;m = A n; S ;m + E n;m ; (1) where E n;m is aitive noise. However, this ecomposition is not unique since ea = AQ an e S = Q 1 S yiels same approximation as A; S. Consequently, constraints have been impose such as Varimax rotation or Principal Component Analysis (PCA) [2], statistical inepenence o the sources S as in Inepenent Component Analysis (ICA)[3, 4]. A relate strategy is sparse coing where the objective o minimizing the error is combine with a term penalizing the non-sparsity o S [5]. Factor analysis in the setting o ICA is oten illustrate by the so-calle cocktail party problem. Here mixtures o several speakers are recore in several microphones orming the measure signal. The task is to ientiy the sources
3 S o each original speaker. However, even in an anechoic environment the mixing moel is typically not accurate because o ierent elays in the microphones. Consier two microphones place at istance L an L + h rom a given speaker. Uner normal atmospheric conitions, the spee o soun is approximately c = 344 m/s while a typical sampling rate is s = 22 khz. Then the elay in samples between the two microphones is given by: #samples= sh c such that the elay increases linearly with the ierence in istance. Consequently, a istance o 1 cm gives a elay o samples while h = 1m leas to a elay o samples. Harshman an Hong [6] propose a generalization o the actor moels in which the unerlying sources have specic elays when they reach the sensors. The moel is calle shite actor analysis (SFA), an reas n;m = A n; S ;m e n; + E n;m: (2) In real acoustic environments we expect echoes ue to paths that are create by reection o suraces. To account or general elay mixing eects, the ICA moel has been generalize to convolutive mixtures, see e.g., [79] n;m = ; A n;s ;m + E n;m : (3) Here A is a lter that accounts or the presence o each source in the sensors at time elay. The shite actor moel, thus is a special case o the convolutive moel where the lter coecients A n; = A n; i e n; = else A n; = 0. In act shite mixtures are also seen in many other contexts. For instance, astronomy where star motion Doppler eects inuce requency re shits that can be moelle using SFA. Here we will ocus on the elaye source moel. In [6] strong support was oun or the conjecture that the incorporation o shits can strengthen the moel enough to make the parameters ientiable up to scaling an permutation (essential uniqueness). We will emonstrate that this conjecture is not correct when allowing or arbitrary shits. Inee, the moel is, as or regular actor analysis, ambiguous. In [10] an algorithm was propose to estimate the moel. However, the algorithm has the ollowing rawbacks. 1. All potential shits have to be specie in the moel. 2. Exhaustive integer search or the elays is expensive. 3. The moel only accounts or shits by whole samples. 4. The moel is in general not unique. Prior to the work o [6, 10] Bell an Sejnowski [4] sketche how to hanle time elays in networks base on a moel similar to equation 2. This was urther explore in [11]. Although their algorithms erive graients to search or the elays (alleviating the rst two rawbacks above) the moels are still base on pure integer elays. In [12] a ierent moel base on equally mixe sources, i.e. A = 1, orme by moving averages incorporate non-integer elays by signal interpolation. Yereor [13] solve the SFA moel by joint iagonalization o
4 Fig. 1. Example o activities obtaine (black graph) when summing three components (gray, blue ashe an re ash-otte graphs) each shite to various egrees (given in samples by the colore numbers). Clearly, the resulting activities are heavily impacte by the shits such that a regular instantaneous ICA analysis woul be inaequate. the source cross spectra base on the AC-DC algorithm with non-integer shits or the 2 2 system. This approach was extene to complex signals in [14]. The algorithm is least squares optimal or equal number o sensors an sources. More sensors than sources is not a problem or conventional ICA; we simply reuce imension by variance ecomposition, this proceure is exact or noiseless mixing. Due to the elays projection base imensional reuction will not reprouce the simple single elay structure, but rather lea to a more general convolutive mixture. We will thereore aim at an algorithm or ning a shit invariant subspace. Hence, solve equation 2 by use o the act that a shit in the time omain can be approximate by multiplication by the complex coecients e i! in the requency omain. This alleviates the rst three rawbacks o the SFA algorithm. We will enote this algorithm a Shit Invariant Subspace Analysis (SISA). To urther eal with shit an rotation ambiguities, we impose inepenence in the complex omain base on inormation-maximization (IM) [4]. Hence, we orm an algorithm or ICA with shite sources (SICA). Notice, that algorithms or ICA in the complex omain without shits have previously been erive, see or instance [9, 15] an reerences therein. 2 Metho an Results In the ollowing U will enote a matrix in the time omain, while e U enotes the corresponing matrix in the requency omain. U an e U enotes 3-way arrays in the time an requency omains respectively. Furthermore, U V enotes the irect prouct, i.e. element-wise multiplication. Also,! = 2 1 M such that eu ( ) = U e i2 1 M. Finally, the i th row o a matrix will be enote U i;:. 2.1 Shit Invariant Subspace Analysis (SISA) In the ollowing we will evice an algorithm to n a shit invariant subspace base on the SFA moel. Consier the SFA moel an its requency transorme n;m = A n; S ;m n; + E n;m; e n; = A n; e S; e i2 1 M n; + e En; : (4)
5 In matrix notation this can be state as Due to Parseval's ientity the ollowing hols C ls = n;m e = e A ( )e S + e E : (5) ke n;m k 2 F = 1 M n; ke En; k 2 F : (6) Thus, minimizing the least square error in the time an requency omain is equivalent. The algorithm will be base on alternatingly solving or A, S an. S upate: Accoring to equation 5, S can be estimate as es = e A ( ) y e : (7) Although, S is upate in the requency omain the upate version has to remain real when taking the inverse FFT. For S to be real value the ollowing has to hol es M +1 = e S ; (8) where enotes complex conjugate. This constraint is enorce by upating the rst bm=2c + 1 elements, i.e. up to the Nyquist requency, while setting the remaining elements accoring to equation 8. A upate: Let e S (n) ; enote the elaye version o the source signal e S; to the n th channel, i.e. e S (n) ; = e S; e i2 1 M n;. Then equation 2 can be restate as n;: = A n;: S (n) + E n;: ; (9) This is the regular actor analysis problem giving the upate A n;: = n;: S (n)y : (10) upate: The least square error or the moel state in equation 5, is given by C ls = 1 M (e A e ( )e S ) H (e A e ( )e S ); (11) where H enotes the conjugate transpose. Dene T ND 1 = vec( ), i.e. the vectorize version o the matrix such that T n+( 1)N = n;. Let urther eq n;; = e A ( ) n; e S ; ; e E = e e A ( )e S : (12) Then the graient o C ls with respect to n; is given as g n+( 1)N ls n+( = 1 n; M 2!=[ Qn;; e E e n; ] (13)
6 The Hessian has the ollowing structure H n+( 1)N;n 0 +( 0 1)N = As a result, ( 2 M 2 M P!2 <[ e Qn;; e Q n0 ; 0 ; ] i n 6= n0 ^ 6= 0 P!2 <[ e Qn;; ( e Q n0 ; 0 ; + e E n0 ; )] i n = n0 ^ = 0 can be estimate using the Newton-Raphson metho (14) T T H 1 g; (15) where is a step size parameter that is tune to keep ecreasing the cost unction. Fig. 2. Results obtaine by a shit invariant subspace analysis (SISA). Let panel: the true actors orming a synthetic ata set. To the let, the strength o the mixing A o each source is inicate in gray color scale. In the mile, the three sources are shown an to the right is given the time elays o each source to each channel. Right panel: The estimate actors rom the SISA analysis. Although, all the variance is explaine the ecomposition has not ientie the true unerlying components but an ambiguous mix. Clearly, as or regular actor analysis the SISA is not unique. 2.2 SISA is not unique Accoring to equation 5, the reconstructe signal in the complex omain is given is a rotation, scaling an shit matrix. Assume the inverse o W ( ) is also a rotation, as e e A ( )e S = e A ( ) W ( ) W ( ) 1 e S :Such that W ( ) = W e i2 1 M ^ scaling an shit matrix, i.e. W ( ) 1 = V e i2 1 M. Since W ( ) W ( ) 1 = I, we n 00 1 i2 W ; 00V 0 ;00e M (^ ; ; 00 ) = 0 or 6= or = 0 8 (16)
7 From = 1 we obtain the relation V = W 1. For the remaining requencies this expression can only be vali i ^ = 0 (iagonal elements) an ^ = k 0 (o iagonal elements) where k 0 enotes an arbitrary constant. The rst relation gives the constraint that ^ = T. The secon relation urther constraints all the elements o the columns o ^ to be equal. Thus the ambiguity is given by W ( ) = [W iag(e i2 1 M b )]. Where b is a vector escribing the shit ambiguity. 2.3 Shite Inepenent Component Analysis (SICA) A common approach to ICA is the maximum likelihoo (ML) metho [16] which correspons to the approach o maximizing inormation propose in [4]. In the ramework o ML a non-gaussian istribution on the sources is assume such that ambiguity can be resolve up to the trivial ambiguities o scale, permutation an source shiting relative to the time elays. Dene, U e = W ( )e S, i.e. the sources at requency when transorme accoring to the rotation an shit ambiguity escribe in the previous section. The ambiguity can be resolve by maximizing the log-likelihoo assuming the (non-gaussian) Laplace istribution p(e U ) / e j U; e j, i.e. Y Y jet( W ( ) )jp( W ( )e S ) (17) p(e S jw; b ) = p(e S jw; b ) = Such that the log-likelihoo as a unction o W an b L(W; b ) = ln j et( W ( ) )j becomes j W ( )e S j (18) By maximizing L(W; b ) W an b is estimate an a new unambiguous S solution oun by e S = W ( )e S. The corresponing mixing an elays can be estimate alternating between the A an upate. We initialize A as A = AW 1 an i; by the maximum cross-correlation between i;: an S ;:. 3 Discussion Traitionally, ICA analysis is base on subspace analysis oten using singular value ecomposition (SVD). The sources are then oun by rotating the vectors spanning the subspace accoring to a measure o inepenence. Similarly, we erive the SISA algorithm to n a shit invariant subspace by alternating least squares. Shit an rotation ambiguities were solve by imposing inepenence on the amplitues o the requency transorm o the sources. While SVD has a close orm solution the SISA algorithm is non-convex. Estimating A an S has a close orm solution or xe values o, S an A. However, is estimate using an iterative metho potentially leaing to many local minima. Furthermore, the problem becomes increasingly icult or high requency sources an large shits
8 Fig. 3. Result obtaine using the SICA on the ecomposition oun using SISA. By imposing inepenence, e.g., requiring the amplitues in the requency omain to be sparse, the rotation an shit ambiguity inherite in the moel is resolve. Clearly the true unerlying components an their respective mixing are correctly ientie. However, a local minimum has been oun, resulting in errors in the estimation o the elays or the rst component. ue to aitional local minima. In an example we saw this happen: The SICA algorithm aile in correctly ientiying the elays o the rst component; the component with the highest requencies. A multistart strategy was invoke, we choose the best o ten ranom initializations to obtain a goo initial solution or the estimation o the shit invariant subspace. While our algorithm was base on likelihoo maximization, Yereor [13] evelope an algorithm base on joint iagonalization. The present SISA is potentially useul as a preprocessing step or this latter algorithm when estimating less sources than sensors. Current work comprises perormance comparisons with this algorithm (A. Yereor, personal communication). Previous work base on integer shits conjecture the ecomposition to be unique [6]. When using integer shits some shits might perorm better than others ue to a better integer rouning error. Hence, this might be why the integer shits orme seemingly unique solutions. However, as emonstrate in gure 2 the shite actor analysis moel is not in general unique. But, by imposing inepenence unique solutions can be obtaine up to trivial permutation, scaling an specic onset relative to the elays o the sources as emonstrate in gure 3. The shit/elay moel may prove useul or a wie range o ata where ICA alreay has been employe. Furthermore, the extra inormation o elays can be useul or spatial source localization when combine with inormation o position o the sensors. Future work will ocus on implementing aitional constraints such as non-negativity an attempt to improve the ientiability in the presence o many local minima. The current algorithm can be ownloae rom [1].
9 Reerences 1. Mørup, M., Masen, K.H.: www2.imm.tu.k/pubb/views/publication_etails.php? i=5206. (2007) 2. Kaiser, H.F.: The varimax criterion or analytic rotation in actor analysis. Psychometrica 23 (1958) Comon, P.: Inepenent component analysis, a new concept? Signal Processing 36 (1994) Bell, A.J., Sejnowski, T.J.: An inormation maximization approach to blin source separation an blin econvolution. Neural Computation 7 (1995) Olshausen, B. A., F.D.: Emergence o simple-cell receptiove el propertises by learning a sparse coe or natural images. Nature 381 (1996) Harshman, R., Hong, S., Luny, M.: Shite actor analysis part i: Moels an properties. Journal o Chemometrics 17 (2003) Attias, H., Schreiner, C.: Blin source separation an econvolution: the ynamic component analysis algorithm. Neural Computation 10(6) (1998) Parra, L., Spence, C., Vries, B.: Convolutive blin source separation base on multiple ecorrelation. IEEE Workshop on Neural Networks an Signal Processing (1998) Anemuller, J., Sejnowski, T.J., Makeig, S.: Complex inepenent component analysis o requency-omain electroencephalographic ata. Neural Networks 16(9) (2003) Harshman, R., Hong, S., Luny, M.: Shite actor analysis part ii: Algorithms. Journal o Chemometrics 17 (2003) Torkkola, K.: Blin separation o elaye sources base on inormationmaximization. Acoustics, Speech, an Signal Processing. ICASSP-96 6 (1996) Emile, B., Comon, P.: Estimation o time elays between unknown colore signals. Signal Processing 68(1) (1998) Yereor, A.: Time-elay estimation in mixtures. ICASSP 5 (2003) Yereor, A.: Blin source separation in the presence o oppler requency shits. ICASSP 5 (2005) Caroso, J.F., Tulay, A.: The maximum likelihoo approach to complex ica. ICASSP (2006) Hyvarinen, A., Karhunen, J., Oja, E.: Inepenent Component Analysis. John Wiley an Sons. (2001)
Time and Frequency Domain Optimization with Shift, Convolution and Smoothness in Factor Analysis Type Decompositions
Downloae from orbit.tu.k on: May 9, 218 Time an Frequency Domain Optimization with Shift, Convolution an Smoothness in Factor Analysis Type Decompositions Masen, Kristoffer Hougaar; Hansen, Lars Kai; Mørup,
More informationUnit vectors with non-negative inner products
Unit vectors with non-negative inner proucts Bos, A.; Seiel, J.J. Publishe: 01/01/1980 Document Version Publisher s PDF, also known as Version of Recor (inclues final page, issue an volume numbers) Please
More informationLeast-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 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 informationMulti-View Clustering via Canonical Correlation Analysis
Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
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 informationTEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE
TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,
More informationMulti-View Clustering via Canonical Correlation Analysis
Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu
More informationCapacity Analysis of MIMO Systems with Unknown Channel State Information
Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,
More informationOptimization of Geometries by Energy Minimization
Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.
More informationSensors & Transducers 2015 by IFSA Publishing, S. L.
Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationAn Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes
SUBMITTED TO IEEE TRANSACTIONS ON INFORMATION THEORY, FEBRUARY 2004 1 An Upper Boun on the Minimum Distance o Serially Concatenate Convolutional Coes Alberto Perotti, Member, IEEE, an Sergio Beneetto,
More informationImproving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers
International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize
More informationMulti-View Clustering via Canonical Correlation Analysis
Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in
More informationProblems Governed by PDE. Shlomo Ta'asan. Carnegie Mellon University. and. Abstract
Pseuo-Time Methos for Constraine Optimization Problems Governe by PDE Shlomo Ta'asan Carnegie Mellon University an Institute for Computer Applications in Science an Engineering Abstract In this paper we
More informationINDEPENDENT COMPONENT ANALYSIS VIA
INDEPENDENT COMPONENT ANALYSIS VIA NONPARAMETRIC MAXIMUM LIKELIHOOD ESTIMATION Truth Rotate S 2 2 1 0 1 2 3 4 X 2 2 1 0 1 2 3 4 4 2 0 2 4 6 4 2 0 2 4 6 S 1 X 1 Reconstructe S^ 2 2 1 0 1 2 3 4 Marginal
More informationSpeaker Adaptation Based on Sparse and Low-rank Eigenphone Matrix Estimation
INTERSPEECH 2014 Speaker Aaptation Base on Sparse an Low-rank Eigenphone Matrix Estimation Wen-Lin Zhang 1, Dan Qu 1, Wei-Qiang Zhang 2, Bi-Cheng Li 1 1 Zhengzhou Information Science an Technology Institute,
More informationIERCU. Institute of Economic Research, Chuo University 50th Anniversary Special Issues. Discussion Paper No.210
IERCU Institute of Economic Research, Chuo University 50th Anniversary Special Issues Discussion Paper No.210 Discrete an Continuous Dynamics in Nonlinear Monopolies Akio Matsumoto Chuo University Ferenc
More information2 Viktor G. Kurotschka, Rainer Schwabe. 1) In the case of a small experimental region, mathematically described by
HE REDUION OF DESIGN PROLEMS FOR MULIVARIAE EXPERIMENS O UNIVARIAE POSSIILIIES AND HEIR LIMIAIONS Viktor G Kurotschka, Rainer Schwabe Freie Universitat erlin, Mathematisches Institut, Arnimallee 2{6, D-4
More information1. Filling an initially porous tube under a constant head imposed at x =0
Notes on Moving Bounary problems, Voller U o M, volle00@umn.eu. Filling an initially porous tube uner a constant hea impose at x =0 Governing equation is base on calculating the water volume lux by the
More informationAll s Well That Ends Well: Supplementary Proofs
All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee
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 informationResearch on Thin Film Thickness Uniformity for Deposition of Rectangular Planar Sputtering Target
Available online at www.scienceirect.com Physics Proceia 3 (01 ) 903 913 18 th International Vacuum Congress (IVC-18) Research on Thin Film Thickness Uniormity or Deposition o Rectangular Planar puttering
More informationInter-domain Gaussian Processes for Sparse Inference using Inducing Features
Inter-omain Gaussian Processes for Sparse Inference using Inucing Features Miguel Lázaro-Greilla an Aníbal R. Figueiras-Vial Dep. Signal Processing & Communications Universia Carlos III e Mari, SPAIN {miguel,arfv}@tsc.uc3m.es
More informationComputed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is:
Noll 3 CT Notes : Page Compute Tomograph Notes Part Challenges with Projection X-ra Sstems The equation that governs the image intensit in projection imaging is: z I I ep µ z Projection -ra sstems are
More informationComputed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is:
Noll 6 CT Notes : Page Compute Tomograph Notes Part Challenges with Projection X-ra Sstems The equation that governs the image intensit in projection imaging is: z I I ep μ z Projection -ra sstems are
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
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 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 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 informationMulti-edge Optimization of Low-Density Parity-Check Codes for Joint Source-Channel Coding
Multi-ege Optimization of Low-Density Parity-Check Coes for Joint Source-Channel Coing H. V. Beltrão Neto an W. Henkel Jacobs University Bremen Campus Ring 1 D-28759 Bremen, Germany Email: {h.beltrao,
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 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 information1 Introuction In the past few years there has been renewe interest in the nerson impurity moel. This moel was originally propose by nerson [2], for a
Theory of the nerson impurity moel: The Schrieer{Wol transformation re{examine Stefan K. Kehrein 1 an nreas Mielke 2 Institut fur Theoretische Physik, uprecht{karls{universitat, D{69120 Heielberg, F..
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationUNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION
UNIFYING AND MULISCALE APPROACHES O FAUL DEECION AND ISOLAION Seongkyu Yoon an John F. MacGregor Dept. Chemical Engineering, McMaster University, Hamilton Ontario Canaa L8S 4L7 yoons@mcmaster.ca macgreg@mcmaster.ca
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 informationProduct and Quotient Rules and Higher-Order Derivatives. The Product Rule
330_003.q 11/3/0 :3 PM Page 119 SECTION.3 Prouct an Quotient Rules an Higher-Orer Derivatives 119 Section.3 Prouct an Quotient Rules an Higher-Orer Derivatives Fin the erivative o a unction using the Prouct
More information2.3 Product and Quotient Rules and Higher-Order Derivatives
Chapter Dierentiation. Prouct an Quotient Rules an Higher-Orer Derivatives Fin the erivative o a unction using the Prouct Rule. Fin the erivative o a unction using the Quotient Rule. Fin the erivative
More informationSemianalytical method of lines for solving elliptic partial dierential equations
Chemical Engineering Science 59 (2004) 781 788 wwwelseviercom/locate/ces Semianalytical metho of lines for solving elliptic partial ierential equations Venkat R Subramanian a;, Ralph E White b a Department
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationAngles-Only Orbit Determination Copyright 2006 Michel Santos Page 1
Angles-Only Orbit Determination Copyright 6 Michel Santos Page 1 Abstract This ocument presents a re-erivation of the Gauss an Laplace Angles-Only Methos for Initial Orbit Determination. It keeps close
More informationNeuro-Fuzzy Processor
An Introuction to Fuzzy State Automata L.M. Reyneri Dipartimento i Elettronica - Politecnico i Torino C.so Duca Abruzzi, 24-10129 Torino - ITALY e.mail reyneri@polito.it; phone ++39 11 568 4038; fax ++39
More informationConsider for simplicity a 3rd-order IIR filter with a transfer function. where
Basic IIR Digital Filter The causal IIR igital filters we are concerne with in this course are characterie by a real rational transfer function of or, equivalently by a constant coefficient ifference equation
More informationIndependent Component Analysis (ICA) Bhaskar D Rao University of California, San Diego
Independent Component Analysis (ICA) Bhaskar D Rao University of California, San Diego Email: brao@ucsdedu References 1 Hyvarinen, A, Karhunen, J, & Oja, E (2004) Independent component analysis (Vol 46)
More informationHow to Minimize Maximum Regret in Repeated Decision-Making
How to Minimize Maximum Regret in Repeate Decision-Making Karl H. Schlag July 3 2003 Economics Department, European University Institute, Via ella Piazzuola 43, 033 Florence, Italy, Tel: 0039-0-4689, email:
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 informationDebond crack growth in fatigue along fiber in UD composite with broken fibers
Debon crack growth in atigue along iber in UD composite with broken ibers Johannes Eitzenberger an Janis arna Dept o Applie Physics an Mechanical Engineering Lulea University o Technology, Sween SE 97
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 informationLinear Regression with Limited Observation
Ela Hazan Tomer Koren Technion Israel Institute of Technology, Technion City 32000, Haifa, Israel ehazan@ie.technion.ac.il tomerk@cs.technion.ac.il Abstract We consier the most common variants of linear
More informationA New Minimum Description Length
A New Minimum Description Length Soosan Beheshti, Munther A. Dahleh Laboratory for Information an Decision Systems Massachusetts Institute of Technology soosan@mit.eu,ahleh@lis.mit.eu Abstract The minimum
More informationBasic IIR Digital Filter Structures
Basic IIR Digital Filter Structures The causal IIR igital filters we are concerne with in this course are characterie by a real rational transfer function of or, equivalently by a constant coefficient
More informationSTATISTICAL LIKELIHOOD REPRESENTATIONS OF PRIOR KNOWLEDGE IN MACHINE LEARNING
STATISTICAL LIKELIHOOD REPRESENTATIONS OF PRIOR KNOWLEDGE IN MACHINE LEARNING Mark A. Kon Department of Mathematics an Statistics Boston University Boston, MA 02215 email: mkon@bu.eu Anrzej Przybyszewski
More informationA Short Note on Self-Similar Solution to Unconfined Flow in an Aquifer with Accretion
Open Journal o Flui Dynamics, 5, 5, 5-57 Publishe Online March 5 in SciRes. http://www.scirp.org/journal/oj http://x.oi.org/.46/oj.5.57 A Short Note on Sel-Similar Solution to Unconine Flow in an Aquier
More informationOptimal Measurement and Control in Quantum Dynamical Systems.
Optimal Measurement an Control in Quantum Dynamical Systems. V P Belavin Institute of Physics, Copernicus University, Polan. (On leave of absence from MIEM, Moscow, USSR) Preprint No 411, Torun, February
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 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 informationLocal Linear ICA for Mutual Information Estimation in Feature Selection
Local Linear ICA for Mutual Information Estimation in Feature Selection Tian Lan, Deniz Erogmus Department of Biomeical Engineering, OGI, Oregon Health & Science University, Portlan, Oregon, USA E-mail:
More informationTHE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE
Journal of Soun an Vibration (1996) 191(3), 397 414 THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE E. M. WEINSTEIN Galaxy Scientific Corporation, 2500 English Creek
More informationEC5555 Economics Masters Refresher Course in Mathematics September 2013
EC5555 Economics Masters Reresher Course in Mathematics September 3 Lecture 5 Unconstraine Optimization an Quaratic Forms Francesco Feri We consier the unconstraine optimization or the case o unctions
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationNew Statistical Test for Quality Control in High Dimension Data Set
International Journal of Applie Engineering Research ISSN 973-456 Volume, Number 6 (7) pp. 64-649 New Statistical Test for Quality Control in High Dimension Data Set Shamshuritawati Sharif, Suzilah Ismail
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 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 informationModeling time-varying storage components in PSpice
Moeling time-varying storage components in PSpice Dalibor Biolek, Zenek Kolka, Viera Biolkova Dept. of EE, FMT, University of Defence Brno, Czech Republic Dept. of Microelectronics/Raioelectronics, FEEC,
More informationTMA 4195 Matematisk modellering Exam Tuesday December 16, :00 13:00 Problems and solution with additional comments
Problem F U L W D g m 3 2 s 2 0 0 0 0 2 kg 0 0 0 0 0 0 Table : Dimension matrix TMA 495 Matematisk moellering Exam Tuesay December 6, 2008 09:00 3:00 Problems an solution with aitional comments The necessary
More informationWe G Model Reduction Approaches for Solution of Wave Equations for Multiple Frequencies
We G15 5 Moel Reuction Approaches for Solution of Wave Equations for Multiple Frequencies M.Y. Zaslavsky (Schlumberger-Doll Research Center), R.F. Remis* (Delft University) & V.L. Druskin (Schlumberger-Doll
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 informationMonte Carlo Methods with Reduced Error
Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for
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 informationReal-time economic optimization for a fermentation process using Model Predictive Control
Downloae from orbit.tu.k on: Nov 5, 218 Real-time economic optimization for a fermentation process using Moel Preictive Control Petersen, Lars Norbert; Jørgensen, John Bagterp Publishe in: Proceeings of
More informationEVALUATING HIGHER DERIVATIVE TENSORS BY FORWARD PROPAGATION OF UNIVARIATE TAYLOR SERIES
MATHEMATICS OF COMPUTATION Volume 69, Number 231, Pages 1117 1130 S 0025-5718(00)01120-0 Article electronically publishe on February 17, 2000 EVALUATING HIGHER DERIVATIVE TENSORS BY FORWARD PROPAGATION
More informationGaussian processes with monotonicity information
Gaussian processes with monotonicity information Anonymous Author Anonymous Author Unknown Institution Unknown Institution Abstract A metho for using monotonicity information in multivariate Gaussian process
More informationTeaching Fourier optics through ray matrices
INSTITUTE OF PHYSICS PUBLISHING Eur. J. Phys. 26 (2005 261 271 EUROPEAN JOURNAL OF PHYSICS oi:10.1088/0143-0807/26/2/005 Teaching Fourier optics through ray matrices IMoreno 1,MMSánche-Lópe 1,CFerreira
More informationONE SILVESTRU SEVER DRAGOMIR 1;2
SOME -DIVERGENCE MEASURES RELATED TO JENSEN S ONE SILVESTRU SEVER DRAGOMIR ; Abstract. In this paper we introuce some -ivergence measures that are relate to the Jensen s ivergence introuce by Burbea an
More informationModelling and simulation of dependence structures in nonlife insurance with Bernstein copulas
Moelling an simulation of epenence structures in nonlife insurance with Bernstein copulas Prof. Dr. Dietmar Pfeifer Dept. of Mathematics, University of Olenburg an AON Benfiel, Hamburg Dr. Doreen Straßburger
More informationAalborg Universitet. Compressed Sensing with Rank Deficient Dictionaries
Downloae from vbn.aau.k on: januar 11, 2019 Aalborg Universitet Compresse Sensing with Rank Deficient Dictionaries ansen, Thomas Lungaar; Johansen, Daniel øjrup; Jørgensen, Peter Bjørn; Trillingsgaar,
More informationLecture 2: Correlated Topic Model
Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables
More informationEstimation of the Maximum Domination Value in Multi-Dimensional Data Sets
Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.
More informationTHE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS
THE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS BY ANDREW F. MAGYAR A issertation submitte to the Grauate School New Brunswick Rutgers,
More informationProof of SPNs as Mixture of Trees
A Proof of SPNs as Mixture of Trees Theorem 1. If T is an inuce SPN from a complete an ecomposable SPN S, then T is a tree that is complete an ecomposable. Proof. Argue by contraiction that T is not a
More informationTechnion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels.
Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Constraine Coes for Two-Dimensional Channels Keren Censor Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Technion
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
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 informationarxiv:hep-th/ v1 3 Feb 1993
NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,
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 informationConcentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification
Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,
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 informationMaximal Causes for Non-linear Component Extraction
Journal of Machine Learning Research 9 (2008) 1227-1267 Submitte 5/07; Revise 11/07; Publishe 6/08 Maximal Causes for Non-linear Component Extraction Jörg Lücke Maneesh Sahani Gatsby Computational Neuroscience
More informationAnalyzing Tensor Power Method Dynamics in Overcomplete Regime
Journal of Machine Learning Research 18 (2017) 1-40 Submitte 9/15; Revise 11/16; Publishe 4/17 Analyzing Tensor Power Metho Dynamics in Overcomplete Regime Animashree Ananumar Department of Electrical
More informationMotivation. CS/EE 3700 : Fundamentals of Digital System Design
Motivation CS/EE 37 : Funamentals o Digital System Design Chris J. Myers Lecture 4: Logic Optimization Chapter 4 Algebraic manipulation is not systematic. This chapter presents methos that can be automate
More information6. Friction and viscosity in gasses
IR2 6. Friction an viscosity in gasses 6.1 Introuction Similar to fluis, also for laminar flowing gases Newtons s friction law hols true (see experiment IR1). Using Newton s law the viscosity of air uner
More informationLeft-invariant extended Kalman filter and attitude estimation
Left-invariant extene Kalman filter an attitue estimation Silvere Bonnabel Abstract We consier a left-invariant ynamics on a Lie group. One way to efine riving an observation noises is to make them preserve
More informationExamining Geometric Integration for Propagating Orbit Trajectories with Non-Conservative Forcing
Examining Geometric Integration for Propagating Orbit Trajectories with Non-Conservative Forcing Course Project for CDS 05 - Geometric Mechanics John M. Carson III California Institute of Technology June
More informationA Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation
A Novel ecouple Iterative Metho for eep-submicron MOSFET RF Circuit Simulation CHUAN-SHENG WANG an YIMING LI epartment of Mathematics, National Tsing Hua University, National Nano evice Laboratories, an
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
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 information