Related papers: On equivalence of vector-valued maps
Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…
Scalarization method is an important tool in the study of vector optimization as corresponding solutions of vector optimization problems can be found by solving scalar optimization problems. This is applied by Du (2010) [A note on cone…
We extend some recent results about bounded invariant equivalence relations and invariant subgroups of definable groups: we show that type-definability and smoothness are equivalent conditions in a wider class of relations than heretofore…
In this paper, we consolidate and expand upon the current theory and potential applications of the set of $k$ best \emph{cascading via-paths} (CVPs) and the \emph{reciprocal pointer chain} (RPC) method for identifying them. CVPs are a…
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster…
In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all…
Instead of evaluating the gradient field of the brightness map of an image, we propose the use of dipole vectors. This approach is obtained by adapting to the image gray-tone distribution the definition of the dipole moment of charge…
The widespread relevance of complex networks is a valuable tool in the analysis of a broad range of systems. There is a demand for tools which enable the extraction of meaningful information and allow the comparison between different…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
Information transfer between triangle meshes is of great importance in computer graphics and geometry processing. To facilitate this process, a smooth and accurate map is typically required between the two meshes. While such maps can…
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…
In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our…
This paper introduces the notion of ``relative gerbes'' for smooth maps of manifolds, and discusses their differential geometry. The equivalence classes of relative gerbes are further classified by the relative integral cohomology in degree…
We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the…
Graph comparison is fundamentally important for many applications such as the analysis of social networks and biological data and has been a significant research area in the pattern recognition and pattern analysis domains. Nowadays, the…
We consider the problem of determining if a pair of undirected graphs $\langle G_\mathsf{V}, G_\mathsf{H} \rangle$, which share the same vertex set, has a representation using opaque geometric shapes for vertices, and vertical/horizontal…
We give a global geometric decomposition of continuously differentiable vector fields on $\mathbb{R}^n$. More precisely, given a vector field of class $\mathcal{C}^{1}$ on $\mathbb{R}^{n}$, and a geometric structure on $\mathbb{R}^n$, we…
Applications of the Path Group (consisting of classes of continuous curves in Minkowski space-time) to gauge theory and gravity are reviewed. Covariant derivatives are interpreted as generators of an induced representation of Path Group.…
Given a vector bundle $E$ of rank $r$ and degree $d$ on a curve $C$ of genus $g$, one can associate to $E$ in a natural way several other vector bundles. For example, one can take wedge powers of $E$. If $E$ is generated by global sections,…
This paper addresses how to construct features for the problem of image correspondence, in particular, the paper addresses how to construct features so as to maintain the right level of invariance versus discriminability. We show that…