[{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1102.3389v1"}],"scopus_import":1,"intvolume":" 15","month":"05","abstract":[{"lang":"eng","text":"Given a continuous function f:X-R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the extended persistence diagram of f. In addition, we quantify the robustness of the homology classes under perturbations of f using well groups, and we show how to read the ranks of these groups from the same extended persistence diagram. The special case X=R3 has ramifications in the fields of medical imaging and scientific visualization."}],"oa_version":"Preprint","volume":15,"issue":"1","publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"2859","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:00:18Z","oa":1,"publisher":"International Press","quality_controlled":"1","page":"51 - 72","date_created":"2018-12-11T11:59:58Z","doi":"10.4310/HHA.2013.v15.n1.a3","date_published":"2013-05-01T00:00:00Z","year":"2013","publication":"Homology, Homotopy and Applications","day":"01","external_id":{"arxiv":["1102.3389"]},"author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","full_name":"Bendich, Paul","last_name":"Bendich"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"},{"first_name":"Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","full_name":"Patel, Amit","last_name":"Patel"}],"publist_id":"3930","title":"Homology and robustness of level and interlevel sets","citation":{"mla":"Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications, vol. 15, no. 1, International Press, 2013, pp. 51–72, doi:10.4310/HHA.2013.v15.n1.a3.","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 2013;15(1):51-72. doi:10.4310/HHA.2013.v15.n1.a3","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2013). Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2013.v15.n1.a3","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, Homology, Homotopy and Applications 15 (2013) 51–72.","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness of level and interlevel sets,” Homology, Homotopy and Applications, vol. 15, no. 1. International Press, pp. 51–72, 2013.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications. International Press, 2013. https://doi.org/10.4310/HHA.2013.v15.n1.a3.","ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"d65f79775b51258a604ca5ec741297cc","file_id":"5116","date_updated":"2020-07-14T12:46:06Z","file_size":280280,"creator":"system","date_created":"2018-12-12T10:15:00Z","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf"}],"volume":33,"issue":"11","abstract":[{"lang":"eng","text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology."}],"oa_version":"Submitted Version","scopus_import":1,"intvolume":" 33","month":"08","date_updated":"2021-01-12T07:42:34Z","ddc":["000"],"file_date_updated":"2020-07-14T12:46:06Z","department":[{"_id":"HeEd"}],"_id":"3310","type":"journal_article","pubrep_id":"542","status":"public","year":"2012","has_accepted_license":"1","publication":"Pattern Recognition Letters","day":"01","page":"1436 - 1444","date_created":"2018-12-11T12:02:36Z","doi":"10.1016/j.patrec.2011.10.007","date_published":"2012-08-01T00:00:00Z","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","oa":1,"quality_controlled":"1","publisher":"Elsevier","citation":{"ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters. Elsevier, 2012. https://doi.org/10.1016/j.patrec.2011.10.007.","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. Pattern Recognition Letters. 2012;33(11):1436-1444. doi:10.1016/j.patrec.2011.10.007","apa":"Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007","ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:10.1016/j.patrec.2011.10.007."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"3330","author":[{"first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","full_name":"Bendich, Paul","last_name":"Bendich"},{"full_name":"Cabello, Sergio","last_name":"Cabello","first_name":"Sergio"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"title":"A point calculus for interlevel set homology"},{"oa_version":"None","acknowledgement":"This research was partially supported by the Defense Advanced Research Projects Agency (DARPA) under grant HR0011-05-1-0007.","abstract":[{"text":"The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper in- corporates this theory into the already developed framework of persistent homology. We demonstrate that persistent intersec- tion homology gives useful information about the relationship between an embedded stratified space and its singularities. We give, and prove the correctness of, an algorithm for the computa- tion of the persistent intersection homology groups of a filtered simplicial complex equipped with a stratification by subcom- plexes. We also derive, from Poincare ́ Duality, some structural results about persistent intersection homology.","lang":"eng"}],"month":"06","intvolume":" 11","publisher":"Springer","quality_controlled":"1","scopus_import":1,"day":"01","publication":"Foundations of Computational Mathematics","language":[{"iso":"eng"}],"publication_status":"published","year":"2011","volume":11,"doi":"10.1007/s10208-010-9081-1","issue":"3","date_published":"2011-06-01T00:00:00Z","date_created":"2018-12-11T12:02:59Z","page":"305 - 336","_id":"3378","status":"public","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:43:04Z","citation":{"apa":"Bendich, P., & Harer, J. (2011). Persistent intersection homology. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-010-9081-1","ama":"Bendich P, Harer J. Persistent intersection homology. Foundations of Computational Mathematics. 2011;11(3):305-336. doi:10.1007/s10208-010-9081-1","short":"P. Bendich, J. Harer, Foundations of Computational Mathematics 11 (2011) 305–336.","ieee":"P. Bendich and J. Harer, “Persistent intersection homology,” Foundations of Computational Mathematics, vol. 11, no. 3. Springer, pp. 305–336, 2011.","mla":"Bendich, Paul, and John Harer. “Persistent Intersection Homology.” Foundations of Computational Mathematics, vol. 11, no. 3, Springer, 2011, pp. 305–36, doi:10.1007/s10208-010-9081-1.","ista":"Bendich P, Harer J. 2011. Persistent intersection homology. Foundations of Computational Mathematics. 11(3), 305–336.","chicago":"Bendich, Paul, and John Harer. “Persistent Intersection Homology.” Foundations of Computational Mathematics. Springer, 2011. https://doi.org/10.1007/s10208-010-9081-1."},"title":"Persistent intersection homology","department":[{"_id":"HeEd"}],"author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Bendich","full_name":"Bendich, Paul"},{"full_name":"Harer, John","last_name":"Harer","first_name":"John"}],"publist_id":"3229"},{"citation":{"ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. https://doi.org/10.1007/978-3-642-15775-2_1.","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “The robustness of level sets,” presented at the ESA: European Symposium on Algorithms, Liverpool, UK, 2010, vol. 6346, pp. 1–10.","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, in:, Springer, 2010, pp. 1–10.","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. https://doi.org/10.1007/978-3-642-15775-2_1","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. The robustness of level sets. In: Vol 6346. Springer; 2010:1-10. doi:10.1007/978-3-642-15775-2_1","mla":"Bendich, Paul, et al. The Robustness of Level Sets. Vol. 6346, Springer, 2010, pp. 1–10, doi:10.1007/978-3-642-15775-2_1."},"date_updated":"2021-01-12T07:52:38Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"2336","author":[{"first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","full_name":"Bendich, Paul","last_name":"Bendich"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"},{"full_name":"Patel, Amit","last_name":"Patel","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","first_name":"Amit"}],"department":[{"_id":"HeEd"}],"title":"The robustness of level sets","_id":"3848","type":"conference","conference":{"name":"ESA: European Symposium on Algorithms","location":"Liverpool, UK","end_date":"2010-09-08","start_date":"2010-09-06"},"status":"public","publication_status":"published","year":"2010","day":"01","language":[{"iso":"eng"}],"page":"1 - 10","doi":"10.1007/978-3-642-15775-2_1","date_published":"2010-09-01T00:00:00Z","volume":6346,"date_created":"2018-12-11T12:05:30Z","abstract":[{"lang":"eng","text":"We define the robustness of a level set homology class of a function f:XR as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology. The special case X=R3 has ramifications in medical imaging and scientific visualization."}],"oa_version":"None","quality_controlled":"1","publisher":"Springer","scopus_import":1,"alternative_title":["LNCS"],"month":"09","intvolume":" 6346"},{"day":"10","year":"2010","has_accepted_license":"1","date_created":"2018-12-11T12:05:30Z","date_published":"2010-08-10T00:00:00Z","doi":"10.1007/978-3-642-15155-2_2","page":"12 - 23","oa":1,"quality_controlled":"1","publisher":"Springer","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Michael Kerber, and Amit Patel. “Persistent Homology under Non-Uniform Error,” 6281:12–23. Springer, 2010. https://doi.org/10.1007/978-3-642-15155-2_2.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.","ieee":"P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23.","apa":"Bendich, P., Edelsbrunner, H., Kerber, M., & Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_2","ama":"Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. In: Vol 6281. Springer; 2010:12-23. doi:10.1007/978-3-642-15155-2_2","mla":"Bendich, Paul, et al. Persistent Homology under Non-Uniform Error. Vol. 6281, Springer, 2010, pp. 12–23, doi:10.1007/978-3-642-15155-2_2."},"title":"Persistent homology under non-uniform error","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","full_name":"Bendich, Paul","last_name":"Bendich"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"id":"34A254A0-F248-11E8-B48F-1D18A9856A87","first_name":"Amit","last_name":"Patel","full_name":"Patel, Amit"}],"publist_id":"2333","language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":142357,"date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2016-537-v1+1_2010-P-05-NonuniformError.pdf","date_created":"2018-12-12T10:13:13Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4994","checksum":"af61e1c2bb42f3d556179d4692caeb1b"}],"publication_status":"published","volume":6281,"oa_version":"Submitted Version","abstract":[{"text":"Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classes. Prior work has shown that the homology and robustness information can be read off the extended persistence diagram of the function. This paper extends these results to a non-uniform error model in which perturbations vary in their magnitude across the domain.","lang":"eng"}],"intvolume":" 6281","month":"08","alternative_title":["LNCS"],"scopus_import":1,"ddc":["000"],"date_updated":"2021-01-12T07:52:38Z","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:17Z","_id":"3849","pubrep_id":"537","status":"public","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","end_date":"2010-08-27","location":"Brno, Czech Republic"},"type":"conference"},{"abstract":[{"lang":"eng","text":"We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to acontinuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can bevisualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchicalalgorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, thedual complexes are geometrically realized in $R^3$ and can thus be used to construct level and interlevel sets. We apply these tools tostudy 3-dimensional images of plant root systems."}],"oa_version":"Submitted Version","scopus_import":1,"month":"10","intvolume":" 16","publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5262","checksum":"f6d813c04f4b46023cec6b9a17f15472","date_updated":"2020-07-14T12:46:21Z","file_size":721994,"creator":"system","date_created":"2018-12-12T10:17:10Z","file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf"}],"language":[{"iso":"eng"}],"issue":"6","volume":16,"_id":"3901","type":"journal_article","status":"public","pubrep_id":"536","date_updated":"2021-01-12T07:53:04Z","ddc":["000"],"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:21Z","quality_controlled":"1","publisher":"IEEE","oa":1,"has_accepted_license":"1","year":"2010","day":"28","publication":"IEEE Transactions of Visualization and Computer Graphics","page":"1251 - 1260","date_published":"2010-10-28T00:00:00Z","doi":"10.1109/TVCG.2010.139","date_created":"2018-12-11T12:05:47Z","citation":{"mla":"Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:10.1109/TVCG.2010.139.","ieee":"P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.","apa":"Bendich, P., Edelsbrunner, H., & Kerber, M. (2010). Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2010.139","ama":"Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 2010;16(6):1251-1260. doi:10.1109/TVCG.2010.139","chicago":"Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” IEEE Transactions of Visualization and Computer Graphics. IEEE, 2010. https://doi.org/10.1109/TVCG.2010.139.","ista":"Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bendich","full_name":"Bendich, Paul","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"}],"publist_id":"2253","title":"Computing robustness and persistence for images"},{"abstract":[{"text":"We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a I-parameter family of neighborhoods of a point to assess the local homology of the stratified space at that point. We prove the correctness of this assessment under the assumption of a sufficiently dense sample. We also give an algorithm that constructs the vineyard and makes the local assessment in time at most cubic in the size of the Delaunay triangulation of the point sample.","lang":"eng"}],"publisher":"IEEE","quality_controlled":0,"month":"01","year":"2007","publication_status":"published","day":"01","page":"536 - 546","date_created":"2018-12-11T12:06:13Z","doi":"10.1109/FOCS.2007.33","date_published":"2007-01-01T00:00:00Z","_id":"3975","conference":{"name":"FOCS: Foundations of Computer Science"},"type":"conference","status":"public","date_updated":"2021-01-12T07:53:35Z","citation":{"chicago":"Bendich, Paul, David Cohen Steiner, Herbert Edelsbrunner, John Harer, and Dmitriy Morozov. “Inferring Local Homology from Sampled Stratified Spaces,” 536–46. IEEE, 2007. https://doi.org/10.1109/FOCS.2007.33.","ista":"Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring local homology from sampled stratified spaces. FOCS: Foundations of Computer Science, 536–546.","mla":"Bendich, Paul, et al. Inferring Local Homology from Sampled Stratified Spaces. IEEE, 2007, pp. 536–46, doi:10.1109/FOCS.2007.33.","short":"P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, D. Morozov, in:, IEEE, 2007, pp. 536–546.","ieee":"P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, and D. Morozov, “Inferring local homology from sampled stratified spaces,” presented at the FOCS: Foundations of Computer Science, 2007, pp. 536–546.","apa":"Bendich, P., Cohen Steiner, D., Edelsbrunner, H., Harer, J., & Morozov, D. (2007). Inferring local homology from sampled stratified spaces (pp. 536–546). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2007.33","ama":"Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. Inferring local homology from sampled stratified spaces. In: IEEE; 2007:536-546. doi:10.1109/FOCS.2007.33"},"extern":1,"author":[{"last_name":"Bendich","full_name":"Paul Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"last_name":"Cohen Steiner","full_name":"Cohen-Steiner, David","first_name":"David"},{"full_name":"Herbert Edelsbrunner","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Harer","full_name":"Harer, John","first_name":"John"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"}],"publist_id":"2150","title":"Inferring local homology from sampled stratified spaces"}]