{"month":"11","date_updated":"2021-01-12T07:42:18Z","type":"book_chapter","day":"14","author":[{"last_name":"Wagner","first_name":"Hubert","full_name":"Wagner, Hubert"},{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen"},{"full_name":"Vuçini, Erald","first_name":"Erald","last_name":"Vuçini"}],"publication":"Topological Methods in Data Analysis and Visualization II","doi":"10.1007/978-3-642-23175-9_7","page":"91 - 106","_id":"3271","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"editor":[{"first_name":"Ronald","last_name":"Peikert","full_name":"Peikert, Ronald"},{"full_name":"Hauser, Helwig","first_name":"Helwig","last_name":"Hauser"},{"last_name":"Carr","first_name":"Hamish","full_name":"Carr, Hamish"},{"first_name":"Raphael","last_name":"Fuchs","full_name":"Fuchs, Raphael"}],"abstract":[{"text":"In this paper we present an efficient framework for computation of persis- tent homology of cubical data in arbitrary dimensions. An existing algorithm using simplicial complexes is adapted to the setting of cubical complexes. The proposed approach enables efficient application of persistent homology in domains where the data is naturally given in a cubical form. By avoiding triangulation of the data, we significantly reduce the size of the complex. We also present a data-structure de- signed to compactly store and quickly manipulate cubical complexes. By means of numerical experiments, we show high speed and memory efficiency of our ap- proach. We compare our framework to other available implementations, showing its superiority. Finally, we report performance on selected 3D and 4D data-sets.","lang":"eng"}],"publication_status":"published","citation":{"mla":"Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical Data.” Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:10.1007/978-3-642-23175-9_7.","ieee":"H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.","chicago":"Wagner, Hubert, Chao Chen, and Erald Vuçini. “Efficient Computation of Persistent Homology for Cubical Data.” In Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert, Helwig Hauser, Hamish Carr, and Raphael Fuchs, 91–106. Springer, 2011. https://doi.org/10.1007/978-3-642-23175-9_7.","ista":"Wagner H, Chen C, Vuçini E. 2011.Efficient computation of persistent homology for cubical data. In: Topological Methods in Data Analysis and Visualization II. Theory, Algorithms, and Applications, , 91–106.","apa":"Wagner, H., Chen, C., & Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, & R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II (pp. 91–106). Springer. https://doi.org/10.1007/978-3-642-23175-9_7","ama":"Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. Topological Methods in Data Analysis and Visualization II. Springer; 2011:91-106. doi:10.1007/978-3-642-23175-9_7","short":"H. Wagner, C. Chen, E. Vuçini, in:, R. Peikert, H. Hauser, H. Carr, R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II, Springer, 2011, pp. 91–106."},"date_published":"2011-11-14T00:00:00Z","year":"2011","publisher":"Springer","scopus_import":1,"oa_version":"None","date_created":"2018-12-11T12:02:23Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"3375","alternative_title":["Theory, Algorithms, and Applications"],"quality_controlled":"1","title":"Efficient computation of persistent homology for cubical data","status":"public"}