Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A critical view of pyramid segmentation algorithms
Pattern Recognition Letters
Hierarchical Image Analysis Using Irregular Tessellations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple Resolution Segmentation of Textured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the relative complexity of active vs. passive visual search
International Journal of Computer Vision
The adaptive pyramid: a framework for 2D image analysis
CVGIP: Image Understanding
An automatic proof of Go¨del's incompleteness theorem
Artificial Intelligence
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Curve reconstruction, the traveling salesman problem and Menger's theorem on length
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Algorithms for Defining Visual Regions-of-Interest: Comparison with Eye Fixations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Problem-Solving Processes in Humans and Computers: Theory and Research in Psychology and Artificial Intelligence
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
A Pyramid Framework for Early Vision: Multiresolutional Computer Vision
A Pyramid Framework for Early Vision: Multiresolutional Computer Vision
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Vision pyramids that do not grow too high
Pattern Recognition Letters - Special issue: In memoriam Azriel Rosenfeld
Human Problem Solving
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Integral trees: subtree depth and diameter
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Hi-index | 0.00 |
The traveling salesman problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution for an input with a large number of cities, the problem is transformed into a simpler form containing smaller number of cities, which is then solved optimally. Graph pyramid solution strategies, using Boruvka's minimum spanning tree step, convert, in a bottom-up processing, a 2D Euclidean TSP problem with a large number of cities into successively smaller problems (graphs) with similar layout and solution, until the number of cities is small enough to seek the optimal solution. Expanding this tour solution in a top-down manner, to the lower levels of the pyramid, leads to an approximate solution. The new model has an adaptive spatial structure and it simulates visual acuity and visual attention. The model solves the TSP problem sequentially, by moving attention from city to city, and the quality of the solutions is similar to the solutions produced by humans. The graph pyramid data structures and processing strategies provide good methods for finding near-optimal solutions for computationally hard problems. Isolating processing used by humans to solve computationally hard problems is of general importance to psychology community and might lead to advances in pattern recognition.