Approximative graph pyramid solution of the E-TSP

Image and Vision Computing

Volumn 27, Issue 7, 2009, Pages 887-896

  Haxhimusa, Yll ^a,b   Kropatsch, Walter G ^b   Pizlo, Zygmunt ^a   Ion, Adrian ^b  

^a PURDUE UNIVERSITY   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Bor vka's minimum spanning tree; Graph pyramids; Hierarchical representation; Human problem solving; Traveling salesman problem

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; OBJECT RECOGNITION; OPTIMAL SYSTEMS; PROBLEM SOLVING; QUERY PROCESSING; TREES (MATHEMATICS);

APPROXIMATE SOLUTIONS; EUCLIDEAN; GRAPH PYRAMIDS; HARD PROBLEMS; HIERARCHICAL REPRESENTATION; HUMAN PROBLEM SOLVING; NEAR-OPTIMAL SOLUTIONS; NEW MODELS; OPTIMAL SOLUTIONS; SOLUTION STRATEGIES; SPATIAL STRUCTURES; TOP-DOWN MANNERS; TSP PROBLEMS; VISUAL ACUITIES; VISUAL ATTENTIONS;

TRAVELING SALESMAN PROBLEM;

EID: 64849113194     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2008.06.016     Document Type: Article

References (63)

1. Ormrod J.E. Human Learning (1999), Prentice-Hall, Englewood Cliffs, NJ
2. MacGregor J., and Ormerod T. Human performance on the traveling salesman problem. Perception & Psychophysics 58 (1996) 527-539
3. Graham S.M., Joshi A., and Pizlo Z. The travelling salesman problem: a hierarchical model. Memory and Cognition 28 7 (2000) 1191-1204
4. Vickers D., Butavicius M., Lee M., and Medvedev A. Human performance on visually presented traveling salesman problems. Psychological Research 65 (2001) 34-45
5. Johnson D.S., and McGeoch L.A. The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts E.H.L., and Lenstra J.K. (Eds). Ch. Local Search in Combinatorial Optimization (1997), Wiley, New York 215-310
6. Christofides N. Graph Theory - An Algorithmic Approach (1975), Academic Press, New York
7. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. The Traveling Salesman Problem (1985), Wiley, New York
8. Gutin G., and Punnen A.P. The traveling salesman problem and its variations (2002), Kluwer Academic Publishers, Dordrecht
9. Yuille A.L. Generalized deformable models statistical physics and matching problems. Neural Computation 2 (1990) 1-24
10. W. Wolfe, M. Parry, J. MacMillan, Hopfield-style neural networks and the tsp, in: 1994 IEEE International Conference on Neural Networks, 1994, IEEE World Congress on Computational Intelligence, vol. 7, 1994, pp. 4577-4582.
11. Andrews J., and Sethian J.A. Fast marching methods for the continuous traveling salesman problem. Proceedings of the National Academy of Sciences of the United States of America 104 4 (2007) 1118-1123
12. Sethian J.A. Level Set Methods and Fast Marching Methods (2006), Cambridge University Press, Cambridge
13. MacGregor J.N., Ormerod T.C., and Chronicle E.P. A model of human performance on the traveling salesperson problem. Memory and Cognition 28 (2000) 1183-1190
14. Pizlo Z., and Li Z. Pyramid algorithms as models of human cognition. Proceedings of SPIE-IS&T Electronic Imaging Computational Imaging (2003), SPIE 1-12
15. Z. Pizlo, E. Stefanov, J. Saalweachter, Y. Haxhimusa, K. Kropatsch, Adaptive pyramid model for the traveling salesman problem., in: Proceedings of the 1st International Workshop on Human Problem Solving, Purdue University (http://psych.purdue.edu/tsp/workshop/program.html), 2005.
16. J. MacGregor, Solution performance and heuristics in closed and open versions of 2d euclidean tsps., in: Proceedings of the 1st International Workshop on Human Problem Solving, Purdue University (http://psych.purdue.edu/tsp/workshop/program.html), 2005.
17. M. Lee, A generative model of human performance on an optimal stopping problem, in: Proceedings of the 1st International Workshop on Human Problem Solving, Purdue University (http://psych.purdue.edu/tsp/workshop/program.html), 2005.
18. Pizlo Z., and Li Z. Solving combinatorial problems: the 15 puzzle problem. Memory and Cognition 33 6 (2005) 1069-1084
19. Poyla G. How to Solve it: A New Aspect of Mathematical Method (1957), Doubleday, Garden City, NY
20. Pizlo Z., Stefanov E., Saalweachter J., Li Z., Haxhimusa Y., and Kropatsch W.G. Traveling salesman problem: a foveating model. Journal of Problem Solving 1 1 (2006) 83-101
21. J. Giesen, Curve reconstruction, the tsp, and menger's theorem on length., in: Proceedings of the 15th Annual ACM Symposium on Computational Geometry, 1999, pp. 207-216.
22. Edelsbrunner H., Kirkpatrick D.G., and Seidel R. On the shape of a set of points in the plane. IEEE Transaction on Information Theory 29 4 (1983) 71-78
23. Wagman M. Problem-Solving Processes in Humans and Computers (2002), Praeger, New York
24. Ammon K. An automatic proof of Gödel's incompleteness theorem. Artificial Intelligence 61 2 (1993) 291-306
25. Larking J.H., Reif F., Carbonell J., and Gugliotta A. Fermi: a flexible expert reasoner with multi-domain inferencing. Cognitive Sciences 12 (1988) 101-138
26. Valdés-Perés R.E. Some recent human-computer discoveries in science and what accounts for them. AI Magazine 16 3 (1995) 37-44
27. Shortliffe E.H. Computer-based Medical Consultations: MYCIN (1976), American Elsevier, New York
28. Newell A., and Simon H.A. Human Problem Solving (1972), Prentice-Hall, Englewood Cliffs, NJ
29. Russel S., and Norvig P. Artificial Intelligence: A Modern Approach (1995), Prentice-Hall, Englewood Cliffs, NJ
30. Duda R.O., Hart P.E., and Stork D.G. Pattern Classification (2001), Wiley, New York
31. Bishop C.M. Pattern Recognition and Machine Learning (2006), Springer, Berlin
32. Tsotsos J.K. Analyzing vision at the complexity level. Behavioral and Brain Sciences 13 3 (1990) 423-469
33. Tsotsos J.K. On the relative complexity of passive vs active visual search. International Journal of Computer Vision 7 2 (1992) 127-141
34. Zeki S. A Vision of the Brain (1993), Blackwell, Oxford
35. Pizlo Z., Salach-Golyska M., and Rosenfeld A. Curve detection in a noisy image. Vision Research 37 9 (1997) 1217-1241
36. Pizlo Z. Perception viewed as an inverse problem. Vision Research 41 24 (2001) 3145-3161
37. Pizlo Z., Rosenfeld A., and Epelboim J. An exponential pyramid model of the time-course of size processing. Vision Research 35 8 (1995) 1089-1107
38. Bouman C., and Liu B. Multiple resolution segmentation of textured images. IEEE Transactions on Pattern Analysis and Machine Intelligence 13 2 (1991) 99-113
39. Koffka K. Principles of Gestalt Psychology (1935), Harcourt, New York
40. L.W. Stark, C.M. Privitera, Top-down and bottom-up image processing, in: IEEE Proceeding of International Conference on Neural Networks, vol. 4, 1997, pp. 2294 -2299.
41. Privitera C.M., and Stark L.W. Algorithms for defining visual regions-of-interest: comparison with eye fixations. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 9 (2000) 970-982
42. Chernyak D., and Stark L. Top-down guided eye movements. IEEE Transactions on Systems, Man, and Cybernetics 31 4 (2001) 514-522
43. Jolion J.-M., and Rosenfeld A. A Pyramid Framework for Early Vision (1994), Kluwer Academic Publishers, Dordrecht
44. Z. Pizlo, A. Joshi, S.M. Graham, Problem solving in human beings and computers, Tech. Rep. CSD TR 94-075, Department of Computer Sciences, Purdue University, 1994.
45. Z. Pizlo, Z. Li, Graph pyramids as models of human problem solving in: Proceedings of SPIE-IS&T Electronic Imaging, Computational Imaging II, SPIE, vol. 5299, San Jose, USA, 2004, pp. 205-215.
46. Lance J., and Williams W. A general theory of classificatory sorting strategies: I. Hierarchical systems. Journal on Computing 9 (1967) 373-380
47. Chowdhury N., and Murhty C. Minimal spanning tree based clustering technique: relationship whith bayes classifier. Pattern Recognition 30 11 (1997) 1919-1929
48. Gutin G., Yeo A., and Zverovich A. Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the tsp. Discrete Applied Mathematics 117 1-3 (2002) 81-86
49. Bister M., Cornelis J., and Rosenfeld A. A critical view of pyramid segmentation algorithms. Pattern Recognition Letters 11 9 (1990) 605-617
50. Montanvert A., Meer P., and Rosenfeld A. Hierarchical image analysis using irregular tesselations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13 4 (1991) 307-316
51. Jolion J.-M., and Montanvert A. The adaptive pyramid a framework for 2D image analysis. Computer Vision, Graphics, and Image Processing: Image Understanding 55 3 (1992) 339-348
52. Watt R.J. Scanning from coarse to fine spatial scales in the human visual system after the onset of a stimulus. Journal of the Optical Society of America 4 (1987) 2006-2021
53. Neštřil J., Miklovà E., and Neštřilova H. Otakar Boro̊vka on minimal spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics 233 (2001) 3-36
54. In: Atallah M.J. (Ed). Algorithms and Theory of Computational Handbook (1999), CRC Press, Boca Raton, FL
55. Kropatsch W.G., Haxhimusa Y., and Pizlo Z. Integral trees subtree: depth and diameter. In: Klette R., and Žunic J. (Eds). Proceedings of the International Workshop on Combinatorial Image Analysis 2004. Lecture Notes in Computer Science vol. 3322 (2004), Springer, Berlin 77-87
56. Prim R.C. Shortest connection networks and some generalizations. The Bell System Technical Journal 36 (1957) 1389-1401
57. Kropatsch W.G., Haxhimusa Y., Pizlo Z., and Langs G. Vision pyramids that do not grow too high. Pattern Recognition Letters 26 3 (2005) 319-337
58. Miller G.A. The magical number seven, plus or minus two: some limits on our capacity for processing information. Psychological Review 63 (1956) 81-97
59. Papadimitiou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1998), Dover, New York
60. van Rooij I., Stege U., and Schactman A. Convex hull and tour crossings in the euclidean traveling salesperson problem: implications for human performance studies. Memory & Cognition 31 (2003) 215-220
61. Journal of Vision, Website, http://www.journalofvision.org/.
62. V. Research, Website, http://www.elsevier.com/locate/visres.
63. Journal of Problem Solving, Website, http://docs.lib.purdue.edu/jps/.