8,811 Hits in 11.8 sec

Robust Near-Isometric Matching via Structured Learning of Graphical Models [article]

Julian J. McAuley, Tiberio S. Caetano, Alexander J. Smola
2008 arXiv   pre-print
Models for near-rigid shape matching are typically based on distance-related features, in order to infer matches that are consistent with the isometric assumption.  ...  The outcome is a model for near-rigid shape matching which is robust in the sense that it is able to capture the possibly limited but still important scale and appearance variations.  ...  Figure 9 shows an example match using both the unary and higher-order techniques. Finally, figure 6 (right) shows the weights learned for this model.  ... 
arXiv:0809.3618v1 fatcat:s6dfkyn5x5ckrfs3uki7dj7eju

Statistical mechanics of multi-index matching problems with site disorder

David S. Dean, David Lancaster
2006 Physical Review E  
Particular attention is paid to the zero temperature limit of maximal matching problems where the method allows us to obtain the average value of the optimal match and also sheds light on the algorithmic  ...  A recently developed functional formalism is exploited which yields exact results in the finite temperature thermodynamic limit.  ...  DL acknowledges an EPSRC "Discipline Hopping Award".  ... 
doi:10.1103/physreve.74.041122 pmid:17155037 fatcat:45kgxkymd5d43egy6nyvs2u4ki

Multivariate moment matching for model order reduction of quadratic-bilinear systems using error bounds [article]

Muhammad Altaf Khattak, Mian Ilyas Ahmad, Lihong Feng, Peter Benner
2021 arXiv   pre-print
We propose an adaptive moment-matching framework for model order reduction of quadratic-bilinear descriptor systems.  ...  The results are compared with standard quadratic-bilinear projection methods and we observe that the approximations obtained by the proposed method yield high accuracy.  ...  Since our target is moment-matching for QBDAEs, we will mainly focus on the two-sided moment-matching technique of Benner and Breiten [10] .  ... 
arXiv:2105.12966v1 fatcat:aafjubrh6ravnbq4t2vyuhnela

Interferences in match kernels [article]

Naila Murray, Hervé Jégou, Florent Perronnin, Andrew Zisserman
2016 arXiv   pre-print
We consider the design of an image representation that embeds and aggregates a set of local descriptors into a single vector.  ...  The second one involves equalising the match of a single descriptor to the aggregated vector.  ...  ACKNOWLEDGMENTS This work was done within the Project Fire-ID, supported by the ANR French research agency, and also supported by ERC grant VisRec no. 228180.  ... 
arXiv:1611.08194v1 fatcat:p5nb75jrfzgrlcn2jixuwhwdbq

Computing Optimal Assignments in Linear Time for Approximate Graph Matching [article]

Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson
2019 arXiv   pre-print
We employ the method to approximate the edit distance between two graphs by matching their vertices in linear time.  ...  We verify the effectiveness and efficiency of our methods using synthetic and real-world datasets.  ...  ACKNOWLEDGEMENTS This work was supported by the German Research Foundation (DFG) within the Collaborative Research Center SFB 876 "Providing Information by Resource-Constrained Data Analysis", project  ... 
arXiv:1901.10356v2 fatcat:5or3mvlpj5d6xcfe37arq4n4mm

Covariant un-reduction for curve matching [article]

Alexis Arnaudon, Marco Castrillon Lopez, Darryl D. Holm
2015 arXiv   pre-print
This process is applied to the problem of curve matching in the plane, when the curves depend on more than one independent variable.  ...  This situation occurs in a variety of instances such as matching of surfaces or comparison of evolution between species.  ...  In contrast, the un-reduction technique introduced in [4] seeks a family of equations, called the un-reduced equations, on T Q, whose solution projects onto those of a set of Euler-Lagrange equations on  ... 
arXiv:1508.05325v1 fatcat:ulkrtbgrx5e7nplv4mokvmlfka

Inexact Bayesian point pattern matching for linear transformations

J. Christmas, R.M. Everson, J. Bell, C.P. Winlove
2014 Pattern Recognition  
The matching problem is inexact due to the lack of one-to-one correspondence between the point sets and the presence of noise.  ...  The method turns out to be similar in structure to the iterative closest point algorithm.  ...  Acknowledgments The authors would like to thank Dr Jessica Mansfield for assistance with equipment design and multiphoton microscopy.  ... 
doi:10.1016/j.patcog.2014.04.022 fatcat:ioam4gtsurb7nm24frbhs43o2e

Matched Asymptotic Expansions in Financial Engineering

Sam Howison
2005 Journal of Engineering Mathematics  
volatility model, and in a model for illiquid markets.  ...  This paper focuses on the use of matched asymptotic expansions in option pricing; it presents illustrations of the approach in 'plain vanilla' option valuation, in valuation using a fast mean-reverting-stochastic  ...  Acknowledgements I am grateful to Joe Conlon, Ben Hambly and Michael Mitton for helpful comments, and to Mike Giles for assistance with computation.  ... 
doi:10.1007/s10665-005-7716-z fatcat:3g5qteog3nggrjjskldbbr75la

Gravitate Project D3.1 Report On Shape Analysis And Matching And On Semantic Matching

Silvia Biasotti, Andrea Cerri, Chiara Catalano E., Bianca Falcidieno, Maria Laura Torrente, Stuart Middleton E., Leo Dorst, Ilan Shimshoni, Ayellet Tal, Dominic Oldman
2016 Zenodo  
This state of the art report describes the techniques of shape analysis, and of metadata search that have been already implemented in cultural heritage or we think are useful for the GRAVITATE project.  ...  After the review of the current literature on these fields, we end the report with common remarks on possible or plausible cross connections that suggest themselves.  ...  Many techniques for exact matching have existed for years.  ... 
doi:10.5281/zenodo.55432 fatcat:tc3rsykiufezxeper7ldew2ibu

Pattern matching in pseudo real-time

Raphaël Clifford, Benjamin Sach
2011 Journal of Discrete Algorithms  
We give new solutions which are applicable to a wide variety of matching problems including function and parameterised matching, swap matching, swap-mismatch, k-difference, k-difference with transpositions  ...  , overlap matching, edit distance/LCS and L 1 and L 2 rearrangement distances.  ...  The authors would also like to thank the anonymous reviewer for pointing out the link between self-normalised matching and L 2 -rearrangement distances.  ... 
doi:10.1016/j.jda.2010.09.005 fatcat:sr3p42h2vjfmzjc5rs7ippqpb4

Building bridges: matching density functional theory with experiment

David R. Bowler
2019 Contemporary physics (Print)  
The discussion will centre on the scanning tunnelling microscope (STM) and surface problems, tracking the author's personal interest, though the general principles are widely applicable.  ...  We will discuss the key concepts in density functional theory (DFT), how it can be used to model experimental data, and consider how the synergy between DFT and experiment can give significant insights  ...  Mike Gillan for fruitful and illuminating collaborations and discussions over many years.  ... 
doi:10.1080/00107514.2019.1578079 fatcat:gxofrcbbwvfirhhxgrzoqaa35y

A Fast, Randomised, Maximal Subset Matching Algorithm For Document-Level Music Retrieval

Raphaël Clifford, Manolis Christodoulakis, Tim Crawford, David Meredith 0001, Geraint A. Wiggins
2006 Zenodo  
A quadratic time lower bound is conjectured for the time complexity of this class of problems if exact solutions are required.  ...  OMRAS uses an approximate matching method, designed to work with noisy data (in both pitch and time dimensions), whereas MSM is an exact-matching method suitable for score-like representations; therefore  ... 
doi:10.5281/zenodo.1414878 fatcat:2mmwvusmljfylcuij5jia3ykwa

Interactively Matching Hand-Drawings Using Induction

Adrian R. Pearce, Terry Caelli
1999 Computer Vision and Image Understanding  
The procedure is analyzed for its ability to accommodate new symbols and answer orientation queries, and it is compared empirically with machine learning techniques.  ...  We have developed an interactive system for interpreting hand-drawn symbols and schematic drawings.  ...  The formulation relates to the class of exact solutions to Bayesian Networks [12] and this allows for the following definitions to be made.  ... 
doi:10.1006/cviu.1998.0742 fatcat:cxiy5xkas5hcdh7entawqlvtou

A dependently typed calculus with pattern matching and erasure inference

Matúš Tejiščák
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
We also give an erasure inference algorithm for erasure-unannotated or partially annotated programs and prove it sound, complete, and optimal with respect to the typing rules of the calculus.  ...  Some parts of dependently typed programs constitute evidence of their type-correctness and, once checked, are unnecessary for execution.  ...  ACKNOWLEDGMENTS The author would like to thank Edwin Brady, Andreas Abel, Jonathan Leivent, and Jan de Muijnck-Hughes for feedback, conversations, suggestions, draft reviews, and other support.  ... 
doi:10.1145/3408973 fatcat:ls43oxeho5hvlmvnmmvtqy65jq

Solving Hard Stable Matching Problems Involving Groups of Similar Agents [article]

Kitty Meeks, Baharak Rastegari
2017 arXiv   pre-print
We focus on the setting in which all agents involved in some matching problem can be partitioned into k different types, where the type of an agent determines his or her preferences, and agents have preferences  ...  We show that (for the case without exceptions), several well-studied NP-hard stable matching problems including Max SMTI (that of finding the maximum cardinality stable matching in an instance of stable  ...  Both authors are extremely grateful to David Manlove for his insightful comments on a preliminary version of this manuscript.  ... 
arXiv:1708.04109v1 fatcat:ydxttuybjvb4rl3ijhgp27fjz4
« Previous Showing results 1 — 15 out of 8,811 results