EL ENG 16A Lecture Notes - Lecture 4: Orthogonal Matrix, Matching Pursuit, Row And Column Vectors
31 Jan 2018
School
Department
Course
Professor
Document Summary
8:37 pm matching pursuit - a sparse approximation algorithm which involves finding the "best matching" projections of multidimensional data onto the span of an over-complete (redundant) dictionary. Orthogonal matching pursuit orthogonal matching pursuit (omp) - a technique/algorithm used to locate devices and their messages sent in a setup (used in internet of things, where devices often need to communicate with one another) Gram-schmidt and omp sparse spectrum - the setup where the number of devices transmitting at any given time is much less than the total number of devices in the set up. Omp algorithm uses cross correlation and least squares to locate a device that transmitted the message (finds the devices tha t are present) as well as uncover the message. The unknowns in omp are (1) the devices that are present (their signature codes) and (2) the shifts/delays of their signature codes.
