Results 11 to 20 of about 91,504 (262)
Early estimation model for 3D-discrete indian sign language recognition using graph matching
Journal of King Saud University: Computer and Information Sciences, 2021 Machine translation of sign language is a critical task of computer vision. In this work, we propose to use 3D motion capture technology for sign capture and graph matching for sign recognition.
E. Kiran Kumar +3 more
doaj +1 more source
Journal of Mathematical Biology, 2019 THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $σ$ an assignment of leaves of $T$ to species.
Geiß, M +8 more
openaire +4 more sources
Fractional matching preclusion for generalized augmented cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
Tianlong Ma +3 more
doaj +1 more source
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009 As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs.
Caetano, Tiberio +4 more
openaire +4 more sources
Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Journal of Chemistry, 2021 A connected graph GV,E in which the number of edges is one more than its number of vertices is called a bicyclic graph. A perfect matching of a graph is a matching in which every vertex of the graph is incident to exactly one edge of the matching set ...
Muhammad Rizwan +3 more
doaj +1 more source
Matching delaunay graphs [PDF]
Pattern Recognition, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Finch, Andrew M. +2 more
openaire +1 more source
Reciprocal best match graphs [PDF]
Journal of Mathematical Biology, 2019 Reciprocal best matches play an important role in numerous applications in computational biology, in particular as the basis of many widely used tools for orthology assessment. Nevertheless, very little is known about their mathematical structure. Here, we investigate the structure of reciprocal best match graphs (RBMGs).
Geiß, M., Stadler, P., Hellmuth, M.
openaire +4 more sources
Corrigendum to “Best match graphs” [PDF]
Journal of Mathematical Biology, 2021 AbstractTwo errors in the article Best Match Graphs (Geiß et al. in JMB 78: 2015–2057, 2019) are corrected. One concerns the tacit assumption that digraphs are sink-free, which has to be added as an additional precondition in Lemma 9, Lemma 11, Theorem 4. Correspondingly, Algorithm 2 requires that its input is sink-free.
David Schaller +9 more
openaire +4 more sources
Detecting Matching Blunders of Multi-Source Remote Sensing Images via Graph Theory
Sensors, 2020 Large radiometric and geometric distortion in multi-source images leads to fewer matching points with high matching blunder ratios, and global geometric relationship models between multi-sensor images are inexplicit.
Cailong Deng +3 more
doaj +1 more source
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Matching is a part of graph theory that discusses pair. A matching M is called to be maximum if M has the highest number of elements. A blossom which is encountered in non-bipartite graph can cause failure in process of finding the maximum matching in ...
Muchammad Abrori, Mohammad Imam Jauhari
doaj +1 more source