@article{Guido1997d,
abstract = {In this paper we propose an algorithm for the optimal bit allocation among dependent quantizers for the minimum-maximum (MINMAX) distortion criterion. We compare this algorithm to the well-known Lagrange multiplier method for the minimum-average (MINAVE) distortion criterion. We point out the differences between these two distortion criteria, and their implications for coding applications. We argue that even though the MINAVE criterion is more popular, in many cases, the MINMAX criterion is more appropriate. We introduce the algorithms for solving the optimal bit allocation problem among dependent quantizers for both criteria and highlight the similarities and differences. We present the two algorithms using the same frame-work, which sheds new light on the relationship between the MINAVE and the MINMAX criteria. We point out that any problem which can be solved with the MINAVE criterion can also be solved with the MINMAX criterion, since both approaches are based on the same assumptions. {\textcopyright} 1997 Elsevier Science Ltd. All rights reserved.},
author = {Schuster, Guido M. and Katsaggelos, Aggelos K.},
doi = {10.1016/S0083-6656(97)00048-2},
issn = {00836656},
journal = {Vistas in Astronomy},
month = {jan},
number = {3},
pages = {427--437},
title = {{The minimum-average and minimum-maximum criteria in lossy compression}},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0083665697000482},
volume = {41},
year = {1997}
}

{"_id":"ksRJxBFRxoHkAbKML","bibbaseid":"schuster-katsaggelos-theminimumaverageandminimummaximumcriteriainlossycompression-1997","author_short":["Schuster, G. M.","Katsaggelos, A. K."],"bibdata":{"bibtype":"article","type":"article","abstract":"In this paper we propose an algorithm for the optimal bit allocation among dependent quantizers for the minimum-maximum (MINMAX) distortion criterion. We compare this algorithm to the well-known Lagrange multiplier method for the minimum-average (MINAVE) distortion criterion. We point out the differences between these two distortion criteria, and their implications for coding applications. We argue that even though the MINAVE criterion is more popular, in many cases, the MINMAX criterion is more appropriate. We introduce the algorithms for solving the optimal bit allocation problem among dependent quantizers for both criteria and highlight the similarities and differences. We present the two algorithms using the same frame-work, which sheds new light on the relationship between the MINAVE and the MINMAX criteria. We point out that any problem which can be solved with the MINAVE criterion can also be solved with the MINMAX criterion, since both approaches are based on the same assumptions. © 1997 Elsevier Science Ltd. All rights reserved.","author":[{"propositions":[],"lastnames":["Schuster"],"firstnames":["Guido","M."],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K."],"suffixes":[]}],"doi":"10.1016/S0083-6656(97)00048-2","issn":"00836656","journal":"Vistas in Astronomy","month":"jan","number":"3","pages":"427–437","title":"The minimum-average and minimum-maximum criteria in lossy compression","url":"https://linkinghub.elsevier.com/retrieve/pii/S0083665697000482","volume":"41","year":"1997","bibtex":"@article{Guido1997d,\nabstract = {In this paper we propose an algorithm for the optimal bit allocation among dependent quantizers for the minimum-maximum (MINMAX) distortion criterion. We compare this algorithm to the well-known Lagrange multiplier method for the minimum-average (MINAVE) distortion criterion. We point out the differences between these two distortion criteria, and their implications for coding applications. We argue that even though the MINAVE criterion is more popular, in many cases, the MINMAX criterion is more appropriate. We introduce the algorithms for solving the optimal bit allocation problem among dependent quantizers for both criteria and highlight the similarities and differences. We present the two algorithms using the same frame-work, which sheds new light on the relationship between the MINAVE and the MINMAX criteria. We point out that any problem which can be solved with the MINAVE criterion can also be solved with the MINMAX criterion, since both approaches are based on the same assumptions. {\\textcopyright} 1997 Elsevier Science Ltd. All rights reserved.},\nauthor = {Schuster, Guido M. and Katsaggelos, Aggelos K.},\ndoi = {10.1016/S0083-6656(97)00048-2},\nissn = {00836656},\njournal = {Vistas in Astronomy},\nmonth = {jan},\nnumber = {3},\npages = {427--437},\ntitle = {{The minimum-average and minimum-maximum criteria in lossy compression}},\nurl = {https://linkinghub.elsevier.com/retrieve/pii/S0083665697000482},\nvolume = {41},\nyear = {1997}\n}\n","author_short":["Schuster, G. M.","Katsaggelos, A. K."],"key":"Guido1997d","id":"Guido1997d","bibbaseid":"schuster-katsaggelos-theminimumaverageandminimummaximumcriteriainlossycompression-1997","role":"author","urls":{"Paper":"https://linkinghub.elsevier.com/retrieve/pii/S0083665697000482"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":[],"search_terms":["minimum","average","minimum","maximum","criteria","lossy","compression","schuster","katsaggelos"],"title":"The minimum-average and minimum-maximum criteria in lossy compression","year":1997}