Тёмный

Image Compression and the FFT 

Steve Brunton
Подписаться 354 тыс.
Просмотров 48 тыс.
50% 1

Here we discuss how to compress images using the FFT. Compression is a cornerstone of the modern digital communication era.
Book Website: databookuw.com
Book PDF: databookuw.com/databook.pdf
These lectures follow Chapter 2 from:
"Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control" by Brunton and Kutz
Amazon: www.amazon.com/Data-Driven-Sc...
Brunton Website: eigensteve.com
This video was produced at the University of Washington

Наука

Опубликовано:

 

27 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 54   
@lernenmitrobin
@lernenmitrobin 4 года назад
Great Steve! There was the Parsevals theorem related to FFT we talked about a few videos ago. Very nice example and explanation!!!
@complex_variation
@complex_variation 4 года назад
wow steve all your videos are way too great I'm buying your book as soon as I can.
@user-rn7py2ee9x
@user-rn7py2ee9x Год назад
Excellent video. It was especially interesting to understand image compression in the context of Parseval's Theorem.
@sirajtayyabkhan6820
@sirajtayyabkhan6820 3 года назад
Brilliant video, very concise, and clear.
@oussamalaouadi8521
@oussamalaouadi8521 3 года назад
Great. Thank You so much. just one thing to point out : the JPEG Compression standard used the DCT transform on the block level of an image (usually 8x8) it's based on Fourier's idea but a bit advanced in some sense that it de-correlates the input data (frequency information of pixels) to make it easier to Quantify (reduce) the higher frequencies and still get almost the same image with less volume.
@chowdhsk
@chowdhsk 2 года назад
yes was just about to type this. @steve maybe you should mention it
@TheGhostcowvaca
@TheGhostcowvaca Год назад
Very clear and easy to understand!
@jumbyvt6839
@jumbyvt6839 2 года назад
This was really good. Great job.
@konstantinosmimidis1632
@konstantinosmimidis1632 4 года назад
Great video. Very good level of explanation for educational purposes, but also for professionals. Congratulations! Looking forward for the wavelet analysis and S-transform if it possible sometime.
@JohnWick-xd5zu
@JohnWick-xd5zu 4 года назад
Thank you sir
@sksahil4374
@sksahil4374 Год назад
Great Video. Very good explanation. it's clear my concept about wavelet transformation.
@SRIMANTASANTRA
@SRIMANTASANTRA 4 года назад
Hi Professor Steve, Thanks.....
@michaeljurado7224
@michaeljurado7224 2 года назад
This is a great video.
@gammingfatma2282
@gammingfatma2282 3 года назад
أستاذ رائع ومميّز.... Great Video
@alexeyl22
@alexeyl22 4 года назад
Would be nice to see effects of various animations on the FFT.
@johnwt7333
@johnwt7333 3 года назад
Just do it yourself in python.
@martinignaciofeldman
@martinignaciofeldman Год назад
great video, thanks
@toastrecon
@toastrecon 4 года назад
I'm excited to learn more about this!
@migueMSD
@migueMSD 3 года назад
Great video
@Eigensteve
@Eigensteve 3 года назад
Thanks!
@individuoenigmatico1990
@individuoenigmatico1990 6 месяцев назад
Wonderful content. I think the fact that compression works depends on the fact that the Discrete Fourier Transform, and hence its inverse, are unitary operators, hence they preserve distances between vectors. If I am eliminating a little noise in a vector in the Fourier space, I get a new denoised vector whose distance to the first one is negligible, hence the distance between the original image and the the "compressed" image shall itself be negligible.
@arvindp551
@arvindp551 3 года назад
It's 2 AM in New Delhi and you have made my day. Thank you Steve!
@yuurishibuya4797
@yuurishibuya4797 3 года назад
Get a life!
@arvindp551
@arvindp551 3 года назад
@@yuurishibuya4797 well, I have everything i need, you name it...except a job in engineering field for which I had left my previous stable-cum-peaceful job.
@overcomplete
@overcomplete 4 года назад
might be a bit advanced but the bit I'm interested in is zero-padding. thanks great vids as always
@EEDKonduruLakshmiBhanuPrakashR
@EEDKonduruLakshmiBhanuPrakashR 3 года назад
Professor can you please explain difference between and FFT and DCT, why DCT is used in JPEG Compression and can you please explain python code for JPEG COMPRESSION . Thank you.
@Amine-gz7gq
@Amine-gz7gq 2 года назад
what is the range of frequencies used for the FFT ?
@bryanperf
@bryanperf 4 года назад
Another great video and well explained. Doesn't JPEG use the DCT instead of the full FFT?
@supershaye
@supershaye 4 года назад
Yes JPEG uses the DCT instead. The energy compaction of the DCT is much better than the Fourier Transform.
@Miyelsh
@Miyelsh 4 года назад
JPEG uses the DCT with blocks of pixels instead of the whole image at once. That's why badly jpg'd images have the odd blocky appearance.
@jms547
@jms547 4 года назад
So after thresholding do the large-amplitude components tend to sit on a compactly supported set as you kind of suggest in your sketches, or are they scattered all over Fourier space? Thanks for the great lectures!
@Miyelsh
@Miyelsh 4 года назад
They would be pretty heavily localized, but depend a lot from image to image. A picture of a white square on a black background would look kind of like a puddle after a rock was dropped in, with circles emmanating from the center.
@jms547
@jms547 4 года назад
@@Miyelsh thanks!
@erick_ac
@erick_ac Год назад
you could design an image to scatter over the fourier space, but regardless, the inverse operation to form the image only keeps the coefficients needed for the higher values, aka, you store their coordinates from the fourier space although one could totally design a way to store the coefficients that best fit the described set in the sketch, but you would need to study a very particular use case to apply it (like maybe how the fourier space looks on cartoony images or just compressing for text)
@delendaanouar7180
@delendaanouar7180 4 года назад
Hi, Great video as usual. Lately I have heard of Haline which is used in image processing and it is 100 times faster than Matlab, I wonder if Haline using another algorithm differs from that of FFT, and another question is how we can return the signal word to the image(image=signal!!)?
@mohamedking96
@mohamedking96 2 года назад
an image is simply a set of points(x,y) which they could be plotted like a signal
@erick_ac
@erick_ac Год назад
the fast fourier transform is a discrete transform meaning that the values it receives are in a discrete domain, it's not a continuous signal. it's extensively used in computing because of the discrete nature of digital stuff like audio and video
@xiezhang1741
@xiezhang1741 4 года назад
I am curious how the "transparent" board works.
@danielsteel5251
@danielsteel5251 4 года назад
Likely some variation on this: black room, solid color background, special neon markers, camera behind *pane of glass,* and the picture is reversed (i.e., horizontally reflected) either before or after recording. Make sense?
@xiezhang1741
@xiezhang1741 4 года назад
@@danielsteel5251 Thanks. That explains. Sometimes he also includes his computer screen on the board. Guess there would be another projector involved. Anyways, it's really cool to see it. It looks so nice.
@danielsteel5251
@danielsteel5251 4 года назад
@@xiezhang1741 _... Guess there would be another projector involved. ..._ I'd guess that it was video editing, after the fact; not a projector.
@xiezhang1741
@xiezhang1741 4 года назад
@@danielsteel5251 That's unlikely, since he is precisely pointing to the right codes and images while he demonstrates the code implementations. It's gonna be really difficult to pretend something exists there while explaining very accurately and add the actual stuffs later.
@superuser8636
@superuser8636 4 года назад
@@xiezhang1741 His screen is being recorded and he can see it in a monitor while recording as he can be seen looking off camera into a monitor and it is then later edited in (and out) in post-production (post/post-prod) as necessary. If I'm wrong feel free to offer an alternate theory, but this seems the most likely and is what I would do.
@igorg4129
@igorg4129 4 года назад
Great. Thank you very much sir. Question. In the middle of fft2 image There are low frequensy sinewaves, or there are high amplitude sinewaves?
@Miyelsh
@Miyelsh 4 года назад
The middle is low frequency waves. The very center is what's called the DC term, which is the overall average brightness of the image. The edges would be terms that are alternating every pixel, so you would only see those if you did something like took a picture of a screen door.
@amortalbeing
@amortalbeing Месяц назад
Thanks good
@davidajaba
@davidajaba 4 года назад
I'm here first... Awesome video... 😁
@astrovenky
@astrovenky 3 года назад
7:05 this doesn't have to be true but this is true!! Lol 🤣
@ashwinsrinivas7278
@ashwinsrinivas7278 4 года назад
Peppa!!! What are you doing in Steve's video??
@falahmohsen9796
@falahmohsen9796 2 года назад
hello >>>thank you for this فhe interesting lecture. Can I communicate with you by email about the same topic
Далее
Image Compression with the FFT (Examples in Matlab)
17:30
Wavelets and Multiresolution Analysis
15:12
Просмотров 137 тыс.
Wait for the BOWLING BALL! 👀
00:38
Просмотров 23 млн
Flo Rida - Whistle НА РУССКОМ 😂🔥
00:29
CMPRSN (Compression Overview) - Computerphile
15:54
Просмотров 69 тыс.
How Image Compression Works
6:52
Просмотров 113 тыс.
The Laplace Transform: A Generalized Fourier Transform
16:28
Denoising Data with FFT [Python]
10:03
Просмотров 170 тыс.
Why Information Theory is Important - Computerphile
12:33
How the 2D FFT works
9:40
Просмотров 84 тыс.
10 МИНУСОВ IPHONE 15
18:03
Просмотров 37 тыс.