{"id":"https://openalex.org/W2159422149","doi":"https://doi.org/10.1109/pcs.2009.5167465","title":"Low complexity algorithm for Spatially Varying Transforms","display_name":"Low complexity algorithm for Spatially Varying Transforms","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2159422149","doi":"https://doi.org/10.1109/pcs.2009.5167465","mag":"2159422149"},"language":"en","primary_location":{"id":"doi:10.1109/pcs.2009.5167465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pcs.2009.5167465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Picture Coding Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086466532","display_name":"Cixun Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Cixun Zhang","raw_affiliation_strings":["Tampere University of Technology, Tampere, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110241858","display_name":"Kemal U\u01e7ur","orcid":null},"institutions":[{"id":"https://openalex.org/I2738502077","display_name":"Nokia (Finland)","ror":"https://ror.org/04pkc8m17","country_code":"FI","type":"company","lineage":["https://openalex.org/I2738502077"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Kemal Ugur","raw_affiliation_strings":["Nokia Research Center, Tampere, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Research Center, Tampere, Finland","institution_ids":["https://openalex.org/I2738502077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017900883","display_name":"Jani Lainema","orcid":null},"institutions":[{"id":"https://openalex.org/I2738502077","display_name":"Nokia (Finland)","ror":"https://ror.org/04pkc8m17","country_code":"FI","type":"company","lineage":["https://openalex.org/I2738502077"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jani Lainema","raw_affiliation_strings":["Nokia Research Center, Tampere, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Research Center, Tampere, Finland","institution_ids":["https://openalex.org/I2738502077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059063295","display_name":"Antti Hallapuro","orcid":null},"institutions":[{"id":"https://openalex.org/I2738502077","display_name":"Nokia (Finland)","ror":"https://ror.org/04pkc8m17","country_code":"FI","type":"company","lineage":["https://openalex.org/I2738502077"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Antti Hallapuro","raw_affiliation_strings":["Nokia Research Center, Tampere, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Research Center, Tampere, Finland","institution_ids":["https://openalex.org/I2738502077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007583477","display_name":"Moncef Gabbouj","orcid":"https://orcid.org/0000-0002-9788-2323"},"institutions":[{"id":"https://openalex.org/I4210133110","display_name":"Tampere University","ror":null,"country_code":"FI","type":null,"lineage":["https://openalex.org/I4210133110"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Moncef Gabbouj","raw_affiliation_strings":["Tampere University of Technology, Tampere, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tampere University of Technology, Tampere, Finland","institution_ids":["https://openalex.org/I4210133110"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0715,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78320196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10741","display_name":"Video Coding and Compression Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10741","display_name":"Video Coding and Compression Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/macroblock","display_name":"Macroblock","score":0.9365068674087524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6835874319076538},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6582673192024231},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6497559547424316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6271012425422668},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5580772161483765},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5512111186981201},{"id":"https://openalex.org/keywords/rate\u2013distortion-theory","display_name":"Rate\u2013distortion theory","score":0.4420928359031677},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.41385418176651},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.268758624792099},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.24836111068725586},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15397170186042786}],"concepts":[{"id":"https://openalex.org/C124828224","wikidata":"https://www.wikidata.org/wiki/Q2632668","display_name":"Macroblock","level":3,"score":0.9365068674087524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6835874319076538},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6582673192024231},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6497559547424316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6271012425422668},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5580772161483765},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5512111186981201},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.4420928359031677},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.41385418176651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.268758624792099},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.24836111068725586},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15397170186042786},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/pcs.2009.5167465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pcs.2009.5167465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Picture Coding Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.161.4602","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.4602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tut.fi/~moncef/publications/low-complexity-algo-pcs-2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W832984975","https://openalex.org/W2101700394","https://openalex.org/W2122086266","https://openalex.org/W2137956707","https://openalex.org/W2145671134","https://openalex.org/W2276329208"],"related_works":["https://openalex.org/W2368824897","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2157716306","https://openalex.org/W2030109976","https://openalex.org/W2369260257","https://openalex.org/W2545120792","https://openalex.org/W2389120450"],"abstract_inverted_index":{"In":[0,75],"our":[1],"previous":[2],"work,":[3,77],"we":[4,78],"introduced":[5],"spatially":[6],"varying":[7],"transforms":[8],"(SVT)":[9],"for":[10,69],"video":[11],"coding,":[12],"where":[13],"the":[14,17,21,42,50,61,92,121,131],"location":[15,72],"of":[16,41,53,60,95,104,130],"transform":[18],"block":[19,88],"within":[20],"macroblock":[22,86],"is":[23],"not":[24],"fixed":[25],"but":[26],"varying.":[27],"SVT":[28,54],"has":[29],"lower":[30],"decoding":[31],"complexity":[32,52,82,94,100,124],"compared":[33],"to":[34,46,63,90],"standard":[35],"methods":[36],"as":[37],"only":[38,138],"a":[39,80,113],"portion":[40],"prediction":[43],"error":[44],"needs":[45],"be":[47,56],"decoded.":[48],"However,":[49],"encoding":[51,93],"can":[55,126],"relatively":[57],"high":[58],"because":[59],"need":[62],"perform":[64],"rate":[65],"distortion":[66],"optimization":[67],"(RDO)":[68],"each":[70],"candidate":[71,106,132],"parameter":[73],"(LP).":[74],"this":[76],"propose":[79],"low":[81,99,123],"algorithm":[83,101,125],"operating":[84],"on":[85,109],"and":[87,112],"level":[89],"reduce":[91,127],"SVT.":[96],"The":[97],"proposed":[98,122],"includes":[102],"selection":[103],"available":[105],"LP":[107,133],"based":[108],"motion":[110],"difference":[111],"hierarchical":[114],"search":[115],"algorithm.":[116],"Experimental":[117],"results":[118],"show":[119],"that":[120],"around":[128],"80%":[129],"tested":[134],"in":[135,141],"RDO":[136],"with":[137],"marginal":[139],"penalty":[140],"coding":[142],"efficiency.":[143]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}