{"entities":{"Q1575779":{"pageid":1586519,"ns":120,"title":"Item:Q1575779","lastrevid":67908279,"modified":"2026-04-12T20:08:49Z","type":"item","id":"Q1575779","labels":{"en":{"language":"en","value":"Fast recursive algorithms for 2-D discrete cosine transform."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1493532"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1575779$F609516A-C09B-4F50-8395-C55CCE0CE430","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"02b97b94d4ad7e460ed622e5d67df8ff173f8d10","datavalue":{"value":{"text":"Fast recursive algorithms for 2-D discrete cosine transform.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1575779$AC2BF8DA-121B-45ED-AE41-310A7E559D1D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c9483a9a9498ea946b9046a962fcc8e8f2f6c448","datavalue":{"value":"1037.65137","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1575779$D51A7BF8-FB1E-4366-9F53-4E82021B2DFB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"22ad594bd25211a6159bd4b07f08f4e46173163f","datavalue":{"value":"10.1016/S0165-1684(00)00102-X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1575779$0E8DCD2B-F90F-48F6-BABA-FD4DCBE0DB57","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"68394fd7e8a253e114d6399606d47416a190b2d2","datavalue":{"value":{"entity-type":"item","numeric-id":1511313,"id":"Q1511313"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1575779$B3CB8C60-2E02-45C3-843C-801F4A7D3024","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3635fb523baacd154dddf62cfd3bf4f66b56cfe9","datavalue":{"value":{"entity-type":"item","numeric-id":106348,"id":"Q106348"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1575779$255BBCCE-6118-4A83-B92B-5449D8D88D8E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b3a497233c3b9babc42d370358782cbff338a7a1","datavalue":{"value":{"time":"+2000-08-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1575779$1064D9F6-C97A-4E7B-88E7-088E576BCCB6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"cb85665fe84364d594d3e10b97c7a76fc58a84a9","datavalue":{"value":"A new algorithm for computation of two-dimensional (2D) type-III discrete cosine transform is presented. The algorithm is particularly suited to block size \\((p_1*2^m)\\) by \\((p_2*2n)\\), where \\(p_{1}\\) and \\(p_{2}\\) are odd integers, and \\(m\\) and \\(n\\) are non-negative integers. It shows that the 2D type-III DCT can be decomposed into cosine-cosine, cosine-sine, sine-cosine, sine-sine sequences, which can be further decomposed into similar sequences. The proposed algorithm provides the flexibility in choosing block size and has a simple indexing mapping scheme and a fairly regular computation structure. The algorithm also requires a smaller number of arithmetic operations for \\(p_{1}=p_{2}=3\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q1575779$C736F20D-E85E-4835-9F28-47895E3F1D42","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"c4603c40f3b09770fdbb70ee2650f252415f25c5","datavalue":{"value":"65T50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1575779$56993EB3-EA5D-42CA-970D-4DECBDFF2F44","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f6b7902d0f1864067af7947c280d14c429e585b3","datavalue":{"value":"1493532","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1575779$7E76E6E4-6BA5-4540-9EF8-37CE2045A349","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48ddf43eca498c7e7087cd696beb82ea63925320","datavalue":{"value":"algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1575779$1B83FC0C-C648-4B6E-8DFD-9ED428D776DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5927baf72689b6f3c90539a8aeb117d1bcb63a23","datavalue":{"value":"discrete cosine transform","type":"string"},"datatype":"string"},"type":"statement","id":"Q1575779$95251B7E-4DE4-484A-B973-1B2B4EE9097C","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1575779$D396E275-8ADC-4F4B-B32D-59F26B6D9BA2","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"598ca1e2cd2fcbd2b7aa0ff5d0641e18959787da","datavalue":{"value":"Q126437020","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1575779$5821D122-C412-46F0-92BF-B4FC192D5B0C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"14e12739c5529ea4d00cb3d5ea901033bac63d62","datavalue":{"value":"https://doi.org/10.1016/s0165-1684(00)00102-x","type":"string"},"datatype":"url"},"type":"statement","id":"Q1575779$6266BA9A-D7EE-4B20-BAE9-C33CCC20035D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9aa8189615fe832bbd19fda4fdf9f91cfb627890","datavalue":{"value":"W2047252910","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1575779$0CF6DF6B-985D-4C46-AC64-471E894BCCA5","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"74c4041feb0f01ed8797c7edc9c0fd99ada1f57a","datavalue":{"value":{"entity-type":"item","numeric-id":2734324,"id":"Q2734324"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c38a6c5822badcf1519273cab992ee8cd9e69449","datavalue":{"value":{"amount":"+0.950085461139679","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1575779$79F52726-F1FB-4C8E-88E2-B40C24AD1FBD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6b46cbf5e530dfc3c9633afb9f6466e2109ccb96","datavalue":{"value":{"entity-type":"item","numeric-id":673366,"id":"Q673366"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4bef3fcf98de7a1bf7e89ea0f54bab465f7da1cb","datavalue":{"value":{"amount":"+0.879908561706543","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1575779$AFD86B3F-4323-4AA5-9BAE-181E52EBCA31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e4c4ae609cbb7667abdbd2b1ab4772751a1c89c9","datavalue":{"value":{"entity-type":"item","numeric-id":3493169,"id":"Q3493169"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2ce4acbc760d1420227edc09316cff280b531604","datavalue":{"value":{"amount":"+0.878763735294342","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1575779$0B74B5FB-AE10-483F-A545-BFF3D177ABCF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"10ee054c8eccbd497878746dbceb1e9aa176b374","datavalue":{"value":{"entity-type":"item","numeric-id":4031486,"id":"Q4031486"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"59b1eff00622dfb8f5d9527b3da5bce3aa4a4270","datavalue":{"value":{"amount":"+0.8593324422836304","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1575779$501EB4B9-CE3A-4D65-AC6C-CEFD5D0EF0D7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast recursive algorithms for 2-D discrete cosine transform.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_recursive_algorithms_for_2-D_discrete_cosine_transform."}}}}}