Results 31 to 40 of about 91,504 (262)
A Robust False Matching Points Detection Method for Remote Sensing Image Registration [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 Given the influences of illumination, imaging angle, and geometric distortion, among others, false matching points still occur in all image registration algorithms.
X. J. Shan, P. Tang
doaj +1 more source
Constraint-Based Graph Matching [PDF]
, 2009 Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. It covers measures based on univalent matchings, such that each node is matched with at most one node, as well as multivalent matchings, such that a node may be matched with ...
Le Clément de Saint-Marcq, Vianney +2 more
openaire +2 more sources
Multiplex graph matching matched filters [PDF]
2019 IEEE International Conference on Big Data (Big Data), 2019 We consider the problem of detecting a noisy induced multiplex template network in a larger multiplex background network. Our approach, which extends the framework of [14] to the multiplex setting, leverages a multiplex analogue of the classical graph matching problem to use the template as a matched filter for efficiently searching the background for ...
Konstantinos Pantazis +4 more
openaire +1 more source
Conditional Matching Preclusion Number of Graphs
Discrete Dynamics in Nature and Society, 2023 The conditional matching preclusion number of a graph G, denoted by mp1G, is the minimum number of edges whose deletion results in the graph with no isolated vertices that has neither perfect matching nor almost-perfect matching.
Yalan Li, Shumin Zhang, Chengfu Ye
doaj +1 more source
Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
Complexity, 2019 The matching energy ME(G) of a graph G was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial m(G,x).
Xiaolin Chen, Huishu Lian
doaj +1 more source
The matching number and Hamiltonicity of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.
Rao Li
doaj +1 more source
Progressively Decomposing Graph Matching
IEEE Access, 2019 Existing approaches to graph matching mainly include two types, i.e., the Koopmans-Beckmann's QAP formulation (KB-QAP) and Lawler's QAP formulation (L-QAP).
Jin-Gang Yu +3 more
doaj +1 more source
Matching number and characteristic polynomial of a graph
Journal of Taibah University for Science, 2020 Matching number and the spectral properties depending on the characteristic polynomial of a graph obtained by means of the adjacency polynomial has many interesting applications in different areas of science.
Aysun Yurttas Gunes +3 more
doaj +1 more source
Dictionary-based matching graph network for biomedical named entity recognition
Scientific Reports, 2023 Biomedical named entity recognition (BioNER) is an essential task in biomedical information analysis. Recently, deep neural approaches have become widely utilized for BioNER.
Yinxia Lou, Xun Zhu, Kai Tan
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source