Expertise in map comprehension: processing of geographic features according to spatial configuration and abstract roles

Expertise in topographic map reading is dependent on efficient processing of geographical information presented in a standardised map format. Studies have supported the proposition that expert map readers employ cognitive schemas in which prototypical configurations held in long term memory are employed during the surface search of map features to facilitate map comprehension. Within the experts’ cognitive schemas, it is assumed that features are grouped according to spatial configurations that have been frequently encountered and these patterns facilitate efficient chunking of features during information processing. This thesis investigates the nature of information held in experts’ cognitive schemas. It also proposes that features are grouped in the experts’ schemas not only by their spatial configurations but according to the abstract and functional roles they perform. Three experiments investigated the information processing strategies employed by firstly, skilled map readers engaged in a map reproduction task and secondly, expert map readers engaged in a location comparison exercise. In the first and second experiments, skilled and novice map readers studied and reproduced a town map and a topographic map. Drawing protocols and verbal protocols provided insights into their information processing strategies. The skilled map readers demonstrated superior performance for reproducing contour related data with evidence of the use of cognitive schemas. For the third experiment, expert and novice map readers compared locations within map excerpts for similarities of boundary extents. Eye-gaze data and verbal protocols provided information on the features attended to and the participants’ search patterns. The expert group integrated features into their cognitive schemas according to the abstract roles they performed significantly more frequently than the novices. Both groups employed pattern recognition to integrate features for some of the locations. Within a similar experimental design the second part of the third experiment examined whether experts also integrated the abstract roles of remote features and village grouping concepts within their cognitive schemas. The experts again integrated the abstract roles of physical features into their schemas more often than novices but this strategy was not employed for either the remote feature or grouping categories. Implications for map design and future Geographic Information Systems are discussed

A Novel Active Contour Model for Texture Segmentation

Texture is intuitively defined as a repeated arrangement of a basic pattern or object in an image. There is no mathematical definition of a texture though. The human visual system is able to identify and segment different textures in a given image. Automating this task for a computer is far from trivial. There are three major components of any texture segmentation algorithm: (a) The features used to represent a texture, (b) the metric induced on this representation space and (c) the clustering algorithm that runs over these features in order to segment a given image into different textures. In this paper, we propose an active contour based novel unsupervised algorithm for texture segmentation. We use intensity covariance matrices of regions as the defining feature of textures and find regions that have the most inter-region dissimilar covariance matrices using active contours. Since covariance matrices are symmetric positive definite, we use geodesic distance defined on the manifold of symmetric positive definite matrices PD(n) as a measure of dissimlarity between such matrices. We demonstrate performance of our algorithm on both artificial and real texture images

On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing

Active Contour Models for Manifold Valued Image Segmentation

Image segmentation is the process of partitioning a image into different regions or groups based on some characteristics like color, texture, motion or shape etc. Active contours is a popular variational method for object segmentation in images, in which the user initializes a contour which evolves in order to optimize an objective function designed such that the desired object boundary is the optimal solution. Recently, imaging modalities that produce Manifold valued images have come up, for example, DT-MRI images, vector fields. The traditional active contour model does not work on such images. In this paper, we generalize the active contour model to work on Manifold valued images. As expected, our algorithm detects regions with similar Manifold values in the image. Our algorithm also produces expected results on usual gray-scale images, since these are nothing but trivial examples of Manifold valued images. As another application of our general active contour model, we perform texture segmentation on gray-scale images by first creating an appropriate Manifold valued image. We demonstrate segmentation results for manifold valued images and texture images

Tracking multiple objects using intensity-GVF snakes

Active contours or snakes are widely used for segmentation and tracking. Multiple object tracking remains a difficult task, characterised by a trade off between increasing the capturing range of edges of the object of interest, and decreasing the capturing range of other edges. We propose a new external force field which is calculated for every object independently. This new force field uses prior knowledge about the intensity of the object of interest. Using this extra information, this new force field helps in discriminating between edges of interest and other objects. For this new force field, the expected intensity of an object must be estimated. We propose a technique which calculates this estimation out of the image

Unsupervised edge map scoring: a statistical complexity approach

We propose a new Statistical Complexity Measure (SCM) to qualify edge maps without Ground Truth (GT) knowledge. The measure is the product of two indices, an \emph{Equilibrium} index $\mathcal{E}$ obtained by projecting the edge map into a family of edge patterns, and an \emph{Entropy} index $\mathcal{H}$, defined as a function of the Kolmogorov Smirnov (KS) statistic. This new measure can be used for performance characterization which includes: (i)~the specific evaluation of an algorithm (intra-technique process) in order to identify its best parameters, and (ii)~the comparison of different algorithms (inter-technique process) in order to classify them according to their quality. Results made over images of the South Florida and Berkeley databases show that our approach significantly improves over Pratt's Figure of Merit (PFoM) which is the objective reference-based edge map evaluation standard, as it takes into account more features in its evaluation

Edge Potential Functions (EPF) and Genetic Algorithms (GA) for Edge-Based Matching of Visual Objects

Edges are known to be a semantically rich representation of the contents of a digital image. Nevertheless, their use in practical applications is sometimes limited by computation and complexity constraints. In this paper, a new approach is presented that addresses the problem of matching visual objects in digital images by combining the concept of Edge Potential Functions (EPF) with a powerful matching tool based on Genetic Algorithms (GA). EPFs can be easily calculated starting from an edge map and provide a kind of attractive pattern for a matching contour, which is conveniently exploited by GAs. Several tests were performed in the framework of different image matching applications. The results achieved clearly outline the potential of the proposed method as compared to state of the art methodologies. (c) 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works