graph_matching_SMAC
所属分类:图形图象
开发工具:matlab
文件大小:374KB
下载次数:32
上传日期:2009-11-10 00:26:15
上 传 者:
leo_hwang
说明: Graph Matching Toolbox in Matlab
tested on Matlab 7.4 (windows/mac/unix)
fixed a bug which affected discretization performance in the case of different graph sizes
文件列表:
graph_matching_SMAC (0, 2009-02-04)
graph_matching_SMAC\compileDir.m (375, 2008-04-21)
graph_matching_SMAC\demo_computeEigenvectorsAffineConstraint.m (782, 2008-04-21)
graph_matching_SMAC\demo_graph_matching_SMAC.m (1896, 2009-02-04)
graph_matching_SMAC\._demo_graph_matching_SMAC.m (70, 2009-02-04)
graph_matching_SMAC\demo_normalizeMatchingW.m (1795, 2008-04-21)
graph_matching_SMAC\init.m (1377, 2008-04-21)
graph_matching_SMAC\util (0, 2009-02-04)
graph_matching_SMAC\util\a_times_b_cmplx.cpp (13761, 2008-04-21)
graph_matching_SMAC\util\actionFigure.m (8816, 2008-04-21)
graph_matching_SMAC\util\assert.m (712, 2008-04-21)
graph_matching_SMAC\util\assignmentoptimal.cpp (13145, 2008-04-21)
graph_matching_SMAC\util\assignmentoptimal.mexmaci (17332, 2007-12-07)
graph_matching_SMAC\util\bistocNormalize.m (296, 2008-04-21)
graph_matching_SMAC\util\bounds.m (373, 2008-04-21)
graph_matching_SMAC\util\changeExt.m (357, 2008-04-21)
graph_matching_SMAC\util\classes2indexes.m (549, 2008-04-21)
graph_matching_SMAC\util\compileFiles.m (3252, 2008-04-21)
graph_matching_SMAC\util\compute_full_rank_constraint.m (437, 2008-04-21)
graph_matching_SMAC\util\compute_graph_matching_SMAC.m (3282, 2009-02-04)
graph_matching_SMAC\util\._compute_graph_matching_SMAC.m (70, 2009-02-04)
graph_matching_SMAC\util\compute_graph_matching_SMAC.m~ (3279, 2009-02-04)
graph_matching_SMAC\util\compute_ICM_graph_matching.m (1390, 2008-04-21)
graph_matching_SMAC\util\compute_matching_from_W.m (1771, 2008-04-21)
graph_matching_SMAC\util\compute_matchingW.m (1244, 2008-04-21)
graph_matching_SMAC\util\computeConstraintMatching.m (1038, 2008-04-21)
graph_matching_SMAC\util\computeDiscreteCorrespondancesGreedy.m (1692, 2008-04-21)
graph_matching_SMAC\util\computeEigenvectorsAffineConstraint.m (2936, 2008-04-21)
graph_matching_SMAC\util\computeErrorMatching.m (580, 2008-04-21)
graph_matching_SMAC\util\computeImagesGui.m (695, 2008-04-21)
graph_matching_SMAC\util\computeKFirstEigenvectors.m (1489, 2008-04-21)
graph_matching_SMAC\util\computeNcutConstraint_projection.m (2437, 2008-04-21)
graph_matching_SMAC\util\computeObjectiveValue.m (411, 2008-04-21)
graph_matching_SMAC\util\computeSyntheticExampleMatching.m (2260, 2008-04-21)
graph_matching_SMAC\util\computeXorthonormal.m (439, 2008-04-21)
graph_matching_SMAC\util\copy2figure.m (1355, 2008-04-21)
graph_matching_SMAC\util\definePaths.m (14159, 2008-04-21)
graph_matching_SMAC\util\dir2.m (1381, 2008-04-21)
... ...
Graph Matching Toolbox in MATLAB
a more complete html version is available at http://www.seas.upenn.edu/~timothee/
This software is made publicly for research use only. It may be modified and redistributed under the terms of the GNU General Public License.
Please cite the paper and source code if you are using it in your work.
This software implements spectral graph matching with affine constraint (SMAC), optionally with kronecker bistochastic normalization, introduced in the paper below. The software can be used to handle arbitrary graph matching / subgraph matching problems:
1) highly scalable compared to other approaches (hundreds of nodes in each graph, depending on sparsity)
2) accurate (performed similarly to SDP relaxation in our experiments)
3) exploits sparsity pattern in each graph
4) handles graphs of different sizes (subgraph matching)
5) handles partial matchings (not just full matching)
In addition, the code implements kronecker bistochastic normalization, which modifies the graph matching cost function and dramatically improves the matching accuracy for a variety of graph matching algorithms.
Date: 04/21/2008
Version: 1.1
Author: Timothee Cour
Related Publication
Timothee Cour, Praveen Srinivasan, Jianbo Shi. Balanced Graph Matching. Advances in Neural Information Processing Systems (NIPS), 2006
Installation instructions
1) start matlab
2) cd to directory where you unzipped the files (containing a README)
3) type init (to add paths) (ignore warnings about assert if any)
4) type compileDir (ignore warnings about assert if any) to compile mex files
make sure it says at the end: "Compilation of files succeded without error", otherwise try to compile problem files by hand
start any of the 3 demos:
demo_graph_matching_SMAC;
demo_normalizeMatchingW;
demo_computeEigenvectorsAffineConstraint;
the main variables are explained in the function compute_graph_matching_SMAC
Please address questions / bug reports to: timothee “dot” cour “at” gmail “dot” com
%%%%%%%%%%%%%%%%%%%%%%%%%%%
history:
Date: 04/21/2008
Version: 1.1 released
fixed bug giving error: "assert(nbIter<1000); failed" when using graphs of different sizes
support new matlab mwIndex
changed:
compute_ICM_graph_matching
+ mex files
Date: 12/01/2007
Version: 1.0 released
近期下载者:
相关文件:
收藏者: