SPIE
My SPIE Subscription | My E-mail Alerts | My Article Collections
  Home » Proc. of SPIE » Volume 5299
 Search Proceedings
Advanced Search
 Browse Proceedings
Proceedings
By Year
By Symposium
By Volume No.
By Volume Title
By Technology
 Browse Journals
Journals
Optical Engineering
J. Electronic
   Imaging
J. Biomedical Optics
J. Micro/
   Nanolithography,
   MEMS, and MOEMS
J. Applied Remote
   Sensing
J. Nanophotonics
  SPIE Letters Virtual Journal
 Subscriptions &
 Pricing
Institutions &
Corporations
Personal subscriptions
 General Information
About the Digital
Library
Terms of Use
SPIE Home
Previous Article
Grouping and segmentation in a hierarchy of graphs
We review multilevel hierarchies under the special aspect of their potential for segmentation and grouping. The one-to-one correspondence between salient image features and salient model features are ...
Next Article
Alternating minimization multigrid algorithms for transmission tomography
The problem of image formation for X-ray transmission tomography is formulated as a statistical inverse problem. The maximum likelihood estimate of the attenuation function is sought. Using convex opt...

You are not logged in to this journal. Log in

Graph pyramids as models of human problem solving

Proc. SPIE, Vol. 5299, 205 (2004); doi:10.1117/12.543423

Online Publication Date: 25 June 2004

Conference Date: Monday 19 January 2004
Conference Location: San Jose, CA, USA
Conference Title: Computational Imaging II
Conference Chairs: Charles A. Bouman, Eric L. Miller
Zygmunt Pizlo and Zheng Li
Purdue Univ. (USA)
Prior theories have assumed that human problem solving involves estimating distances among states and performing search through the problem space. The role of mental representation in those theories was minimal. Results of our recent experiments suggest that humans are able to solve some difficult problems quickly and accurately. Specifically, in solving these problems humans do not seem to rely on distances or on search. It is quite clear that producing good solutions without performing search requires a very effective mental representation. In this paper we concentrate on studying the nature of this representation. Our theory takes the form of a graph pyramid. To verify the psychological plausibility of this theory we tested subjects in a Euclidean Traveling Salesman Problem in the presence of obstacles. The role of the number and size of obstacles was tested for problems with 6-50 cities. We analyzed the effect of experimental conditions on solution time per city and on solution error. The main result is that time per city is systematically affected only by the size of obstacles, but not by their number, or by the number of cities.

©2004 COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
Buy This PDF  (US$18)
Download PDF (178 kB) View Cart

PROCEEDINGS DATA

ISSN:
0277-786X (print)  
Publisher:
AIP is a member of CrossRef SPIE


There are no references.

CITING ARTICLES


For access to citing articles, you need to log in.
For access to citing articles, you need to Log in.