Signal processing

Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, , potential fields, seismic signals, altimetry processing, and scientific measurements. Signal processing techniques are used to optimize transmissions, digital storage efficiency, correcting distorted signals, subjective video quality and to also detect or pinpoint components of interest in a measured signal. According to Alan V. Oppenheim and Ronald W. Schafer, the principles of signal processing can be found in the classical numerical analysis techniques of the 17th century. They further state that the digital refinement of these techniques can be found in the digital control systems of the 1940s and 1950s. In 1948, Claude Shannon wrote the influential paper "A Mathematical Theory of Communication" which was published in the Bell System Technical Journal. The paper laid the groundwork for later development of information communication systems and the processing of signals for transmission. Signal processing matured and flourished in the 1960s and 1970s, and digital signal processing became widely used with specialized digital signal processor chips in the 1980s. A signal is a function , where this function is either deterministic (then one speaks of a deterministic signal) or a path , a realization of a stochastic process Analog signal processing Analog signal processing is for signals that have not been digitized, as in most 20th-century radio, telephone, and television systems. This involves linear electronic circuits as well as nonlinear ones. The former are, for instance, passive filters, active filters, additive mixers, integrators, and delay lines. Nonlinear circuits include compandors, multipliers (frequency mixers, voltage-controlled amplifiers), voltage-controlled filters, voltage-controlled oscillators, and phase-locked loops. Continuous-time signal processing is for signals that vary with the change of continuous domain (without considering some individual interrupted points).

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Summary

Resolution-robust Large Mask In painting with Fourier Convolutions

Anastasia Remizova

Modern image inpainting systems, despite the significant progress, often struggle with large missing areas, complex geometric structures, and high-resolution images. We find that one of the main reasons for that is the lack of an effective receptive field in both the inpainting network and the loss function. To alleviate this issue, we propose a new method called large mask inpainting (LaMa). LaMa is based on i) a new inpainting network architecture that uses fast Fourier convolutions (FFCs), which have the imagewide receptive field; ii) a high receptive field perceptual loss; iii) large training masks, which unlocks the potential of the first two components. Our inpainting network improves the state-of-the-art across a range of datasets and achieves excellent performance even in challenging scenarios, e.g. completion of periodic structures. Our model generalizes surprisingly well to resolutions that are higher than those seen at train time, and achieves this at lower parameter&time costs than the competitive baselines. The code is available at https://github.com/saic-mdal/lama.

IEEE COMPUTER SOC2022

Perturbed Fourier uniqueness and interpolation results in higher dimensions

Joao Pedro Gonçalves Ramos, Martin Peter Stoller

We obtain new Fourier interpolation and uniqueness results in all dimensions, extending methods and results by the first author and M. Sousa [11] and the second author [12]. We show that the only Schwartz function which, together with its Fourier transform, vanishes on surfaces close to the origin-centered spheres whose radii are square roots of integers, is the zero function. In the radial case, these surfaces are spheres with perturbed radii, while in the non-radial case, they can be graphs of continuous functions over the sphere. As an applica-tion, we translate our perturbed Fourier uniqueness results to perturbed Heisenberg uniqueness for the hyperbola, using the interrelation between these fields introduced and studied by Bakan, Hedenmalm, Montes-Rodriguez, Radchenko and Via-zovska [1].(c) 2022 Published by Elsevier Inc.

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Fourier uniqueness and interpolation in Euclidean space

Martin Peter Stoller

We prove that every Schwartz function in Euclidean space can be completely recovered given only its restrictions and the restrictions of its Fourier transform to all origin-centered spheres whose radii are square roots of integers. In particular, the only Schwartz function which, together with its Fourier transform, vanishes on these spheres, is the zero function. We show that this remains true if we replace the spheres by surfaces or discrete sets of points which are sufficiently small perturbations of these spheres. In a complementary, opposite direction, we construct infinite dimensional spaces of Fourier eigenfunctions vanishing on on certain discrete subsets of those spheres. The proofs combine harmonic analysis, the theory of modular forms and algebraic number theory.

EPFL2022

Variable bitrate (VBR) is a term used in telecommunications and computing that relates to the bitrate used in sound or video encoding. As opposed to constant bitrate (CBR), VBR files vary the amount of output data per time segment. VBR allows a higher bitrate (and therefore more storage space) to be allocated to the more complex segments of media files while less space is allocated to less complex segments. The average of these rates can be calculated to produce an average bitrate for the file.

In signal processing, a digital biquad filter is a second order recursive linear filter, containing two poles and two zeros. "Biquad" is an abbreviation of "biquadratic", which refers to the fact that in the Z domain, its transfer function is the ratio of two quadratic functions: The coefficients are often normalized such that a0 = 1: High-order infinite impulse response filters can be highly sensitive to quantization of their coefficients, and can easily become unstable.

Speaker recognition is the identification of a person from characteristics of voices. It is used to answer the question "Who is speaking?" The term voice recognition can refer to speaker recognition or speech recognition. Speaker verification (also called speaker authentication) contrasts with identification, and speaker recognition differs from speaker diarisation (recognizing when the same speaker is speaking).

Statistical Signal Processing Tools COM-500: Statistical signal and data processing through applications

Explores statistical signal processing tools for wireless communications, including spectral estimation and signal detection, classification, and adaptive filtering.

Sampling Theorem and Control Systems ME-326: Control systems and discrete-time control

Explores the Sampling Theorem, digital control, signal reconstruction, and anti-aliasing filters.

Signal Processing Fundamentals COM-500: Statistical signal and data processing through applications

Explores signal processing fundamentals, including discrete time signals, spectral factorization, and stochastic processes.

In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original representation. Any particular compression is either lossy or lossless. Lossless compression reduces bits by identifying and eliminating statistical redundancy. No information is lost in lossless compression. Lossy compression reduces bits by removing unnecessary or less important information.

Digital image processing is the use of a digital computer to process s through an algorithm. As a subcategory or field of digital signal processing, digital image processing has many advantages over . It allows a much wider range of algorithms to be applied to the input data and can avoid problems such as the build-up of noise and distortion during processing. Since images are defined over two dimensions (perhaps more) digital image processing may be modeled in the form of multidimensional systems.

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.