{"id":"https://openalex.org/W2114450317","doi":"https://doi.org/10.1109/icassp.2012.6288717","title":"Parallel GPU implementation of null space based alternating optimization algorithm for large-scale matrix rank minimization","display_name":"Parallel GPU implementation of null space based alternating optimization algorithm for large-scale matrix rank minimization","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2114450317","doi":"https://doi.org/10.1109/icassp.2012.6288717","mag":"2114450317"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2012.6288717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2012.6288717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5100866596","display_name":"Katsumi Konishi","orcid":null},"institutions":[{"id":"https://openalex.org/I116465919","display_name":"Kogakuin University","ror":"https://ror.org/01wc2tq75","country_code":"JP","type":"education","lineage":["https://openalex.org/I116465919"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Katsumi Konishi","raw_affiliation_strings":["Department of Computer Science, Kogakuin University, Tokyo, Japan","[Department of computer science, Kogakuin university, Tokyo, Japan]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kogakuin University, Tokyo, Japan","institution_ids":["https://openalex.org/I116465919"]},{"raw_affiliation_string":"[Department of computer science, Kogakuin university, Tokyo, Japan]","institution_ids":["https://openalex.org/I116465919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100866596"],"corresponding_institution_ids":["https://openalex.org/I116465919"],"apc_list":null,"apc_paid":null,"fwci":3.0859,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91238761,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3689","last_page":"3692"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9933000206947327,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9933000206947327,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.7174488306045532},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.6820430755615234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6584563255310059},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5926035046577454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5767938494682312},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5615789890289307},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5355169177055359},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5105413198471069},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.48786425590515137},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.41015490889549255},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38804811239242554},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.363192617893219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22101062536239624},{"id":"https://openalex.org/keywords/hankel-matrix","display_name":"Hankel matrix","score":0.06471428275108337}],"concepts":[{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.7174488306045532},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.6820430755615234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6584563255310059},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5926035046577454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5767938494682312},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5615789890289307},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5355169177055359},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5105413198471069},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.48786425590515137},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.41015490889549255},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38804811239242554},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.363192617893219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22101062536239624},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.06471428275108337},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2012.6288717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2012.6288717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2011359124","https://openalex.org/W2074471762","https://openalex.org/W2096154138","https://openalex.org/W2103972604","https://openalex.org/W2105104771","https://openalex.org/W2124608575","https://openalex.org/W2147523783","https://openalex.org/W2550766755","https://openalex.org/W2611328865"],"related_works":["https://openalex.org/W2782904003","https://openalex.org/W4226434912","https://openalex.org/W2118633810","https://openalex.org/W2150953077","https://openalex.org/W2002598339","https://openalex.org/W2920931670","https://openalex.org/W2133814741","https://openalex.org/W1995410415","https://openalex.org/W3108343813","https://openalex.org/W4301603585"],"abstract_inverted_index":{"This":[0,55],"paper":[1,56],"provides":[2,64,99],"an":[3],"alternating":[4],"optimization":[5],"algorithm":[6,77,98],"for":[7],"large-scale":[8,48,91],"matrix":[9,20,71],"rank":[10,21],"minimization":[11,22],"problems":[12],"and":[13,33,85,104],"its":[14],"parallel":[15,110],"implementation":[16],"on":[17],"GPU.":[18],"The":[19,76],"problem":[23,49],"has":[24],"a":[25,47,58,65,90,100],"lot":[26],"of":[27,51],"important":[28],"applications":[29],"in":[30],"signal":[31],"processing,":[32],"several":[34],"useful":[35],"algorithms":[36,42],"have":[37],"been":[38],"proposed.":[39],"However":[40],"most":[41],"cannot":[43],"be":[44,79,87,106],"applied":[45,88],"to":[46,89],"because":[50],"high":[52],"computational":[53],"cost.":[54],"proposes":[57],"null":[59],"space":[60],"based":[61],"algorithm,":[62],"which":[63],"low-rank":[66,101],"solution":[67,102],"without":[68,82],"computing":[69],"inverse":[70],"nor":[72],"singular":[73],"value":[74],"decomposition.":[75],"can":[78,86,105],"parallelized":[80],"easily":[81],"any":[83],"approximation":[84],"problem.":[92],"Numerical":[93],"examples":[94],"show":[95],"that":[96],"the":[97],"efficiently":[103],"speed":[107],"up":[108],"by":[109],"GPU":[111],"computing.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}