As far as I can tell, these patents only go up to claim 10 in the first place:
U not cleared to see it
So only the combination may be new. But this reminds me of a USPTO thing from my past.
The landmark ruling you are referring to is the U.S. Supreme Court case KSR International Co. v. Teleflex Inc. (2007), which led directly to the USPTO publishing its highly influential 2010 Examination Guidelines for Determining Obviousness. Under this framework, if element A is known and element B is known, combining them is not patentable if the combination yields nothing more than predictable results.
https://www.uspto.gov/web/offices/pac/mpep/s2143.html
So, general-purpose data network, such as USB or Ethernet was known (A), claims Haar-transform decoding was known (B) [DE69909880T2 / EP0955609]. Even if we don't find this combination in prior art, it is dubious that this is patent worthy based on USPTO guidelines (combine A with B).
But I see a lot of stuff that suggests prior art:
1. Noriaki Yamazaki and Tetsuo Tanaka (2007). “ZYWRLE: Enhanced VNC Codec for Motion Picture.” IEICE Transactions, J90-D(7), pp. 1790–1798. Brief summary: Adds wavelet compression to VNC’s ZRLE codec for transmitting moving images, reducing network traffic to 20–50% of standard ZRLE. https://search.ieice.org/bin/summary.php?abst=j&category=D&i...
2. Joshua G. Senecal, Peter Lindstrom, Mark A. Duchaineau and Kenneth I. Joy (2004). “An Improved N-Bit to N-Bit Reversible Haar-Like Transform.” Proceedings of Pacific Graphics 2004, pp. 371–380. DOI: 10.1109/PCCGA.2004.1348368. Brief summary: Introduces PLHaar, a reversible Haar-like transform supporting lossy and lossless image compression without increasing coefficient bit width, suitable for bandwidth-limited video and graphics hardware. https://www.osti.gov/servlets/purl/15014239
3. Joshua G. Senecal, Mark A. Duchaineau and Kenneth I. Joy (2004). “Reversible n-Bit to n-Bit Integer Haar-Like Transforms.” Proceedings of the Data Compression Conference 2004, p. 564. Brief summary: Introduces lookup-table Haar-like transforms that preserve bit width and reversibility, with applications to fast image compression and streaming hardware such as DVI channels. https://www.osti.gov/servlets/purl/15013668
Good luck synaptic!
Also possibly related:
Method and apparatus for increasing memory resource utilization in an information stream decoder, https://patents.google.com/patent/WO1999057908A1/en
And a paper by a PHD student in 2005, Real-time Rendering with Wavelet-Compressed Multi-Dimensional Datasets on the GPU, https://cs.ucsb.edu/sites/default/files/documents/2005-05.pd...
Displaylink's own abandoned patent application talking about sending patches of compressed/uncompressed graphical data to the screen over USB: https://patents.google.com/patent/US20060119602A1/en
Using reference frames with Haar wavelet transforms in video compression, https://patents.google.com/patent/US6272180B1/en
It would take much human time to search for prior art across all of human knowledge for existing patents and new patents being proposed. But GPUs are tireless, and can continually grind towards success. They build their case for dismantling all existing active patents as long as they are kept fed.
If I were a frontier lab, I would be finding the most valuable patents, starting the research agents up, and then shorting companies that would see enterprise value decline if subject patents were invalidated (think Hindenburg or Culper Research activist investors). Just one way of monetizing the fancy search engine and token dispenser.
After how many dollars spent? I mean, it is good that eventually bad patents get killed, but it still costs too much to do it, one at a time. We need a more streamlined process, maybe? Maybe an academic-review-like process at filing? Send the claims anonymously to a few experts in the field, randomly selected. If they all say it is obvious, kill it immediately and fine the company for wasting the patent office's time?
I think we could get the 7 grand together here.