Assignee
SZE VIVIENNE
CA·10 granted patents·1 pending application·28 citations·filing 2009–2012
Top patents by PatentIndex Score
11 records- 0191US9154801B2Method and apparatus for diagonal scan and simplified coding of transform coefficientsSZE VIVIENNE·Filed 2011·Granted Oct 6, 2015·9 cites·13 claims
- 0284US8604951B2System and method for optimizing context-adaptive binary arithmetic codingSZE VIVIENNE·Filed 2011·Granted Dec 10, 2013·9 cites·17 claims
- 0381US10230989B2Method and apparatus for video encoding and/or decoding to prevent start code confusionSZE VIVIENNE·Filed 2012·Granted Mar 12, 2019·3 cites·21 claims
- 0478US9344743B2Flexible region based sample adaptive offset (SAO) and adaptive loop filter (ALF)SZE VIVIENNE·Filed 2012·Granted May 17, 2016·2 cites·8 claims
- 0577US10123053B2Acceleration of bypass binary symbol processing in video codingSZE VIVIENNE·Filed 2012·Granted Nov 6, 2018·2 cites·19 claims
- 0676US8294603B2System and method for providing high throughput entropy coding using syntax element partitioningSZE VIVIENNE·Filed 2010·Granted Oct 23, 2012·3 cites·14 claims
- 0762US10070152B2Sample adaptive offset (SAO) parameter signalingSZE VIVIENNE·Filed 2012·Granted Sep 4, 2018·0 cites·50 claims
- 0861US8068043B2Method and apparatus for video processing in context-adaptive binary arithmetic codingSZE VIVIENNE·Filed 2009·Granted Nov 29, 2011·0 cites·12 claims
- 0957US10142637B2Method and apparatus for parallelizing context selection in video processingSZE VIVIENNE·Filed 2012·Granted Nov 27, 2018·0 cites·17 claims
- 1056US10349070B2Simplified binary arithmetic coding engineSZE VIVIENNE·Filed 2011·Granted Jul 9, 2019·0 cites·19 claims
- 1156US2013003858A1Simplified Context Selection For Entropy Coding of Transform Coefficient Syntax ElementsSZE VIVIENNE·Filed 2012·Application pending·0 cites
Join the waitlist — get patent alerts
Get an alert when SZE VIVIENNE files or is granted a new patent.
We store only your email — no account needed. See our privacy policy.
Counts cover granted patents and pending applications in the PatentIndex corpus. How scoring works →