{"id":"https://openalex.org/W2567427496","doi":"https://doi.org/10.1109/euvip.2016.7764593","title":"Improving block-matching algorithm by selecting disparity sets minimizing distortion for stereoscopic image coding","display_name":"Improving block-matching algorithm by selecting disparity sets minimizing distortion for stereoscopic image coding","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2567427496","doi":"https://doi.org/10.1109/euvip.2016.7764593","mag":"2567427496"},"language":"en","primary_location":{"id":"doi:10.1109/euvip.2016.7764593","is_oa":false,"landing_page_url":"https://doi.org/10.1109/euvip.2016.7764593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 6th European Workshop on Visual Information Processing (EUVIP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5082696476","display_name":"Aysha Kadaikar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aysha Kadaikar","raw_affiliation_strings":["L2TI, Institut Galil\u00e9e, Universit\u00e9 Paris, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L2TI, Institut Galil\u00e9e, Universit\u00e9 Paris, Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044570096","display_name":"Gabriel Dauphin","orcid":"https://orcid.org/0000-0002-0677-6702"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gabriel Dauphin","raw_affiliation_strings":["L2TI, Institut Galil\u00e9e, Universit\u00e9 Paris, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L2TI, Institut Galil\u00e9e, Universit\u00e9 Paris, Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035263631","display_name":"Anissa Mokraoui","orcid":"https://orcid.org/0000-0001-6447-8722"},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anissa Mokraoui","raw_affiliation_strings":["L2TI, Institut Galil\u00e9e, Universit\u00e9 Paris, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L2TI, Institut Galil\u00e9e, Universit\u00e9 Paris, Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210091279"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16834545,"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":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9998999834060669,"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/T10741","display_name":"Video Coding and Compression Technologies","score":0.9994000196456909,"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/T11105","display_name":"Advanced Image Processing Techniques","score":0.9991000294685364,"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/distortion","display_name":"Distortion (music)","score":0.730721652507782},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6075226068496704},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6005462408065796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5932059288024902},{"id":"https://openalex.org/keywords/stereoscopy","display_name":"Stereoscopy","score":0.5722351670265198},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5648700594902039},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5516782402992249},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5216834545135498},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4907720983028412},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42639926075935364},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36554670333862305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3224930763244629},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07146909832954407}],"concepts":[{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.730721652507782},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6075226068496704},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6005462408065796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5932059288024902},{"id":"https://openalex.org/C126057942","wikidata":"https://www.wikidata.org/wiki/Q35158","display_name":"Stereoscopy","level":2,"score":0.5722351670265198},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5648700594902039},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5516782402992249},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5216834545135498},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4907720983028412},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42639926075935364},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36554670333862305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3224930763244629},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07146909832954407},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C194257627","wikidata":"https://www.wikidata.org/wiki/Q211554","display_name":"Amplifier","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/euvip.2016.7764593","is_oa":false,"landing_page_url":"https://doi.org/10.1109/euvip.2016.7764593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 6th European Workshop on Visual Information Processing (EUVIP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1744250986","https://openalex.org/W1973857136","https://openalex.org/W1976782938","https://openalex.org/W1987278810","https://openalex.org/W2018938123","https://openalex.org/W2062929274","https://openalex.org/W2064788571","https://openalex.org/W2106198122","https://openalex.org/W2111888154","https://openalex.org/W2283960892"],"related_works":["https://openalex.org/W1536158975","https://openalex.org/W2393788985","https://openalex.org/W2157670837","https://openalex.org/W2029966401","https://openalex.org/W2374120702","https://openalex.org/W2288745733","https://openalex.org/W2631594184","https://openalex.org/W2072849536","https://openalex.org/W3006845356","https://openalex.org/W2078994727"],"abstract_inverted_index":{"This":[0,68],"paper":[1,69],"deals":[2],"with":[3,64],"the":[4,29,31,35,45,47,52,84,87,93,97,106,113,123,126,136,143],"blockwise":[5],"disparity":[6,40,54,89],"map":[7,55,90],"estimation":[8],"problem":[9],"for":[10],"stereoscopic":[11],"image":[12],"coding.":[13],"Generally,":[14],"disparities":[15,61,110],"are":[16],"selected":[17,111],"amongst":[18],"a":[19,24,38,65,130],"search":[20,32,78],"area":[21,33],"by":[22,112],"minimizing":[23,122],"local":[25],"distortion.":[26],"In":[27],"addition":[28],"larger":[30,66],"is,":[34],"more":[36],"often":[37],"better":[39],"can":[41],"be":[42],"chosen":[43],"and":[44],"lower":[46],"global":[48],"distortion":[49,124],"is.":[50],"However,":[51],"resulting":[53],"containing":[56],"higher":[57],"number":[58],"of":[59,76,86,96,109,125,138,147],"idfferent":[60],"is":[62],"encoded":[63],"bitrate.":[67],"proposes":[70],"two":[71],"approaches":[72],"to":[73,118,142],"take":[74],"advantage":[75],"large":[77],"areas":[79],"while":[80],"reducing":[81],"not":[82],"only":[83],"bitrate":[85,131],"estimated":[88],"but":[91],"also":[92],"computational":[94],"complexity":[95],"optimal":[98],"solution.":[99],"The":[100],"developed":[101],"sub-optimal":[102],"algorithms":[103,140],"rely":[104],"on":[105],"initial":[107],"set":[108],"traditional":[114],"Block-Matching":[115],"Algorithm":[116],"(BMA)":[117],"compute":[119],"new":[120],"sets":[121],"predicted":[127],"view":[128],"under":[129],"constraint.":[132],"Simulation":[133],"results":[134],"confirm":[135],"benefits":[137],"our":[139],"compared":[141],"BMA":[144],"in":[145],"terms":[146],"bitrate-distortion.":[148]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}