1
|
He P, Emami P, Ranka S, Rangarajan A. Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations. IEEE Trans Pattern Anal Mach Intell 2023; 45:14872-14887. [PMID: 37669196 DOI: 10.1109/tpami.2023.3307592] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/07/2023]
Abstract
We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.
Collapse
|
2
|
Kerdoncuff T, Emonet R, Sebban M. Sampled Gromov Wasserstein. Mach Learn 2021; 110:2151-86. [DOI: 10.1007/s10994-021-06035-1] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
|
3
|
Abstract
This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.
Collapse
|
4
|
Abstract
In pattern recognition applications, with the aim of increasing efficiency, it is useful to represent the elements by attributed graphs (which consider their structural properties). Under this structural representation of the elements some graph matching problems need a common labeling between the vertices of a set of graphs. Computing this common labeling is a NP-Complete problem. Nevertheless, some methodologies have been presented which obtain a sub-optimal solution in polynomial time. The drawback of these methods is that they rely on pairwise labeling computations, causing the methodologies not to consider the global information during the entire process. To solve this problem, we present a methodology which generates the common labeling by matching all graph nodes to a virtual node set. The method has been tested using three independent datasets, one synthetic and two real. Experimental results show that the presented method obtains better performance than the most popular common labeling algorithm with the same computational cost.
Collapse
Affiliation(s)
- ALBERT SOLÉ-RIBALTA
- Department of Computer Science and Mathematics, Universitat Rovira i Virgili (URV), Avda. Països Catalans, 26, 43007 Tarragona, Spain
| | - FRANCESC SERRATOSA
- Department of Computer Science and Mathematics, Universitat Rovira i Virgili (URV), Avda. Països Catalans, 26, 43007 Tarragona, Spain
| |
Collapse
|
5
|
Abstract
Spectral Matching (SM) is a computationally efficient approach to approximate the solution of pairwise matching problems that are np-hard. In this paper, we present a probabilistic interpretation of spectral matching schemes and derive a novel Probabilistic Matching (PM) scheme that is shown to outperform previous approaches. We show that spectral matching can be interpreted as a Maximum Likelihood (ML) estimate of the assignment probabilities and that the Graduated Assignment (GA) algorithm can be cast as a Maximum a Posteriori (MAP) estimator. Based on this analysis, we derive a ranking scheme for spectral matchings based on their reliability, and propose a novel iterative probabilistic matching algorithm that relaxes some of the implicit assumptions used in prior works. We experimentally show our approaches to outperform previous schemes when applied to exhaustive synthetic tests as well as the analysis of real image sequences.
Collapse
Affiliation(s)
- Amir Egozi
- Department of Electrical Engineering, Ben Gurion University, Israel.
| | | | | |
Collapse
|
6
|
Tian Y, Yan J, Zhang H, Zhang Y, Yang X, Zha H. On the Convergence of Graph Matching: Graduated Assignment Revisited. Computer Vision – ECCV 2012 2012. [DOI: 10.1007/978-3-642-33712-3_59] [Citation(s) in RCA: 25] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/02/2023]
|
7
|
Abstract
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. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Collapse
Affiliation(s)
- Tibério S Caetano
- Statistical Machine Learning Group, NICTA, Locked Bag 8001, Canberra, ACT 2601, Australia.
| | | | | | | | | |
Collapse
|
8
|
Abstract
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.
Collapse
Affiliation(s)
- Tibério S Caetano
- National ICT Australia, Locked Bag 8001, Canberra ACT 2601, Australia.
| | | | | | | |
Collapse
|
9
|
Hérault L. Neural Networks without Training for Optimization. Neural Netw. [DOI: 10.1007/3-540-28847-3_8] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/25/2022]
|
10
|
|
11
|
Abstract
A novel Projections Onto Convex Sets (POCS) graph matching algorithm is presented. Two-way assignment constraints are enforced without using elaborate penalty terms, graduated nonconvexity, or sophisticated annealing mechanisms to escape from poor local minima. Results indicate that the presented algorithm is robust and compares favorably to other well-known algorithms.
Collapse
Affiliation(s)
- Barend J van Wyk
- French South African Technical Institute in Electronics, Tshwane University of Technology, Private Bag X680, Pretoria, 0001, South Africa.
| | | |
Collapse
|
12
|
Abstract
The concave-convex procedure (CCCP) is a way to construct discrete-time iterative dynamical systems that are guaranteed to decrease global optimization and energy functions monotonically. This procedure can be applied to almost any optimization problem, and many existing algorithms can be interpreted in terms of it. In particular, we prove that all expectation-maximization algorithms and classes of Legendre minimization and variational bounding algorithms can be reexpressed in terms of CCCP. We show that many existing neural network and mean-field theory algorithms are also examples of CCCP. The generalized iterative scaling algorithm and Sinkhorn's algorithm can also be expressed as CCCP by changing variables. CCCP can be used both as a new way to understand, and prove the convergence of, existing optimization algorithms and as a procedure for generating new algorithms.
Collapse
Affiliation(s)
- A L Yuille
- Smith-Kettlewell Eye Research Institute, San Francisco, CA 94115, USA.
| | | |
Collapse
|
13
|
Abstract
A Lagrange multiplier and Hopfield-type barrier function method is proposed for approximating a solution of the traveling salesman problem. The method is derived from applications of Lagrange multipliers and a Hopfield-type barrier function and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier parameter. For any given value of the barrier parameter, the method searches for a minimum point of the barrier problem in a feasible descent direction, which has a desired property that lower and upper bounds on variables are always satisfied automatically if the step length is a number between zero and one. At each iteration, the feasible descent direction is found by updating Lagrange multipliers with a globally convergent iterative procedure. For any given value of the barrier parameter, the method converges to a stationary point of the barrier problem without any condition on the objective function. Theoretical and numerical results show that the method seems more effective and efficient than the softassign algorithm.
Collapse
Affiliation(s)
- Chuangyin Dang
- Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Kowloon, Hong Kong.
| | | |
Collapse
|
14
|
Abstract
In this paper a globally convergent Lagrange and barrier function iterative algorithm is proposed for approximating a solution of the traveling salesman problem. The algorithm employs an entropy-type barrier function to deal with nonnegativity constraints and Lagrange multipliers to handle linear equality constraints, and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier parameter. For any given value of the barrier parameter, the algorithm searches for a minimum point of the barrier problem in a feasible descent direction, which has a desired property that the nonnegativity constraints are always satisfied automatically if the step length is a number between zero and one. At each iteration the feasible descent direction is found by updating Lagrange multipliers with a globally convergent iterative procedure. For any given value of the barrier parameter, the algorithm converges to a stationary point of the barrier problem without any condition on the objective function. Theoretical and numerical results show that the algorithm seems more effective and efficient than the softassign algorithm.
Collapse
Affiliation(s)
- C Dang
- Department of Manufacturing Engineering & Engineering Management, City University of Hong Kong, Hong Kong.
| | | |
Collapse
|
15
|
Schellewald C, Roth S, Schnörr C. Evaluation of Convex Optimization Techniques for the Weighted Graph-Matching Problem in Computer Vision. Lecture Notes in Computer Science 2001. [DOI: 10.1007/3-540-45404-7_48] [Citation(s) in RCA: 10] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/01/2023]
|