Context-adaptive binary arithmetic coding - Revision history

80.221.244.224: /* History */ typo. Middle name is Johannes

2024-12-21T00:03:17Z

History: typo. Middle name is Johannes

← Previous revision		Revision as of 00:03, 21 December 2024
Line 115:		Line 115:

	==History==		==History==
	In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma ~~Johannen~~ Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>		In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannes Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>

	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref> The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication, 2, 145, 1990.</ref><ref>''Encoding of motion video sequences for the MPEG environment using arithmetic coding'', E. Viscito and C. Gonzales, SPIE Visual Communications and Image Processing '90, October 2–4, 1990.</ref> This proposal extended the use of arithmetic coding from intraframe JPEG to interframe video coding.		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref> The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication, 2, 145, 1990.</ref><ref>''Encoding of motion video sequences for the MPEG environment using arithmetic coding'', E. Viscito and C. Gonzales, SPIE Visual Communications and Image Processing '90, October 2–4, 1990.</ref> This proposal extended the use of arithmetic coding from intraframe JPEG to interframe video coding.

IznoRepeat: /* References */ add WP:TEMPLATECAT to remove from template; genfixes

2024-12-05T23:53:10Z

References: add WP:TEMPLATECAT to remove from template; genfixes

← Previous revision		Revision as of 23:53, 5 December 2024
Line 140:		Line 140:
	[[Category:MPEG]]		[[Category:MPEG]]
	[[Category:Video compression]]		[[Category:Video compression]]
			[[Category:Data compression]]

76.71.3.150: /* Example */ MOS:CQ

2024-11-17T15:32:34Z

Example: MOS:CQ

← Previous revision		Revision as of 15:32, 17 November 2024
Line 99:		Line 99:

	{{clear}}		{{clear}}
	3. Encode each bin. The selected context model supplies two probability estimates: the probability that the bin contains ~~“1”~~ and the probability that the bin contains ~~“0”~~. These estimates determine the two sub-ranges that the arithmetic coder uses to encode the bin.		3. Encode each bin. The selected context model supplies two probability estimates: the probability that the bin contains "1" and the probability that the bin contains "0". These estimates determine the two sub-ranges that the arithmetic coder uses to encode the bin.

	4. Update the context models. For example, if context model 2 was selected for bin 1 and the value of bin 1 was ~~“0”~~, the frequency count of ~~“0”s~~ is incremented. This means that the next time this model is selected, the probability of a ~~“0”~~ will be slightly higher. When the total number of occurrences of a model exceeds a threshold value, the frequency counts for ~~“0”~~ and ~~“1”~~ will be scaled down, which in effect gives higher priority to recent observations.		4. Update the context models. For example, if context model 2 was selected for bin 1 and the value of bin 1 was "0", the frequency count of "0"s is incremented. This means that the next time this model is selected, the probability of a "0" will be slightly higher. When the total number of occurrences of a model exceeds a threshold value, the frequency counts for "0" and "1" will be scaled down, which in effect gives higher priority to recent observations.

	==The arithmetic decoding engine==		==The arithmetic decoding engine==

Artoria2e5: /* Example */ move stuff

2024-01-11T12:38:26Z

Example: move stuff

← Previous revision		Revision as of 12:38, 11 January 2024
Line 23:		Line 23:

	==Example==		==Example==

⚫	1. Binarize the value MVDx, the motion vector difference in the {{var\|x}} direction.
	{\| class="wikitable floatright"		{\| class="wikitable floatright"
	! MVD<sub>x</sub>		! MVD<sub>x</sub>
Line 56:		Line 54:
	\| 111111110		\| 111111110
	\|}		\|}

		⚫	1. Binarize the value MVDx, the motion vector difference in the {{var\|x}} direction.

	The first bit of the binarized codeword is bin 1; the second bit is bin 2; and so on.		The first bit of the binarized codeword is bin 1; the second bit is bin 2; and so on.

	{{clear}}		{{clear}}
⚫	2. Choose a context model for each bin. One of 3 models is selected for bin 1, based on previous coded MVD values. The L1 norm of two previously-coded values, e<sub>k</sub>, is calculated:

	{\| class="wikitable floatright"		{\| class="wikitable floatright"
	! e<sub>k</sub>		! e<sub>k</sub>
Line 76:		Line 74:
	\|}		\|}

		⚫	2. Choose a context model for each bin. One of 3 models is selected for bin 1, based on previous coded MVD values. The L1 norm of two previously-coded values, e<sub>k</sub>, is calculated:
⚫	{{clear}}
⚫	If e<sub>k</sub> is small, then there is a high probability that the current MVD will have a small magnitude; conversely, if e<sub>k</sub> is large then it is more likely that the current MVD will have a large magnitude. We select a probability table (context model) accordingly. The remaining bins are coded using one of 4 further context models:

		⚫	{{clear}}
	{\| class="wikitable floatright"		{\| class="wikitable floatright"
	! Bin		! Bin
Line 98:		Line 96:
	\| 6		\| 6
	\|}		\|}
		⚫	If e<sub>k</sub> is small, then there is a high probability that the current MVD will have a small magnitude; conversely, if e<sub>k</sub> is large then it is more likely that the current MVD will have a large magnitude. We select a probability table (context model) accordingly. The remaining bins are coded using one of 4 further context models:

	{{clear}}		{{clear}}
	3. Encode each bin. The selected context model supplies two probability estimates: the probability that the bin contains “1” and the probability that the bin contains “0”. These estimates determine the two sub-ranges that the arithmetic coder uses to encode the bin.		3. Encode each bin. The selected context model supplies two probability estimates: the probability that the bin contains “1” and the probability that the bin contains “0”. These estimates determine the two sub-ranges that the arithmetic coder uses to encode the bin.

Artoria2e5: /* Example */ {{clear}}

2024-01-11T12:37:27Z

Example: {{clear}}

← Previous revision		Revision as of 12:37, 11 January 2024
Line 25:		Line 25:

	1. Binarize the value MVDx, the motion vector difference in the {{var\|x}} direction.		1. Binarize the value MVDx, the motion vector difference in the {{var\|x}} direction.

	{\| class="wikitable floatright"		{\| class="wikitable floatright"
	! MVD<sub>x</sub>		! MVD<sub>x</sub>
Line 60:		Line 59:
	The first bit of the binarized codeword is bin 1; the second bit is bin 2; and so on.		The first bit of the binarized codeword is bin 1; the second bit is bin 2; and so on.

			{{clear}}
	2. Choose a context model for each bin. One of 3 models is selected for bin 1, based on previous coded MVD values. The L1 norm of two previously-coded values, e<sub>k</sub>, is calculated:		2. Choose a context model for each bin. One of 3 models is selected for bin 1, based on previous coded MVD values. The L1 norm of two previously-coded values, e<sub>k</sub>, is calculated:

Line 76:		Line 76:
	\|}		\|}

			{{clear}}
	If e<sub>k</sub> is small, then there is a high probability that the current MVD will have a small magnitude; conversely, if e<sub>k</sub> is large then it is more likely that the current MVD will have a large magnitude. We select a probability table (context model) accordingly. The remaining bins are coded using one of 4 further context models:		If e<sub>k</sub> is small, then there is a high probability that the current MVD will have a small magnitude; conversely, if e<sub>k</sub> is large then it is more likely that the current MVD will have a large magnitude. We select a probability table (context model) accordingly. The remaining bins are coded using one of 4 further context models:

Line 97:		Line 98:
	\| 6		\| 6
	\|}		\|}
			{{clear}}

	3. Encode each bin. The selected context model supplies two probability estimates: the probability that the bin contains “1” and the probability that the bin contains “0”. These estimates determine the two sub-ranges that the arithmetic coder uses to encode the bin.		3. Encode each bin. The selected context model supplies two probability estimates: the probability that the bin contains “1” and the probability that the bin contains “0”. These estimates determine the two sub-ranges that the arithmetic coder uses to encode the bin.

BD2412: Clean up spacing errors around ref tags., replaced: /ref>T → /ref> T (2)

2023-09-09T00:56:24Z

Clean up spacing errors around ref tags., replaced: /ref>T → /ref> T (2)

← Previous revision		Revision as of 00:56, 9 September 2023
Line 1:		Line 1:
			{{Short description\|Entropy coding method}}
	~~{{Short description\|Entropy coding method}}~~'''Context-adaptive binary arithmetic coding''' ('''CABAC''') is a form of [[entropy encoding]] used in the [[H.264/MPEG-4 AVC]]<ref name="H.264_overview" /><ref name="H.264_book" /> and [[High Efficiency Video Coding]] (HEVC) standards. It is a [[lossless compression]] technique, although the video coding standards in which it is used are typically for [[lossy compression]] applications. CABAC is notable for providing much better [[data compression\|compression]] than most other entropy encoding algorithms used in video encoding, and it is one of the key elements that provides the H.264/AVC encoding scheme with better compression capability than its predecessors.<ref name="LiDrew2014">{{cite book\|author1=Ze-Nian Li\|author2=Mark S. Drew\|author3=Jiangchuan Liu\|title=Fundamentals of Multimedia\|url=https://books.google.com/books?id=R6vBBAAAQBAJ\|date=9 April 2014\|publisher=Springer Science & Business Media\|isbn=978-3-319-05290-8}}</ref>		'''Context-adaptive binary arithmetic coding''' ('''CABAC''') is a form of [[entropy encoding]] used in the [[H.264/MPEG-4 AVC]]<ref name="H.264_overview" /><ref name="H.264_book" /> and [[High Efficiency Video Coding]] (HEVC) standards. It is a [[lossless compression]] technique, although the video coding standards in which it is used are typically for [[lossy compression]] applications. CABAC is notable for providing much better [[data compression\|compression]] than most other entropy encoding algorithms used in video encoding, and it is one of the key elements that provides the H.264/AVC encoding scheme with better compression capability than its predecessors.<ref name="LiDrew2014">{{cite book\|author1=Ze-Nian Li\|author2=Mark S. Drew\|author3=Jiangchuan Liu\|title=Fundamentals of Multimedia\|url=https://books.google.com/books?id=R6vBBAAAQBAJ\|date=9 April 2014\|publisher=Springer Science & Business Media\|isbn=978-3-319-05290-8}}</ref>

	In [[H.264/MPEG-4 AVC]], CABAC is only supported in the Main and higher [[H.264/MPEG-~~4_AVC~~#Profiles\|profiles]] (but not the extended profile) of the standard, as it requires a larger amount of processing to decode than the simpler scheme known as [[context-adaptive variable-length coding]] (CAVLC) that is used in the standard's Baseline profile. CABAC is also difficult to parallelize and vectorize, so other forms of parallelism (such as spatial region parallelism) may be coupled with its use. In HEVC, CABAC is used in all profiles of the standard.		In [[H.264/MPEG-4 AVC]], CABAC is only supported in the Main and higher [[H.264/MPEG-4 AVC#Profiles\|profiles]] (but not the extended profile) of the standard, as it requires a larger amount of processing to decode than the simpler scheme known as [[context-adaptive variable-length coding]] (CAVLC) that is used in the standard's Baseline profile. CABAC is also difficult to parallelize and vectorize, so other forms of parallelism (such as spatial region parallelism) may be coupled with its use. In HEVC, CABAC is used in all profiles of the standard.

	==Algorithm==		==Algorithm==
Line 115:		Line 116:
	In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>		In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>

	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication, 2, 145, 1990.</ref><ref>''Encoding of motion video sequences for the MPEG environment using arithmetic coding'', E. Viscito and C. Gonzales, SPIE Visual Communications and Image Processing '90, October ~~2-4~~, 1990.</ref>This proposal extended the use of arithmetic coding from intraframe JPEG to interframe video coding.		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref> The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication, 2, 145, 1990.</ref><ref>''Encoding of motion video sequences for the MPEG environment using arithmetic coding'', E. Viscito and C. Gonzales, SPIE Visual Communications and Image Processing '90, October 2–4, 1990.</ref> This proposal extended the use of arithmetic coding from intraframe JPEG to interframe video coding.

	In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>		In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>
Line 133:		Line 134:
	}}		}}
	{{Compression methods}}		{{Compression methods}}

	[[Category:Audiovisual introductions in 2003]]		[[Category:Audiovisual introductions in 2003]]
	[[Category:Entropy coding]]		[[Category:Entropy coding]]

109.144.217.218: /* References */ Category change

2023-08-17T16:08:16Z

References: Category change

← Previous revision		Revision as of 16:08, 17 August 2023
Line 134:		Line 134:
	{{Compression methods}}		{{Compression methods}}
	[[Category:Audiovisual introductions in 2003]]		[[Category:Audiovisual introductions in 2003]]
	[[Category:~~Lossless~~ ~~compression algorithms~~]]		[[Category:Entropy coding]]
	[[Category:MPEG]]		[[Category:MPEG]]
	[[Category:Video compression]]		[[Category:Video compression]]

Butron: Added another reference to historical use of ABAC in video compression

2023-07-24T17:53:48Z

Added another reference to historical use of ABAC in video compression

← Previous revision		Revision as of 17:53, 24 July 2023
Line 115:		Line 115:
	In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>		In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>

	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication 2, 1990.</ref>		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication, 2, 145, 1990.</ref><ref>''Encoding of motion video sequences for the MPEG environment using arithmetic coding'', E. Viscito and C. Gonzales, SPIE Visual Communications and Image Processing '90, October 2-4, 1990.</ref>This proposal extended the use of arithmetic coding from intraframe JPEG to interframe video coding.

	In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>		In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>

Butron: Added a reference to the first use of adaptive arithmetic coding in motion video compression

2023-07-24T17:35:15Z

Added a reference to the first use of adaptive arithmetic coding in motion video compression

← Previous revision		Revision as of 17:35, 24 July 2023
Line 115:		Line 115:
	In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>		In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>

	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication 2, 1990.</ref>

	In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>		In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>

Citation bot: Alter: title, template type. Add: chapter. Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine 33/8263

2023-07-24T14:07:52Z

Alter: title, template type. Add: chapter. Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine 33/8263

← Previous revision		Revision as of 14:07, 24 July 2023
Line 117:		Line 117:
	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>

	In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite ~~journal~~ \|last1=Ortega \|first1=A. \|title~~=Embedded image-domain compression using context models \|journal~~=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>		In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>

	==See also==		==See also==

← Previous revision		Revision as of 17:53, 24 July 2023
Line 115:		Line 115:
	In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>		In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>

	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication 2, 1990.</ref>		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication, 2, 145, 1990.</ref><ref>''Encoding of motion video sequences for the MPEG environment using arithmetic coding'', E. Viscito and C. Gonzales, SPIE Visual Communications and Image Processing '90, October 2-4, 1990.</ref>This proposal extended the use of arithmetic coding from intraframe JPEG to interframe video coding.

	In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>		In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>

← Previous revision		Revision as of 17:35, 24 July 2023
Line 115:		Line 115:
	In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>		In 1986, [[IBM]] researchers Kottappuram M. A. Mohiuddin and Jorma Johannen Rissanen filed a [[patent]] for a multiplication-free binary arithmetic coding algorithm.<ref name="t81">{{cite web \|title=T.81 – DIGITAL COMPRESSION AND CODING OF CONTINUOUS-TONE STILL IMAGES – REQUIREMENTS AND GUIDELINES \|url=https://www.w3.org/Graphics/JPEG/itu-t81.pdf \|publisher=[[CCITT]] \|date=September 1992 \|accessdate=12 July 2019}}</ref><ref>{{US patent\|4652856}}</ref> In 1988, an IBM research team including R.B. Arps, T.K. Truong, D.J. Lu, W. B. Pennebaker, L. Mitchell and G. G. Langdon presented an adaptive binary arithmetic coding (ABAC) algorithm called Q-Coder.<ref>{{cite journal \|last1=Arps \|first1=R. B. \|last2=Truong \|first2=T. K. \|last3=Lu \|first3=D. J. \|last4=Pasco \|first4=R. C. \|last5=Friedman \|first5=T. D. \|title=A multi-purpose VLSI chip for adaptive data compression of bilevel images \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=775–795 \|doi=10.1147/rd.326.0775 \|issn=0018-8646}}</ref><ref>{{cite journal \|last1=Pennebaker \|first1=W. B. \|last2=Mitchell \|first2=J. L. \|last3=Langdon \|first3=G. G. \|last4=Arps \|first4=R. B. \|title=An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder \|journal=IBM Journal of Research and Development \|date=November 1988 \|volume=32 \|issue=6 \|pages=717–726 \|doi=10.1147/rd.326.0717 \|issn=0018-8646}}</ref>

	The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>		The above patents and research papers, along several others from IBM and [[Mitsubishi Electric]], were later cited by the [[CCITT]] and [[Joint Photographic Experts Group]] as the basis for the [[JPEG]] [[image compression]] format's adaptive binary arithmetic coding algorithm in 1992.<ref name="t81"/> However, encoders and decoders of the JPEG file format, which has options for both [[Huffman encoding]] and arithmetic coding, typically only support the Huffman encoding option, which was originally because of patent concerns, although JPEG's arithmetic coding patents<ref>{{cite web \|url=http://www.itu.int/rec/T-REC-T.81-200401-I!Cor1/dologin.asp?lang=e&id=T-REC-T.81-200401-I!Cor1!PDF-E&type=items \|title=Recommendation T.81 (1992) Corrigendum 1 (01/04) \|author= \|date=9 November 2004 \|work=Recommendation T.81 (1992) \|publisher=International Telecommunication Union \|accessdate=3 February 2011}}</ref> have since expired due to the age of the JPEG standard.<ref>''JPEG Still Image Data Compression Standard'', W. B. Pennebaker and [[Joan L. Mitchell\|J. L. Mitchell]], Kluwer Academic Press, 1992. {{ISBN\|0-442-01272-1}}</ref>The first reported use of adaptive binary arithmetic coding in motion video compression was in a proposal by IBM researchers to the MPEG group in 1989.<ref>''DCT Coding for Motion Video Storage using Adaptive Arithmetic Coding'', C. A. Gonzales. L. Allman, T. McCarthy, P. Wendt and A. N. Akansu, Signal Processing: Image Communication 2, 1990.</ref>

	In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>		In 1999, Youngjun Yoo ([[Texas Instruments]]), Young Gap Kwon and Antonio Ortega ([[University of Southern California]]) presented a context-adaptive form of binary arithmetic coding.<ref>{{cite book \|last1=Ortega \|first1=A. \|title=Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) \|chapter=Embedded image-domain compression using context models \|date=October 1999 \|volume=1 \|pages=477–481 vol.1 \|doi=10.1109/ICIP.1999.821655\|isbn=0-7803-5467-2 \|s2cid=27303716 }}</ref> The modern context-adaptive binary arithmetic coding (CABAC) algorithm was commercially introduced with the [[H.264/MPEG-4 AVC]] format in 2003.<ref>{{cite web \|title=Context-Based Adaptive Binary Arithmetic Coding (CABAC) \|url=https://www.hhi.fraunhofer.de/en/departments/vca/research-groups/image-video-coding/research-topics/context-based-adaptive-binary-arithmetic-coding-cabac.html \|website=Fraunhofer Heinrich Hertz Institute \|accessdate=13 July 2019 \|language=en}}</ref> The majority of patents for the AVC format are held by [[Panasonic]], [[Godo kaisha\|Godo Kaisha IP Bridge]] and [[LG Electronics]].<ref name="patents">{{cite web \|title=AVC/H.264 {{ndash}} Patent List \|url=https://www.mpegla.com/wp-content/uploads/avc-att1.pdf \|website=MPEG LA \|accessdate=6 July 2019}}</ref>