@prefix foaf: .
@prefix wikipedia-en: .
@prefix ns2: .
wikipedia-en:Discrete_cosine_transform foaf:primaryTopic ns2:Discrete_cosine_transform .
@prefix rdf: .
@prefix owl: .
ns2:Discrete_cosine_transform rdf:type owl:Thing .
@prefix dbpedia-es: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-es:Transformada_de_coseno_discreta .
@prefix dbpedia-wikidata: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-wikidata:Q2877 .
@prefix dbpedia-de: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-de:Diskrete_Kosinustransformation .
@prefix dbpedia-it: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-it:Trasformata_discreta_del_coseno ,
.
@prefix dbpedia-eu: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-eu:Kosinuaren_transformatu_diskretu ,
.
@prefix dbpedia-nl: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-nl:Discrete_cosinustransformatie ,
.
@prefix dbpedia-pt: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-pt:Transformada_discreta_de_cosseno .
@prefix ns12: .
ns2:Discrete_cosine_transform owl:sameAs ns12:Q2877 ,
.
@prefix dbr: .
ns2:Discrete_cosine_transform owl:sameAs dbr:Discrete_cosine_transform .
@prefix dbpedia-pl: .
ns2:Discrete_cosine_transform owl:sameAs dbpedia-pl:Dyskretna_transformacja_kosinusowa ,
;
foaf:isPrimaryTopicOf wikipedia-en:Discrete_cosine_transform .
@prefix rdfs: .
ns2:Discrete_cosine_transform rdfs:comment "A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is the most widely used transformation technique in signal processing and data compression. It is used in most digital media, including digital images (such as JPEG and HEIF, where small high-frequency components can be discarded), digital video (such as MPEG and H.26x), digital audio (such as Dolby Digital, MP3 and AAC), digital television (such as SDTV, HDTV and VOD), digital radio (such as AAC+ and DAB+), and speech coding (such as AAC-LD, Siren and Opus). DCTs are also important to numerous other applications in science and engineering, such as digital signal processing, communications de"@en ;
rdfs:label "Discrete cosine transform"@en ;
rdfs:seeAlso ns2:ZPEG .
@prefix dct: .
@prefix ns17: .
ns2:Discrete_cosine_transform dct:subject ns17:Discrete_transforms ,
ns17:Digital_signal_processing ,
ns17:Data_compression ,
ns17:Video_compression ,
ns17:JPEG ,
ns17:Indian_inventions ,
ns17:Image_compression ,
,
ns17:Fourier_analysis ;
foaf:depiction .
@prefix ns18: .
ns2:Discrete_cosine_transform ns18:wikiPageID 59962 ;
ns18:wikiPageRevisionID 935777869 .
@prefix ns19: .
@prefix ns20: .
ns2:Discrete_cosine_transform ns19:wikiPageUsesTemplate ns20:See_also ,
ns20:Compression_formats ,
ns20:Columns-list ,
ns20:Compression_Methods ,
ns20:Citation ,
ns20:See ,
ns20:Sqrt ,
ns20:As_of ,
ns20:Citation_needed ,
ns20:Cite_journal ,
ns20:DSP ,
ns20:Harvnb ,
ns20:Cn ,
ns20:Reflist ,
ns20:Planetmath_reference ,
ns20:Harvtxt ,
ns20:Commons_category ,
ns20:Telecommunications ,
ns20:Harv ;
ns18:thumbnail ;
ns18:wikiPageExternalLink ,
,
,
.
@prefix ns21: .
ns2:Discrete_cosine_transform ns18:wikiPageExternalLink ns21:DCT-History-How-I-Came-Up-with-the-Discrete-Cosine-Transform ,
,
,
.
@prefix ns22: .
ns2:Discrete_cosine_transform ns18:wikiPageExternalLink ns22:discretetimesign00alan ,
,
,
,
.
@prefix xsd: .
ns2:Discrete_cosine_transform ns18:wikiPageLength "103582"^^xsd:nonNegativeInteger ;
ns18:wikiPageOutDegree "584"^^xsd:nonNegativeInteger ;
ns18:wikiPageRevisionLink ;
ns18:wikiPageHistoryLink ;
ns18:wikiPageEditLink ;
ns18:wikiPageExtracted "2020-01-14T17:48:21Z"^^xsd:dateTime ;
ns18:abstract "A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies. The DCT, first proposed by Nasir Ahmed in 1972, is the most widely used transformation technique in signal processing and data compression. It is used in most digital media, including digital images (such as JPEG and HEIF, where small high-frequency components can be discarded), digital video (such as MPEG and H.26x), digital audio (such as Dolby Digital, MP3 and AAC), digital television (such as SDTV, HDTV and VOD), digital radio (such as AAC+ and DAB+), and speech coding (such as AAC-LD, Siren and Opus). DCTs are also important to numerous other applications in science and engineering, such as digital signal processing, communications devices, reducing network bandwidth usage, and spectral methods for the numerical solution of partial differential equations. The use of cosine rather than sine functions is critical for compression, since it turns out (as described below) that fewer cosine functions are needed to approximate a typical signal, whereas for differential equations the cosines express a particular choice of boundary conditions. In particular, a DCT is a Fourier-related transform similar to the discrete Fourier transform (DFT), but using only real numbers. The DCTs are generally related to Fourier Series coefficients of a periodically and symmetrically extended sequence whereas DFTs are related to Fourier Series coefficients of a periodically extended sequence. DCTs are equivalent to DFTs of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), whereas in some variants the input and/or output data are shifted by half a sample. There are eight standard DCT variants, of which four are common. The most common variant of discrete cosine transform is the type-II DCT, which is often called simply \"the DCT\". This was the original DCT, first proposed by Nasir Ahmed in 1972. Its inverse, the type-III DCT, is correspondingly often called simply \"the inverse DCT\" or \"the IDCT\". Two related transforms are the discrete sine transform (DST), which is equivalent to a DFT of real and odd functions, and the modified discrete cosine transform (MDCT), which is based on a DCT of overlapping data. Multidimensional DCTs (MD DCTs) are developed to extend the concept of DCT on MD signals. There are several algorithms to compute MD DCT. A variety of fast algorithms have been developed to reduce the computational complexity of implementing DCT. One of these is the integer DCT (IntDCT), an integer approximation of the standard DCT, used in several ISO/IEC and ITU-T international standards. DCT compression, also known as block compression, compresses data in sets of discrete DCT blocks. DCT blocks can have a number of sizes, including 8x8 pixels for the standard DCT, and varied integer DCT sizes between 4x4 and 32x32 pixels. The DCT has a strong \"energy compaction\" property, capable of achieving high quality at high data compression ratios. However, blocky compression artifacts can appear when heavy DCT compression is applied."@en ;
ns18:wikiPageModified "2020-01-14T17:48:17Z"^^xsd:dateTime .
ns2:DCT ns18:wikiPageDisambiguates ns2:Discrete_cosine_transform .
ns2:Inverse_cosine_transform ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns2:Discrete_Cosine_Transform ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns2:Fast_cosine_transform ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns2:Inverse_discrete_cosine_transform ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns2:IDCT ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns2:Fast_Cosine_Transform ns18:wikiPageRedirects ns2:Discrete_cosine_transform .
ns18:knownFor ns2:Discrete_cosine_transform .