Jorma Rissanen
Jorma Johannes Rissanen | |
---|---|
Born | October 20, 1932 (1932-10-20) Pielisjärvi (now Lieksa), Finland |
Died | May 9, 2020(2020-05-09) (aged 87) Los Gatos, California, United States |
Alma mater | Helsinki University of Technology |
Known for | arithmetic coding and the minimum description length principle |
Awards | IEEE Richard W. Hamming Medal (1993) Claude E. Shannon Award (2009) |
Scientific career | |
Fields | Information Theory |
Institutions | IBM Linköping University Tampere University of Technology |
Doctoral advisor | Hans Blomberg[1] |
Jorma Johannes Rissanen (October 20, 1932 – May 9, 2020)[2] was an information theorist, known for originating the minimum description length (MDL) principle and practical approaches to arithmetic coding for lossless data compression. His work inspired the development of the theory of stochastic chains with memory of variable length.[3][2]
Education and career
Rissanen was born in Pielisjärvi (now Lieksa) in Finland and grew up in Kemi, a border town between Finland and Sweden. He moved to Helsinki and studied at the Helsinki University of Technology, where he obtained his Master’s degree in electrical engineering in 1956 and licentiate in control theory in 1960. He studied there under Olli Lokki and Hans Blomberg.[2]
Rissanen became an IBM researcher since 1960, first in Stockholm, Sweden, while still a Ph.D. student under Hans Blomberg. Most of his PhD work was done remotely as a result and he received his Ph.D. from the Helsinki University of Technology in 1965 with a topic on adaptive control theory. He then moved to IBM Almaden in San Jose, California and stayed with IBM until his retirement in 2002, with a brief interruption in 1974 as a professor of control theory at Linköping University in Sweden. During that time, he became familiar with the work on algorithmic randomness by Andrey Kolmogorov and Per Martin-Löf, which inspired his work on arithmetic coding and MDL, leading to a stream of ground-breaking publications from the late 1970s to the early 1990s. The work on MDL developed into the more general notions of stochastic complexity (about which he wrote an influential book[4]) and universal coding/modeling. After retirement from IBM, he remained professor emeritus of Tampere University of Technology and a fellow of Helsinki Institute for Information Technology.
Awards and recognitions
He was awarded the IEEE Richard W. Hamming Medal in 1993,[5] an IEEE Golden Jubilee Award for Technological Innovation from the IEEE Information Theory Society in 1998,[6] the Kolmogorov Medal of the University of London in 2006,[7] and the IEEE Claude E. Shannon Award in 2009.[8] A Festschrift collection, which includes an interview and substantial biographical information, was published by the Tampere University of Technology in honor of his 75th birthday.[1]
Personal life
Rissanen married Riitta Aberg in 1956, and they have a son Juhani and a daughter Natasha.[1]
Bibliography
- Rissanen, Jorma (1989). Stochastic complexity in statistical inquiry. Singapore: World Scientific. ISBN 981-238-549-5. OCLC 52854741.
- Cybenko, George; O'Leary, Dianne P.; Rissanen, Jorma, eds. (1999). The mathematics of information coding, extraction, and distribution. New York: Springer. ISBN 0-387-98665-0. OCLC 39922074.
- Rissanen, Jorma (2007). Information and complexity in statistical modeling. New York: Springer. ISBN 978-0-387-68812-1. OCLC 232363255.
- Rissanen, Jorma (2012). Optimal estimation of parameters. Cambridge: Cambridge University Press. ISBN 978-1-139-51850-5. OCLC 796796345.
References
- ^ a b c Peter Grünwald, Petri Myllymäki, Ioan Tabus, Marcelo Weinberger, and Bin Yu (eds.), Festschrift in Honor of Jorma Rissanen on the Occasion of his 75th Birthday Archived 2016-03-03 at the Wayback Machine, Tampere University of Technology, 2008.
- ^ a b c Grünwald, Peter; Myllymäki, Petry; Roos, Teemu; Tabus, Ioan (September 2020). "In Memoriam: Jorma J. Rissanen, 1932–2020" (PDF). IEEE Information Theory Society Newsletter. Archived (PDF) from the original on October 23, 2021. Retrieved October 3, 2022.
- ^ "Jorma J. Rissanen". Los Gatos Weekly Times Obits. Retrieved 14 January 2021.
- ^ Rissanen, Jorma J. (1989). Stochastic Complexity in Statistical Inquiry. Singapore: Word Scientific.
- ^ "IEEE Richard W. Hamming Medal Recipients" (PDF). IEEE. Archived from the original (PDF) on June 20, 2010. Retrieved May 29, 2011.
- ^ "Golden Jubilee Awards for Technological Innovation". IEEE Information Theory Society. Retrieved July 14, 2011.
- ^ Kolmogorov Medal web site, University of London.
- ^ "Claude E. Shannon Award Recipients". IEEE Information Theory Society. Retrieved July 1, 2015.
External links
- Professor Jorma Rissanen page at RHUL
- Grünwald, Peter; Myllymäki, Petri; Roos, Teemu; Tabus, Ioan (September 2020). "In Memoriam: Jorma J. Rissanen (1932-2020)" (PDF). IEEE Information Theory Society Newsletter. pp. 13–14. Retrieved October 3, 2022.
- v
- t
- e
- Richard Hamming (1988)
- Irving S. Reed (1989)
- Dennis Ritchie / Ken Thompson (1990)
- Elwyn Berlekamp (1991)
- Lotfi A. Zadeh (1992)
- Jorma Rissanen (1993)
- Gottfried Ungerboeck (1994)
- Jacob Ziv (1995)
- Mark Semenovich Pinsker (1996)
- Thomas M. Cover (1997)
- David D. Clark (1998)
- David A. Huffman (1999)
- Solomon W. Golomb (2000)
- Alexander G. Fraser (2001)
- Peter Elias (2002)
- Claude Berrou / Alain Glavieux (2003)
- Jack K. Wolf (2004)
- Neil Sloane (2005)
- Vladimir Levenshtein (2006)
- Abraham Lempel (2007)
- Sergio Verdú (2008)
- Peter Franaszek (2009)
- Whitfield Diffie / Martin Hellman / Ralph Merkle (2010)
- Toby Berger (2011)
- Michael Luby / Amin Shokrollahi (2012)
- Robert Calderbank (2013)
- Thomas Richardson / Rüdiger Urbanke (2014)
- Imre Csiszár (2015)
- Abbas El Gamal (2016)
- Shlomo Shamai (2017)
- Erdal Arıkan (2018)
- David Tse (2019)
- Cynthia Dwork (2020)
![]() ![]() ![]() | This article about a Finnish scientist is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e