Many-to-Many Graph Matching: a Continuous Relaxation Approach

Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs which optimally aligns their structure. In the classical formulation of graph matching, only one-to-one correspondences between vertices are considered. However, in many applications, graphs cannot be matched perfectly and it is more interesting to consider many-to-many correspondences where clusters of vertices in one graph are matched to clusters of vertices in the other graph. In this paper, we formulate the many-to-many graph matching problem as a discrete optimization problem and propose an approximate algorithm based on a continuous relaxation of the combinatorial problem. We compare our method with other existing methods on several benchmark computer vision datasets.Comment: 1

Electron correlation in FeSe superconductor studied by bulk-sensitive photoemission spectroscopy

We have investigated the electronic structures of recently discovered superconductor FeSe by soft-x-ray and hard-x-ray photoemission spectroscopy with high bulk sensitivity. The large Fe 3d spectral weight is located in the vicinity of the Fermi level (EF), which is demonstrated to be a coherent quasi-particle peak. Compared with the results of the band structure calculation with local-density approximation, Fe 3d band narrowing and the energy shift of the band toward EF are found, suggesting an importance of the electron correlation effect in FeSe. The self energy correction provides the larger mass enhancement value (Z^-1=3.6) than in Fe-As superconductors and enables us to separate a incoherent part from the spectrum. These features are quite consistent with the results of recent dynamical mean-field calculations, in which the incoherent part is attributed to the lower Hubbard band.Comment: 8 pages, 5 figures, 1 talbl

The Basics of Water Waves Theory for Analogue Gravity

This chapter gives an introduction to the connection between the physics of water waves and analogue gravity. Only a basic knowledge of fluid mechanics is assumed as a prerequisite.Comment: 36 pages. Lecture Notes for the IX SIGRAV School on "Analogue Gravity", Como (Italy), May 201

Reporters for the analysis of N-glycosylation in Candida albicans

Copyright © 2013 The Authors. Published by Elsevier Inc. All rights reserved.Peer reviewedPublisher PD

Shonan Rotation Averaging: Global Optimality by Surfing SO(p)nSO(p)^n

Shonan Rotation Averaging is a fast, simple, and elegant rotation averaging algorithm that is guaranteed to recover globally optimal solutions under mild assumptions on the measurement noise. Our method employs semidefinite relaxation in order to recover provably globally optimal solutions of the rotation averaging problem. In contrast to prior work, we show how to solve large-scale instances of these relaxations using manifold minimization on (only slightly) higher-dimensional rotation manifolds, re-using existing high-performance (but local) structure-from-motion pipelines. Our method thus preserves the speed and scalability of current SFM methods, while recovering globally optimal solutions.Comment: 30 pages (paper + supplementary material). To appear at the European Conference on Computer Vision (ECCV) 202

An Analysis of Errors in Graph-Based Keypoint Matching and Proposed Solutions

International audienceAn error occurs in graph-based keypoint matching when key-points in two different images are matched by an algorithm but do not correspond to the same physical point. Most previous methods acquire keypoints in a black-box manner, and focus on developing better algorithms to match the provided points. However to study the complete performance of a matching system one has to study errors through the whole matching pipeline, from keypoint detection, candidate selection to graph optimisation. We show that in the full pipeline there are six different types of errors that cause mismatches. We then present a matching framework designed to reduce these errors. We achieve this by adapting keypoint detectors to better suit the needs of graph-based matching, and achieve better graph constraints by exploiting more information from their keypoints. Our framework is applicable in general images and can handle clutter and motion discontinuities. We also propose a method to identify many mismatches a posteriori based on Left-Right Consistency inspired by stereo matching due to the asymmetric way we detect keypoints and define the graph

Phthalocyanine-nanocarbon ensembles: From discrete molecular and supramolecular systems to hybrid nanomaterials

This document is the Accepted Manuscript version of a Published Work that appeared in final form in Accounts of Chemical Research, copyright © American Chemical Society after peer review and technical editing by the publisher. To access the final edited and published work see http://dx.doi.org/10.1021/ar5004384Conspectus Phthalocyanines (Pcs) are macrocyclic and aromatic compounds that present unique electronic features such as high molar absorption coefficients, rich redox chemistry, and photoinduced energy/electron transfer abilities that can be modulated as a function of the electronic character of their counterparts in donor-acceptor (D-A) ensembles. In this context, carbon nanostructures such as fullerenes, carbon nanotubes (CNTs), and, more recently, graphene are among the most suitable Pc companions. Pc-C60 ensembles have been for a long time the main actors in this field, due to the commercial availability of C60 and the ell-established synthetic methods for its functionalization. As a result, many Pc-C60 architectures have been prepared, featuring different connectivities (covalent or supramolecular), intermolecular interactions (self-organized or molecularly dispersed species), and Pc HOMO/LUMO levels. All these elements provide a versatile toolbox for tuning the photophysical properties in terms of the type of process (photoinduced energy/electron transfer), the nature of the interactions beteen the electroactive units (through bond or space), and the kinetics of the formation/decay of the photogenerated species. Some recent trends in this field include the preparation of stimuli-responsive multicomponent systems ith tunable photophysical properties and highly ordered nanoarchitectures and surface-supported systems shoing high charge mobilities. A breakthrough in the Pc-nanocarbon field as the appearance of CNTs and graphene, hich opened a ne avenue for the preparation of intriguing photoresponsive hybrid ensembles shoing light-stimulated charge separation. The scarce solubility of these 1-D and 2-D nanocarbons, together ith their loer reactivity ith respect to C60 stemming from their less strained sp2 carbon netorks, has not meant an unsurmountable limitation for the preparation of variety of Pc-based hybrids. These systems, hich sho improved solubility and dispersibility features, bring together the unique electronic transport properties of CNTs and graphene ith the excellent light-harvesting and tunable redox properties of Pcs. A singular and distinctive feature of these Pc-CNT/graphene (single- or fe-layers) hybrid materials is the control of the direction of the photoinduced charge transfer as a result of the band-like electronic structure of these carbon nanoforms and the adjustable electronic levels of Pcs. Moreover, these conjugates present intensified light-harvesting capabilities resulting from the grafting of several chromophores on the same nanocarbon platform.In this Account, recent progress in the construction of covalent and supramolecular Pc-nanocarbon ensembles is summarized, ith a particular emphasis on their photoinduced behavior. e believe that the high degree of control achieved in the preparation of Pc-carbon nanostructures, together ith the increasing knoledge of the factors governing their photophysics, ill allo for the design of next-generation light-fueled electroactive systems. Possible implementation of these Pc-nanocarbons in high performance devices is envisioned, finally turning into reality much of the expectations generated by these materialsFinancial support from the Spanish MICINN (CTQ2011-24187/BQU), the Comunidad de Madrid (S2013/MIT-2841 FOTOCARBON) and the EU (“SO2S” FP7-PEOPLE-2012-ITN, no.: 316975) is acknowledge

Multiple structure alignment and consensus identification for proteins

<p>Abstract</p> <p>Background</p> <p>An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructures present in the given proteins. The algorithm represents each protein as a sequence of triples of coordinates of the alpha-carbon atoms along the backbone. It then computes iteratively a sequence of transformation matrices (i.e., translations and rotations) to align the proteins in space and generate the consensus. The algorithm is a heuristic in that it computes an approximation to the optimal alignment that minimizes the sum of the pairwise distances between the consensus and the transformed proteins.</p> <p>Results</p> <p>Experimental results show that the algorithm converges quite rapidly and generates consensus structures that are visually similar to the input proteins. A comparison with other coordinate-based alignment algorithms (MAMMOTH and MATT) shows that the proposed algorithm is competitive in terms of speed and the sizes of the conserved regions discovered in an extensive benchmark dataset derived from the HOMSTRAD and SABmark databases.</p> <p>The algorithm has been implemented in C++ and can be downloaded from the project's web page. Alternatively, the algorithm can be used via a web server which makes it possible to align protein structures by uploading files from local disk or by downloading protein data from the RCSB Protein Data Bank.</p> <p>Conclusions</p> <p>An algorithm is presented to compute a multiple structure alignment for a set of proteins, together with their consensus structure. Experimental results show its effectiveness in terms of the quality of the alignment and computational cost.</p

Realtime Deformation of Constrained Meshes Using GPU

Constrained meshes play an important role in freeform architectural design, as they can represent panel layouts on freeform surfaces. It is challenging to perform realtime manipulation on such meshes, because all constraints need to be respected during the deformation while the shape quality needs to be maintained. This usually leads to nonlinear constrained optimization problems, which are challenging to solve in real time. In this paper, we present a GPU-based shape manipulation tool for constrained meshes, using the parallelizable algorithm proposed in [8]. We discuss the main challenges and solutions for the GPU implementation, and provide timing comparison against a CPU implementation of the algorithm. Our GPU implementation significantly outperforms the CPU version, allowing realtime handle-based deformation for large constrained meshes