
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Pedro F. Felzenszwalb, Julian J. McAuley, "Fast Inference with MinSum Matrix Product," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 12, pp. 25492554, December, 2011.  
BibTex  x  
@article{ 10.1109/TPAMI.2011.121, author = {Pedro F. Felzenszwalb and Julian J. McAuley}, title = {Fast Inference with MinSum Matrix Product}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {33}, number = {12}, issn = {01628828}, year = {2011}, pages = {25492554}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2011.121}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Fast Inference with MinSum Matrix Product IS  12 SN  01628828 SP2549 EP2554 EPD  25492554 A1  Pedro F. Felzenszwalb, A1  Julian J. McAuley, PY  2011 KW  Graphical models KW  MAP inference KW  minsum matrix product. VL  33 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. AddisonWesley, 1974.
[2] S.M. Aji and R.J. McEliece, "The Generalized Distributive Law," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 325343, Mar. 2000.
[3] A. Amini, T. Weymouth, and R. Jain, "Using Dynamic Programming for Solving Variational Problems in Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 9, pp. 855867, Sept. 1990.
[4] Y. Amit and A. Kong, "Graphical Templates for Model Registration," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 225236, Mar. 1996.
[5] U. Bertele and F. Brioschi, Nonserial Dynamic Programming. Academic Press, 1972.
[6] Y. Boykov and M.P. Jolly, "Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in ND Images," Proc. IEEE Int'l Conf. Computer Vision, 2001.
[7] Y. Boykov, O. Veksler, and R. Zabih, "Fast Approximate Energy Minimization via Graph Cuts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 12221239, Nov. 2001.
[8] T.M. Chan, "More Algorithms for AllPairs Shortest Paths in Weighted Graphs," Proc. Ann. ACM Symp. Theory of Computing, pp. 590598, 2007.
[9] J.M. Coughlan and S.J. Ferreira, "Finding Deformable Shapes Using Loopy Belief Propagation," Proc. European Conf. Computer Vision, 2002.
[10] P.F. Felzenszwalb and D. McAllester, "The Generalized A* Architecture," J. Artificial Intelligence Research, vol. 29, pp. 153190, 2007.
[11] A.M. Frieze and G.R. Grimmett, "The ShortestPath Problem for Graphs with Random ArcLengths," Discrete Applied Math., vol. 10, no. 1, pp. 5777, 1985.
[12] D.R. Karger, D. Koller, and S.J. Phillips, "Finding the Hidden Path: Time Bounds for AllPairs Shortest Paths," SIAM J. Computing, vol. 22, no. 6, pp. 11991217, 1993.
[13] M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active Contour Models," Int'l J. Computer Vision, vol. 1, no. 4, pp. 321331, 1987.
[14] D. Knuth, "A Generalization of Dijkstra's Algorithm," Information Processing Letters, vol. 6, no. 1, pp. 15, 1977.
[15] J.J. McAuley and T.S. Caetano, "Exploiting withinClique Factorizations in JunctionTree Algorithms," Proc. AI and Statistics, 2010.
[16] J.J. McAuley, T.S. Caetano, and M.S. Barbosa, "Graph Rigidity, Cyclic Belief Propagation and Point Pattern Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 11, pp. 20472054, Nov. 2008.
[17] A. Moffat and T. Takaoka, "An All Pairs Shortest Path Algorithm with Expected Time $O(n^2\log n)$ ," SIAM J. Computing, vol. 16, no. 6, pp. 10231031, 1987.
[18] M.A. Paskin, "Thin Junction Tree Filters for Simultaneous Localization and Mapping," Proc. Int'l Joint Conf. Artificial Intelligence, 2003.
[19] U. Quasthoff, M. Richter, and C. Biemann, "Corpus Portal for Search in Monolingual Corpora," Proc. Language Resources and Evaluation, 2006.
[20] L. Sigal and M.J. Black, "Predicting 3D People from 2D Pictures," Proc. Conf. Articulated Motion and Deformable Objects, 2006.
[21] V. Strassen, "Gaussian Elimination Is Not Optimal," Numerische Mathematik, vol. 14, no. 3, pp. 354356, 1969.
[22] C. Sutton and A. McCallum, "An Introduction to Conditional Random Fields for Relational Learning," Introduction to Statistical Relational Learning, L. Getoor and B. Taskar, eds., MIT Press, 2006.
[23] L.G. Valiant, "General ContextFree Recognition in Less than Cubic Time," J. Computer and System Sciences, vol. 10, pp. 308315, 1975.
[24] J.S. Yedidia, W.T. Freeman, and Y. Weiss, "Generalized Belief Propagation," Proc. Neural Information Processing Systems, 2000.