[{"title":"Group-valued regularization for analysis of articulated motion","article_processing_charge":"No","oa_version":"None","date_created":"2024-10-15T11:20:54Z","doi":"10.1007/978-3-642-33863-2_6","abstract":[{"lang":"eng","text":"We present a novel method for estimation of articulated motion in depth scans. The method is based on a framework for regularization of vector- and matrix- valued functions on parametric surfaces.\r\n\r\nWe extend augmented-Lagrangian total variation regularization to smooth rigid motion cues on the scanned 3D surface obtained from a range scanner. We demonstrate the resulting smoothed motion maps to be a powerful tool in articulated scene understanding, providing a basis for rigid parts segmentation, with little prior assumptions on the scene, despite the noisy depth measurements that often appear in commodity depth scanners."}],"type":"conference","month":"08","publication_identifier":{"eisbn":["9783642338632"],"isbn":["9783642338625"],"issn":["0302-9743"],"eissn":["1611-3349"]},"_id":"18348","date_published":"2012-08-31T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","intvolume":"      7583","alternative_title":["LNCS"],"day":"31","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":7583,"issue":"Part 1","quality_controlled":"1","year":"2012","author":[{"last_name":"Rosman","first_name":"Guy","full_name":"Rosman, Guy"},{"first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"last_name":"Tai","first_name":"Xue-Cheng","full_name":"Tai, Xue-Cheng"},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"date_updated":"2025-01-16T12:29:07Z","extern":"1","scopus_import":"1","conference":{"name":"ECCV: European Conference on Computer Vision","start_date":"2012-10-07","end_date":"2012-10-13","location":"Florence, Italy"},"publisher":"Springer Nature","status":"public","publication":"Computer Vision, ECCV 2012 - Workshops and Demonstrations","citation":{"ieee":"G. Rosman, A. M. Bronstein, M. M. Bronstein, X.-C. Tai, and R. Kimmel, “Group-valued regularization for analysis of articulated motion,” in <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, Florence, Italy, 2012, vol. 7583, no. Part 1, pp. 52–62.","mla":"Rosman, Guy, et al. “Group-Valued Regularization for Analysis of Articulated Motion.” <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, vol. 7583, no. Part 1, Springer Nature, 2012, pp. 52–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">10.1007/978-3-642-33863-2_6</a>.","apa":"Rosman, G., Bronstein, A. M., Bronstein, M. M., Tai, X.-C., &#38; Kimmel, R. (2012). Group-valued regularization for analysis of articulated motion. In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i> (Vol. 7583, pp. 52–62). Florence, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">https://doi.org/10.1007/978-3-642-33863-2_6</a>","ama":"Rosman G, Bronstein AM, Bronstein MM, Tai X-C, Kimmel R. Group-valued regularization for analysis of articulated motion. In: <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>. Vol 7583. Springer Nature; 2012:52-62. doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">10.1007/978-3-642-33863-2_6</a>","chicago":"Rosman, Guy, Alex M. Bronstein, Michael M. Bronstein, Xue-Cheng Tai, and Ron Kimmel. “Group-Valued Regularization for Analysis of Articulated Motion.” In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, 7583:52–62. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_6\">https://doi.org/10.1007/978-3-642-33863-2_6</a>.","short":"G. Rosman, A.M. Bronstein, M.M. Bronstein, X.-C. Tai, R. Kimmel, in:, Computer Vision, ECCV 2012 - Workshops and Demonstrations, Springer Nature, 2012, pp. 52–62.","ista":"Rosman G, Bronstein AM, Bronstein MM, Tai X-C, Kimmel R. 2012. Group-valued regularization for analysis of articulated motion. Computer Vision, ECCV 2012 - Workshops and Demonstrations. ECCV: European Conference on Computer Vision, LNCS, vol. 7583, 52–62."},"page":"52-62"},{"date_published":"2012-08-31T00:00:00Z","_id":"18349","publication_status":"published","intvolume":"      7583","language":[{"iso":"eng"}],"title":"Stable Spectral Mesh Filtering","article_processing_charge":"No","oa_version":"None","date_created":"2024-10-15T11:20:54Z","doi":"10.1007/978-3-642-33863-2_9","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642338625","9783642338632"]},"abstract":[{"lang":"eng","text":"The rapid development of 3D acquisition technology has brought with itself the need to perform standard signal processing operations such as filters on 3D data. It has been shown that the eigenfunctions of the Laplace-Beltrami operator (manifold harmonics) of a surface play the role of the Fourier basis in the Euclidean space; it is thus possible to formulate signal analysis and synthesis in the manifold harmonics basis. In particular, geometry filtering can be carried out in the manifold harmonics domain by decomposing the embedding coordinates of the shape in this basis. However, since the basis functions depend on the shape itself, such filtering is valid only for weak (near all-pass) filters, and produces severe artifacts otherwise. In this paper, we analyze this problem and propose the fractional filtering approach, wherein we apply iteratively weak fractional powers of the filter, followed by the update of the basis functions. Experimental results show that such a process produces more plausible and meaningful results."}],"month":"08","type":"conference","date_updated":"2025-01-16T11:49:13Z","extern":"1","year":"2012","author":[{"full_name":"Kovnatsky, Artiom","first_name":"Artiom","last_name":"Kovnatsky"},{"last_name":"Bronstein","first_name":"Michael M.","full_name":"Bronstein, Michael M."},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","first_name":"Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"publication":"Computer Vision, ECCV 2012 - Workshops and Demonstrations","status":"public","citation":{"short":"A. Kovnatsky, M.M. Bronstein, A.M. Bronstein, in:, Computer Vision, ECCV 2012 - Workshops and Demonstrations, Springer Nature, 2012, pp. 83–91.","chicago":"Kovnatsky, Artiom, Michael M. Bronstein, and Alex M. Bronstein. “Stable Spectral Mesh Filtering.” In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, 7583:83–91. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">https://doi.org/10.1007/978-3-642-33863-2_9</a>.","ista":"Kovnatsky A, Bronstein MM, Bronstein AM. 2012. Stable Spectral Mesh Filtering. Computer Vision, ECCV 2012 - Workshops and Demonstrations. ECCV: European Conference on Computer Vision, LNCS, vol. 7583, 83–91.","mla":"Kovnatsky, Artiom, et al. “Stable Spectral Mesh Filtering.” <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, vol. 7583, no. Part 1, Springer Nature, 2012, pp. 83–91, doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">10.1007/978-3-642-33863-2_9</a>.","ieee":"A. Kovnatsky, M. M. Bronstein, and A. M. Bronstein, “Stable Spectral Mesh Filtering,” in <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>, Florence, Italy, 2012, vol. 7583, no. Part 1, pp. 83–91.","ama":"Kovnatsky A, Bronstein MM, Bronstein AM. Stable Spectral Mesh Filtering. In: <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i>. Vol 7583. Springer Nature; 2012:83-91. doi:<a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">10.1007/978-3-642-33863-2_9</a>","apa":"Kovnatsky, A., Bronstein, M. M., &#38; Bronstein, A. M. (2012). Stable Spectral Mesh Filtering. In <i>Computer Vision, ECCV 2012 - Workshops and Demonstrations</i> (Vol. 7583, pp. 83–91). Florence, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33863-2_9\">https://doi.org/10.1007/978-3-642-33863-2_9</a>"},"page":"83-91","scopus_import":"1","publisher":"Springer Nature","conference":{"end_date":"2012-10-13","start_date":"2012-10-07","name":"ECCV: European Conference on Computer Vision","location":"Florence, Italy"},"volume":7583,"issue":"Part 1","alternative_title":["LNCS"],"day":"31","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"language":[{"iso":"eng"}],"conference":{"name":"International Workshop on Theoretical Foundations of Computer Vision","start_date":"2011-06-26","end_date":"2011-07-01","location":"Dagstuhl, Germany"},"publisher":"Springer Nature","scopus_import":"1","citation":{"ama":"Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. Equi-affine invariant geometries of articulated objects. In: <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>. Vol 7474. Springer Nature; 2012:177-190. doi:<a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">10.1007/978-3-642-34091-8_8</a>","mla":"Raviv, Dan, et al. “Equi-Affine Invariant Geometries of Articulated Objects.” <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>, vol. 7474, Springer Nature, 2012, pp. 177–90, doi:<a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">10.1007/978-3-642-34091-8_8</a>.","ieee":"D. Raviv, A. M. Bronstein, M. M. Bronstein, R. Kimmel, and N. Sochen, “Equi-affine invariant geometries of articulated objects,” in <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>, Dagstuhl, Germany, 2012, vol. 7474, pp. 177–190.","apa":"Raviv, D., Bronstein, A. M., Bronstein, M. M., Kimmel, R., &#38; Sochen, N. (2012). Equi-affine invariant geometries of articulated objects. In <i>15th International Workshop on Theoretical Foundations of Computer Vision</i> (Vol. 7474, pp. 177–190). Dagstuhl, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">https://doi.org/10.1007/978-3-642-34091-8_8</a>","ista":"Raviv D, Bronstein AM, Bronstein MM, Kimmel R, Sochen N. 2012. Equi-affine invariant geometries of articulated objects. 15th International Workshop on Theoretical Foundations of Computer Vision. International Workshop on Theoretical Foundations of Computer Vision, LNCS, vol. 7474, 177–190.","chicago":"Raviv, Dan, Alex M. Bronstein, Michael M. Bronstein, Ron Kimmel, and Nir Sochen. “Equi-Affine Invariant Geometries of Articulated Objects.” In <i>15th International Workshop on Theoretical Foundations of Computer Vision</i>, 7474:177–90. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34091-8_8\">https://doi.org/10.1007/978-3-642-34091-8_8</a>.","short":"D. Raviv, A.M. Bronstein, M.M. Bronstein, R. Kimmel, N. Sochen, in:, 15th International Workshop on Theoretical Foundations of Computer Vision, Springer Nature, 2012, pp. 177–190."},"page":"177-190","status":"public","intvolume":"      7474","publication":"15th International Workshop on Theoretical Foundations of Computer Vision","publication_status":"published","author":[{"last_name":"Raviv","first_name":"Dan","full_name":"Raviv, Dan"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"full_name":"Bronstein, Michael M.","last_name":"Bronstein","first_name":"Michael M."},{"last_name":"Kimmel","first_name":"Ron","full_name":"Kimmel, Ron"},{"full_name":"Sochen, Nir","first_name":"Nir","last_name":"Sochen"}],"year":"2012","_id":"18350","extern":"1","date_published":"2012-09-01T00:00:00Z","date_updated":"2025-01-16T10:12:48Z","month":"09","type":"conference","abstract":[{"lang":"eng","text":"We introduce an (equi-)affine invariant geometric structure by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to evaluate a new form of geodesic distances and to construct an invariant Laplacian from which local and global diffusion geometry is constructed. Applications of the proposed framework demonstrate its power in generalizing and enriching the existing set of tools for shape analysis."}],"quality_controlled":"1","publication_identifier":{"isbn":["9783642340901"],"eisbn":["9783642340918"],"eissn":["1611-3349"],"issn":["0302-9743"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","alternative_title":["LNCS"],"date_created":"2024-10-15T11:20:54Z","doi":"10.1007/978-3-642-34091-8_8","oa_version":"None","article_processing_charge":"No","title":"Equi-affine invariant geometries of articulated objects","volume":7474},{"date_updated":"2024-10-09T21:02:34Z","year":"2012","author":[{"last_name":"Bouajjani","first_name":"Ahmed","full_name":"Bouajjani, Ahmed"},{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","first_name":"Cezara","last_name":"Dragoi"},{"last_name":"Enea","first_name":"Constantin","full_name":"Enea, Constantin"},{"first_name":"Mihaela","last_name":"Sighireanu","full_name":"Sighireanu, Mihaela"}],"status":"public","publication":"Automated Technology for Verification and Analysis","page":"167-182","citation":{"short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.","chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In <i>Automated Technology for Verification and Analysis</i>, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>.","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in <i>Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>","apa":"Bouajjani, A., Dragoi, C., Enea, C., &#38; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">https://doi.org/10.1007/978-3-642-33386-6_14</a>","mla":"Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_14\">10.1007/978-3-642-33386-6_14</a>."},"scopus_import":"1","conference":{"end_date":"2012-10-06","start_date":"2012-10-03","name":"ATVA: Automated Technology for Verification and Analysis","location":"Thiruvananthapuram, India"},"publisher":"Springer","volume":7561,"series_title":"LNCS","alternative_title":["LNCS"],"day":"15","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","date_published":"2012-10-15T00:00:00Z","_id":"10903","publication_status":"published","intvolume":"      7561","language":[{"iso":"eng"}],"title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data","article_processing_charge":"No","date_created":"2022-03-21T07:58:39Z","oa_version":"None","doi":"10.1007/978-3-642-33386-6_14","department":[{"_id":"ToHe"}],"publication_identifier":{"eisbn":["9783642333866"],"isbn":["9783642333859"],"eissn":["1611-3349"],"issn":["0302-9743"]},"place":"Berlin, Heidelberg","corr_author":"1","acknowledgement":"This work has been partially supported by the French ANR project Veridyc","abstract":[{"lang":"eng","text":"We propose a logic-based framework for automated reasoning about sequential programs manipulating singly-linked lists and arrays with unbounded data. We introduce the logic SLAD, which allows combining shape constraints, written in a fragment of Separation Logic, with data and size constraints. We address the problem of checking the entailment between SLAD formulas, which is crucial in performing pre-post condition reasoning. Although this problem is undecidable in general for SLAD, we propose a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools. We prove that this procedure is complete, i.e., it is actually a decision procedure for this problem, for an important fragment of SLAD including known decidable logics. We implemented this procedure and shown its preciseness and its efficiency on a significant benchmark of formulas."}],"month":"10","type":"conference"},{"publication_identifier":{"eisbn":["9783642329401"],"isbn":["9783642329395"],"issn":["0302-9743"],"eissn":["1611-3349"]},"place":"Berlin, Heidelberg","acknowledgement":"Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft faculty fellowship.","corr_author":"1","type":"conference","month":"09","arxiv":1,"abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"external_id":{"arxiv":["1201.5073"]},"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Strategy synthesis for multi-dimensional quantitative objectives","oa_version":"Preprint","date_created":"2022-03-21T08:00:21Z","doi":"10.1007/978-3-642-32940-1_10","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1201.5073"}],"department":[{"_id":"KrCh"}],"intvolume":"      7454","publication_status":"published","language":[{"iso":"eng"}],"date_published":"2012-09-15T00:00:00Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"2716"}]},"_id":"10904","quality_controlled":"1","oa":1,"volume":7454,"day":"15","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","publication":"CONCUR 2012 - Concurrency Theory","status":"public","citation":{"ieee":"K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in <i>CONCUR 2012 - Concurrency Theory</i>, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>","ista":"Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.","short":"K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>."},"OA_type":"green","page":"115-131","publisher":"Springer","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2012-09-04","end_date":"2012-09-07","location":"Newcastle upon Tyne, United Kingdom"},"scopus_import":"1","ec_funded":1,"date_updated":"2025-09-29T11:10:44Z","editor":[{"first_name":"Maciej","last_name":"Koutny","full_name":"Koutny, Maciej"},{"last_name":"Ulidowski","first_name":"Irek","full_name":"Ulidowski, Irek"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"full_name":"Raskin, Jean-François","last_name":"Raskin","first_name":"Jean-François"}],"year":"2012"},{"acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","corr_author":"1","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783642330902"],"isbn":["9783642330896"]},"external_id":{"arxiv":["1604.08234"]},"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"conference","month":"10","arxiv":1,"abstract":[{"text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help.","lang":"eng"}],"doi":"10.1007/978-3-642-33090-2_27","oa_version":"Preprint","date_created":"2022-03-21T08:01:45Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"title":"Polynomial-time algorithms for energy games with special weight structures","department":[{"_id":"KrCh"}],"intvolume":"      7501","publication_status":"published","language":[{"iso":"eng"}],"date_published":"2012-10-01T00:00:00Z","_id":"10905","related_material":{"record":[{"status":"public","relation":"later_version","id":"535"}]},"oa":1,"quality_controlled":"1","volume":7501,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","alternative_title":["LNCS"],"citation":{"short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>Algorithms – ESA 2012</i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>Algorithms – ESA 2012</i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithms – ESA 2012</i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in <i>Algorithms – ESA 2012</i>, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.","ama":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: <i>Algorithms – ESA 2012</i>. Vol 7501. Springer; 2012:301-312. doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>"},"page":"301-312","status":"public","publication":"Algorithms – ESA 2012","publisher":"Springer","conference":{"end_date":"2012-09-12","start_date":"2012-09-10","name":"ESA: European Symposium on Algorithms","location":"Ljubljana, Slovenia"},"ec_funded":1,"scopus_import":"1","date_updated":"2025-09-29T13:18:37Z","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"year":"2012"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","series_title":"LNCS","alternative_title":["LNCS"],"volume":7214,"oa":1,"quality_controlled":"1","author":[{"first_name":"Sergey","last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey"},{"last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lopes, Nuno P.","first_name":"Nuno P.","last_name":"Lopes"},{"first_name":"Corneliu","last_name":"Popeea","full_name":"Popeea, Corneliu"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"year":"2012","editor":[{"last_name":"Flanagan","first_name":"Cormac","full_name":"Flanagan, Cormac"},{"full_name":"König, Barbara","last_name":"König","first_name":"Barbara"}],"date_updated":"2024-10-09T21:02:32Z","publisher":"Springer","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2012-04-01","start_date":"2012-03-24","location":"Tallinn, Estonia"},"scopus_import":"1","page":"549-551","citation":{"short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>","ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>"},"status":"public","publication":"Tools and Algorithms for the Construction and Analysis of Systems","department":[{"_id":"ToHe"}],"date_created":"2022-03-21T08:03:30Z","doi":"10.1007/978-3-642-28756-5_46","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"article_processing_charge":"No","title":"HSF(C): A software verifier based on Horn clauses","type":"conference","month":"04","abstract":[{"text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool.","lang":"eng"}],"corr_author":"1","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783642287558"],"eisbn":["9783642287565"]},"place":"Berlin, Heidelberg","_id":"10906","date_published":"2012-04-01T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"      7214","publication_status":"published"},{"oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","day":"28","alternative_title":["LNCS"],"volume":7561,"publisher":"Springer Nature","file":[{"checksum":"68415837a315de3cc4d120f6019d752c","file_size":465502,"content_type":"application/pdf","date_created":"2018-12-18T13:07:35Z","date_updated":"2020-07-14T12:47:10Z","access_level":"open_access","relation":"main_file","file_id":"5746","creator":"dernst","file_name":"2012_ATVA_Gupta.pdf"}],"conference":{"end_date":"2012-10-06","start_date":"2012-10-03","name":"ATVA: Automated Technology for Verification and Analysis","location":"Thiruvananthapuram, Kerala, India"},"scopus_import":"1","has_accepted_license":"1","ec_funded":1,"ddc":["005"],"citation":{"apa":"Gupta, A. (2012). Improved single pass algorithms for resolution proof reduction. In <i>10th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 107–121). Thiruvananthapuram, Kerala, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>","ama":"Gupta A. Improved single pass algorithms for resolution proof reduction. In: <i>10th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 7561. Springer Nature; 2012:107-121. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>","ieee":"A. Gupta, “Improved single pass algorithms for resolution proof reduction,” in <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, Kerala, India, 2012, vol. 7561, pp. 107–121.","mla":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 7561, Springer Nature, 2012, pp. 107–21, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>.","ista":"Gupta A. 2012. Improved single pass algorithms for resolution proof reduction. 10th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 107–121.","short":"A. Gupta, in:, 10th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2012, pp. 107–121.","chicago":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, 7561:107–21. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>."},"page":"107-121","status":"public","publication":"10th International Symposium on Automated Technology for Verification and Analysis","author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"}],"year":"2012","date_updated":"2025-04-15T07:56:27Z","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"type":"conference","month":"09","file_date_updated":"2020-07-14T12:47:10Z","abstract":[{"text":"Unsatisfiability proofs find many applications in verification. Today, many SAT solvers are capable of producing resolution proofs of unsatisfiability. For efficiency smaller proofs are preferred over bigger ones. The solvers apply proof reduction methods to remove redundant parts of the proofs while and after generating the proofs. One method of reducing resolution proofs is redundant resolution reduction, i.e., removing repeated pivots in the paths of resolution proofs (aka Pivot recycle). The known single pass algorithm only tries to remove redundancies in the parts of the proof that are trees. In this paper, we present three modifications to improve the algorithm such that the redundancies can be found in the parts of the proofs that are DAGs. The first modified algorithm covers greater number of redundancies as compared to the known algorithm without incurring any additional cost. The second modified algorithm covers even greater number of the redundancies but it may have longer run times. Our third modified algorithm is parametrized and can trade off between run times and the coverage of the redundancies. We have implemented our algorithms in OpenSMT and applied them on unsatisfiability proofs of 198 examples from plain MUS track of SAT11 competition. The first and second algorithm additionally remove 0.89% and 10.57% of clauses respectively as compared to the original algorithm. For certain value of the parameter, the third algorithm removes almost as many clauses as the second algorithm but is significantly faster.","lang":"eng"}],"acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative\r\nReactive Modeling (QUAREM).","pubrep_id":"180","corr_author":"1","publication_identifier":{"isbn":["9783642333859"],"eisbn":["9783642333866"],"issn":["0302-9743"],"eissn":["1611-3349"]},"department":[{"_id":"ToHe"}],"date_created":"2018-12-18T13:01:46Z","oa_version":"Submitted Version","doi":"10.1007/978-3-642-33386-6_10","article_processing_charge":"No","title":"Improved single pass algorithms for resolution proof reduction","language":[{"iso":"eng"}],"intvolume":"      7561","publication_status":"published","_id":"5745","date_published":"2012-09-28T00:00:00Z"},{"_id":"10907","date_published":"2011-06-01T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"      6658","publication_status":"published","department":[{"_id":"HeEd"}],"oa_version":"None","doi":"10.1007/978-3-642-20844-7_22","date_created":"2022-03-21T08:08:35Z","article_processing_charge":"No","title":"Spatio-temporal extraction of articulated models in a graph pyramid","month":"06","type":"conference","abstract":[{"lang":"eng","text":"This paper presents a method to create a model of an articulated object using the planar motion in an initialization video. The model consists of rigid parts connected by points of articulation. The rigid parts are described by the positions of salient feature-points tracked throughout the video. Following a filtering step that identifies points that belong to different objects, rigid parts are found by a grouping process in a graph pyramid. Valid articulation points are selected by verifying multiple hypotheses for each pair of parts."}],"acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","corr_author":"1","publication_identifier":{"isbn":["9783642208430"],"eisbn":["9783642208447"],"eissn":["1611-3349"],"issn":["0302-9743"]},"place":"Berlin, Heidelberg","author":[{"full_name":"Artner, Nicole M.","first_name":"Nicole M.","last_name":"Artner"},{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","last_name":"Ion","full_name":"Ion, Adrian"},{"full_name":"Kropatsch, Walter G.","first_name":"Walter G.","last_name":"Kropatsch"}],"year":"2011","date_updated":"2024-10-09T21:02:32Z","editor":[{"last_name":"Jiang","first_name":"Xiaoyi","full_name":"Jiang, Xiaoyi"},{"full_name":"Ferrer, Miquel","last_name":"Ferrer","first_name":"Miquel"},{"first_name":"Andrea","last_name":"Torsello","full_name":"Torsello, Andrea"}],"conference":{"name":"GbRPR: Graph-based Representations in Pattern Recognition","start_date":"2011-05-18","end_date":"2011-05-20","location":"Münster, Germany"},"publisher":"Springer","scopus_import":"1","page":"215-224","citation":{"short":"N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.","chicago":"Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>.","ista":"Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.","ieee":"N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in <i>Graph-Based Representations in Pattern Recognition</i>, Münster, Germany, 2011, vol. 6658, pp. 215–224.","mla":"Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>.","apa":"Artner, N. M., Ion, A., &#38; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &#38; A. Torsello (Eds.), <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>","ama":"Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. <i>Graph-Based Representations in Pattern Recognition</i>. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>"},"status":"public","publication":"Graph-Based Representations in Pattern Recognition","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","alternative_title":["LNCS"],"series_title":"LNIP","volume":6658,"quality_controlled":"1"},{"title":"Incremental-decremental algorithm for computing AT-models and persistent homology","doi":"10.1007/978-3-642-23672-3_35","oa_version":"Published Version","date_created":"2021-07-11T22:01:19Z","main_file_link":[{"url":"http://hdl.handle.net/11441/30766","open_access":"1"}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"publication_identifier":{"isbn":["9783642236716"],"issn":["0302-9743"],"eissn":["1611-3349"]},"type":"conference","month":"08","abstract":[{"text":"In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend the persistence computation to a wider setting. Finally, we show how to combine incremental and decremental techniques for persistent homology computation.","lang":"eng"}],"date_published":"2011-08-01T00:00:00Z","_id":"9648","intvolume":"      6854","publication_status":"published","language":[{"iso":"eng"}],"volume":6854,"day":"01","alternative_title":["LNCS"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","quality_controlled":"1","oa":1,"date_updated":"2026-04-16T10:09:19Z","author":[{"full_name":"Gonzalez-Diaz, Rocio","first_name":"Rocio","last_name":"Gonzalez-Diaz"},{"last_name":"Ion","first_name":"Adrian","full_name":"Ion, Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jimenez","first_name":"Maria Jose","full_name":"Jimenez, Maria Jose"},{"full_name":"Poyatos, Regina","last_name":"Poyatos","first_name":"Regina"}],"year":"2011","status":"public","publication":"Computer Analysis of Images and Patterns","page":"286-293","citation":{"apa":"Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., &#38; Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In <i>Computer Analysis of Images and Patterns</i> (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">https://doi.org/10.1007/978-3-642-23672-3_35</a>","mla":"Gonzalez-Diaz, Rocio, et al. “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.” <i>Computer Analysis of Images and Patterns</i>, vol. 6854, Springer Nature, 2011, pp. 286–93, doi:<a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">10.1007/978-3-642-23672-3_35</a>.","ama":"Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm for computing AT-models and persistent homology. In: <i>Computer Analysis of Images and Patterns</i>. Vol 6854. Springer Nature; 2011:286-293. doi:<a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">10.1007/978-3-642-23672-3_35</a>","ieee":"R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental algorithm for computing AT-models and persistent homology,” in <i>Computer Analysis of Images and Patterns</i>, Seville, Spain, 2011, vol. 6854, pp. 286–293.","short":"R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis of Images and Patterns, Springer Nature, 2011, pp. 286–293.","chicago":"Gonzalez-Diaz, Rocio, Adrian Ion, Maria Jose Jimenez, and Regina Poyatos. “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.” In <i>Computer Analysis of Images and Patterns</i>, 6854:286–93. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">https://doi.org/10.1007/978-3-642-23672-3_35</a>.","ista":"Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental algorithm for computing AT-models and persistent homology. Computer Analysis of Images and Patterns. CAIP: International Conference on Computer Analysis of Images and Patterns, LNCS, vol. 6854, 286–293."},"publisher":"Springer Nature","conference":{"name":"CAIP: International Conference on Computer Analysis of Images and Patterns","start_date":"2011-08-29","end_date":"2011-08-31","location":"Seville, Spain"},"scopus_import":"1"},{"date_updated":"2024-12-02T14:07:41Z","date_published":"2010-01-01T00:00:00Z","extern":"1","_id":"18338","year":"2010","author":[{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"full_name":"Bronstein, Michael M.","last_name":"Bronstein","first_name":"Michael M."}],"publication_status":"published","publication":"11th European Conference on Computer Vision","intvolume":"      6312","status":"public","page":"197–208","citation":{"ista":"Bronstein AM, Bronstein MM. 2010. Spatially-sensitive affine-invariant image descriptors. 11th European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 6312, 197–208.","chicago":"Bronstein, Alex M., and Michael M. Bronstein. “Spatially-Sensitive Affine-Invariant Image Descriptors.” In <i>11th European Conference on Computer Vision</i>, 6312:197–208. Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_15\">https://doi.org/10.1007/978-3-642-15552-9_15</a>.","short":"A.M. Bronstein, M.M. Bronstein, in:, 11th European Conference on Computer Vision, Springer Nature, 2010, pp. 197–208.","ieee":"A. M. Bronstein and M. M. Bronstein, “Spatially-sensitive affine-invariant image descriptors,” in <i>11th European Conference on Computer Vision</i>, Heraklion, Greece, 2010, vol. 6312, pp. 197–208.","mla":"Bronstein, Alex M., and Michael M. Bronstein. “Spatially-Sensitive Affine-Invariant Image Descriptors.” <i>11th European Conference on Computer Vision</i>, vol. 6312, Springer Nature, 2010, pp. 197–208, doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_15\">10.1007/978-3-642-15552-9_15</a>.","apa":"Bronstein, A. M., &#38; Bronstein, M. M. (2010). Spatially-sensitive affine-invariant image descriptors. In <i>11th European Conference on Computer Vision</i> (Vol. 6312, pp. 197–208). Heraklion, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_15\">https://doi.org/10.1007/978-3-642-15552-9_15</a>","ama":"Bronstein AM, Bronstein MM. Spatially-sensitive affine-invariant image descriptors. In: <i>11th European Conference on Computer Vision</i>. Vol 6312. Springer Nature; 2010:197–208. doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_15\">10.1007/978-3-642-15552-9_15</a>"},"scopus_import":"1","publisher":"Springer Nature","conference":{"name":"ECCV: European Conference on Computer Vision","start_date":"2010-09-05","end_date":"2010-09-10","location":"Heraklion, Greece"},"language":[{"iso":"eng"}],"volume":6312,"title":"Spatially-sensitive affine-invariant image descriptors","article_processing_charge":"No","doi":"10.1007/978-3-642-15552-9_15","date_created":"2024-10-15T11:20:54Z","oa_version":"None","alternative_title":["LNCS"],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"eisbn":["9783642155529"],"isbn":["9783642155512"],"eissn":["1611-3349"],"issn":["0302-9743"]},"quality_controlled":"1","abstract":[{"text":"Invariant image descriptors play an important role in many computer vision and pattern recognition problems such as image search and retrieval. A dominant paradigm today is that of “bags of features”, a representation of images as distributions of primitive visual elements. The main disadvantage of this approach is the loss of spatial relations between features, which often carry important information about the image. In this paper, we show how to construct spatially-sensitive image descriptors in which both the features and their relation are affine-invariant. Our construction is based on a vocabulary of pairs of features coupled with a vocabulary of invariant spatial relations between the features. Experimental results show the advantage of our approach in image retrieval applications.","lang":"eng"}],"month":"01","type":"conference"},{"date_published":"2010-01-01T00:00:00Z","extern":"1","date_updated":"2024-11-18T14:31:56Z","year":"2010","author":[{"full_name":"Mitra, Niloy J.","last_name":"Mitra","first_name":"Niloy J."},{"last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Bronstein, Michael","last_name":"Bronstein","first_name":"Michael"}],"_id":"18339","citation":{"short":"N.J. Mitra, A.M. Bronstein, M. Bronstein, in:, 11th European Conference on Computer Vision, Springer Nature, 2010, pp. 398–410.","ista":"Mitra NJ, Bronstein AM, Bronstein M. 2010. Intrinsic regularity detection in 3D geometry. 11th European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 6313, 398–410.","chicago":"Mitra, Niloy J., Alex M. Bronstein, and Michael Bronstein. “Intrinsic Regularity Detection in 3D Geometry.” In <i>11th European Conference on Computer Vision</i>, 6313:398–410. Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15558-1_29\">https://doi.org/10.1007/978-3-642-15558-1_29</a>.","mla":"Mitra, Niloy J., et al. “Intrinsic Regularity Detection in 3D Geometry.” <i>11th European Conference on Computer Vision</i>, vol. 6313, Springer Nature, 2010, pp. 398–410, doi:<a href=\"https://doi.org/10.1007/978-3-642-15558-1_29\">10.1007/978-3-642-15558-1_29</a>.","apa":"Mitra, N. J., Bronstein, A. M., &#38; Bronstein, M. (2010). Intrinsic regularity detection in 3D geometry. In <i>11th European Conference on Computer Vision</i> (Vol. 6313, pp. 398–410). Heraklion, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-15558-1_29\">https://doi.org/10.1007/978-3-642-15558-1_29</a>","ama":"Mitra NJ, Bronstein AM, Bronstein M. Intrinsic regularity detection in 3D geometry. In: <i>11th European Conference on Computer Vision</i>. Vol 6313. Springer Nature; 2010:398–410. doi:<a href=\"https://doi.org/10.1007/978-3-642-15558-1_29\">10.1007/978-3-642-15558-1_29</a>","ieee":"N. J. Mitra, A. M. Bronstein, and M. Bronstein, “Intrinsic regularity detection in 3D geometry,” in <i>11th European Conference on Computer Vision</i>, Heraklion, Greece, 2010, vol. 6313, pp. 398–410."},"page":"398–410","publication_status":"published","status":"public","publication":"11th European Conference on Computer Vision","intvolume":"      6313","language":[{"iso":"eng"}],"scopus_import":"1","conference":{"name":"ECCV: European Conference on Computer Vision","start_date":"2010-09-05","end_date":"2010-09-10","location":"Heraklion, Greece"},"publisher":"Springer Nature","article_processing_charge":"No","date_created":"2024-10-15T11:20:54Z","doi":"10.1007/978-3-642-15558-1_29","oa_version":"None","volume":6313,"title":"Intrinsic regularity detection in 3D geometry","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","alternative_title":["LNCS"],"acknowledgement":"We thank Helmut Pottmann and the anonymous reviewers for their comments and helpful suggestions. Niloy Mitra was partially supported by a Microsoft outstanding young faculty fellowship.","publication_identifier":{"isbn":["9783642155574","9783642155581"],"issn":["0302-9743","1611-3349"]},"abstract":[{"lang":"eng","text":"Automatic detection of symmetries, regularity, and repetitive structures in 3D geometry is a fundamental problem in shape analysis and pattern recognition with applications in computer vision and graphics. Especially challenging is to detect intrinsic regularity, where the repetitions are on an intrinsic grid, without any apparent Euclidean pattern to describe the shape, but rising out of (near) isometric deformation of the underlying surface. In this paper, we employ multidimensional scaling to reduce the problem of intrinsic structure detection to a simpler problem of 2D grid detection. Potential 2D grids are then identified using an autocorrelation analysis, refined using local fitting, validated, and finally projected back to the spatial domain. We test the detection algorithm on a variety of scanned plaster models in presence of imperfections like missing data, noise and outliers. We also present a range of applications including scan completion, shape editing, super-resolution, and structural correspondence."}],"quality_controlled":"1","month":"01","type":"conference"},{"date_published":"2010-05-01T00:00:00Z","isi":1,"_id":"10908","publication_status":"published","intvolume":"      6355","language":[{"iso":"eng"}],"title":"ABC: Algebraic Bound Computation for loops","article_processing_charge":"No","main_file_link":[{"url":"https://infoscience.epfl.ch/record/186096","open_access":"1"}],"oa_version":"Submitted Version","date_created":"2022-03-21T08:14:35Z","doi":"10.1007/978-3-642-17511-4_7","department":[{"_id":"ToHe"}],"place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783642175107"],"eisbn":["9783642175114"],"issn":["0302-9743"],"eissn":["1611-3349"]},"corr_author":"1","acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","abstract":[{"lang":"eng","text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts."}],"month":"05","type":"conference","external_id":{"isi":["000309668000007"]},"date_updated":"2025-09-30T09:51:13Z","editor":[{"full_name":"Clarke, Edmund M","first_name":"Edmund M","last_name":"Clarke"},{"first_name":"Andrei","last_name":"Voronkov","full_name":"Voronkov, Andrei"}],"year":"2010","author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"}],"publication":"Logic for Programming, Artificial Intelligence, and Reasoning","status":"public","page":"103-118","citation":{"apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.","chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>.","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118."},"scopus_import":"1","publisher":"Springer Nature","conference":{"start_date":"2010-04-25","end_date":"2010-05-01","name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning","location":"Dakar, Senegal"},"volume":6355,"series_title":"LNCS","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","oa":1},{"publication_status":"published","publication":"Applications and Theory of Petri Nets","status":"public","citation":{"mla":"Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.” <i>Applications and Theory of Petri Nets</i>, Springer Berlin Heidelberg, 2010, pp. 1–17, doi:<a href=\"https://doi.org/10.1007/978-3-642-13675-7_1\">10.1007/978-3-642-13675-7_1</a>.","apa":"Juhás, G., Kazlov, I., &#38; Juhásová, A. (2010). Instance Deadlock: A Mystery behind Frozen Programs. In <i>Applications and Theory of Petri Nets</i> (pp. 1–17). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13675-7_1\">https://doi.org/10.1007/978-3-642-13675-7_1</a>","ama":"Juhás G, Kazlov I, Juhásová A. Instance Deadlock: A Mystery behind Frozen Programs. In: <i>Applications and Theory of Petri Nets</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:1-17. doi:<a href=\"https://doi.org/10.1007/978-3-642-13675-7_1\">10.1007/978-3-642-13675-7_1</a>","ieee":"G. Juhás, I. Kazlov, and A. Juhásová, “Instance Deadlock: A Mystery behind Frozen Programs,” in <i>Applications and Theory of Petri Nets</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 1–17.","chicago":"Juhás, Gabriel, Igor Kazlov, and Ana Juhásová. “Instance Deadlock: A Mystery behind Frozen Programs.” In <i>Applications and Theory of Petri Nets</i>, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13675-7_1\">https://doi.org/10.1007/978-3-642-13675-7_1</a>.","ista":"Juhás G, Kazlov I, Juhásová A. 2010.Instance Deadlock: A Mystery behind Frozen Programs. In: Applications and Theory of Petri Nets. , 1–17.","short":"G. Juhás, I. Kazlov, A. Juhásová, in:, Applications and Theory of Petri Nets, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 1–17."},"page":"1-17","publisher":"Springer Berlin Heidelberg","language":[{"iso":"eng"}],"date_updated":"2022-04-01T13:45:24Z","date_published":"2010-01-01T00:00:00Z","extern":"1","_id":"5940","year":"2010","author":[{"full_name":"Juhás, Gabriel","last_name":"Juhás","first_name":"Gabriel"},{"id":"4A997E50-F248-11E8-B48F-1D18A9856A87","full_name":"Kazlov, Igor","last_name":"Kazlov","first_name":"Igor"},{"full_name":"Juhásová, Ana","first_name":"Ana","last_name":"Juhásová"}],"publication_identifier":{"isbn":["9783642136740","9783642136757"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","type":"book_chapter","title":"Instance Deadlock: A Mystery behind Frozen Programs","article_processing_charge":"No","date_created":"2019-02-08T09:33:41Z","oa_version":"None","doi":"10.1007/978-3-642-13675-7_1","user_id":"4A997E50-F248-11E8-B48F-1D18A9856A87"},{"_id":"18320","date_published":"2006-02-13T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"      3889","publication_status":"published","date_created":"2024-10-15T11:20:53Z","doi":"10.1007/11679363_116","oa_version":"None","article_processing_charge":"No","title":"On separation of semitransparent dynamic images from static background","month":"02","type":"conference","abstract":[{"text":"Presented here is the problem of recovering a dynamic image superimposed on a static background. Such a problem is ill-posed and may arise e.g. in imaging through semireflective media, in separation of an illumination image from a reflectance image, in imaging with diffraction phenomena, etc. In this work we study regularization of this problem in spirit of Total Variation and general sparsifying transformations.","lang":"eng"}],"publication_identifier":{"isbn":["9783540326304"],"eisbn":["9783540326311"],"issn":["0302-9743"],"eissn":["1611-3349"]},"author":[{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","first_name":"Alexander","last_name":"Bronstein"},{"last_name":"Bronstein","first_name":"Michael M.","full_name":"Bronstein, Michael M."},{"first_name":"Michael","last_name":"Zibulevsky","full_name":"Zibulevsky, Michael"}],"year":"2006","extern":"1","date_updated":"2024-10-22T07:00:45Z","publisher":"Springer Nature","conference":{"location":"Charleston, SC, United States","start_date":"2006-03-05","end_date":"2006-03-08","name":"ICA: International Conference on Independent Component Analysis and Signal Separation"},"scopus_import":"1","citation":{"mla":"Bronstein, Alex M., et al. “On Separation of Semitransparent Dynamic Images from Static Background.” <i>6th International Conference on Independent Component Analysis and Signal Separation</i>, vol. 3889, Springer Nature, 2006, pp. 934–40, doi:<a href=\"https://doi.org/10.1007/11679363_116\">10.1007/11679363_116</a>.","ama":"Bronstein AM, Bronstein MM, Zibulevsky M. On separation of semitransparent dynamic images from static background. In: <i>6th International Conference on Independent Component Analysis and Signal Separation</i>. Vol 3889. Springer Nature; 2006:934-940. doi:<a href=\"https://doi.org/10.1007/11679363_116\">10.1007/11679363_116</a>","ieee":"A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “On separation of semitransparent dynamic images from static background,” in <i>6th International Conference on Independent Component Analysis and Signal Separation</i>, Charleston, SC, United States, 2006, vol. 3889, pp. 934–940.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Zibulevsky, M. (2006). On separation of semitransparent dynamic images from static background. In <i>6th International Conference on Independent Component Analysis and Signal Separation</i> (Vol. 3889, pp. 934–940). Charleston, SC, United States: Springer Nature. <a href=\"https://doi.org/10.1007/11679363_116\">https://doi.org/10.1007/11679363_116</a>","ista":"Bronstein AM, Bronstein MM, Zibulevsky M. 2006. On separation of semitransparent dynamic images from static background. 6th International Conference on Independent Component Analysis and Signal Separation. ICA: International Conference on Independent Component Analysis and Signal Separation, LNISA, vol. 3889, 934–940.","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Michael Zibulevsky. “On Separation of Semitransparent Dynamic Images from Static Background.” In <i>6th International Conference on Independent Component Analysis and Signal Separation</i>, 3889:934–40. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11679363_116\">https://doi.org/10.1007/11679363_116</a>.","short":"A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, in:, 6th International Conference on Independent Component Analysis and Signal Separation, Springer Nature, 2006, pp. 934–940."},"OA_type":"closed access","page":"934-940","status":"public","publication":"6th International Conference on Independent Component Analysis and Signal Separation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"13","alternative_title":["LNISA"],"volume":3889,"quality_controlled":"1"},{"title":"Robust expression-invariant face recognition from partially missing data","volume":3953,"doi":"10.1007/11744078_31","oa_version":"None","date_created":"2024-10-15T11:20:53Z","article_processing_charge":"No","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["9783540338376"],"isbn":["9783540338369"],"eissn":["1611-3349"],"issn":["0302-9743"]},"type":"conference","month":"01","quality_controlled":"1","abstract":[{"text":"Recent studies on three-dimensional face recognition proposed to model facial expressions as isometries of the facial surface. Based on this model, expression-invariant signatures of the face were constructed by means of approximate isometric embedding into flat spaces. Here, we apply a new method for measuring isometry-invariant similarity between faces by embedding one facial surface into another. We demonstrate that our approach has several significant advantages, one of which is the ability to handle partially missing data. Promising face recognition results are obtained in numerical experiments even when the facial surfaces are severely occluded.","lang":"eng"}],"date_updated":"2024-10-22T06:46:14Z","extern":"1","date_published":"2006-01-01T00:00:00Z","_id":"18321","author":[{"first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"full_name":"Bronstein, Michael M.","last_name":"Bronstein","first_name":"Michael M."},{"last_name":"Kimmel","first_name":"Ron","full_name":"Kimmel, Ron"}],"year":"2006","publication":"9th European Conference on Computer Vision","status":"public","intvolume":"      3953","publication_status":"published","citation":{"chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Robust Expression-Invariant Face Recognition from Partially Missing Data.” In <i>9th European Conference on Computer Vision</i>, Vol. 3953. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11744078_31\">https://doi.org/10.1007/11744078_31</a>.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Robust expression-invariant face recognition from partially missing data. 9th European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 3953.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 9th European Conference on Computer Vision, Springer Nature, 2006.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Robust expression-invariant face recognition from partially missing data. In <i>9th European Conference on Computer Vision</i> (Vol. 3953). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/11744078_31\">https://doi.org/10.1007/11744078_31</a>","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Robust expression-invariant face recognition from partially missing data,” in <i>9th European Conference on Computer Vision</i>, Graz, Austria, 2006, vol. 3953.","ama":"Bronstein AM, Bronstein MM, Kimmel R. Robust expression-invariant face recognition from partially missing data. In: <i>9th European Conference on Computer Vision</i>. Vol 3953. Springer Nature; 2006. doi:<a href=\"https://doi.org/10.1007/11744078_31\">10.1007/11744078_31</a>","mla":"Bronstein, Alex M., et al. “Robust Expression-Invariant Face Recognition from Partially Missing Data.” <i>9th European Conference on Computer Vision</i>, vol. 3953, Springer Nature, 2006, doi:<a href=\"https://doi.org/10.1007/11744078_31\">10.1007/11744078_31</a>."},"OA_type":"closed access","publisher":"Springer Nature","conference":{"location":"Graz, Austria","name":"ECCV: European Conference on Computer Vision","end_date":"2006-05-13","start_date":"2006-05-07"},"scopus_import":"1","language":[{"iso":"eng"}]},{"date_created":"2024-10-15T11:20:53Z","doi":"10.1007/11789239_5","oa_version":"None","article_processing_charge":"No","title":"Facetoface: An isometric model for facial animation","month":"07","type":"conference","abstract":[{"text":"A geometric framework for finding intrinsic correspondence between animated 3D faces is presented. We model facial expressions as isometries of the facial surface and find the correspondence between two faces as the minimum-distortion mapping. Generalized multidimensional scaling is used for this goal. We apply our approach to texture mapping onto 3D video, expression exaggeration and morphing between faces.","lang":"eng"}],"publication_identifier":{"isbn":["9783540360315"],"eisbn":["9783540360322"],"issn":["0302-9743"],"eissn":["1611-3349"]},"_id":"18322","date_published":"2006-07-18T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"      4069","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","alternative_title":["LNIP"],"volume":4069,"quality_controlled":"1","author":[{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"},{"last_name":"Kimmel","first_name":"Ron","full_name":"Kimmel, Ron"}],"year":"2006","extern":"1","date_updated":"2024-10-22T06:42:42Z","conference":{"name":"AMDO: Conference on Articulated Motion and Deformable Objects","end_date":"2006-07-14","start_date":"2006-07-11","location":"Mallorca, Spain"},"publisher":"Springer Nature","scopus_import":"1","citation":{"ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Facetoface: An isometric model for facial animation,” in <i>4th International Conference on Articulated Motion and Deformable Objects</i>, Mallorca, Spain, 2006, vol. 4069, pp. 38–47.","mla":"Bronstein, Alex M., et al. “Facetoface: An Isometric Model for Facial Animation.” <i>4th International Conference on Articulated Motion and Deformable Objects</i>, vol. 4069, Springer Nature, 2006, pp. 38–47, doi:<a href=\"https://doi.org/10.1007/11789239_5\">10.1007/11789239_5</a>.","ama":"Bronstein AM, Bronstein MM, Kimmel R. Facetoface: An isometric model for facial animation. In: <i>4th International Conference on Articulated Motion and Deformable Objects</i>. Vol 4069. Springer Nature; 2006:38-47. doi:<a href=\"https://doi.org/10.1007/11789239_5\">10.1007/11789239_5</a>","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2006). Facetoface: An isometric model for facial animation. In <i>4th International Conference on Articulated Motion and Deformable Objects</i> (Vol. 4069, pp. 38–47). Mallorca, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/11789239_5\">https://doi.org/10.1007/11789239_5</a>","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 4th International Conference on Articulated Motion and Deformable Objects, Springer Nature, 2006, pp. 38–47.","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Facetoface: An Isometric Model for Facial Animation.” In <i>4th International Conference on Articulated Motion and Deformable Objects</i>, 4069:38–47. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11789239_5\">https://doi.org/10.1007/11789239_5</a>.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2006. Facetoface: An isometric model for facial animation. 4th International Conference on Articulated Motion and Deformable Objects. AMDO: Conference on Articulated Motion and Deformable Objects, LNIP, vol. 4069, 38–47."},"OA_type":"closed access","page":"38-47","status":"public","publication":"4th International Conference on Articulated Motion and Deformable Objects"},{"extern":"1","date_updated":"2024-10-22T06:35:45Z","author":[{"full_name":"Bronstein, Alexander","first_name":"Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Bronstein","first_name":"Michael M.","full_name":"Bronstein, Michael M."},{"full_name":"Bruckstein, Alfred M.","last_name":"Bruckstein","first_name":"Alfred M."},{"last_name":"Kimmel","first_name":"Ron","full_name":"Kimmel, Ron"}],"year":"2006","OA_type":"closed access","page":"48-57","citation":{"chicago":"Bronstein, Alex M., Michael M. Bronstein, Alfred M. Bruckstein, and Ron Kimmel. “Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling.” In <i>4th International Conference on Articulated Motion and Deformable Objects</i>, 4069:48–57. Springer Nature, 2006. <a href=\"https://doi.org/10.1007/11789239_6\">https://doi.org/10.1007/11789239_6</a>.","ista":"Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. 2006. Matching two-dimensional articulated shapes using generalized multidimensional scaling. 4th International Conference on Articulated Motion and Deformable Objects. AMDO: Conference on Articulated Motion and Deformable Objects, LNIP, vol. 4069, 48–57.","short":"A.M. Bronstein, M.M. Bronstein, A.M. Bruckstein, R. Kimmel, in:, 4th International Conference on Articulated Motion and Deformable Objects, Springer Nature, 2006, pp. 48–57.","ama":"Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. Matching two-dimensional articulated shapes using generalized multidimensional scaling. In: <i>4th International Conference on Articulated Motion and Deformable Objects</i>. Vol 4069. Springer Nature; 2006:48-57. doi:<a href=\"https://doi.org/10.1007/11789239_6\">10.1007/11789239_6</a>","ieee":"A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel, “Matching two-dimensional articulated shapes using generalized multidimensional scaling,” in <i>4th International Conference on Articulated Motion and Deformable Objects</i>, Mallorca, Spain, 2006, vol. 4069, pp. 48–57.","apa":"Bronstein, A. M., Bronstein, M. M., Bruckstein, A. M., &#38; Kimmel, R. (2006). Matching two-dimensional articulated shapes using generalized multidimensional scaling. In <i>4th International Conference on Articulated Motion and Deformable Objects</i> (Vol. 4069, pp. 48–57). Mallorca, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/11789239_6\">https://doi.org/10.1007/11789239_6</a>","mla":"Bronstein, Alex M., et al. “Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling.” <i>4th International Conference on Articulated Motion and Deformable Objects</i>, vol. 4069, Springer Nature, 2006, pp. 48–57, doi:<a href=\"https://doi.org/10.1007/11789239_6\">10.1007/11789239_6</a>."},"publication":"4th International Conference on Articulated Motion and Deformable Objects","status":"public","conference":{"location":"Mallorca, Spain","name":"AMDO: Conference on Articulated Motion and Deformable Objects","start_date":"2006-07-11","end_date":"2006-07-14"},"publisher":"Springer Nature","scopus_import":"1","volume":4069,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","alternative_title":["LNIP"],"quality_controlled":"1","date_published":"2006-07-18T00:00:00Z","_id":"18323","intvolume":"      4069","publication_status":"published","language":[{"iso":"eng"}],"date_created":"2024-10-15T11:20:53Z","oa_version":"None","doi":"10.1007/11789239_6","article_processing_charge":"No","title":"Matching two-dimensional articulated shapes using generalized multidimensional scaling","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783540360322"],"isbn":["9783540360315"]},"type":"conference","month":"07","abstract":[{"lang":"eng","text":"We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an axiomatic construction of an articulation-invariant distance between shapes, formulated as a generalized multidimensional scaling (GMDS) problem and solved efficiently. Some numerical results demonstrating the accuracy of our method are presented."}]},{"_id":"18319","date_published":"2005-03-31T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","intvolume":"      3459","title":"Isometric embedding of facial surfaces into S3","article_processing_charge":"No","oa_version":"None","doi":"10.1007/11408031_53","date_created":"2024-10-15T11:12:06Z","abstract":[{"text":"The problem of isometry-invariant representation and comparison of surfaces is of cardinal importance in pattern recognition applications dealing with deformable objects. Particularly, in three-dimensional face recognition treating facial expressions as isometries of the facial surface allows to perform robust recognition insensitive to expressions.\r\nIsometry-invariant representation of surfaces can be constructed by isometrically embedding them into some convenient space, and carrying out the comparison in that space. Presented here is a discussion on isometric embedding into S3, which appears to be superior over the previously used Euclidean space in sense of the representation accuracy.","lang":"eng"}],"month":"03","type":"conference","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783540320128"],"isbn":["9783540255475"]},"year":"2005","author":[{"last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"last_name":"Kimmel","first_name":"Ron","full_name":"Kimmel, Ron"}],"date_updated":"2024-10-22T06:29:06Z","extern":"1","scopus_import":"1","publisher":"Springer Berlin Heidelberg","conference":{"location":"Hofgeismar, Germany","end_date":"2005-04-09","start_date":"2005-04-07","name":"Scale Space: Conference on Scale-Space Theories in Computer Vision"},"publication":"5th International Conference on Scale-Space Theories in Computer Vision","status":"public","OA_type":"closed access","citation":{"chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Isometric Embedding of Facial Surfaces into S3.” In <i>5th International Conference on Scale-Space Theories in Computer Vision</i>, 3459:622–31. Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11408031_53\">https://doi.org/10.1007/11408031_53</a>.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 5th International Conference on Scale-Space Theories in Computer Vision, Springer Berlin Heidelberg, 2005, pp. 622–631.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2005. Isometric embedding of facial surfaces into S3. 5th International Conference on Scale-Space Theories in Computer Vision. Scale Space: Conference on Scale-Space Theories in Computer Vision, LNIP, vol. 3459, 622–631.","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Isometric embedding of facial surfaces into S3,” in <i>5th International Conference on Scale-Space Theories in Computer Vision</i>, Hofgeismar, Germany, 2005, vol. 3459, pp. 622–631.","apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2005). Isometric embedding of facial surfaces into S3. In <i>5th International Conference on Scale-Space Theories in Computer Vision</i> (Vol. 3459, pp. 622–631). Hofgeismar, Germany: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11408031_53\">https://doi.org/10.1007/11408031_53</a>","ama":"Bronstein AM, Bronstein MM, Kimmel R. Isometric embedding of facial surfaces into S3. In: <i>5th International Conference on Scale-Space Theories in Computer Vision</i>. Vol 3459. Springer Berlin Heidelberg; 2005:622-631. doi:<a href=\"https://doi.org/10.1007/11408031_53\">10.1007/11408031_53</a>","mla":"Bronstein, Alex M., et al. “Isometric Embedding of Facial Surfaces into S3.” <i>5th International Conference on Scale-Space Theories in Computer Vision</i>, vol. 3459, Springer Berlin Heidelberg, 2005, pp. 622–31, doi:<a href=\"https://doi.org/10.1007/11408031_53\">10.1007/11408031_53</a>."},"page":"622-631","alternative_title":["LNIP"],"day":"31","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":3459,"quality_controlled":"1"},{"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2004-07-12","end_date":"2004-07-16","location":"Turku, Finland"},"publisher":"Springer Nature","scopus_import":"1","language":[{"iso":"eng"}],"publication":"31st International Colloquium on Automata, Languages and Programming","intvolume":"      3142","status":"public","publication_status":"published","page":"3","citation":{"short":"M. Henzinger, in:, 31st International Colloquium on Automata, Languages and Programming, Springer Nature, 2004, p. 3.","chicago":"Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” In <i>31st International Colloquium on Automata, Languages and Programming</i>, 3142:3. Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">https://doi.org/10.1007/978-3-540-27836-8_2</a>.","ista":"Henzinger M. 2004. The past, present, and future of web search engines. 31st International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.","mla":"Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” <i>31st International Colloquium on Automata, Languages and Programming</i>, vol. 3142, Springer Nature, 2004, p. 3, doi:<a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">10.1007/978-3-540-27836-8_2</a>.","ama":"Henzinger M. The past, present, and future of web search engines. In: <i>31st International Colloquium on Automata, Languages and Programming</i>. Vol 3142. Springer Nature; 2004:3. doi:<a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">10.1007/978-3-540-27836-8_2</a>","ieee":"M. Henzinger, “The past, present, and future of web search engines,” in <i>31st International Colloquium on Automata, Languages and Programming</i>, Turku, Finland, 2004, vol. 3142, p. 3.","apa":"Henzinger, M. (2004). The past, present, and future of web search engines. In <i>31st International Colloquium on Automata, Languages and Programming</i> (Vol. 3142, p. 3). Turku, Finland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">https://doi.org/10.1007/978-3-540-27836-8_2</a>"},"_id":"11800","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"}],"year":"2004","date_updated":"2024-11-06T08:14:51Z","extern":"1","date_published":"2004-07-01T00:00:00Z","type":"conference","month":"07","abstract":[{"lang":"eng","text":"Web search engines have emerged as one of the central applications on the Internet. In fact, search has become one of the most important activities that people engage in on the the Internet. Even beyond becoming the number one source of information, a growing number of businesses are depending on web search engines for customer acquisition.\r\n\r\nThe first generation of web search engines used text-only retrieval techniques. Google revolutionized the field by deploying the PageRank technology – an eigenvector-based analysis of the hyperlink structure – to analyze the web in order to produce relevant results. Moving forward, our goal is to achieve a better understanding of a page with a view towards producing even more relevant results."}],"quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"]},"day":"01","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The past, present, and future of web search engines","volume":3142,"oa_version":"None","date_created":"2022-08-11T12:38:58Z","doi":"10.1007/978-3-540-27836-8_2","article_processing_charge":"No"}]