Polarity-SC by @polarity 🎛️
Open-Source Spectral Compressor. Upward/downward, pink-noise shaping, sidechain, delta, IR export.

💻 Win/Mac/Linux (VST3/CLAP)
🎁 FREE https://polarity.productions/polarity-sc/

#freeplugin #spectralcompression #fft #opensource #dynamics #sidechain #opensource

Chandra の Cas A 画像を FFT して遊ぶ:振幅と位相から見る天体画像の構造 - Qiita

はじめに 天体画像を見ていると、私たちは自然に「明るいところ」や「細かい構造」に注目します。 たとえば Chandra X線天文衛星で観測された超新星残骸 Cassiopeia A(Cas A)の画像を見ると、shell 状の構造、filament、局所的に明るい kno...

Qiita
Flânerie — Wandering in Paris

The flâneur is the idle stroller observing society, and flânerie is the art of being a flâneur, the "Gastonomy of the Eye". Let's see how to stroll Paris with no specific purpose.

Bob's Pages of Travel, Linux, Cybersecurity, and More
Heute findet in #Düsseldorf nochmal "Aufklärung in Zeiten der Verdunkelung" statt, dieses Mal 19:30 Uhr im #FFT. (Eintritt 5 €, ermäßigt 2 €) https://www.fft-duesseldorf.de/spielplan/aufklaerung-in-zeiten-der-verdunkelung
Aufklärung in Zeiten der Verdunkelung | FFT Düsseldorf

Unsere Gegenwart und ihre multiplen Krisen beschreibt der Philosoph Philipp Blom als Zeit des Umbruchs, in der wir die früheren Versprechen unbegrenzten Wachstums und technischen Fortschritts kritisc

drew myself and some of my art moots in the FF Tactics style :3 #pixelart #FFT

Wow, il n'y a plus d'autre moyen de présenter son billet d'accès à #RolandGarros autrement que via #application #smartphone 🫤😢

>Tous les spectateurs doivent présenter leurs billets depuis l'application mobile Roland-Garros. Il n'est donc désormais plus possible d'imprimer son billet. Le billet est sécurisé et dynamique, seuls les billets présentés depuis l'application mobile Roland-Garros seront acceptés.

#tennis #billetterie #fft

『ファイナルファンタジータクティクス - イヴァリース クロニクルズ』 ユニット紹介

YouTube
『ファイナルファンタジータクティクス - イヴァリース クロニクルズ』 バックボーンストーリー

YouTube

Great news!! A fast, butterfly (aka FFT-like), implementation of the Noiselet Transform [1] is now integrated into the LazyLinop toolbox [2] – “a python toolbox to ease and accelerate computations with (“matrix-free”) linear operators.” Thank you to Pascal Carrivain and Rémi Gribonval from the OCKHAM/INRIA team [3], in ENS Lyon, France (where I’m currently invited for a sabbatical year in 25-26) for this implementation. The idea came from common discussions we had together (I share my office with Pascal at ENS Lyon) about possible additional butterfly transformations to complete the (already long) list of operators integrated to LazyLinop. The whole Noiselet Tansform (and its inverse) is described here in the LazyLinop documentation, with a demonstration code in python. Enjoy!

---

[1] https://laurentjacques.gitlab.io/post/some-comments-on-noiselets/

[2] https://faustgrp.gitlabpages.inria.fr/lazylinop/index.html "Lazylinop is a python toolbox to ease and accelerate computations with (“matrix-free”) linear operators. It provides glue to combine linear operators as easily as NumPy arrays, PyTorch/CuPy compatibility, standard signal/image processing linear operators, as well as advanced tools to approximate large matrices by efficient butterfly operators."

[3] https://team.inria.fr/ockham/

#Noiselet #CompressiveSensing #Butterfly #fft #InverseProblem #Python #Numeric #PyTorch

Some comments on the Noiselet Transform (special "LazyLinopt update") | Laurent Jacques

Updates: (22/04/26) Great news!! A fast, butterfly (aka FFT-like), implementation of the Noiselet Transform (see below) is now integrated into the LazyLinop toolbox – “a python toolbox to ease and accelerate computations with (“matrix-free”) linear operators.

Laurent Jacques