{"id":"https://openalex.org/W2028446146","doi":"https://doi.org/10.1109/ncc.2014.6811337","title":"Effective approach to reduce complexity for HEVC intra prediction in inter frames","display_name":"Effective approach to reduce complexity for HEVC intra prediction in inter frames","publication_year":2014,"publication_date":"2014-02-01","ids":{"openalex":"https://openalex.org/W2028446146","doi":"https://doi.org/10.1109/ncc.2014.6811337","mag":"2028446146"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2014.6811337","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2014.6811337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Twentieth National Conference on Communications (NCC)","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/A5000991545","display_name":"Ramakrishna Adireddy","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ramakrishna Adireddy","raw_affiliation_strings":["DSP multimedia software, PathPartner Technology Consulting Pvt. Ltd., Bangalore, India"],"affiliations":[{"raw_affiliation_string":"DSP multimedia software, PathPartner Technology Consulting Pvt. Ltd., Bangalore, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051197062","display_name":"Nirmal Kumar Palanisamy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nirmal Kumar Palanisamy","raw_affiliation_strings":["DSP multimedia software, PathPartner Technology Consulting Pvt. Ltd., Bangalore, India"],"affiliations":[{"raw_affiliation_string":"DSP multimedia software, PathPartner Technology Consulting Pvt. Ltd., Bangalore, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000991545"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.10010995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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/T10741","display_name":"Video Coding and Compression Technologies","score":0.9995999932289124,"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.9995999932289124,"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.9955999851226807,"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/T10531","display_name":"Advanced Vision and Imaging","score":0.9872000217437744,"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/computer-science","display_name":"Computer science","score":0.735564112663269},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42037534713745117},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3271208107471466}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.735564112663269},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42037534713745117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3271208107471466}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc.2014.6811337","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2014.6811337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Twentieth National Conference on Communications (NCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2189341500"],"abstract_inverted_index":{"Recently":[0],"established":[1],"video":[2],"compression":[3],"standard":[4,36],"HEVC":[5],"has":[6,125],"adopted":[7],"quad":[8],"tree":[9],"based":[10],"Coding":[11],"Unit":[12],"(CU)":[13],"block":[14,59],"partitioning":[15],"structure":[16],"to":[17,37,86,219],"embrace":[18],"wide":[19],"variety":[20],"of":[21,42,72,99,151,163,169,177,193,203,224,229,238],"image":[22],"texture":[23],"characteristics.":[24],"For":[25],"spatial":[26],"prediction,":[27,60],"35":[28],"intra":[29,43,47,73,89,107,134,142,200,225],"prediction":[30,48,108,128,143],"modes":[31,49,90,144,159,176,189],"are":[32],"defined":[33],"in":[34,61,75,91],"this":[35,137],"improve":[38],"the":[39,65,70,96,182,194,198,214,230],"coding":[40],"efficiency":[41],"blocks.":[44],"Evaluating":[45],"all":[46,51,88,141,173],"at":[50],"depths,":[52],"along":[53],"with":[54,121,156],"motion":[55],"estimation":[56],"for":[57,109],"a":[58,104,116,132],"inter":[62,76,92,100,110,210],"frames":[63,77],"increase":[64],"encoding":[66,239],"complexity":[67],"further.":[68],"Since":[69],"possibility":[71],"blocks":[74],"is":[78,83,115,233],"highly":[79],"content":[80],"dependent,":[81],"it":[82],"computationally":[84],"in-efficient":[85],"evaluate":[87],"frames.":[93,111],"To":[94],"reduce":[95],"computation":[97],"load":[98],"frames,":[101],"we":[102,139],"propose":[103],"conditional":[105,133],"multi-stage":[106],"The":[112,166,227],"proposed":[113,170,231],"approach":[114,171],"fast":[117],"&":[118],"pruning":[119],"method":[120],"predictive":[122],"nature":[123],"and":[124,180,212,241],"two":[126,186],"unconditional":[127],"stages":[129],"followed":[130],"by":[131],"prediction.":[135,226],"In":[136],"method,":[138],"categorize":[140],"into":[145],"few":[146],"groups.":[147],"Each":[148],"group":[149],"consists":[150],"one":[152],"central":[153,174],"angular":[154,158,175,188],"mode":[155],"consecutive":[157],"on":[160],"both":[161],"sides":[162],"center":[164,191],"angle.":[165],"first":[167],"stage":[168,184,205],"evaluates":[172,185],"each":[178],"group,":[179],"then":[181,213],"second":[183,204],"equi-distant":[187],"from":[190],"angle":[192],"winning":[195],"group.":[196],"Finally,":[197],"best":[199,209],"cost":[201,211],"resulted":[202],"gets":[206],"compared":[207],"against":[208],"decision":[215],"will":[216],"be":[217],"taken":[218],"carry":[220],"out":[221],"further":[222],"refinement":[223],"performance":[228],"algorithm":[232],"verified":[234],"through":[235],"comparative":[236],"analysis":[237],"time":[240],"BD-rate.":[242]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}