{"id":"https://openalex.org/W2054199929","doi":"https://doi.org/10.1109/cvpr.2011.5995679","title":"Graph connectivity in sparse subspace clustering","display_name":"Graph connectivity in sparse subspace clustering","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2054199929","doi":"https://doi.org/10.1109/cvpr.2011.5995679","mag":"2054199929"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2011.5995679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CVPR 2011","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/A5054868377","display_name":"Behrooz Nasihatkon","orcid":"https://orcid.org/0000-0002-6190-3890"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]},{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Behrooz Nasihatkon","raw_affiliation_strings":["National ICT Australia (NICTA), Australian National University, Australia","Australian National University, National ICT Australia (NICTA)"],"affiliations":[{"raw_affiliation_string":"National ICT Australia (NICTA), Australian National University, Australia","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I118347636"]},{"raw_affiliation_string":"Australian National University, National ICT Australia (NICTA)","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I118347636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020216442","display_name":"Richard Hartley","orcid":"https://orcid.org/0000-0002-5005-0191"},"institutions":[{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]},{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Richard Hartley","raw_affiliation_strings":["National ICT Australia (NICTA), Australian National University, Australia","Australian National University, National ICT Australia (NICTA)"],"affiliations":[{"raw_affiliation_string":"National ICT Australia (NICTA), Australian National University, Australia","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I118347636"]},{"raw_affiliation_string":"Australian National University, National ICT Australia (NICTA)","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054868377"],"corresponding_institution_ids":["https://openalex.org/I118347636","https://openalex.org/I42894916"],"apc_list":null,"apc_paid":null,"fwci":5.9877,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.96582739,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"2137","last_page":"2144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994000196456909,"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":0.9994000196456909,"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/T10689","display_name":"Remote-Sensing Image Classification","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/T10057","display_name":"Face and Expression Recognition","score":0.9721999764442444,"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/linear-subspace","display_name":"Linear subspace","score":0.7556366324424744},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.714086651802063},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5710084438323975},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5675516128540039},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5475791096687317},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.489167720079422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46474263072013855},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4632832407951355},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.45651885867118835},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.446707546710968},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4359120726585388},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3996064066886902},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3663599193096161},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.11518621444702148}],"concepts":[{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.7556366324424744},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.714086651802063},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5710084438323975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5675516128540039},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5475791096687317},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.489167720079422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46474263072013855},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4632832407951355},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.45651885867118835},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.446707546710968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4359120726585388},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3996064066886902},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3663599193096161},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.11518621444702148}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cvpr.2011.5995679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2011.5995679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"CVPR 2011","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.469.2838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.469.2838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.cecs.anu.edu.au/~u4716751/2011-Graph Connectivity In Sparse Subspace Clustering.pdf","raw_type":"text"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/63677","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/63677","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Graph connectivity in sparse subspace clustering","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1587069887","https://openalex.org/W1986931325","https://openalex.org/W2002260165","https://openalex.org/W2003217181","https://openalex.org/W2056639756","https://openalex.org/W2075632264","https://openalex.org/W2119197726","https://openalex.org/W2125742596","https://openalex.org/W2136762275","https://openalex.org/W2152714163","https://openalex.org/W4210631977","https://openalex.org/W4250657332","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2380748039","https://openalex.org/W2065962751","https://openalex.org/W2069324581","https://openalex.org/W2121787161","https://openalex.org/W2066106635","https://openalex.org/W2547150524","https://openalex.org/W35176419","https://openalex.org/W2090100305","https://openalex.org/W2279114381","https://openalex.org/W2016708865"],"abstract_inverted_index":{"Sparse":[0],"Subspace":[1],"Clustering":[2],"(SSC)":[3],"is":[4,17,65,78,82,90,102,141,167],"one":[5],"of":[6,38,56,62,73,97,121,132,157],"the":[7,22,31,42,50,59,68,71,85,94,98,105,108,119,126,137,144],"recent":[8],"approaches":[9],"to":[10,135],"subspace":[11,64,77,86,148],"segmentation.":[12],"In":[13],"SSC":[14,89],"a":[15,54,172],"graph":[16],"constructed":[18],"whose":[19,26],"nodes":[20],"are":[21,28],"data":[23],"points":[24,51],"and":[25,118,152],"edges":[27],"inferred":[29],"from":[30,67],"L":[32,112],"<sup":[33,113],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[34,114],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[35,115],"-sparse":[36],"representation":[37,110],"each":[39,63,76,147],"point":[40],"by":[41,125,170],"others.":[43,69],"It":[44],"has":[45],"been":[46],"proved":[47,142,168],"that":[48,143],"if":[49],"lie":[52],"on":[53,92],"mixture":[55],"independent":[57],"subspaces,":[58],"graphical":[60],"structure":[61],"disconnected":[66],"However,":[70],"problem":[72,138],"connectivity":[74,145,158],"within":[75,146],"still":[79],"unanswered.":[80],"This":[81],"important":[83],"since":[84],"segmentation":[87],"in":[88,174],"based":[91],"finding":[93],"connected":[95],"components":[96],"graph.":[99],"Our":[100],"analysis":[101],"built":[103],"upon":[104],"connection":[106],"between":[107],"sparse":[109],"through":[111],"-norm":[116],"minimization":[117],"geometry":[120],"convex":[122],"poly-topes":[123],"proposed":[124],"compressed":[127],"sensing":[128],"community.":[129],"After":[130],"introduction":[131],"some":[133],"assumptions":[134],"make":[136],"well-defined,":[139],"it":[140],"holds":[149],"for":[150,159,164],"2-":[151],"3-dimensional":[153],"subspaces.":[154],"The":[155],"claim":[156],"general":[160],"d-dimensional":[161],"case,":[162],"even":[163],"generic":[165],"configurations,":[166],"false":[169],"giving":[171],"counterexample":[173],"dimensions":[175],"greater":[176],"than":[177],"3.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}