MultimediaWiki - User contributions [en]

Iterated Function Systems (IFS)

2019-04-30T18:22:29Z

C0D3K: info about IFS, need to edit the other IFS page

*Documentation Pulled From: http://links.uwaterloo.ca/ResearchIFSFractalCoding.html

=== Iterated Function Systems (IFS) ===
* IFS is the term originally devised by Michael Barnsley and Steven Demko [1] for a collection of contraction mappings over a complete metric space, typically compact subsets of R^n. Systems of contraction mappings had been considered previously by a number authors for various purposes. But the landmark papers of John Hutchinson [2] and, independently, Barnsley and Demko [1] showed how such systems of mappings with associated probabilities could be used to construct fractal sets and measures: the former from a geometric measure theory setting and the latter from a probabilistic setting. For those who are not familiar with IFS, we'll provide a simple discussion and example a little later in this section.

* Just as important, however, was the fact that the Barnsley/Demko paper was the first to suggest that IFS could be used to approximate natural objects. This was the seed of the inverse problem of fractal approximation: Given a "target" set, S, for example, a leaf, can we find an IFS with attractor A (see below) that approximates S to a reasonable degree.

* In a subsequent paper, Barnsley and students [3] showed how the inverse problem of fractal approximation was could be reformulated by means of the infamous "Collage Theorem": instead of trying to find an IFS whose attractor A would match the target S (a very tedious and difficult problem), one can look for an IFS that maps A as close as possible to itself. More on this later."

=== Fractal Image Coding ===
* After [3], the next natural question was: "Can we use IFS to approximate images?" The seminal paper [4] by A. Jacquin, then a Ph.D. student of Barnsley at Georgia Tech, provided the basis of block-based fractal image coding which is still used today. Jacquin's paper launched an intensive activity in fractal image compression [5-7]. Indeed, in the meantime, Barnsley left Georgia Tech to found the company Iterated Systems which was dedicated to the commercialization of fractal image compression.

* In fractal image coding, one tries again to approximate a "target" image y with the fixed point x' of a contractive fractal transform T. In general, however, this direct inverse problem is difficult because of the complex nature of the fractal transform, which maps modified subimages onto other regions. A great simplification is afforded by the Collage Theorem of Ref. [3] above. In collage coding, one looks for a transform T that minimizes the so-called collage distance d(y,Ty). Most, if not all, fractal image coding methods rely on collage coding.

* Fractal compression methods were actually quite competitive until the appearance of powerful wavelet-based methods and, subsequently, context-based coders. Nevertheless, it has always been the philosophy of the Waterloo research programme that fractal-based methods are interesting mathematically and that they may also be able to provide useful information about images. We are indeed finding that there is much "life after compression".

* Very briefly, block-based fractal image coding is a "local IFS" procedure. Given an image I, one typically seeks to approximate its subimages on n x n range subblocks R_i with contracted (i.e., decimated) and greyscale-modified subimages on 2n x 2n domain subblocks D_j. For each range block, one searches for the best domain block D_i from a domain pool. The larger the domain pool, the better opportunity for a good approximation, but at the expense of higher search times.

=== A Simple Introduction to IFS ===

* Suppose that w : X -> X is a contraction mapping of a complete metric space (X,d) to itself. Then, by the celebrated Banach Fixed Point Theorem, there is a unique point x' in X such that w(x') = x', the fixed point of w. Moreover, for any starting point x_0 in X, the sequence of points {x_n} defined by the iteration procedure x_{n+1}=w(x_n) converges to x' as n -> infinity. In other words, x' is an attractive fixed point .

* Now suppose that we have more than one contraction mapping on X, i.e. w_i : X -> X, i=1,...N. Each of these maps w_i will have its own fixed point x'_i. And, of course, if we apply only one of these maps repeatedly, say w_P, then the iteration sequence {x_n} will converge to its fixed point x'_P. But what happens if you pick the maps at random? Clearly, each map will be fighting to bring the sequence to its own fixed point!

* Assuming that you pick each map w_i with a nonzero probability p_i (sum of p_i = 1), the sequence will eventually approach a unique set, the "attractor" A of the "iterated function system" W = {w_1, ... , w_N}, performing a random walk over it (or at least getting nearer and nearer to it). The probabilities will play a role in determining how often various regions of the attractor are visited.

=== Examples on [0,1]: ===
* Example 1:
w_1(x) = x/3, w_2(x) = x/3 + 2/3
!Note that w_1(0)=0 and w_2(1)=1. Then the attractor of this IFS is the classical Cantor set on [0,1].

* Example 2:
w_1(x) = x/2, w_2(x) = x/2 + 1/2
!Note again that w_1(0)=0 and w_2(1)=1. Then the attractor of this IFS is the interval [0,1]. If p_1 = p_2 = 1/2, then the distribution of the random-walking iterates {x_n} over the interval [0,1] is uniform. If p_1 > p_2, then there is more probability of finding the iterates in the interval [0,1/2] than in [1/2,1]. But this means that there will be more probability of finding them in [0,1/4] vs. [1/4,1/2] and more in [1/2,3/4] than [3/4,1], and so on. The result is that the visitation frequencies over small sets demonstrate a complicated fractal-like pattern.

=== An example in [0,1] X [0,1]: ===
w_1(x,y)=(x/2,y/2), w_2(x,y)=(x/2+1/2,y/2), w_3(x,y)=(x/2,y/2+1/2)
The fixed points of these maps are, respectively, (0,0), (1,0) and (0,1). The attractor of this IFS is a "rectangular" Sierpinski gasket with corners at these fixed points.

* Note: Let us go back to Franklin Mendvil's beautiful montage of photos presented above. Starting at the upper left photo (which could be considered as the "seed" set), if you scan left-to-right and then move down and scan left-to-right again, you have the first six "sets" that are approaching this "rectangular" Sierpinski gasket.

* For a little more discussion on this subject, along with a quite readable introduction to fractal image coding, you may wish to look at E.R. Vrscay's [http://links.uwaterloo.ca/papers/waterloo/vr95.pdf Hitchhiker's Guide to Fractal Image Compression]. It was written for a general audience with some undergraduate mathematical knowledge. Ref. [8] below is also a very nice and readable discussion of fractal image coding.

=== References ===
* 1. M.F. Barnsley and S. Demko, Iterated function systems and the global construction of fractals, Proc. Roy. Soc. London A399, 243-275 (1985).
* 2. J. Hutchinson, Fractals and self-similarity, Indiana Univ. J. Math. 30, 713-747 (1981).
* 3. M.F. Barnsley, V. Ervin, D. Hardin and J. Lancaster, Solution of an inverse problem for fractals and other sets, Proc. Nat. Acad. Sci. USA 83, 1975-1977 (1985).
* 4 . A. Jacquin, Image coding based on a fractal theory of iterated contractive image transformations, IEEE Trans. Image Proc. 1, 18-30 (1992).
* 5. M.F. Barnsley and L.P. Hurd, Fractal Image Compression, A.K. Peters, Wellesley, Mass. (1993).
* 6. Y. Fisher, Fractal Image Compression, Theory and Application, Springer-Verlag, New York (1995).
* 7. N. Lu, Fractal Imaging, Academic Press, New York (1997).
* 8. Y. Fisher, A discussion of fractal image compression, in Chaos and Fractals, New Frontiers of Science, H.-O. Peitgen, H. Jurgens and D. Saupe, Springer-Verlag, Heidelberg (1994).

IFS

2019-04-30T15:41:33Z

C0D3K:

* Extension: .ifs
* Website: http://www.verrando.com/pulcini/gp-ifs1.html
* Theory: http://www.verrando.com/pulcini/gp-ifs4.html
* Author: Giovambattista Pulcini

=== Overview ===

A Fractal image format made in 1995 to convert TrueColor images into an Fractal format.

The program is partially based on Yuval Fisher's [https://web.archive.org/web/20020208225342/http://inls.ucsd.edu/Research/Fisher/Fractals/enc.c enc.c]/[https://web.archive.org/web/20020122033408/http://inls.ucsd.edu/Research/Fisher/Fractals/dec.c dec.c], but uses a simpler classification scheme.

Software & Sources:
[http://www.verrando.com/pulcini/ftp/ifsaf.zip IFSAF]
[http://www.verrando.com/pulcini/ftp/ifsdlglt.zip IFSAF dlg lite] for NT and 95
[http://www.verrando.com/pulcini/ftp/ifssrclt.zip IFSAF dlg lite source]

[[Category:Container Formats]]
[[Category:Image Formats]]

IFS

2019-04-30T15:41:03Z

C0D3K:

* Extension: .ifs
* Website: http://www.verrando.com/pulcini/gp-ifs1.html
* Theory: http://www.verrando.com/pulcini/gp-ifs4.html
* Author: Giovambattista Pulcini

=== Overview ===

A Fractal image format made in 1995 to convert TrueColor images into an Fractal format.

The program is partially based on Yuval Fisher's [https://web.archive.org/web/20020208225342/http://inls.ucsd.edu/Research/Fisher/Fractals/enc.c enc.c]/[http://inls.ucsd.edu/Research/Fisher/Fractals/dec.c dec.c], but uses a simpler classification scheme.

Software & Sources:
[http://www.verrando.com/pulcini/ftp/ifsaf.zip IFSAF]
[http://www.verrando.com/pulcini/ftp/ifsdlglt.zip IFSAF dlg lite] for NT and 95
[http://www.verrando.com/pulcini/ftp/ifssrclt.zip IFSAF dlg lite source]

[[Category:Container Formats]]
[[Category:Image Formats]]

IFS

2019-04-30T07:46:58Z

C0D3K:

* Extension: .ifs
* Website: http://www.verrando.com/pulcini/gp-ifs1.html
* Theory: http://www.verrando.com/pulcini/gp-ifs4.html
* Author: Giovambattista Pulcini

=== Overview ===

A Fractal image format made in 1995 to convert TrueColor images into an Fractal format.

The program is partially based on Yuval Fisher's enc.c/dec.c, but uses a simpler classification scheme.

Software & Sources:
[http://www.verrando.com/pulcini/ftp/ifsaf.zip IFSAF]
[http://www.verrando.com/pulcini/ftp/ifsdlglt.zip IFSAF dlg lite] for NT and 95
[http://www.verrando.com/pulcini/ftp/ifssrclt.zip IFSAF dlg lite source]

[[Category:Container Formats]]
[[Category:Image Formats]]

IFS

2019-04-29T20:37:08Z

C0D3K: Created page with "* Extension: .ifs * Website: http://www.verrando.com/pulcini/gp-ifs1.html * Theory: http://www.verrando.com/pulcini/gp-ifs4.html * Author: Giovambattista Pulcini === Overview..."

Lossless Codec Libraries

2019-04-29T06:09:40Z

C0D3K:

''This page is based on the document 'Description of the LCL codecs (MSZH and ZLIB)' by Roberto Togni found at [http://multimedia.cx/lcl.txt http://multimedia.cx/lcl.txt].''

* FOURCCs: MSZH and ZLIB
* Frame type: intra only
* Website: http://www.geocities.jp/sandk_project/LRC.htm (Japanese)
* Samples: http://samples.mplayerhq.hu/V-codecs/mszh-zlib/
* Mirrored Codecs: [https://web.archive.org/web/20070108024547if_/http://www.geocities.jp:80/sandk_project/prg/LCL223.ZIP LCL 2.2.3][https://web.archive.org/web/20050131045315if_/http://www.geocities.co.jp:80/Playtown-Denei/2837/prg/LCL222.ZIP LCL 2.2.2][https://web.archive.org/web/20040315230350if_/http://www.geocities.co.jp:80/Playtown-Denei/2837/prg/LCL120A.LZH LCL 1.2.0a]

These two codecs, used in [[Microsoft Audio/Video Interleaved|AVI]] files, were created by Kenji Oshima to compress digital animation. MSZH is based on a simple proprietary compressor while ZLIB uses deflate method found in the [http://www.zlib.org zlib library] to compress frames.

This description is based on LCL Ver 2.23 dated 2000.09.20.

== Basic Description ==

The codec converts original RGB24 image data to a target colorspace and compresses it with a selected algorithm. The codec can also remove unchanged frames and replace them with null frames, and can filter image data before compression. The only difference between avimszh and avizlib is in the stream compressor. PNG filtering is available only in avizlib. Except for null frames, there is no temporal compression, and all frames can be decoded independently from the others. Each AVI chunk contains one frame. In case of multithreaded mode the two sections are stored into the same chunk.

== File Header ==

Codec information is stored at the end of [[BITMAPINFOHEADER]] structure into AVI header. This structure is 8 bytes longer than the standard structure.

struct {
standard BITMAPINFOHEADER fields

unsigned char unknown[4];
unsigned char imagetype;
unsigned char compression;
unsigned char flags;
unsigned char codec;
} BITMAPINFOHEADER_extended

* unknown:
always [4, 0, 0, 0]

* codec:
1 mszh
3 zlib

* imagetype:
0 [[YUV 1:1:1]]
1 [[YUV 4:2:2]]
2 [[Lossless Codec Libraries#RGB24|RGB24]]
3 [[YUV 4:1:1]]
4 [[YUV 2:1:1]]
5 [[YUV 4:2:0]]

* compression:
0 mszh: compression
1 mszh: no compression, zlib: hispeed compression
9 zlib: high compression
-1 zlib: normal compression (zlib standard level)

* flags:
bit 0: multithread used
bit 1: nullframe insertion used
bit 3: png fileter used (zlib only)

== Image Types ==

'''(TODO: These should probably be moved to their own pages)'''

=== RGB24 ===

This colorspace is laid out as standard Blue-Green-Red order color data, totaling 3 bytes per pixel.

=== YUV ===

YUV formats can be converted to RGB using the following equations:
R = Y + 1.403V'
G = Y - 0.344U' - 0.714V'
B = Y + 1.770U'
or, in a programmer-friendly form (integer math)
b = ((y << 20) + u * 1858076 + 0x80000) >> 20;
g = ((y << 20) - u * 360857 - v * 748830 + 0x80000) >> 20;
r = ((y << 20) + v * 1470103 + 0x80000) >> 20;
Values are then clamped to 0-255 range.

Please note that these equations don't have the 128 offset value into U and V components.

YUV structure: packed format with various subsampling factors
'''(TODO: add byte order and description for every YUV format)'''

Please note that byte order is different from standard YUV formats with the same name!

== Compression ==

As the codec name suggests, all compressors are lossless.

=== Zlib compression ===

This mode uses the standard zlib deflate method. For algorithm description refer to the zlib docs. The compressor state is reset every frame (decode every frame independently). Compression codes (1, 9, -1) have the same meaning as zlib compression flags. Zlib does not require compression level at decompressor so the value is there only for informational purposes.

=== Mszh ===

No compression: Just does what it says, image is not compressed at all.

Mszh compression: Works by copying blocks from already decoded data.
'''(TODO: add mszh decompression algorithm)'''

== Flags ==

=== Multithreaded ===

The encoded image is split in two independent blocks. The decoder must decode them separately and concatenate the resulting images.
'''(TODO: add length and offset fields)'''

=== Nullframe ===

If one frame is unchanged from the previous frame, the coder replaces the new frame with a null frame.

=== PNG Filter (zlib only) ===

It is unclear why this is called a PNG filter since it has nothing to do with filters used in pnglib. All filters share the same structure, but the implementation depends on the colorspace. PNG filters are line-based, first pixel is stored unchanged, then other values are stored as difference from the previous ones. The filter (if any) is applied between decompression and colorspace conversion.

'''(TODO: add structure for each pngfilter)'''

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]

Lossless Codec Libraries

2019-04-29T06:09:06Z

C0D3K:

''This page is based on the document 'Description of the LCL codecs (MSZH and ZLIB)' by Roberto Togni found at [http://multimedia.cx/lcl.txt http://multimedia.cx/lcl.txt].''

* FOURCCs: MSZH and ZLIB
* Frame type: intra only
* Website: http://www.geocities.jp/sandk_project/LRC.htm (Japanese)
* Samples: http://samples.mplayerhq.hu/V-codecs/mszh-zlib/
* Mirrored Codecs: [https://web.archive.org/web/20070108024547if_/http://www.geocities.jp:80/sandk_project/prg/LCL223.ZIP LCL 2.2.3] [https://web.archive.org/web/20050131045315if_/http://www.geocities.co.jp:80/Playtown-Denei/2837/prg/LCL222.ZIP LCL 2.2.2][https://web.archive.org/web/20040315230350if_/http://www.geocities.co.jp:80/Playtown-Denei/2837/prg/LCL120A.LZH LCL 1.2.0a]

These two codecs, used in [[Microsoft Audio/Video Interleaved|AVI]] files, were created by Kenji Oshima to compress digital animation. MSZH is based on a simple proprietary compressor while ZLIB uses deflate method found in the [http://www.zlib.org zlib library] to compress frames.

This description is based on LCL Ver 2.23 dated 2000.09.20.

== Basic Description ==

The codec converts original RGB24 image data to a target colorspace and compresses it with a selected algorithm. The codec can also remove unchanged frames and replace them with null frames, and can filter image data before compression. The only difference between avimszh and avizlib is in the stream compressor. PNG filtering is available only in avizlib. Except for null frames, there is no temporal compression, and all frames can be decoded independently from the others. Each AVI chunk contains one frame. In case of multithreaded mode the two sections are stored into the same chunk.

== File Header ==

Codec information is stored at the end of [[BITMAPINFOHEADER]] structure into AVI header. This structure is 8 bytes longer than the standard structure.

struct {
standard BITMAPINFOHEADER fields

unsigned char unknown[4];
unsigned char imagetype;
unsigned char compression;
unsigned char flags;
unsigned char codec;
} BITMAPINFOHEADER_extended

* unknown:
always [4, 0, 0, 0]

* codec:
1 mszh
3 zlib

* imagetype:
0 [[YUV 1:1:1]]
1 [[YUV 4:2:2]]
2 [[Lossless Codec Libraries#RGB24|RGB24]]
3 [[YUV 4:1:1]]
4 [[YUV 2:1:1]]
5 [[YUV 4:2:0]]

* compression:
0 mszh: compression
1 mszh: no compression, zlib: hispeed compression
9 zlib: high compression
-1 zlib: normal compression (zlib standard level)

* flags:
bit 0: multithread used
bit 1: nullframe insertion used
bit 3: png fileter used (zlib only)

== Image Types ==

'''(TODO: These should probably be moved to their own pages)'''

=== RGB24 ===

This colorspace is laid out as standard Blue-Green-Red order color data, totaling 3 bytes per pixel.

=== YUV ===

YUV formats can be converted to RGB using the following equations:
R = Y + 1.403V'
G = Y - 0.344U' - 0.714V'
B = Y + 1.770U'
or, in a programmer-friendly form (integer math)
b = ((y << 20) + u * 1858076 + 0x80000) >> 20;
g = ((y << 20) - u * 360857 - v * 748830 + 0x80000) >> 20;
r = ((y << 20) + v * 1470103 + 0x80000) >> 20;
Values are then clamped to 0-255 range.

Please note that these equations don't have the 128 offset value into U and V components.

YUV structure: packed format with various subsampling factors
'''(TODO: add byte order and description for every YUV format)'''

Please note that byte order is different from standard YUV formats with the same name!

== Compression ==

As the codec name suggests, all compressors are lossless.

=== Zlib compression ===

This mode uses the standard zlib deflate method. For algorithm description refer to the zlib docs. The compressor state is reset every frame (decode every frame independently). Compression codes (1, 9, -1) have the same meaning as zlib compression flags. Zlib does not require compression level at decompressor so the value is there only for informational purposes.

=== Mszh ===

No compression: Just does what it says, image is not compressed at all.

Mszh compression: Works by copying blocks from already decoded data.
'''(TODO: add mszh decompression algorithm)'''

== Flags ==

=== Multithreaded ===

The encoded image is split in two independent blocks. The decoder must decode them separately and concatenate the resulting images.
'''(TODO: add length and offset fields)'''

=== Nullframe ===

If one frame is unchanged from the previous frame, the coder replaces the new frame with a null frame.

=== PNG Filter (zlib only) ===

It is unclear why this is called a PNG filter since it has nothing to do with filters used in pnglib. All filters share the same structure, but the implementation depends on the colorspace. PNG filters are line-based, first pixel is stored unchanged, then other values are stored as difference from the previous ones. The filter (if any) is applied between decompression and colorspace conversion.

'''(TODO: add structure for each pngfilter)'''

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]

CorePNG

2019-04-29T05:58:01Z

C0D3K:

* FOURCCs: PNG1
* Name: CorePNG
* Frame type: IP
* Website: [http://corecodec.org/projects/corepng CorePNG codec website]

This lossless codec is based on the PNG image format.
Each frame can be encoded as-is (I-frame), or can represent a delta from the previous frame (P-frame). In both cases the data is compressed in standard PNG format.

The codec was originally developed to compress subtitles.

The codec supports [[Raw RGB|RGB[A]]] and [[Raw YUV|YUV]] colorspaces: In RGB mode every frame is compressed as a PNG image; in YUV mode a frame is stored as 3 PNG images with order Y, U, V.

=== Binary Mirrors ===

[http://www.jory.info/serendipity/archives/28-CorePNG-v0.8.2.html Mirror of VfW codec (with source)]

[https://web.archive.org/web/20040117230558/http://corecodec.org:80/download.php/87/CorePNG-VFW-v0.8.1.exe Another Mirror of VfW codec (with source)]

[https://web.archive.org/web/20040117231829if_/http://corecodec.org:80/download.php/96/CorePNG-VFW-v0.8.2.exe And Another Mirror of VfW codec (with source)]

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]

Black Magic

2019-04-29T05:43:46Z

C0D3K:

* Homepage http://www.decklink.com/
* Binary codec: http://www.decklink.com/downloads/codecs/Blackmagic_Codecs_v4.9.zip

Uncompressed [[YUV]]/[[RGB]] 8/10 bit codec found in [[MOV]] containers.

Some details about the codec are available at http://www.decklink.com/support/detail.asp?techID=78

=== Mirrored Binaries ===
[https://web.archive.org/web/20051124153806if_/http://www.decklink.com:80/downloads/codecs/Blackmagic_Codecs_v4.9.zip Windows Mirror] on archive.org

[https://web.archive.org/web/20060509183340if_/http://decklink.com:80/downloads/codecs/Blackmagic_Codec_OSX.zip OSX Mirror] on archive.org

[https://web.archive.org/web/20060509183333if_/http://decklink.com:80/downloads/codecs/Blackmagic_Codec_OS9.sit OS9 Mirror] on archive.org

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

Black Magic

2019-04-29T05:42:59Z

C0D3K:

* Homepage http://www.decklink.com/
* Binary codec: http://www.decklink.com/downloads/codecs/Blackmagic_Codecs_v4.9.zip

Uncompressed [[YUV]]/[[RGB]] 8/10 bit codec found in [[MOV]] containers. Some details about the codec are available at http://www.decklink.com/support/detail.asp?techID=78

=== Mirrored Binaries ===
[https://web.archive.org/web/20051124153806if_/http://www.decklink.com:80/downloads/codecs/Blackmagic_Codecs_v4.9.zip Windows Mirror] on archive.org

[https://web.archive.org/web/20060509183340if_/http://decklink.com:80/downloads/codecs/Blackmagic_Codec_OSX.zip OSX Mirror] on archive.org

[https://web.archive.org/web/20060509183333if_/http://decklink.com:80/downloads/codecs/Blackmagic_Codec_OS9.sit OS9 Mirror] on archive.org

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

Alparysoft lossless codec

2019-04-29T05:28:31Z

C0D3K:

* FourCCs: ASLC
* Samples: [http://samples.mplayerhq.hu/V-codecs/ASLC/ http://samples.mplayerhq.hu/V-codecs/ASLC/]

=== Overview ===
* Compression of video stream is supported in the following formats:
* RGB24, YUY2, YV12, RGB8 (this type is for the grayscale image compression).

=== Specifications ===
The codec's control is advanced with the following coptions:

* 1. This option should be used for full-colored video in RGB-format (this option is ignored in YUV format video). This option should be switched off in video with less 16 colors.

* 2. Interlace effect on video. Allows increasing compression ratio on interlaced video and to decrease it on non-interlaced :)

* 3. To use the prediction algorithm for full-colored video. It's no use turning on this function in video with less than 16 colors.

* 4. To use algorithms versions, optimized with SIMD-extension SSE. (supported with processors Intel Pentium III, AMD Athlon XP and older) It allows increasing the speed of compression/decompression to 20-50%. The information about your processor is also screened here (including if it supports SSE).

=== Mirrored Binaries ===
* [https://web.archive.org/web/20061216133954if_/http://www.alparysoft.com:80/file.php?id=40 aslcodec-setup.exe] on archive.org
* [https://web.archive.org/web/20041120002746/http://www.alparysoft.com/file.php?id=40 aslcodec_setup_2.0.exe] on archive.org
* [https://web.archive.org/web/20050205072705if_/http://www.alparysoft.com:80/file.php?id=40 aslcodec_setup_2.0b.957.exe] on archive.org

[[Category:Undiscovered Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Video Codecs]]

Alparysoft lossless codec

2019-04-29T05:22:55Z

C0D3K:

* FourCCs: ASLC
* Samples: [http://samples.mplayerhq.hu/V-codecs/ASLC/ http://samples.mplayerhq.hu/V-codecs/ASLC/]

=== Overview ===
* Compression of video stream is supported in the following formats:
* RGB24, YUY2, YV12, RGB8 (this type is for the grayscale image compression).

=== Specifications ===
The codec's control is advanced with the following coptions:

* 1. This option should be used for full-colored video in RGB-format (this option is ignored in YUV format video). This option should be switched off in video with less 16 colors.

* 2. Interlace effect on video. Allows increasing compression ratio on interlaced video and to decrease it on non-interlaced :)

* 3. To use the prediction algorithm for full-colored video. It's no use turning on this function in video with less than 16 colors.

* 4. To use algorithms versions, optimized with SIMD-extension SSE. (supported with processors Intel Pentium III, AMD Athlon XP and older) It allows increasing the speed of compression/decompression to 20-50%. The information about your processor is also screened here (including if it supports SSE).

=== Mirrored Binaries ===
* aslcodec-setup.exe: https://web.archive.org/web/20061216133954if_/http://www.alparysoft.com:80/file.php?id=40
* aslcodec_setup_2.0.exe https://web.archive.org/web/20041120002746/http://www.alparysoft.com/file.php?id=40
* aslcodec_setup_2.0b.957.exe https://web.archive.org/web/20050205072705if_/http://www.alparysoft.com:80/file.php?id=40

[[Category:Undiscovered Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Video Codecs]]

Alparysoft lossless codec

2019-04-29T05:22:23Z

C0D3K:

* FourCCs: ASLC
* Samples: [http://samples.mplayerhq.hu/V-codecs/ASLC/ http://samples.mplayerhq.hu/V-codecs/ASLC/]

=== Overview ===
* Compression of video stream is supported in the following formats:
* RGB24, YUY2, YV12, RGB8 (this type is for the grayscale image compression).

=== Specifications ===
Our codec's control is advanced with the following coptions:

* 1. This option should be used for full-colored video in RGB-format (this option is ignored in YUV format video). This option should be switched off in video with less 16 colors.

* 2. Interlace effect on video. Allows increasing compression ratio on interlaced video and to decrease it on non-interlaced :)

* 3. To use the prediction algorithm for full-colored video. It's no use turning on this function in video with less than 16 colors.

* 4. To use algorithms versions, optimized with SIMD-extension SSE. (supported with processors Intel Pentium III, AMD Athlon XP and older) It allows increasing the speed of compression/decompression to 20-50%. The information about your processor is also screened here (including if it supports SSE).

=== Mirrored Binaries ===
* aslcodec-setup.exe: https://web.archive.org/web/20061216133954if_/http://www.alparysoft.com:80/file.php?id=40
* aslcodec_setup_2.0.exe https://web.archive.org/web/20041120002746/http://www.alparysoft.com/file.php?id=40
* aslcodec_setup_2.0b.957.exe https://web.archive.org/web/20050205072705if_/http://www.alparysoft.com:80/file.php?id=40

[[Category:Undiscovered Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Video Codecs]]

IgCodec

2019-04-29T05:04:29Z

C0D3K:

* Website: http://xrowcc.blog.shinobi.jp/Entry/434/ (Japanese)
* FourCCs: IGC1, IGC2, IGC3, IGC4
This codec uses FastLZ, LZF and ZLIB.

Codec: http://file.xrowcc.blog.shinobi.jp/igcodec100.zip

=== Overview ===
* High speed (IGC1, IGC2)
* High compression (IGC3, IGC4)
* High quality (UYVY)
* Lossless compression
* Input / output correspondence format "RGB32" "RGB24" "YUY2" "UYVY"
* Compression processing, difference processing, RGB ⇔ YUV conversion processing

=== FourCC Specifics ===
* IGC1: Speed priority
* IGC2: Speed priority (Zero Remote only [key frame absent])
* IGC3: Compression priority
* IGC4: Compression priority (ZeroRemote only [no key frame])

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

ZeroCodec

2019-04-29T04:57:37Z

C0D3K:

* Website: http://xrowcc.blog.shinobi.jp/Entry/388/ (Japanese)
* FourCCs: ZECO

Codec: http://file.xrowcc.blog.shinobi.jp/zerocodec201.zip

=== Overview ===
* Functional implementation of compression processing, difference processing, RGB ⇔ YUV conversion processing
* Input / output correspondence format is "RGB" "YUY2" "UYVY"

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]

Black Magic

2019-04-29T04:50:50Z

C0D3K:

* Homepage http://www.decklink.com/
* Binary codec: http://www.decklink.com/downloads/codecs/Blackmagic_Codecs_v4.9.zip

Uncompressed [[YUV]] 8/10 bit codec found in [[MOV]] containers. Some details about the codec are available at http://www.decklink.com/support/detail.asp?techID=78

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

FastCodec

2019-04-29T04:46:51Z

C0D3K:

* Website: http://videosoft.org/codecs/fastcodec/
* FourCC: FCKK

Binary Codec (vfw): https://videosoft.org/res/download/codecs/fastcodec/fastcodec-setup.exe
=== Overview ===
* Supported input and output formats: YUY2/YUNV/V422/YUYV, YVYU, UYVY/Y422/UYNV, RGB24, RGB32.
* Lossless and lossy (near lossless) compression.
* Fast preview mode decompression.
* Lossless compression requires frame width and height must be a multiple of 4.
* Lossy compression requires frame height is multiple of 4 and frame width is multiple of 8.

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

Toponoky

2019-04-29T04:41:23Z

C0D3K:

* Website: https://videosoft.org/codecs/toponoky/
* FourCC: LCKK

Binary Codec (vfw): https://videosoft.org/res/download/codecs/toponoky/toponoky-setup.exe

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

FastCodec

2019-04-29T04:40:59Z

C0D3K:

* Website: http://videosoft.org/codecs/fastcodec/
* FourCC: FCKK

Binary Codec (vfw): https://videosoft.org/res/download/codecs/fastcodec/fastcodec-setup.exe

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]

Toponoky

2019-04-29T04:33:52Z

C0D3K: Created page with "* Website: https://videosoft.org/codecs/toponoky/ * FourCC: LCKK * Binary Codec (vfw): https://videosoft.org/res/download/codecs/toponoky/toponoky-setup.exe Category:Video..."

* Website: https://videosoft.org/codecs/toponoky/
* FourCC: LCKK
* Binary Codec (vfw): https://videosoft.org/res/download/codecs/toponoky/toponoky-setup.exe

[[Category:Video Codecs]]
[[Category:Lossless Video Codecs]]
[[Category:Undiscovered Video Codecs]]