[{"publication_status":"published","intvolume":"       112","month":"03","article_type":"original","author":[{"full_name":"Aflalo, Yonathan","last_name":"Aflalo","first_name":"Yonathan"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","fulldoi":"https://doi.org/10.1073/pnas.1401651112","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"pmid":1,"doi":"10.1073/pnas.1401651112","oa_version":"None","extern":"1","quality_controlled":"1","date_updated":"2024-11-12T08:54:37Z","publisher":"National Academy of Sciences","publication":"Proceedings of the National Academy of Sciences","year":"2015","page":"2942-2947","volume":112,"external_id":{"pmid":["25713342"]},"abstract":[{"lang":"eng","text":"We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving 2n equality and n2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic."}],"_id":"18371","status":"public","date_published":"2015-03-10T00:00:00Z","issue":"10","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","title":"On convex relaxation of graph isomorphism","type":"journal_article","date_created":"2024-10-15T11:20:54Z","citation":{"ista":"Aflalo Y, Bronstein AM, Kimmel R. 2015. On convex relaxation of graph isomorphism. Proceedings of the National Academy of Sciences. 112(10), 2942–2947.","chicago":"Aflalo, Yonathan, Alex M. Bronstein, and Ron Kimmel. “On Convex Relaxation of Graph Isomorphism.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1401651112\">https://doi.org/10.1073/pnas.1401651112</a>.","ama":"Aflalo Y, Bronstein AM, Kimmel R. On convex relaxation of graph isomorphism. <i>Proceedings of the National Academy of Sciences</i>. 2015;112(10):2942-2947. doi:<a href=\"https://doi.org/10.1073/pnas.1401651112\">10.1073/pnas.1401651112</a>","mla":"Aflalo, Yonathan, et al. “On Convex Relaxation of Graph Isomorphism.” <i>Proceedings of the National Academy of Sciences</i>, vol. 112, no. 10, National Academy of Sciences, 2015, pp. 2942–47, doi:<a href=\"https://doi.org/10.1073/pnas.1401651112\">10.1073/pnas.1401651112</a>.","ieee":"Y. Aflalo, A. M. Bronstein, and R. Kimmel, “On convex relaxation of graph isomorphism,” <i>Proceedings of the National Academy of Sciences</i>, vol. 112, no. 10. National Academy of Sciences, pp. 2942–2947, 2015.","apa":"Aflalo, Y., Bronstein, A. M., &#38; Kimmel, R. (2015). On convex relaxation of graph isomorphism. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1401651112\">https://doi.org/10.1073/pnas.1401651112</a>","short":"Y. Aflalo, A.M. Bronstein, R. Kimmel, Proceedings of the National Academy of Sciences 112 (2015) 2942–2947."}},{"volume":9035,"main_file_link":[{"url":"http://arxiv.org/abs/1411.4604","open_access":"1"}],"page":"517 - 532","external_id":{"arxiv":["1411.4604"]},"year":"2015","publisher":"Springer","oa_version":"Preprint","date_updated":"2025-06-11T07:09:03Z","doi":"10.1007/978-3-662-46681-0_50","alternative_title":["LNCS"],"oa":1,"arxiv":1,"article_processing_charge":"No","fulldoi":"https://doi.org/10.1007/978-3-662-46681-0_50","language":[{"iso":"eng"}],"ec_funded":1,"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Swen","last_name":"Jacobs","full_name":"Jacobs, Swen"},{"last_name":"Könighofer","first_name":"Robert","full_name":"Könighofer, Robert"}],"month":"01","intvolume":"      9035","publication_status":"published","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2015-04-11","end_date":"2015-04-18","location":"London, United Kingdom"},"publist_id":"5264","citation":{"apa":"Bloem, R., Chatterjee, K., Jacobs, S., &#38; Könighofer, R. (2015). Assume-guarantee synthesis for concurrent reactive programs with partial information (Vol. 9035, pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">https://doi.org/10.1007/978-3-662-46681-0_50</a>","ieee":"R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee synthesis for concurrent reactive programs with partial information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom, 2015, vol. 9035, pp. 517–532.","short":"R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.","mla":"Bloem, Roderick, et al. <i>Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information</i>. Vol. 9035, Springer, 2015, pp. 517–32, doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">10.1007/978-3-662-46681-0_50</a>.","ista":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis for concurrent reactive programs with partial information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,” 9035:517–32. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">https://doi.org/10.1007/978-3-662-46681-0_50</a>.","ama":"Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis for concurrent reactive programs with partial information. In: Vol 9035. Springer; 2015:517-532. doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_50\">10.1007/978-3-662-46681-0_50</a>"},"date_created":"2018-12-11T11:54:17Z","type":"conference","day":"01","title":"Assume-guarantee synthesis for concurrent reactive programs with partial information","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","department":[{"_id":"KrCh"}],"date_published":"2015-01-01T00:00:00Z","status":"public","abstract":[{"text":"Synthesis of program parts is particularly useful for concurrent systems. However, most approaches do not support common design tasks, like modifying a single process without having to re-synthesize or verify the whole system. Assume-guarantee synthesis (AGS) provides robustness against modifications of system parts, but thus far has been limited to the perfect information setting. This means that local variables cannot be hidden from other processes, which renders synthesis results cumbersome or even impossible to realize.We resolve this shortcoming by defining AGS under partial information. We analyze the complexity and decidability in different settings, showing that the problem has a high worstcase complexity and is undecidable in many interesting cases. Based on these observations, we present a pragmatic algorithm based on bounded synthesis, and demonstrate its practical applicability on several examples.","lang":"eng"}],"_id":"1838","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) through the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by the European Commission through an ERC Start grant (279307: Graph Games) and project STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR 14 AVACS and project ASDPS(JA 2357/2-1)."},{"doi":"10.1109/cvpr.2015.7299161","date_published":"2015-10-15T00:00:00Z","status":"public","publication_identifier":{"isbn":["9781467369640"],"eissn":["1063-6919"]},"article_number":"7299161","fulldoi":"https://doi.org/10.1109/cvpr.2015.7299161","article_processing_charge":"No","language":[{"iso":"eng"}],"author":[{"first_name":"Roee","last_name":"Litman","full_name":"Litman, Roee"},{"first_name":"Simon","last_name":"Korman","full_name":"Korman, Simon"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Avidan, Shai","last_name":"Avidan","first_name":"Shai"}],"abstract":[{"lang":"eng","text":"This work presents a novel approach for detecting inliers in a given set of correspondences (matches). It does so without explicitly identifying any consensus set, based on a method for inlier rate estimation (IRE). Given such an estimator for the inlier rate, we also present an algorithm that detects a globally optimal transformation. We provide a theoretical analysis of the IRE method using a stochastic generative model on the continuous spaces of matches and transformations. This model allows rigorous investigation of the limits of our IRE method for the case of 2D-translation, further giving bounds and insights for the more general case. Our theoretical analysis is validated empirically and is shown to hold in practice for the more general case of 2D-affinities. In addition, we show that the combined framework works on challenging cases of 2D-homography estimation, with very few and possibly noisy inliers, where RANSAC generally fails."}],"_id":"18380","month":"10","publication_status":"published","conference":{"name":"IEEE Conference on Computer Vision and Pattern Recognition","start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, United States"},"citation":{"ista":"Litman R, Korman S, Bronstein AM, Avidan S. 2015. Inverting RANSAC: Global model detection via inlier rate estimation. 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Conference on Computer Vision and Pattern Recognition, 7299161.","ama":"Litman R, Korman S, Bronstein AM, Avidan S. Inverting RANSAC: Global model detection via inlier rate estimation. In: <i>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/cvpr.2015.7299161\">10.1109/cvpr.2015.7299161</a>","chicago":"Litman, Roee, Simon Korman, Alex M. Bronstein, and Shai Avidan. “Inverting RANSAC: Global Model Detection via Inlier Rate Estimation.” In <i>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/cvpr.2015.7299161\">https://doi.org/10.1109/cvpr.2015.7299161</a>.","mla":"Litman, Roee, et al. “Inverting RANSAC: Global Model Detection via Inlier Rate Estimation.” <i>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>, 7299161, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/cvpr.2015.7299161\">10.1109/cvpr.2015.7299161</a>.","ieee":"R. Litman, S. Korman, A. M. Bronstein, and S. Avidan, “Inverting RANSAC: Global model detection via inlier rate estimation,” in <i>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>, Boston, MA, United States, 2015.","short":"R. Litman, S. Korman, A.M. Bronstein, S. Avidan, in:, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, 2015.","apa":"Litman, R., Korman, S., Bronstein, A. M., &#38; Avidan, S. (2015). Inverting RANSAC: Global model detection via inlier rate estimation. In <i>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</i>. Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2015.7299161\">https://doi.org/10.1109/cvpr.2015.7299161</a>"},"date_created":"2024-10-15T11:20:54Z","year":"2015","type":"conference","title":"Inverting RANSAC: Global model detection via inlier rate estimation","publication":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","day":"15","publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-12-04T14:06:06Z","scopus_import":"1","quality_controlled":"1","oa_version":"None","extern":"1"},{"date_updated":"2024-12-04T14:01:05Z","quality_controlled":"1","scopus_import":"1","oa_version":"None","extern":"1","title":"Sparse null space basis pursuit and analysis dictionary learning for high-dimensional data analysis","publisher":"IEEE","publication":"2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","day":"06","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","type":"conference","date_created":"2024-10-15T11:20:54Z","citation":{"ama":"Bian X, Krim H, Bronstein AM, Dai L. Sparse null space basis pursuit and analysis dictionary learning for high-dimensional data analysis. In: <i>2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/icassp.2015.7178678\">10.1109/icassp.2015.7178678</a>","chicago":"Bian, Xiao, Hamid Krim, Alex M. Bronstein, and Liyi Dai. “Sparse Null Space Basis Pursuit and Analysis Dictionary Learning for High-Dimensional Data Analysis.” In <i>2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/icassp.2015.7178678\">https://doi.org/10.1109/icassp.2015.7178678</a>.","ista":"Bian X, Krim H, Bronstein AM, Dai L. 2015. Sparse null space basis pursuit and analysis dictionary learning for high-dimensional data analysis. 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). 40th IEEE International Conference on Acoustics, Speech, and Signal Processing, 7178678.","ieee":"X. Bian, H. Krim, A. M. Bronstein, and L. Dai, “Sparse null space basis pursuit and analysis dictionary learning for high-dimensional data analysis,” in <i>2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, South Brisbane, QLD, Australia, 2015.","apa":"Bian, X., Krim, H., Bronstein, A. M., &#38; Dai, L. (2015). Sparse null space basis pursuit and analysis dictionary learning for high-dimensional data analysis. In <i>2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. South Brisbane, QLD, Australia: IEEE. <a href=\"https://doi.org/10.1109/icassp.2015.7178678\">https://doi.org/10.1109/icassp.2015.7178678</a>","short":"X. Bian, H. Krim, A.M. Bronstein, L. Dai, in:, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2015.","mla":"Bian, Xiao, et al. “Sparse Null Space Basis Pursuit and Analysis Dictionary Learning for High-Dimensional Data Analysis.” <i>2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>, 7178678, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/icassp.2015.7178678\">10.1109/icassp.2015.7178678</a>."},"publication_status":"published","month":"08","conference":{"name":"40th IEEE International Conference on Acoustics, Speech, and Signal Processing","start_date":"2015-04-19","end_date":"2015-04-24","location":"South Brisbane, QLD, Australia"},"language":[{"iso":"eng"}],"author":[{"first_name":"Xiao","last_name":"Bian","full_name":"Bian, Xiao"},{"last_name":"Krim","first_name":"Hamid","full_name":"Krim, Hamid"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"last_name":"Dai","first_name":"Liyi","full_name":"Dai, Liyi"}],"_id":"18387","abstract":[{"text":"Sparse models in dictionary learning have been successfully applied in a wide variety of machine learning and computer vision problems, and have also recently been of increasing research interest. Another interesting related problem based on a linear equality constraint, namely the sparse null space problem (SNS), first appeared in 1986, and has since inspired results on sparse basis pursuit. In this paper, we investigate the relation between the SNS problem and the analysis dictionary learning problem, and show that the SNS problem plays a central role, and may be utilized to solve dictionary learning problems. Moreover, we propose an efficient algorithm of sparse null space basis pursuit, and extend it to a solution of analysis dictionary learning. Experimental results on numerical synthetic data and real-world data are further presented to validate the performance of our method.","lang":"eng"}],"status":"public","publication_identifier":{"eissn":["2379-190X"],"eisbn":["9781467369978"]},"article_number":"7178678","fulldoi":"https://doi.org/10.1109/icassp.2015.7178678","article_processing_charge":"No","doi":"10.1109/icassp.2015.7178678","date_published":"2015-08-06T00:00:00Z"},{"abstract":[{"text":"We present MultiGain, a tool to synthesize strategies for Markov decision processes (MDPs) with multiple mean-payoff objectives. Our models are described in PRISM, and our tool uses the existing interface and simulator of PRISM. Our tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives, and also provides features such as (i) generating strategies and exploring them for simulation, and checking them with respect to other properties; and (ii) generating an approximate Pareto curve for two mean-payoff objectives. In addition, we present a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives under memoryless strategies.","lang":"eng"}],"_id":"1839","date_published":"2015-01-01T00:00:00Z","department":[{"_id":"KrCh"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","title":"Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives","scopus_import":"1","citation":{"ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">https://doi.org/10.1007/978-3-662-46681-0_12</a>.","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">10.1007/978-3-662-46681-0_12</a>","mla":"Brázdil, Tomáš, et al. <i>Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives</i>. Vol. 9035, Springer, 2015, pp. 181–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">10.1007/978-3-662-46681-0_12</a>.","ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer, pp. 181–187, 2015.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.","apa":"Brázdil, T., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2015). Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46681-0_12\">https://doi.org/10.1007/978-3-662-46681-0_12</a>"},"date_created":"2018-12-11T11:54:18Z","series_title":"Lecture Notes in Computer Science","type":"conference","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Forejt, Vojtěch","first_name":"Vojtěch","last_name":"Forejt"},{"full_name":"Kučera, Antonín","last_name":"Kučera","first_name":"Antonín"}],"language":[{"iso":"eng"}],"ec_funded":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"conference":{"start_date":"2015-04-11","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2015-04-18","location":"London, United Kingdom"},"publist_id":"5263","month":"01","intvolume":"      9035","publication_status":"published","doi":"10.1007/978-3-662-46681-0_12","article_processing_charge":"No","arxiv":1,"fulldoi":"https://doi.org/10.1007/978-3-662-46681-0_12","oa":1,"alternative_title":["LNCS"],"publisher":"Springer","oa_version":"Preprint","quality_controlled":"1","date_updated":"2025-06-11T07:09:21Z","page":"181 - 187","main_file_link":[{"url":"http://arxiv.org/abs/1501.03093","open_access":"1"}],"external_id":{"arxiv":["1501.03093"]},"volume":9035,"year":"2015"},{"acknowledgement":"This work was supported by the Austrian Research Association under Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2 128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n","_id":"1840","abstract":[{"lang":"eng","text":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions."}],"status":"public","date_published":"2015-04-01T00:00:00Z","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"issue":"4","isi":1,"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","title":"Optimal Kullback-Leibler aggregation via information bottleneck","type":"journal_article","date_created":"2018-12-11T11:54:18Z","citation":{"mla":"Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>.","short":"B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic Control 60 (2015) 1010–1022.","ieee":"B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.","apa":"Geiger, B., Petrov, T., Kubin, G., &#38; Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. IEEE. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>","ista":"Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.","ama":"Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation via information bottleneck. <i>IEEE Transactions on Automatic Control</i>. 2015;60(4):1010-1022. doi:<a href=\"https://doi.org/10.1109/TAC.2014.2364971\">10.1109/TAC.2014.2364971</a>","chicago":"Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” <i>IEEE Transactions on Automatic Control</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TAC.2014.2364971\">https://doi.org/10.1109/TAC.2014.2364971</a>."},"publist_id":"5262","intvolume":"        60","publication_status":"published","month":"04","author":[{"first_name":"Bernhard","last_name":"Geiger","full_name":"Geiger, Bernhard"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana"},{"first_name":"Gernot","last_name":"Kubin","full_name":"Kubin, Gernot"},{"full_name":"Koeppl, Heinz","first_name":"Heinz","last_name":"Koeppl"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","arxiv":1,"fulldoi":"https://doi.org/10.1109/TAC.2014.2364971","oa":1,"publication_identifier":{"issn":["0018-9286"]},"doi":"10.1109/TAC.2014.2364971","oa_version":"Preprint","quality_controlled":"1","date_updated":"2025-09-23T09:45:33Z","publication":"IEEE Transactions on Automatic Control","publisher":"IEEE","year":"2015","external_id":{"arxiv":["1304.6603"],"isi":["000351731600009"]},"page":"1010 - 1022","volume":60,"main_file_link":[{"url":"http://arxiv.org/abs/1304.6603","open_access":"1"}]},{"conference":{"location":"Paris, France","end_date":"2014-10-30","name":"IEEE International Conference on Image Processing","start_date":"2014-10-27"},"publication_status":"published","month":"01","author":[{"last_name":"Menashe","first_name":"Ohad","full_name":"Menashe, Ohad"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander"}],"_id":"18400","abstract":[{"text":"We propose a method and a prototype imaging system for real-time reconstruction of volumetric piecewise-smooth scattering media. The volume is illuminated by a sequence of structured binary patterns emitted from a fan beam projector, and the scattered light is collected by a two-dimensional sensor, thus creating an under-complete set of compressed measurements. We show a fixed-complexity and latency reconstruction algorithm capable of estimating the scattering coefficients in real-time. We also show a simple greedy algorithm for learning the optimal illumination patterns. Our results demonstrate faithful reconstruction from highly compressed measurements. Furthermore, a method for compressed registration of the measured volume to a known template is presented, showing excellent alignment with just a single projection. Though our prototype system operates in visible light, the presented methodology is suitable for fast x-ray scattering imaging, in particular in real-time vascular medical imaging.","lang":"eng"}],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/icip.2014.7025264","article_number":"7025264","article_processing_charge":"No","status":"public","publication_identifier":{"eisbn":["9781479957514"],"eissn":["2381-8549"]},"doi":"10.1109/icip.2014.7025264","date_published":"2015-01-29T00:00:00Z","quality_controlled":"1","date_updated":"2024-12-04T13:56:28Z","scopus_import":"1","extern":"1","oa_version":"None","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Real-time compressed imaging of scattering volumes","publisher":"IEEE","day":"29","publication":"2014 IEEE International Conference on Image Processing (ICIP)","type":"conference","year":"2015","date_created":"2024-10-15T11:20:54Z","citation":{"ista":"Menashe O, Bronstein AM. 2015. Real-time compressed imaging of scattering volumes. 2014 IEEE International Conference on Image Processing (ICIP). IEEE International Conference on Image Processing, 7025264.","chicago":"Menashe, Ohad, and Alex M. Bronstein. “Real-Time Compressed Imaging of Scattering Volumes.” In <i>2014 IEEE International Conference on Image Processing (ICIP)</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/icip.2014.7025264\">https://doi.org/10.1109/icip.2014.7025264</a>.","ama":"Menashe O, Bronstein AM. Real-time compressed imaging of scattering volumes. In: <i>2014 IEEE International Conference on Image Processing (ICIP)</i>. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/icip.2014.7025264\">10.1109/icip.2014.7025264</a>","apa":"Menashe, O., &#38; Bronstein, A. M. (2015). Real-time compressed imaging of scattering volumes. In <i>2014 IEEE International Conference on Image Processing (ICIP)</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/icip.2014.7025264\">https://doi.org/10.1109/icip.2014.7025264</a>","ieee":"O. Menashe and A. M. Bronstein, “Real-time compressed imaging of scattering volumes,” in <i>2014 IEEE International Conference on Image Processing (ICIP)</i>, Paris, France, 2015.","short":"O. Menashe, A.M. Bronstein, in:, 2014 IEEE International Conference on Image Processing (ICIP), IEEE, 2015.","mla":"Menashe, Ohad, and Alex M. Bronstein. “Real-Time Compressed Imaging of Scattering Volumes.” <i>2014 IEEE International Conference on Image Processing (ICIP)</i>, 7025264, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/icip.2014.7025264\">10.1109/icip.2014.7025264</a>."}},{"date_published":"2015-12-10T00:00:00Z","doi":"10.1109/icip.2015.7351256","publication_identifier":{"eisbn":["9781479983391"]},"status":"public","article_processing_charge":"No","fulldoi":"https://doi.org/10.1109/icip.2015.7351256","article_number":"7351256","language":[{"iso":"eng"}],"abstract":[{"text":"Intel's newly-announced low-cost RealSense 3D camera claims significantly better precision than other currently available low-cost platforms and is expected to become ubiquitous in laptops and mobile devices starting this year. In this paper, we demonstrate for the first time that the RealSense camera can be easily converted into a real low-cost gaze tracker. Gaze has become increasingly relevant as an input for human-computer interaction due to its association with attention. It is also critical in clinical mental health diagnosis. We present a novel 3D gaze and fixation tracker based on the eye surface geometry captured with the RealSense 3D camera. First, eye surface 3D point clouds are segmented to extract the pupil center and iris using registered infrared images. With non-ellipsoid eye surface and single fixation point assumptions, pupil centers and iris normal vectors are used to first estimate gaze (for each eye), and then a single fixation point for both eyes simultaneously using a RANSAC-based approach. With a simple learned bias field correction model, the fixation tracker demonstrates mean error of approximately 1 cm at 20-30 cm, which is sufficiently adequate for gaze and fixation tracking in human-computer interaction and mental health diagnosis applications.","lang":"eng"}],"_id":"18401","author":[{"first_name":"Mark","last_name":"Draelos","full_name":"Draelos, Mark"},{"full_name":"Qiu, Qiang","last_name":"Qiu","first_name":"Qiang"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Sapiro, Guillermo","first_name":"Guillermo","last_name":"Sapiro"}],"publication_status":"published","month":"12","conference":{"location":"Quebec City, QC, Canada","end_date":"2015-09-30","name":"IEEE International Conference on Image Processing","start_date":"2015-09-27"},"citation":{"ama":"Draelos M, Qiu Q, Bronstein AM, Sapiro G. Intel realsense = Real low cost gaze. In: <i>2015 IEEE International Conference on Image Processing (ICIP)</i>. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/icip.2015.7351256\">10.1109/icip.2015.7351256</a>","chicago":"Draelos, Mark, Qiang Qiu, Alex M. Bronstein, and Guillermo Sapiro. “Intel Realsense = Real Low Cost Gaze.” In <i>2015 IEEE International Conference on Image Processing (ICIP)</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/icip.2015.7351256\">https://doi.org/10.1109/icip.2015.7351256</a>.","ista":"Draelos M, Qiu Q, Bronstein AM, Sapiro G. 2015. Intel realsense = Real low cost gaze. 2015 IEEE International Conference on Image Processing (ICIP). IEEE International Conference on Image Processing, 7351256.","apa":"Draelos, M., Qiu, Q., Bronstein, A. M., &#38; Sapiro, G. (2015). Intel realsense = Real low cost gaze. In <i>2015 IEEE International Conference on Image Processing (ICIP)</i>. Quebec City, QC, Canada: IEEE. <a href=\"https://doi.org/10.1109/icip.2015.7351256\">https://doi.org/10.1109/icip.2015.7351256</a>","short":"M. Draelos, Q. Qiu, A.M. Bronstein, G. Sapiro, in:, 2015 IEEE International Conference on Image Processing (ICIP), IEEE, 2015.","ieee":"M. Draelos, Q. Qiu, A. M. Bronstein, and G. Sapiro, “Intel realsense = Real low cost gaze,” in <i>2015 IEEE International Conference on Image Processing (ICIP)</i>, Quebec City, QC, Canada, 2015.","mla":"Draelos, Mark, et al. “Intel Realsense = Real Low Cost Gaze.” <i>2015 IEEE International Conference on Image Processing (ICIP)</i>, 7351256, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/icip.2015.7351256\">10.1109/icip.2015.7351256</a>."},"date_created":"2024-10-15T11:20:54Z","year":"2015","type":"conference","day":"10","publisher":"IEEE","publication":"2015 IEEE International Conference on Image Processing (ICIP)","title":"Intel realsense = Real low cost gaze","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","oa_version":"None","date_updated":"2024-12-05T08:13:05Z","quality_controlled":"1","scopus_import":"1"},{"year":"2015","page":"919 - 930","volume":37,"main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"external_id":{"isi":["000352533000002"],"arxiv":["1309.5655"]},"date_updated":"2025-09-22T14:33:14Z","quality_controlled":"1","OA_place":"repository","oa_version":"Preprint","publisher":"IEEE","related_material":{"record":[{"relation":"earlier_version","id":"2273","status":"public"}]},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","fulldoi":"https://doi.org/10.1109/TPAMI.2014.2363465","corr_author":"1","arxiv":1,"article_processing_charge":"No","oa":1,"doi":"10.1109/TPAMI.2014.2363465","publist_id":"5261","OA_type":"green","intvolume":"        37","month":"05","article_type":"original","publication_status":"published","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"ec_funded":1,"language":[{"iso":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:54:18Z","citation":{"ama":"Kolmogorov V. A new look at reweighted message passing. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(5):919-930. doi:<a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">10.1109/TPAMI.2014.2363465</a>","chicago":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">https://doi.org/10.1109/TPAMI.2014.2363465</a>.","ista":"Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.","ieee":"V. Kolmogorov, “A new look at reweighted message passing,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 5. IEEE, pp. 919–930, 2015.","apa":"Kolmogorov, V. (2015). A new look at reweighted message passing. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">https://doi.org/10.1109/TPAMI.2014.2363465</a>","short":"V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.","mla":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:<a href=\"https://doi.org/10.1109/TPAMI.2014.2363465\">10.1109/TPAMI.2014.2363465</a>."},"issue":"5","scopus_import":"1","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"A new look at reweighted message passing","day":"01","status":"public","date_published":"2015-05-01T00:00:00Z","department":[{"_id":"VlKo"}],"abstract":[{"lang":"eng","text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results."}],"_id":"1841"},{"doi":"10.1109/tpami.2015.2392779","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"oa":1,"pmid":1,"article_processing_charge":"No","arxiv":1,"fulldoi":"https://doi.org/10.1109/tpami.2015.2392779","language":[{"iso":"eng"}],"author":[{"last_name":"Sprechmann","first_name":"P.","full_name":"Sprechmann, P."},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander"},{"full_name":"Sapiro, G.","first_name":"G.","last_name":"Sapiro"}],"intvolume":"        37","month":"09","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1212.3631","open_access":"1"}],"volume":37,"page":"1821-1833","external_id":{"arxiv":["1212.3631"],"pmid":["26353129"]},"year":"2015","publisher":"IEEE","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","oa_version":"Preprint","extern":"1","date_updated":"2024-12-18T11:40:35Z","quality_controlled":"1","date_published":"2015-09-01T00:00:00Z","status":"public","_id":"18415","abstract":[{"text":"Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure and data-dependent complexity and latency of iterative optimization constitute a major limitation in many applications requiring real-time performance or involving large-scale data. Another limitation encountered by these modeling techniques is the difficulty of their inclusion in discriminative learning scenarios. In this work, we propose to move the emphasis from the model to the pursuit algorithm, and develop a process-centric view of parsimonious modeling, in which a learned deterministic fixed-complexity pursuit process is used in lieu of iterative optimization. We show a principled way to construct learnable pursuit process architectures for structured sparse and robust low rank models, derived from the iteration of proximal descent algorithms. These architectures learn to approximate the exact parsimonious representation at a fraction of the complexity of the standard optimization methods. We also show that appropriate training regimes allow to naturally extend parsimonious models to discriminative settings. State-of-the-art results are demonstrated on several challenging problems in image and audio processing with several orders of magnitude speed-up compared to the exact optimization algorithms.","lang":"eng"}],"citation":{"chicago":"Sprechmann, P., Alex M. Bronstein, and G. Sapiro. “Learning Efficient Sparse and Low Rank Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/tpami.2015.2392779\">https://doi.org/10.1109/tpami.2015.2392779</a>.","ama":"Sprechmann P, Bronstein AM, Sapiro G. Learning efficient sparse and low rank models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(9):1821-1833. doi:<a href=\"https://doi.org/10.1109/tpami.2015.2392779\">10.1109/tpami.2015.2392779</a>","ista":"Sprechmann P, Bronstein AM, Sapiro G. 2015. Learning efficient sparse and low rank models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(9), 1821–1833.","mla":"Sprechmann, P., et al. “Learning Efficient Sparse and Low Rank Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 9, IEEE, 2015, pp. 1821–33, doi:<a href=\"https://doi.org/10.1109/tpami.2015.2392779\">10.1109/tpami.2015.2392779</a>.","apa":"Sprechmann, P., Bronstein, A. M., &#38; Sapiro, G. (2015). Learning efficient sparse and low rank models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2015.2392779\">https://doi.org/10.1109/tpami.2015.2392779</a>","short":"P. Sprechmann, A.M. Bronstein, G. Sapiro, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 1821–1833.","ieee":"P. Sprechmann, A. M. Bronstein, and G. Sapiro, “Learning efficient sparse and low rank models,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 9. IEEE, pp. 1821–1833, 2015."},"date_created":"2024-10-15T11:20:55Z","type":"journal_article","day":"01","title":"Learning efficient sparse and low rank models","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","issue":"9"},{"external_id":{"pmid":["26539854"]},"volume":37,"page":"2505-2517","year":"2015","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","publisher":"IEEE","oa_version":"None","extern":"1","quality_controlled":"1","date_updated":"2024-12-12T14:08:46Z","doi":"10.1109/tpami.2015.2408348","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"pmid":1,"article_processing_charge":"No","fulldoi":"https://doi.org/10.1109/tpami.2015.2408348","language":[{"iso":"eng"}],"author":[{"full_name":"Eynard, Davide","first_name":"Davide","last_name":"Eynard"},{"full_name":"Kovnatsky, Artiom","first_name":"Artiom","last_name":"Kovnatsky"},{"last_name":"Bronstein","first_name":"Michael M.","full_name":"Bronstein, Michael M."},{"first_name":"Klaus","last_name":"Glashoff","full_name":"Glashoff, Klaus"},{"full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","first_name":"Alexander","orcid":"0000-0001-9699-8730"}],"intvolume":"        37","month":"12","publication_status":"published","citation":{"mla":"Eynard, Davide, et al. “Multimodal Manifold Snalysis by Simultaneous Diagonalization of Laplacians.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 12, IEEE, 2015, pp. 2505–17, doi:<a href=\"https://doi.org/10.1109/tpami.2015.2408348\">10.1109/tpami.2015.2408348</a>.","apa":"Eynard, D., Kovnatsky, A., Bronstein, M. M., Glashoff, K., &#38; Bronstein, A. M. (2015). Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2015.2408348\">https://doi.org/10.1109/tpami.2015.2408348</a>","ieee":"D. Eynard, A. Kovnatsky, M. M. Bronstein, K. Glashoff, and A. M. Bronstein, “Multimodal manifold snalysis by simultaneous diagonalization of Laplacians,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 12. IEEE, pp. 2505–2517, 2015.","short":"D. Eynard, A. Kovnatsky, M.M. Bronstein, K. Glashoff, A.M. Bronstein, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 2505–2517.","ista":"Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. 2015. Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(12), 2505–2517.","chicago":"Eynard, Davide, Artiom Kovnatsky, Michael M. Bronstein, Klaus Glashoff, and Alex M. Bronstein. “Multimodal Manifold Snalysis by Simultaneous Diagonalization of Laplacians.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/tpami.2015.2408348\">https://doi.org/10.1109/tpami.2015.2408348</a>.","ama":"Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(12):2505-2517. doi:<a href=\"https://doi.org/10.1109/tpami.2015.2408348\">10.1109/tpami.2015.2408348</a>"},"date_created":"2024-10-15T11:20:55Z","type":"journal_article","day":"01","title":"Multimodal manifold snalysis by simultaneous diagonalization of Laplacians","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","issue":"12","date_published":"2015-12-01T00:00:00Z","status":"public","abstract":[{"lang":"eng","text":"We construct an extension of spectral and diffusion geometry to multiple modalities through simultaneous diagonalization of Laplacian matrices. This naturally extends classical data analysis tools based on spectral geometry, such as diffusion maps and spectral clustering. We provide several synthetic and real examples of manifold learning, object classification, and clustering, showing that the joint spectral geometry better captures the inherent structure of multi-modal data. We also show the relation of many previous approaches for multimodal manifold analysis to our framework."}],"_id":"18416"},{"year":"2015","volume":34,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1403.6637","open_access":"1"}],"external_id":{"arxiv":["1403.6637"]},"page":"2-13","oa_version":"Preprint","extern":"1","date_updated":"2024-12-19T10:12:48Z","quality_controlled":"1","publication":"Computer Graphics Forum","publisher":"Wiley","oa":1,"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"arxiv":1,"article_processing_charge":"No","fulldoi":"https://doi.org/10.1111/cgf.12454","doi":"10.1111/cgf.12454","intvolume":"        34","publication_status":"published","month":"02","language":[{"iso":"eng"}],"author":[{"last_name":"Korman","first_name":"Simon","full_name":"Korman, Simon"},{"full_name":"Litman, Roee","first_name":"Roee","last_name":"Litman"},{"full_name":"Avidan, Shai","first_name":"Shai","last_name":"Avidan"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"type":"journal_article","citation":{"ieee":"S. Korman, R. Litman, S. Avidan, and A. M. Bronstein, “Probably approximately symmetric: Fast rigid symmetry detection with global guarantees,” <i>Computer Graphics Forum</i>, vol. 34, no. 1. Wiley, pp. 2–13, 2015.","short":"S. Korman, R. Litman, S. Avidan, A.M. Bronstein, Computer Graphics Forum 34 (2015) 2–13.","apa":"Korman, S., Litman, R., Avidan, S., &#38; Bronstein, A. M. (2015). Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12454\">https://doi.org/10.1111/cgf.12454</a>","mla":"Korman, Simon, et al. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” <i>Computer Graphics Forum</i>, vol. 34, no. 1, Wiley, 2015, pp. 2–13, doi:<a href=\"https://doi.org/10.1111/cgf.12454\">10.1111/cgf.12454</a>.","ista":"Korman S, Litman R, Avidan S, Bronstein AM. 2015. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics Forum. 34(1), 2–13.","chicago":"Korman, Simon, Roee Litman, Shai Avidan, and Alex M. Bronstein. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12454\">https://doi.org/10.1111/cgf.12454</a>.","ama":"Korman S, Litman R, Avidan S, Bronstein AM. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. <i>Computer Graphics Forum</i>. 2015;34(1):2-13. doi:<a href=\"https://doi.org/10.1111/cgf.12454\">10.1111/cgf.12454</a>"},"date_created":"2024-10-15T11:20:55Z","scopus_import":"1","issue":"1","day":"01","title":"Probably approximately symmetric: Fast rigid symmetry detection with global guarantees","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2015-02-01T00:00:00Z","abstract":[{"text":"We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high probability. Our method uses a carefully designed sampling of the transformation space, where each transformation is efficiently evaluated using a sublinear algorithm. We prove that the density of the sampling depends on the total variation of the shape, allowing us to derive formal bounds on the algorithm's complexity and approximation quality. We further investigate different volumetric shape representations (in the form of truncated distance transforms), and in such a way control the total variation of the shape and hence the sampling density and the runtime of the algorithm. A comprehensive set of experiments assesses the proposed method, including an evaluation on the eight categories of the COSEG data set. This is the first large-scale evaluation of any symmetry detection technique that we are aware of.","lang":"eng"}],"_id":"18424"},{"date_created":"2024-10-15T11:20:55Z","citation":{"mla":"Biasotti, S., et al. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” <i>Computer Graphics Forum</i>, vol. 35, no. 6, Wiley, 2015, pp. 87–119, doi:<a href=\"https://doi.org/10.1111/cgf.12734\">10.1111/cgf.12734</a>.","short":"S. Biasotti, A. Cerri, A.M. Bronstein, M. Bronstein, Computer Graphics Forum 35 (2015) 87–119.","apa":"Biasotti, S., Cerri, A., Bronstein, A. M., &#38; Bronstein, M. (2015). Recent trends, applications, and perspectives in 3D shape similarity assessment. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12734\">https://doi.org/10.1111/cgf.12734</a>","ieee":"S. Biasotti, A. Cerri, A. M. Bronstein, and M. Bronstein, “Recent trends, applications, and perspectives in 3D shape similarity assessment,” <i>Computer Graphics Forum</i>, vol. 35, no. 6. Wiley, pp. 87–119, 2015.","ista":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. 2015. Recent trends, applications, and perspectives in 3D shape similarity assessment. Computer Graphics Forum. 35(6), 87–119.","ama":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. Recent trends, applications, and perspectives in 3D shape similarity assessment. <i>Computer Graphics Forum</i>. 2015;35(6):87-119. doi:<a href=\"https://doi.org/10.1111/cgf.12734\">10.1111/cgf.12734</a>","chicago":"Biasotti, S., A. Cerri, Alex M. Bronstein, and M. Bronstein. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12734\">https://doi.org/10.1111/cgf.12734</a>."},"page":"87-119","volume":35,"year":"2015","type":"journal_article","title":"Recent trends, applications, and perspectives in 3D shape similarity assessment","publisher":"Wiley","publication":"Computer Graphics Forum","day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2024-12-19T13:44:16Z","quality_controlled":"1","oa_version":"None","extern":"1","issue":"6","doi":"10.1111/cgf.12734","date_published":"2015-09-01T00:00:00Z","status":"public","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"fulldoi":"https://doi.org/10.1111/cgf.12734","article_processing_charge":"No","language":[{"iso":"eng"}],"author":[{"first_name":"S.","last_name":"Biasotti","full_name":"Biasotti, S."},{"full_name":"Cerri, A.","first_name":"A.","last_name":"Cerri"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"M.","last_name":"Bronstein","full_name":"Bronstein, M."}],"abstract":[{"lang":"eng","text":"The recent introduction of 3D shape analysis frameworks able to quantify the deformation of a shape into another in terms of the variation of real functions yields a new interpretation of the 3D shape similarity assessment and opens new perspectives. Indeed, while the classical approaches to similarity mainly quantify it as a numerical score, map-based methods also define (dense) shape correspondences. After presenting in detail the theoretical foundations underlying these approaches, we classify them by looking at their most salient features, including the kind of structure and invariance properties they capture, as well as the distances and the output modalities according to which the similarity between shapes is assessed and returned. We also review the usage of these methods in a number of 3D shape application domains, ranging from matching and retrieval to annotation and segmentation. Finally, the most promising directions for future research developments are discussed."}],"_id":"18425","month":"09","publication_status":"published","intvolume":"        35"},{"date_published":"2015-09-10T00:00:00Z","status":"public","_id":"18436","citation":{"apa":"Haim, H., Bronstein, A. M., &#38; Marom, E. (2015). Computational multi-focus imaging combining sparse model with color dependent phase mask. <i>Optics Express</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/oe.23.024547\">https://doi.org/10.1364/oe.23.024547</a>","ieee":"H. Haim, A. M. Bronstein, and E. Marom, “Computational multi-focus imaging combining sparse model with color dependent phase mask,” <i>Optics Express</i>, vol. 23, no. 19. Optica Publishing Group, pp. 24547–24556, 2015.","short":"H. Haim, A.M. Bronstein, E. Marom, Optics Express 23 (2015) 24547–24556.","mla":"Haim, Harel, et al. “Computational Multi-Focus Imaging Combining Sparse Model with Color Dependent Phase Mask.” <i>Optics Express</i>, vol. 23, no. 19, Optica Publishing Group, 2015, pp. 24547–56, doi:<a href=\"https://doi.org/10.1364/oe.23.024547\">10.1364/oe.23.024547</a>.","ama":"Haim H, Bronstein AM, Marom E. Computational multi-focus imaging combining sparse model with color dependent phase mask. <i>Optics Express</i>. 2015;23(19):24547-24556. doi:<a href=\"https://doi.org/10.1364/oe.23.024547\">10.1364/oe.23.024547</a>","chicago":"Haim, Harel, Alex M. Bronstein, and Emanuel Marom. “Computational Multi-Focus Imaging Combining Sparse Model with Color Dependent Phase Mask.” <i>Optics Express</i>. Optica Publishing Group, 2015. <a href=\"https://doi.org/10.1364/oe.23.024547\">https://doi.org/10.1364/oe.23.024547</a>.","ista":"Haim H, Bronstein AM, Marom E. 2015. Computational multi-focus imaging combining sparse model with color dependent phase mask. Optics Express. 23(19), 24547–24556."},"date_created":"2024-10-15T11:20:55Z","type":"journal_article","day":"10","title":"Computational multi-focus imaging combining sparse model with color dependent phase mask","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","issue":"19","doi":"10.1364/oe.23.024547","oa":1,"publication_identifier":{"eissn":["1094-4087"]},"article_processing_charge":"No","fulldoi":"https://doi.org/10.1364/oe.23.024547","language":[{"iso":"eng"}],"author":[{"first_name":"Harel","last_name":"Haim","full_name":"Haim, Harel"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","first_name":"Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Marom, Emanuel","last_name":"Marom","first_name":"Emanuel"}],"month":"09","publication_status":"published","intvolume":"        23","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1364/OE.23.024547"}],"volume":23,"page":"24547 - 24556","year":"2015","publisher":"Optica Publishing Group","publication":"Optics Express","extern":"1","oa_version":"Published Version","date_updated":"2024-12-19T10:48:50Z","quality_controlled":"1"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Low-cost gaze and pulse analysis using realsense","publication":"Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare","day":"22","publisher":"ICST","scopus_import":"1","date_updated":"2024-12-19T13:36:57Z","quality_controlled":"1","extern":"1","oa_version":"Published Version","date_created":"2024-10-15T11:20:55Z","citation":{"short":"Q. Qiu, Z. Chang, M. Draelos, J. Chen, A.M. Bronstein, G. Sapiro, in:, Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare, ICST, 2015.","ieee":"Q. Qiu, Z. Chang, M. Draelos, J. Chen, A. M. Bronstein, and G. Sapiro, “Low-cost gaze and pulse analysis using realsense,” in <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>, London, United Kingdom, 2015.","apa":"Qiu, Q., Chang, Z., Draelos, M., Chen, J., Bronstein, A. M., &#38; Sapiro, G. (2015). Low-cost gaze and pulse analysis using realsense. In <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>. London, United Kingdom: ICST. <a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">https://doi.org/10.4108/eai.14-10-2015.2261657</a>","mla":"Qiu, Qiang, et al. “Low-Cost Gaze and Pulse Analysis Using Realsense.” <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>, ICST, 2015, doi:<a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">10.4108/eai.14-10-2015.2261657</a>.","ista":"Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. 2015. Low-cost gaze and pulse analysis using realsense. Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare. 5th EAI International Conference on Wireless Mobile Communication and Healthcare - Transforming Healthcare through Innovations in Mobile and Wireless Technologies.","ama":"Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. Low-cost gaze and pulse analysis using realsense. In: <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>. ICST; 2015. doi:<a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">10.4108/eai.14-10-2015.2261657</a>","chicago":"Qiu, Qiang, Zhuoqing Chang, Mark Draelos, Jie Chen, Alex M. Bronstein, and Guillermo Sapiro. “Low-Cost Gaze and Pulse Analysis Using Realsense.” In <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>. ICST, 2015. <a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">https://doi.org/10.4108/eai.14-10-2015.2261657</a>."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4108/eai.14-10-2015.2261657"}],"type":"conference","year":"2015","author":[{"full_name":"Qiu, Qiang","last_name":"Qiu","first_name":"Qiang"},{"first_name":"Zhuoqing","last_name":"Chang","full_name":"Chang, Zhuoqing"},{"full_name":"Draelos, Mark","first_name":"Mark","last_name":"Draelos"},{"last_name":"Chen","first_name":"Jie","full_name":"Chen, Jie"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"full_name":"Sapiro, Guillermo","last_name":"Sapiro","first_name":"Guillermo"}],"_id":"18439","abstract":[{"lang":"eng","text":"Intel’s newly-announced low-cost and high precision RealSense 3D (RGBD) camera is becoming ubiquitous in laptops and mobile devices starting this year, opening the door for new applications in the mobile health arena. In this paper, we demonstrate how the Intel RealSense 3D camera can be used for low-cost gaze tracking and passive pulse rate estimation. We develop a novel 3D gaze and fixation tracker based on the eye surface geometry as well as an illumination invariant pulse rate estimation method using near-infrared images captured with RealSense. We achieve a mean error of 1cm at 20 − 30cm for the gaze tracker and 2.26bpm (beats per minute) for pulse estimation, which is adequate in many medical applications, demonstrating the great potential of novel consumer-grade RGBD technology in mobile health."}],"language":[{"iso":"eng"}],"conference":{"start_date":"2015-10-14","name":"5th EAI International Conference on Wireless Mobile Communication and Healthcare - Transforming Healthcare through Innovations in Mobile and Wireless Technologies","end_date":"2015-10-16","location":"London, United Kingdom"},"publication_status":"published","month":"12","doi":"10.4108/eai.14-10-2015.2261657","date_published":"2015-12-22T00:00:00Z","fulldoi":"https://doi.org/10.4108/eai.14-10-2015.2261657","article_processing_charge":"No","status":"public","publication_identifier":{"isbn":["9781631900884"]},"oa":1},{"oa":1,"fulldoi":"https://doi.org/10.4171/JEMS/548","arxiv":1,"article_processing_charge":"No","doi":"10.4171/JEMS/548","month":"08","intvolume":"        17","publication_status":"published","publist_id":"5669","language":[{"iso":"eng"}],"author":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yau, Horng","first_name":"Horng","last_name":"Yau"}],"year":"2015","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.3786"}],"volume":17,"page":"1927 - 2036","external_id":{"isi":["000360822900003"],"arxiv":["1211.3786"]},"date_updated":"2026-07-06T11:55:30Z","quality_controlled":"1","oa_version":"Preprint","publisher":"EMS Press","publication":"Journal of the European Mathematical Society","status":"public","department":[{"_id":"LaEr"}],"date_published":"2015-08-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential."}],"_id":"1508","das_tickbox":"1","type":"journal_article","date_created":"2018-12-11T11:52:26Z","citation":{"apa":"Erdös, L., &#38; Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>","short":"L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015) 1927–2036.","ieee":"L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8. EMS Press, pp. 1927–2036, 2015.","mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8, EMS Press, 2015, pp. 1927–2036, doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>.","ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. 2015;17(8):1927-2036. doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>","chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2015. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>.","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036."},"scopus_import":"1","isi":1,"issue":"8","title":"Gap universality of generalized Wigner and β ensembles","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_published":"2015-04-01T00:00:00Z","department":[{"_id":"ToHe"}],"article_number":"20","status":"public","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. "}],"_id":"1832","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:17Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_created":"2018-12-11T11:54:15Z","citation":{"apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1. International Federation for Computational Logic, 2015.","short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015).","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1, 20, International Federation for Computational Logic, 2015, doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>.","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2015. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. 2015;11(1). doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>"},"type":"journal_article","das_tickbox":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Aspect-oriented linearizability proofs","day":"01","issue":"1","scopus_import":"1","isi":1,"doi":"10.2168/LMCS-11(1:20)2015","pubrep_id":"390","fulldoi":"https://doi.org/10.2168/LMCS-11(1:20)2015","corr_author":"1","article_processing_charge":"No","oa":1,"author":[{"full_name":"Chakraborty, Soham","last_name":"Chakraborty","first_name":"Soham"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali"},{"full_name":"Vafeiadis, Viktor","first_name":"Viktor","last_name":"Vafeiadis"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"5271","intvolume":"        11","publication_status":"published","article_type":"original","month":"04","ddc":["000"],"external_id":{"isi":["000353193000019"]},"volume":11,"file":[{"file_name":"IST-2015-390-v1+1_1502.07639.pdf","access_level":"open_access","relation":"main_file","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:11:27Z","date_updated":"2020-07-14T12:45:17Z","checksum":"7370e164d0a731f442424a92669efc34","file_id":"4881","file_size":380203}],"year":"2015","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"publisher":"International Federation for Computational Logic","related_material":{"record":[{"id":"2328","relation":"earlier_version","status":"public"}]},"publication":"Logical Methods in Computer Science","date_updated":"2026-07-06T13:24:05Z","quality_controlled":"1","oa_version":"Published Version"},{"publication":"42nd International Colloquium on Automata, Languages, and Programming","related_material":{"record":[{"relation":"earlier_version","id":"5438","status":"public"},{"status":"public","id":"465","relation":"later_version"}]},"publisher":"Springer Nature","date_updated":"2026-07-06T13:27:53Z","quality_controlled":"1","OA_place":"repository","oa_version":"Preprint","page":"121 - 133","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.08259"}],"volume":9135,"external_id":{"arxiv":["1504.08259"],"isi":["000364317900010"]},"year":"2015","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"5556","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2015-07-06","end_date":"2015-07-10","location":"Kyoto, Japan"},"OA_type":"green","intvolume":"      9135","publication_status":"published","month":"07","pubrep_id":"321","doi":"10.1007/978-3-662-47666-6_10","fulldoi":"https://doi.org/10.1007/978-3-662-47666-6_10","article_processing_charge":"No","arxiv":1,"oa":1,"alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-3-662-47665-9"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Edit distance for pushdown automata","day":"01","issue":"Part II","scopus_import":"1","isi":1,"citation":{"ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: <i>42nd International Colloquium on Automata, Languages, and Programming</i>. Vol 9135. Springer Nature; 2015:121-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In <i>42nd International Colloquium on Automata, Languages, and Programming</i>, 9135:121–33. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>42nd International Colloquium on Automata, Languages, and Programming</i>, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2015). Edit distance for pushdown automata. In <i>42nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp. 121–133.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in <i>42nd International Colloquium on Automata, Languages, and Programming</i>, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133."},"date_created":"2018-12-11T11:53:01Z","type":"conference","abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k.","lang":"eng"}],"_id":"1610","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects\r\nS11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-\r\nN23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph\r\nGames), and MSR faculty fellows award.","date_published":"2015-07-01T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","day":"01","scopus_import":"1","isi":1,"date_created":"2018-12-11T11:53:18Z","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>.","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IEEE, 2015, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>.","apa":"Chatterjee, K., Komárková, Z., &#38; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.","short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256."},"series_title":"LICS","type":"conference","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"_id":"1657","acknowledgement":"A Technical Report of this paper is available at DOI: 10.15479/AT:IST-2015-318-v1-1\r\n","date_published":"2015-07-01T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","related_material":{"record":[{"status":"public","id":"5429","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5435"},{"status":"public","id":"466","relation":"later_version"}]},"publisher":"IEEE","date_updated":"2026-07-06T13:26:26Z","OA_place":"repository","quality_controlled":"1","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2015-318-v1-1","open_access":"1"}],"page":"244 - 256","external_id":{"isi":["000380427100024"]},"year":"2015","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Komárková","first_name":"Zuzana","full_name":"Komárková, Zuzana"},{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"}],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"5493","conference":{"end_date":"2015-07-10","start_date":"2015-07-06","name":"LICS: Logic in Computer Science","location":"Kyoto, Japan"},"OA_type":"green","month":"07","publication_status":"published","doi":"10.1109/LICS.2015.32","fulldoi":"https://doi.org/10.1109/LICS.2015.32","article_processing_charge":"No","alternative_title":["LICS"],"oa":1},{"_id":"5435","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:53Z","has_accepted_license":"1","date_published":"2015-02-23T00:00:00Z","department":[{"_id":"KrCh"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","day":"23","date_created":"2018-12-12T11:39:19Z","citation":{"short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p."},"type":"technical_report","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Komarkova, Zuzana","last_name":"Komarkova","first_name":"Zuzana"},{"orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"}],"language":[{"iso":"eng"}],"month":"02","publication_status":"published","ddc":["004"],"doi":"10.15479/AT:IST-2015-318-v2-1","pubrep_id":"327","fulldoi":"https://doi.org/10.15479/AT:IST-2015-318-v2-1","publication_identifier":{"issn":["2664-1690"]},"alternative_title":["IST Austria Technical Report"],"oa":1,"publisher":"IST Austria","related_material":{"record":[{"relation":"earlier_version","id":"5429","status":"public"},{"id":"1657","relation":"later_version","status":"public"},{"id":"466","relation":"later_version","status":"public"}]},"date_updated":"2026-07-06T13:26:26Z","oa_version":"Published Version","file":[{"date_created":"2018-12-12T11:54:03Z","relation":"main_file","content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2015-318-v2+1_main.pdf","file_size":717630,"checksum":"75284adec80baabdfe71ff9ebbc27445","file_id":"5525","date_updated":"2020-07-14T12:46:53Z"}],"page":"51","year":"2015"}]