|
Abraham Lempel
Abraham Lempel ( he, אברהם למפל, born 10 February 1936) is an Israeli computer scientist and one of the fathers of the LZ family of lossless data compression algorithms. Biography Lempel was born on 10 February 1936 in Lwów, Poland (now Lviv, Ukraine). He studied at Technion - Israel Institute of Technology, and received a B.Sc. in 1963, M.Sc. in 1965, and D.Sc. in 1967. Since 1977 he has held the title of full professor. Lempel is now a professor emeritus in Technion. His historically important works start with the presentation of the LZ77 algorithm in a paper entitled "A Universal Algorithm for Sequential Data Compression" in the ''IEEE Transactions on Information Theory'' (May 1977), co-authored by Jacob Ziv. He is the recipient of the 1998 Golden Jubilee Award for Technological Innovation from the IEEE Information Theory Society; and the 2007 IEEE Richard W. Hamming Medal, for "pioneering work in data compression, especially the Lempel-Ziv algorithm". Lempel fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lviv
Lviv ( uk, Львів) is the largest city in western Ukraine, and the seventh-largest in Ukraine, with a population of . It serves as the administrative centre of Lviv Oblast and Lviv Raion, and is one of the main cultural centres of Ukraine. It was named in honour of Leo, the eldest son of Daniel, King of Ruthenia. Lviv emerged as the centre of the historical regions of Red Ruthenia and Galicia in the 14th century, superseding Halych, Chełm, Belz and Przemyśl. It was the capital of the Kingdom of Galicia–Volhynia from 1272 to 1349, when it was conquered by King Casimir III the Great of Poland. From 1434, it was the regional capital of the Ruthenian Voivodeship in the Kingdom of Poland. In 1772, after the First Partition of Poland, the city became the capital of the Habsburg Kingdom of Galicia and Lodomeria. In 1918, for a short time, it was the capital of the West Ukrainian People's Republic. Between the wars, the city was the centre of the Lwów Voivodeship in th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacob Ziv
Jacob Ziv ( he, יעקב זיו; born 1931) is an Israeli electrical engineer who, along with Abraham Lempel, developed the LZ family of lossless data compression algorithms. Biography Ziv was born in Tiberias, British mandate Palestine, on 27 November 1931. He received the B.Sc., Dip. Eng., and M.Sc. degrees, all in electrical engineering, from the Technion – Israel Institute of Technology in 1954, and 1957, respectively, and the D.Sc. degree from the Massachusetts Institute of Technology in 1962. Ziv joined the Technion – Israel Institute of Technology in 1970 and is Herman Gross Professor of Electrical Engineering and a Technion Distinguished Professor. His research interests include data compression, information theory, and statistical communication theory. Ziv was Dean of the Faculty of Electrical Engineering from 1974 to 1976 and Vice President for Academic Affairs from 1978 to 1982. Since 1987 Ziv has spent three sabbatical leaves at the Information Research De ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Data Compression
In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original representation. Any particular compression is either lossy or lossless. Lossless compression reduces bits by identifying and eliminating statistical redundancy. No information is lost in lossless compression. Lossy compression reduces bits by removing unnecessary or less important information. Typically, a device that performs data compression is referred to as an encoder, and one that performs the reversal of the process (decompression) as a decoder. The process of reducing the size of a data file is often referred to as data compression. In the context of data transmission, it is called source coding; encoding done at the source of the data before it is stored or transmitted. Source coding should not be confused with channel coding, for error detection and correction or line coding, the means for mapping data onto a signal. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Timeline Of Algorithms
The following timeline of algorithms outlines the development of algorithms (mainly "mathematical recipes") since their inception. Medieval Period * Before – writing about "recipes" (on cooking, rituals, agriculture and other themes) * c. 1700–2000 BC – Egyptians develop earliest known algorithms for multiplying two numbers * c. 1600 BC – Babylonians develop earliest known algorithms for factorization and finding square roots * c. 300 BC – Euclid's algorithm * c. 200 BC – the Sieve of Eratosthenes * 263 AD – Gaussian elimination described by Liu Hui * 628 – Chakravala method described by Brahmagupta * c. 820 – Al-Khawarizmi described algorithms for solving linear equations and quadratic equations in his ''Algebra''; the word ''algorithm'' comes from his name * 825 – Al-Khawarizmi described the algorism, algorithms for using the Hindu–Arabic numeral system, in his treatise ''On the Calculation with Hindu Numerals'', which was translated into Latin as ''Algorit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Portable Network Graphics
Portable Network Graphics (PNG, officially pronounced , colloquially pronounced ) is a raster-graphics file format that supports lossless data compression. PNG was developed as an improved, non-patented replacement for Graphics Interchange Format (GIF) — unofficially, the initials PNG stood for the recursive acronym "PNG's not GIF". PNG supports palette-based images (with palettes of 24-bit RGB or 32-bit RGBA colors), grayscale images (with or without an alpha channel for transparency), and full-color non-palette-based RGB or RGBA images. The PNG working group designed the format for transferring images on the Internet, not for professional-quality print graphics; therefore non-RGB color spaces such as CMYK are not supported. A PNG file contains a single image in an extensible structure of ''chunks'', encoding the basic pixels and other information such as textual comments and integrity checks documented in RFC 2083. PNG files use the file extension PNG or png and hav ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
XZ Utils
XZ Utils (previously LZMA Utils) is a set of free software command-line lossless data compressors, including the programs lzma and xz, for Unix-like operating systems and, from version 5.0 onwards, Microsoft Windows. For compression/decompression the Lempel–Ziv–Markov chain algorithm (LZMA) is used. XZ Utils started as a Unix port of Igor Pavlov's LZMA- SDK that has been adapted to fit seamlessly into Unix environments and their usual structure and behavior. Features In most cases, xz achieves higher compression rates than alternatives like gzip and bzip2. Decompression speed is higher than bzip2, but lower than gzip. Compression can be much slower than gzip, and is slower than bzip2 for high levels of compression, and is most useful when a compressed file will be used many times. XZ Utils consists of two major components: * , the command-line compressor and decompressor (analogous to gzip) * liblzma, a software library with an API similar to zlib Various command short ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
7-Zip
7-Zip is a free and open-source file archiver, a utility used to place groups of files within compressed containers known as "archives". It is developed by Igor Pavlov and was first released in 1999. 7-Zip has its own archive format called 7z, but can read and write several others. The program can be used from a Windows graphical user interface that also features shell integration, from a Windows command-line interface as the command 7za.exe, and from POSIX systems as p7zip. Most of the 7-Zip source code is under the LGPL-2.1-or-later license; the unRAR code, however, is under the LGPL-2.1-or-later license with an "unRAR restriction", which states that developers are not permitted to use the code to reverse-engineer the RAR compression algorithm. Since version 21.01 alpha, preliminary Linux support has been added to the upstream instead of the p7zip project. Archive formats 7z By default, 7-Zip creates 7z-format archives with a .7z file extension. Each archive can con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graphics Interchange Format
The Graphics Interchange Format (GIF; or , see pronunciation) is a bitmap image format that was developed by a team at the online services provider CompuServe led by American computer scientist Steve Wilhite and released on 15 June 1987. It is in widespread usage on the World Wide Web due to its wide support and portability between applications and operating systems. The format supports up to 8 bits per pixel for each image, allowing a single image to reference its own palette of up to 256 different colors chosen from the 24-bit RGB color space. It also supports animations and allows a separate palette of up to 256 colors for each frame. These palette limitations make GIF less suitable for reproducing color photographs and other images with color gradients, but well-suited for simpler images such as graphics or logos with solid areas of color. GIF images are compressed using the Lempel–Ziv–Welch (LZW) lossless data compression technique to reduce the file size wi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lempel–Ziv–Welch
Lempel–Ziv–Welch (LZW) is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improved implementation of the LZ78 algorithm published by Lempel and Ziv in 1978. The algorithm is simple to implement and has the potential for very high throughput in hardware implementations. It is the algorithm of the widely used Unix file compression utility compress and is used in the GIF image format. Algorithm The scenario described by Welch's 1984 paper encodes sequences of 8-bit data as fixed-length 12-bit codes. The codes from 0 to 255 represent 1-character sequences consisting of the corresponding 8-bit character, and the codes 256 through 4095 are created in a dictionary for sequences encountered in the data as it is encoded. At each stage in compression, input bytes are gathered into a sequence until the next character would make a sequence with no code yet in the dictionary. The co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
