[{"page":"1 - 10","corr_author":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"09","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-642-15775-2_1","date_published":"2010-09-01T00:00:00Z","date_updated":"2024-10-09T20:54:09Z","date_created":"2018-12-11T12:05:30Z","day":"01","alternative_title":["LNCS"],"publist_id":"2336","status":"public","title":"The robustness of level sets","quality_controlled":"1","conference":{"location":"Liverpool, UK","end_date":"2010-09-08","name":"ESA: European Symposium on Algorithms","start_date":"2010-09-06"},"author":[{"full_name":"Bendich, Paul","first_name":"Paul","last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Morozov, Dmitriy","first_name":"Dmitriy","last_name":"Morozov"},{"first_name":"Amit","full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","last_name":"Patel"}],"type":"conference","intvolume":"      6346","doi":"10.1007/978-3-642-15775-2_1","volume":6346,"language":[{"iso":"eng"}],"citation":{"mla":"Bendich, Paul, et al. <i>The Robustness of Level Sets</i>. Vol. 6346, Springer, 2010, pp. 1–10, doi:<a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">10.1007/978-3-642-15775-2_1</a>.","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.","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. The robustness of level sets. In: Vol 6346. Springer; 2010:1-10. doi:<a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">10.1007/978-3-642-15775-2_1</a>","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">https://doi.org/10.1007/978-3-642-15775-2_1</a>","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">https://doi.org/10.1007/978-3-642-15775-2_1</a>.","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, in:, Springer, 2010, pp. 1–10.","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."},"_id":"3848","oa_version":"None","abstract":[{"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.","lang":"eng"}],"year":"2010","department":[{"_id":"HeEd"}],"publisher":"Springer"},{"year":"2010","_id":"3849","oa_version":"Submitted Version","pubrep_id":"537","language":[{"iso":"eng"}],"type":"conference","file":[{"file_id":"4994","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2016-537-v1+1_2010-P-05-NonuniformError.pdf","relation":"main_file","creator":"system","file_size":142357,"content_type":"application/pdf","checksum":"af61e1c2bb42f3d556179d4692caeb1b","access_level":"open_access","date_created":"2018-12-12T10:13:13Z"}],"volume":6281,"alternative_title":["LNCS"],"publist_id":"2333","day":"10","title":"Persistent homology under non-uniform error","oa":1,"date_published":"2010-08-10T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-15155-2_2","page":"12 - 23","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","has_accepted_license":"1","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"}],"file_date_updated":"2020-07-14T12:46:17Z","department":[{"_id":"HeEd"}],"citation":{"mla":"Bendich, Paul, et al. <i>Persistent Homology under Non-Uniform Error</i>. Vol. 6281, Springer, 2010, pp. 12–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">10.1007/978-3-642-15155-2_2</a>.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Michael Kerber, and Amit Patel. “Persistent Homology under Non-Uniform Error,” 6281:12–23. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">https://doi.org/10.1007/978-3-642-15155-2_2</a>.","ama":"Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. In: Vol 6281. Springer; 2010:12-23. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">10.1007/978-3-642-15155-2_2</a>","apa":"Bendich, P., Edelsbrunner, H., Kerber, M., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">https://doi.org/10.1007/978-3-642-15155-2_2</a>","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.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.","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."},"ddc":["000"],"author":[{"first_name":"Paul","full_name":"Bendich, Paul","last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael"},{"id":"34A254A0-F248-11E8-B48F-1D18A9856A87","last_name":"Patel","full_name":"Patel, Amit","first_name":"Amit"}],"doi":"10.1007/978-3-642-15155-2_2","intvolume":"      6281","quality_controlled":"1","conference":{"end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","location":"Brno, Czech Republic"},"date_created":"2018-12-11T12:05:30Z","status":"public","publication_status":"published","date_updated":"2021-01-12T07:52:38Z","month":"08"},{"year":"2010","_id":"3850","abstract":[{"text":"Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape with a disk of fixed radius? If it does, we also seek a preferably simple solution shape P;P’s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give a decision algorithm for fixed radius in O(nlogn) time that handles any polygonal shape. For convex shapes, the complexity drops to O(n), which is also the time required to compute a solution shape P with at most one more vertex than a vertex-minimal one.","lang":"eng"}],"oa_version":"None","department":[{"_id":"HeEd"}],"publisher":"TU Dortmund","type":"conference","author":[{"last_name":"Berberich","first_name":"Eric","full_name":"Berberich, Eric"},{"first_name":"Dan","full_name":"Halperin, Dan","last_name":"Halperin"},{"orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"},{"full_name":"Pogalnikova, Roza","first_name":"Roza","last_name":"Pogalnikova"}],"citation":{"mla":"Berberich, Eric, et al. <i>Polygonal Reconstruction from Approximate Offsets</i>. TU Dortmund, 2010, pp. 12–23.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Polygonal Reconstruction from Approximate Offsets,” 12–23. TU Dortmund, 2010.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Polygonal reconstruction from approximate offsets. In: TU Dortmund; 2010:12-23.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, TU Dortmund, 2010, pp. 12–23.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23."},"language":[{"iso":"eng"}],"publist_id":"2334","day":"01","date_created":"2018-12-11T12:05:30Z","title":"Polygonal reconstruction from approximate offsets","status":"public","quality_controlled":"1","conference":{"location":"Dortmund, Germany","end_date":"2010-03-24","name":"EuroCG: European Workshop on Computational Geometry","start_date":"2010-03-22"},"page":"12 - 23","month":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2010-01-01T00:00:00Z","date_updated":"2021-01-12T07:52:39Z"},{"day":"18","alternative_title":["LNCS"],"publist_id":"2328","title":"Mean-payoff automaton expressions","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-15375-4_19","date_published":"2010-11-18T00:00:00Z","corr_author":"1","page":"269 - 283","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","_id":"3853","year":"2010","pubrep_id":"62","language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","file_id":"5163","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","access_level":"open_access","checksum":"4f753ae99d076553fb8733e2c8b390e2","creator":"system","file_size":233260,"date_created":"2018-12-12T10:15:41Z"}],"type":"conference","volume":6269,"quality_controlled":"1","conference":{"location":"Paris, France","end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","start_date":"2010-08-31"},"date_created":"2018-12-11T12:05:31Z","status":"public","publication_status":"published","date_updated":"2024-10-09T20:54:08Z","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"ec_funded":1,"month":"11","has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","abstract":[{"text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions.","lang":"eng"}],"department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:17Z","citation":{"short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>.","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &#38; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>."},"ddc":["000","005"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Rannou, Philippe","first_name":"Philippe","last_name":"Rannou"}],"intvolume":"      6269","doi":"10.1007/978-3-642-15375-4_19"},{"month":"10","issue":"6","date_updated":"2025-09-30T09:30:22Z","publication_status":"published","status":"public","date_created":"2018-12-11T12:05:47Z","external_id":{"isi":["000283758600045"]},"quality_controlled":"1","intvolume":"        16","doi":"10.1109/TVCG.2010.139","author":[{"full_name":"Bendich, Paul","first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","last_name":"Bendich"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"}],"citation":{"chicago":"Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE, 2010. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>.","ieee":"P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.","ama":"Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. 2010;16(6):1251-1260. doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>","apa":"Bendich, P., Edelsbrunner, H., &#38; Kerber, M. (2010). Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>","mla":"Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>.","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.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260."},"ddc":["000"],"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:21Z","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"has_accepted_license":"1","publisher":"IEEE","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","corr_author":"1","page":"1251 - 1260","fulldoi":"https://doi.org/10.1109/TVCG.2010.139","date_published":"2010-10-28T00:00:00Z","oa":1,"isi":1,"title":"Computing robustness and persistence for images","publist_id":"2253","day":"28","publication":"IEEE Transactions of Visualization and Computer Graphics","volume":16,"file":[{"date_created":"2018-12-12T10:17:10Z","date_updated":"2020-07-14T12:46:21Z","file_id":"5262","relation":"main_file","file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf","file_size":721994,"creator":"system","checksum":"f6d813c04f4b46023cec6b9a17f15472","access_level":"open_access","content_type":"application/pdf"}],"type":"journal_article","language":[{"iso":"eng"}],"pubrep_id":"536","_id":"3901","oa_version":"Submitted Version","year":"2010"},{"oa_version":"None","_id":"3782","year":"2010","acknowledgement":"Partially supported by the Austri an Science Fund unde r grant P20134-N13.\r\nWe thank Helena Molina-Abril for very helpful discussion. We thank anonymous reviewers for helpful comments.","language":[{"iso":"eng"}],"type":"conference","volume":6533,"publication":"Conference proceedings MCV 2010","alternative_title":["LNCS"],"day":"31","publist_id":"2445","title":"Topology noise removal for curve  and surface evolution","fulldoi":"https://doi.org/10.1007/978-3-642-18421-5_4","date_published":"2010-12-31T00:00:00Z","page":"31 - 42","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","publisher":"Springer","article_processing_charge":"No","abstract":[{"text":"In cortex surface segmentation, the extracted surface is required to have a particular topology, namely, a two-sphere. We present a new method for removing topology noise of a curve or surface within the level set framework, and thus produce a cortical surface with correct topology. We define a new energy term which quantifies topology noise. We then show how to minimize this term by computing its functional derivative with respect to the level set function. This method differs from existing methods in that it is inherently continuous and not digital; and in the way that our energy directly relates to the topology of the underlying curve or surface, versus existing knot-based measures which are related in a more indirect fashion. The proposed flow is validated empirically.","lang":"eng"}],"department":[{"_id":"HeEd"}],"citation":{"mla":"Chen, Chao, and Daniel Freedman. “Topology Noise Removal for Curve  and Surface Evolution.” <i>Conference Proceedings MCV 2010</i>, vol. 6533, Springer, 2010, pp. 31–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">10.1007/978-3-642-18421-5_4</a>.","apa":"Chen, C., &#38; Freedman, D. (2010). Topology noise removal for curve  and surface evolution. In <i>Conference proceedings MCV 2010</i> (Vol. 6533, pp. 31–42). Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">https://doi.org/10.1007/978-3-642-18421-5_4</a>","ama":"Chen C, Freedman D. Topology noise removal for curve  and surface evolution. In: <i>Conference Proceedings MCV 2010</i>. Vol 6533. Springer; 2010:31-42. doi:<a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">10.1007/978-3-642-18421-5_4</a>","ieee":"C. Chen and D. Freedman, “Topology noise removal for curve  and surface evolution,” in <i>Conference proceedings MCV 2010</i>, Beijing, China, 2010, vol. 6533, pp. 31–42.","chicago":"Chen, Chao, and Daniel Freedman. “Topology Noise Removal for Curve  and Surface Evolution.” In <i>Conference Proceedings MCV 2010</i>, 6533:31–42. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-18421-5_4\">https://doi.org/10.1007/978-3-642-18421-5_4</a>.","ista":"Chen C, Freedman D. 2010. Topology noise removal for curve  and surface evolution. Conference proceedings MCV 2010. MCV: Medical Computer Vision, LNCS, vol. 6533, 31–42.","short":"C. Chen, D. Freedman, in:, Conference Proceedings MCV 2010, Springer, 2010, pp. 31–42."},"author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chao","full_name":"Chen, Chao"},{"last_name":"Freedman","first_name":"Daniel","full_name":"Freedman, Daniel"}],"intvolume":"      6533","doi":"10.1007/978-3-642-18421-5_4","quality_controlled":"1","conference":{"end_date":"2010-09-20","start_date":"2010-09-20","name":"MCV: Medical Computer Vision","location":"Beijing, China"},"date_created":"2018-12-11T12:05:08Z","status":"public","publication_status":"published","date_updated":"2026-07-07T13:07:08Z","month":"12"},{"date_created":"2018-12-11T12:06:10Z","status":"public","quality_controlled":"1","conference":{"end_date":"2009-12-02","start_date":"2009-11-29","name":"3DPH: Modelling the Physiological Human","location":"Zermatt, Switzerland"},"month":"11","publication_status":"published","date_updated":"2024-10-09T20:53:56Z","abstract":[{"text":"We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in image processing but is closer to its mathematical roots, which are Morse theory and homological algebra. It allows for the implicit treatment of an underlying mesh, thus combining the structural integrity of its mathematical foundations with the computational efficiency of image processing.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:21Z","department":[{"_id":"HeEd"}],"publisher":"Springer","has_accepted_license":"1","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"John","full_name":"Harer, John","last_name":"Harer"}],"doi":"10.1007/978-3-642-10470-1_4","intvolume":"      5903","ddc":["000"],"citation":{"mla":"Edelsbrunner, Herbert, and John Harer. <i>The Persistent Morse Complex Segmentation of a 3-Manifold</i>. Vol. 5903, Springer, 2009, pp. 36–50, doi:<a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">10.1007/978-3-642-10470-1_4</a>.","chicago":"Edelsbrunner, Herbert, and John Harer. “The Persistent Morse Complex Segmentation of a 3-Manifold,” 5903:36–50. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">https://doi.org/10.1007/978-3-642-10470-1_4</a>.","ieee":"H. Edelsbrunner and J. Harer, “The persistent Morse complex segmentation of a 3-manifold,” presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland, 2009, vol. 5903, pp. 36–50.","ama":"Edelsbrunner H, Harer J. The persistent Morse complex segmentation of a 3-manifold. In: Vol 5903. Springer; 2009:36-50. doi:<a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">10.1007/978-3-642-10470-1_4</a>","apa":"Edelsbrunner, H., &#38; Harer, J. (2009). The persistent Morse complex segmentation of a 3-manifold (Vol. 5903, pp. 36–50). Presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-10470-1_4\">https://doi.org/10.1007/978-3-642-10470-1_4</a>","short":"H. Edelsbrunner, J. Harer, in:, Springer, 2009, pp. 36–50.","ista":"Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50."},"alternative_title":["LNCS"],"publist_id":"2160","day":"17","title":"The persistent Morse complex segmentation of a 3-manifold","corr_author":"1","page":"36 - 50","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"oa":1,"date_published":"2009-11-17T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-10470-1_4","year":"2009","oa_version":"Submitted Version","_id":"3968","file":[{"file_name":"IST-2016-535-v1+1_2009-P-04-3ManifoldSegmentation.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:21Z","file_id":"4694","access_level":"open_access","checksum":"11fc85bcc19bab1f020e706a4b8a4660","content_type":"application/pdf","file_size":165090,"creator":"system","date_created":"2018-12-12T10:08:33Z"}],"type":"conference","volume":5903,"acknowledgement":"This research was partially supported by Geomagic, Inc., and by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0007 and HR0011-05-1-0057.","pubrep_id":"535","language":[{"iso":"eng"}]}]