Название | : | CMPRSN (Compression Overview) - Computerphile |
Продолжительность | : | 15.54 |
Дата публикации | : | |
Просмотров | : | 29 rb |
|
Too much too soon Just show how it works on a sentence Comment from : @diskgrinder |
|
The idea of a random string being uncompressible was a new one to me and greatly added to my comprehension all on its own Comment from : @brandonthesteele |
|
That 7-up product placement Comment from : @Moley1Moleo |
|
less bits feels better than fewer bits to me, maybe because we rarely talk about single bits, but rather see them as a measure of storage in daily life? dunno Comment from : @L0op |
|
How about a video covering wave function collapse procedural generation algorithm Comment from : @kingsindian1066 |
|
The system with the highest factor of compression I can think of would be to have the first few bytes - or even potentially gigabytes - to be dedicated to specifying exactly which very custom algorithm is used to compress the message which follows Your decoder and encoder would be huge, but you could analyse the package very intensely to choose the optimum choice for the specific niche message you are sending, so you never deal with the end result being larger than the original message It would simply require a lot of pre and post processing but taking an hour to compress and decompress a message is worth it if you save a day by sending a smaller message through a low bandwidth tunnel Comment from : @blumoogle2901 |
|
0:11 JPEG is not a compression algorithmus, it's about data ireduction/ibrJPEG reduces details deemed unimportant for our visual system It actually doesn't compress but irrevocably reduces the image data Comment from : @dipi71 |
|
1:55 Thank you! I was screaming "FEWER", at the screen Comment from : @MedEighty |
|
A video on compression described as a long video on a short topic 🤣 Comment from : @Unisaur64 |
|
7zup? Comment from : @telperion3 |
|
ASCII is 7 bits That's fewer than 8 In fact, exactly 1 less than 8 Comment from : @nHans |
|
I'm going to be doubly pedantic and confirm that you can indeed say "less bits" instead of "fewer bits" when you are talking about information entropy (and not just computer memory), given that entropy is a continuous quantity that can take any value in the positive realsbrThat is, 15 bits is less bits than 276 bits Comment from : @KilgoreTroutAsf |
|
I imagine that the initial version of the video was over 30 minutes, but some type of algorithm was run on it, resulting in the video being less than 16 minutes Comment from : @zzzaphod8507 |
|
CMPRSN ? ah! a video on comparison About time too Comment from : @mijmijrm |
|
"You can define randomness as an uncompressable string" a video about this would be appreciated Comment from : @ChrisSeltzer |
|
The title of the video this time: comparison Weird that he talks about compression so much Comment from : @Yupppi |
|
Can we use pi as a form of a compressions? Comment from : @mrudo8663 |
|
I'm always looking at Steve in these videos The background isn't teaching computer science nearly so well! Comment from : @hamc9477 |
|
Finding Tom Scott a bit insufferable these days, but his video on Huffman Encoding was way better than this Huffman has been proven to be way better than RLE Comment from : @stevojohn |
|
I glad to see that "fewer" correction But I'm sad to see it didn't stick Comment from : @TheGreatAtario |
|
0:44 The bits in the "data" square are not random It's ASCII for "this is some data!!!" The compressed data in magenta spells "fewer bits" Comment from : @ZomB1986 |
|
"All mushrooms are edible, some of them even more than once" The same is kinda true for Compression: I can compress any dataset down to 1 bit Decompression is a completely different kettle of fish, though Comment from : @gwaptiva |
|
Thank you! It is “fewer bits” and “less bits” was bothering me so much 😂 Comment from : @ZohoExpert |
|
Now, if my compressor can be allowed to be infinite, I'll just make an infinite lookup table Comment from : @bluekeybo |
|
No mention of smaz? No mention of using a dictionary of words? Bit of a pointless video really Comment from : @TheTruthAboutLemmings |
|
the 0 bit message is still useful - i walk into a coffee shop and get handed my usual coffee, without me requesting one :) Comment from : @andytroo |
|
"You can define randomness as an incompressible string" - that's interesting, as true randomness tends to have patterns and streaks that, if I understand correctly, a compression algorithm could look for Comment from : @dembro27 |
|
Just for fun I played around with assigning shorter binary values to the more commonly used characters found in a text file and working up from there This resulted in the lesser used characters having much larger representations, and the sequence wasn't ultimately much shorter than what I started with I learned that ASCII and UTF-8 were already optimized beyond what I might come up with Comment from : @lanatrzczka |
|
Lossy compression can easily be seen in compressed movies with crowds in the background Generally, the crowd will look blurry and have a much lower frame rate than normal Comment from : @chickenman297 |
|
"and I'm just gonna write 'compress' because I've drawn the box too small and 'compressor' wouldn't fit in" is unintentional comedy gold Comment from : @thepurplelemons |
|
Clickbait, the video wasn’t about “comparison” 🤪 Comment from : @GarretMcGrawHanson |
|
just index all large files with a uuid, ignore all conflicts and save a lot of space cloud compression 😂 Comment from : @fabianmerki4222 |
|
7up? What's happened to the usual diet coke :0 Comment from : @markjfannon |
|
Have you guys done a video on zip bombs yet? Comment from : @TiagoTiagoT |
|
I'm pretty sure that there will soon be a way to compress text using large language models It won't necessarily be super fast, but probably way better at compression Comment from : @minxythemerciless |
|
Ok cool, go deeper please? Comment from : @rachel_rexxx |
|
The question they really need to answer is, what are they going to do once they run through all their tractor-feed paper? Comment from : @ccthomas |
|
Why waste time trading and taking risks when you can use Cannafarm Ltd? Comment from : @status__off7642 |
|
Thank you for your research I find your videos are well done RIght now Im keeping an eye on Cannafarm ltd Comment from : @toptenidea2352 |
|
Guys, just Google Cannafarm Ltd and thank me later Comment from : @andyramos1920 |
|
Guys, just Google Cannafarm Ltd and thank me later Comment from : @Hockienthucdientu |
|
Thank you for your research I find your videos are well done RIght now Im keeping an eye on Cannafarm ltd Comment from : @saddamemedia9376 |
|
ICOs and trading? Yall are dinosaurs Just google Сannafarm Ltd Comment from : @akunas6980 |
|
Ive been watching your videos for over a year now, and Ive got a question: why dont you invest in Cannafarm Ltd??? Comment from : @imammuslim623 |
|
CMPRSN can also be read as Comparison, talk about lossy compression right there Comment from : @GuentherJongeling-hu6oe |
|
There is also the Burrows-Wheeler-Transformation that can cluster similar characters Was a very interesting lecture Comment from : @fly1ngsh33p7 |
|
Been hoping for a general overview forever Comment from : @elementalnova7418 |
|
Commenting before I watch it all If I don't hear middle out, gonna be upset Comment from : @threeholepunchmike3549 |
|
Would love to hear some ideas on Optimal Tip-to-Tip Efficiency No need for demonstrations though Comment from : @andyrobinson |
|
See Steve Bagley -> immediately click Comment from : @VectorNodes |
|
FeWeR! Comment from : @gryzman |
|
Am I the only person who thinks "Kolmogorov Complexity" every time the subject of compression is discussed?brbrI am, aren't I? Comment from : @paullamar4111 |
|
A trill is well known to classical musicians Comment from : @rdubb77 |
|
please buy a tripod!!!!!!!!!!! Comment from : @sam-sn5pu |
|
0:58 - Ironic You should do something on capacity planning next :D Comment from : @YuriBez2023 |
|
Could you do a video about MSS and MTU 😊 Comment from : @themadone3071 |
|
I like how you compressed the video's title! Comment from : @shahinza |
|
"Sean's actually on a tripod, but it's all the walls and background that are waving around in this place" - it all makes sense now, the gravitational waves are getting out of hand Comment from : @NuclearCraftMod |
|
Need a video on "Middle Out" compression Comment from : @KillaBitz |
|
There is no such thing as 'lossy compression' - compression is always lossless brbrWhat you are thinking of is conversion Comment from : @TerminalWorld |
|
Best 7up ad Comment from : @MainDoodler |
|
"Is it 'fewer' bits" Thank you Comment from : @mattj65816 |
|
Come on now, you can say “less” to mean “a lower number of” Not all dictionaries are prescriptivist And this is a YouTube video about compression, so who cares?brbrAlso, “less” has less letters and syllables than “fewer,” fitting the theme perfectly This man should be applauded for saying “less” and staying on-message! Comment from : @ThomasGiles |
|
3:34 🤯 Comment from : @refactorear |
|
Epic Comment from : @AlphaFoxDelta |
|
Thank you for correcting the less/fewer thing I find it very distracting when those get mixed up, and I find myself no longer concentrating My stupid brain Comment from : @grotmx |
|
what about the middle out algorithm? Comment from : @cyberturd-rz3fm |
|
I've just watched the silicon valley :3 this week Comment from : @Strawberry_Htet |
|
I haven't seen 7Up in so many years Is that a product placement? 😄 Comment from : @bmitch3020 |
|
CMPRSN? C9N! Comment from : @ericfrazer4736 |
|
casually just drops "actually you can define randomness as an uncompressible string", and moves on! Comment from : @paultapping9510 |
|
ALWAYS a GREAT day when Computerphile uploads❤ Comment from : @TheNotoriousCommenter |
|
Pole position Comment from : @marcombo01 |
|
I am a simple man I see new Computerphile vid, I click Comment from : @pavlinggeorgiev |
![]() |
Zenoah G23LH 16:1 high compression build! РѕС‚ : Aaron Pratt Download Full Episodes | The Most Watched videos of all time |
![]() |
Moogsoft AIOps 7 min Overview by Co-Founder and CEO Phil Tee | 2017 Product Overview РѕС‚ : Moogsoft Inc. Download Full Episodes | The Most Watched videos of all time |
![]() |
Moogsoft AIOps 3 Minute Overview | 2017 Product Overview РѕС‚ : Moogsoft Inc. Download Full Episodes | The Most Watched videos of all time |
![]() |
The Blockchain u0026 Bitcoin - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |
![]() |
Unrolling the Loops - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |
![]() |
Alderson Loop - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |
![]() |
Programming Loops vs Recursion - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |
![]() |
Where HTML beats C? - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |
![]() |
Physics of Computer Chips - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |
![]() |
EXTRA BITS - More on E-Reader Text Layouts - Computerphile РѕС‚ : Computerphile Download Full Episodes | The Most Watched videos of all time |