Fetching the paper…
Reading the bibliography…
Joint matching over a collection of objects aims at aggregating information from a large collection of similar instances (e.g.
M. A. Fischler and R. C. Bolles, “Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography,” Commun. ACM , vol. 24, no. 6, pp. 381–395, Jun. 1981
1981
Earlier work this paper cites.
J. L. Horner and P. D. Gianino, “Phase-only matched filtering,” Applied optics , vol. 23, no. 6, pp. 812–816, 1984
1984
Earlier work this paper cites.
D. Goldberg, C. Malon, and M. Bern, “A global approach to automatic solution of jigsaw puzzles,” Comput. Geom. Theory Appl. , vol. 28, pp. 165–174, June 2004
2004
Earlier work this paper cites.
N. Bansal, A. Blum, and S. Chawla, “Correlation clustering,” Machine Learning , vol. 56, no. 1-3, pp. 89–113, 2004
2004
Earlier work this paper cites.
D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International journal of computer vision , vol. 60, no. 2, pp. 91–110, 2004
2004
Earlier work this paper cites.
S. P. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
C. Schellewald and C. Schnörr, “Probabilistic subgraph matching based on convex relaxation,” in Energy minimization methods in computer vision and pattern recognition . Springer, 2005, pp. 171–186
2005
Earlier work this paper cites.
K. Mikolajczyk and C. Schmid, “A performance evaluation of local descriptors,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 27, no. 10, pp. 1615–1630, 2005
2005
Earlier work this paper cites.
M. Leordeanu and M. Hebert, “A spectral technique for correspondence problems using pairwise constraints,” in IEEE International Conference on Computer Vision (ICCV) , vol. 2, 2005, pp. 1482–1489
2005
Earlier work this paper cites.
Q.-X. Huang, S. Flöry, N. Gelfand, M. Hofer, and H. Pottmann, “Reassembling fractured objects by geometric matching,” in ACM Transactions on Graphics (TOG) , vol. 25, no. 3. ACM, 2006, pp. 569–578
2006
Earlier work this paper cites.
W. Marande and G. Burger, “Mitochondrial DNA as a genomic jigsaw puzzle,” Science , vol. 318, no. 5849, pp. 415–415, 2007
2007
Earlier work this paper cites.
T. Cour, P. Srinivasan, and J. Shi, “Balanced graph matching,” Advances in Neural Information Processing Systems (NIPS) , 2007
2007
Earlier work this paper cites.
R. Durrett, Random graph dynamics . Cambridge university press, 2007, vol. 20
2007
Earlier work this paper cites.
L. Zhu, Z. Zhou, and D. Hu, “Globally consistent reconstruction of ripped-up documents,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 30, no. 1, pp. 1–13, 2008
2008
Earlier work this paper cites.
N. Ahmed, C. Theobalt, C. Rossl, S. Thrun, and H. Seidel, “Dense correspondence finding for parametrization-free animation reconstruction from video.” in CVPR , 2008
2008
Earlier work this paper cites.
N. Alon and J. H. Spencer, The probabilistic method (3rd Edition) . Wiley, 2008
2008
Earlier work this paper cites.
T. S. Caetano, J. J. McAuley, L. Cheng, Q. V. Le, and A. J. Smola, “Learning graph matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 31, no. 6, pp. 1048–1058, 2009
2009
Earlier work this paper cites.
E. J. Candes and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , vol. 9, no. 6, pp. 717–772, April 2009
2009
Cited alongside, same era.
T. S. Cho, S. Avidan, and W. T. Freeman, “A probabilistic image jigsaw puzzle solver,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2010, pp. 183–190
2010
Cited alongside, same era.
C. Zach, M. Klopschitz, and M. Pollefeys, “Disambiguating visual relations using loop constraints,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2010, pp. 1426–1433
2010
Cited alongside, same era.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transactions on Information Theory , vol. 56, no. 6, pp. 2980–2998, 2010
2010
Cited alongside, same era.
H. Xu, C. Caramanis, and S. Sanghavi, “Robust pca via outlier pursuit,” Advances on Neural Information Processing Systems (NIPS) , 2010
Y. HaCohen, E. Shechtman, D. Goldman, and D. Lischinski, “Non-rigid dense correspondence with applications for image enhancement,” ACM Trans. Graph. , vol. 30, no. 4, pp. 70:1–70:10, Jul. 2011
2011
Later among the works it cites.
Q. Huang, G. Zhang, L. Gao, S. Hu, A. Butscher, and L. Guibas, “An optimization approach for extracting and encoding consistent maps in a shape collection,” ACM Transactions on Graphics , vol. 31, no. 6, p. 167, 2012
2012
Later among the works it cites.
V. Kim, W. Li, N. Mitra, S. DiVerdi, and T. Funkhouser, “Exploring collections of 3d models using fuzzy correspondences,” in ACM SIGGRAPH , 2012
2012
Later among the works it cites.
Y. Chen, S. Sanghavi, and H. Xu, “Clustering sparse graphs,” Advances in Neural Information Processing Systems (NIPS) , 2012
2012
Later among the works it cites.
A. Jalali and N. Srebro, “Clustering using max-norm constrained optimization,” International Conference on Machine Learning (ICML) , June 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
A. Ganesh, J. Wright, X. Li, E. J. Candes, and Y. Ma, “Dense error correction for low-rank matrices via principal component pursuit,” in IEEE International Symposium on Information Theory Proceedings (ISIT) , 2010, pp. 1513–1517
2010
Cited alongside, same era.
C. Mathieu and W. Schudy, “Correlation clustering with noisy input,” in ACM-SIAM SODA , 2010, pp. 712–728
2010
Cited alongside, same era.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from noisy entries,” Journal of Machine Learning Research , vol. 99, pp. 2057–2078, 2010
2010
Cited alongside, same era.
Z. Wen, D. Goldfarb, and W. Yin, “Alternating direction augmented lagrangian methods for semidefinite programming,” Mathematical Programming Computation , vol. 2, no. 3-4, pp. 203–230, 2010
2010
Cited alongside, same era.
D. Crandall, A. Owens, N. Snavely, and D. Huttenlocher, “Discrete-continuous optimization for large-scale structure from motion,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2011, pp. 3001–3008
2011
Cited alongside, same era.
R. Roberts, S. N. Sinha, R. Szeliski, and D. Steedly, “Structure from motion for scenes with large duplicate structures,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2011, pp. 3137–3144
2011
Cited alongside, same era.
A. Nguyen, M. Ben-Chen, K. Welnicka, Y. Ye, and L. Guibas, “An optimization approach to improving collections of shape maps,” in Computer Graphics Forum , vol. 30, no. 5. Wiley Online Library, 2011, pp. 1481–1491
2011
Cited alongside, same era.
2012
Later among the works it cites.
M. Leordeanu, R. Sukthankar, and M. Hebert, “Unsupervised learning for graph matching,” International journal of computer vision , vol. 96, no. 1, pp. 28–45, 2012
2012
Later among the works it cites.
T. Tao, Topics in random matrix theory . AMS Bookstore, 2012, vol. 132
2012
Later among the works it cites.
J. A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of Computational Mathematics , vol. 12, no. 4, pp. 389–434, 2012
2012
Later among the works it cites.
Q. Huang and L. Guibas, “Consistent shape maps via semidefinite programming,” Computer Graphics Forum , vol. 32, no. 5, pp. 177–186, 2013
2013
Later among the works it cites.
D. Pachauri, R. Kondor, and V. Singh, “Solving the multi-way matching problem by permutation synchronization.” in Advanced in Neural Information Processing Systems (NIPS) , 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis, “Low-rank matrix recovery from errors and erasures,” IEEE Transactions on Information Theory , vol. 59, no. 7, pp. 4324–4337, July 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
N. Ailon, Y. Chen, and X. Huan, “Breaking the small cluster barrier of graph clustering,” International Conference on Machine Learning (2013) , 2013
2013
Later among the works it cites.
A. S. Bandeira, M. Charikar, A. Singer, and A. Zhu, “Multireference alignment using semidefinite programming,” in Conference on Innovations in Theoretical Computer Science , 2014, pp. 459–470
2014
Closest in time.