https://lkml.rescloud.iu.edu/hypermail/linux/kernel/2610.1/1...
According to patent prosecution records, the independent claims for GB2484736 originally lacked any network transport limitations and were deemed entirely unpatentable against the prior art listed above.
To get the patent granted, DisplayLink’s attorneys amended the claims to specifically add delivery of the display data over a "general-purpose data network." The validity challenge relies on proving that adding a general-purpose transport layer (like USB or Ethernet) to existing image-compression methodologies was an obvious step and completely unoriginal in 2010, given the widespread existence of USB monitors and network-attached graphics at the time.
As far as I can tell, these patents only go up to claim 10 in the first place:
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!
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?