https://research-explorer.ista.ac.at 2000-01-01T00:00+00:00 1 monthly https://research-explorer.ista.ac.at/record/18396 Bronstein, Alexander Bronstein, M.M. Gordon, E. Kimmel, R. 2004 We discuss the synthesis between the 3D and the 2D data in three-dimensional face recognition. We show how to compensate for the illumination and racial expressions using the 3D facial geometry and present the approach of canonical images, which allows us to incorporate geometric information into standard face recognition approaches. https://research-explorer.ista.ac.at/record/18396 eng IEEE info:eu-repo/semantics/altIdentifier/doi/10.1109/icip.2004.1418696 info:eu-repo/semantics/altIdentifier/issn/1522-4880 info:eu-repo/semantics/altIdentifier/isbn/0780385543 info:eu-repo/semantics/closedAccess Bronstein AM, Bronstein MM, Gordon E, Kimmel R. Fusion of 2D and 3D data in three-dimensional face recognition. In: <i>2004 International Conference on Image Processing</i>. IEEE; 2004. doi:<a href="https://doi.org/10.1109/icip.2004.1418696">10.1109/icip.2004.1418696</a> Fusion of 2D and 3D data in three-dimensional face recognition info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/4498 Henzinger, Monika H Henzinger, Thomas A Kopke, Peter 1995 We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m⩾n). For effectively presented infinite graphs, we present a symbolic similarity-checking procedure that terminates if a finite similarity relation exists. We show that 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations. It follows that the refinement problem and the ∀CTL* model-checking problem are decidable for 2D rectangular automata https://research-explorer.ista.ac.at/record/4498 eng IEEE info:eu-repo/semantics/altIdentifier/doi/10.1109/SFCS.1995.492576 info:eu-repo/semantics/altIdentifier/issn/0272-5428 info:eu-repo/semantics/altIdentifier/isbn/0818671831 info:eu-repo/semantics/closedAccess Henzinger M, Henzinger TA, Kopke P. Computing simulations on finite and infinite graphs. In: <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>. IEEE; 1995:453-462. doi:<a href="https://doi.org/10.1109/SFCS.1995.492576">10.1109/SFCS.1995.492576</a> Computing simulations on finite and infinite graphs info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/18339 Mitra, Niloy J. Bronstein, Alexander Bronstein, Michael 2010 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. https://research-explorer.ista.ac.at/record/18339 eng Springer Nature info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-15558-1_29 info:eu-repo/semantics/altIdentifier/issn/0302-9743 info:eu-repo/semantics/altIdentifier/issn/1611-3349 info:eu-repo/semantics/altIdentifier/isbn/9783642155574 info:eu-repo/semantics/altIdentifier/isbn/9783642155581 info:eu-repo/semantics/closedAccess 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> Intrinsic regularity detection in 3D geometry LNCS info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/9402 Schmid, Laura Chatterjee, Krishnendu Hilbe, Christian Nowak, Martin A. 2021 Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability. https://research-explorer.ista.ac.at/record/9402 https://research-explorer.ista.ac.at/download/9402/14496 eng Springer Nature info:eu-repo/semantics/altIdentifier/doi/10.1038/s41562-021-01114-8 info:eu-repo/semantics/altIdentifier/issn/2397-3374 info:eu-repo/semantics/altIdentifier/wos/000650304000002 info:eu-repo/semantics/altIdentifier/pmid/33986519 info:eu-repo/grantAgreement/EC/H2020/863818 info:eu-repo/grantAgreement/EC/FP7/279307 info:eu-repo/semantics/openAccess Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and indirect reciprocity. <i>Nature Human Behaviour</i>. 2021;5(10):1292–1302. doi:<a href="https://doi.org/10.1038/s41562-021-01114-8">10.1038/s41562-021-01114-8</a> ddc:000 A unified framework of direct and indirect reciprocity info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_6501