Perceptual Organization and the Curve Partitioning Problem
نویسندگان
چکیده
I INTRODUCTION A basic attribute of the human visual system is its ability to group elements of a perceived scene or visual field into meaningful or coherent clusters; in addition to clustering or partitioning, the visual system generally imparts structure and often a semantic interpretation to the data. In spite of the apparent existence proof provided by human vision, the general problem of scene partitioning remains unsolved for computer vision. Part of the difficulty resides In the fact that it is not clear to what extent semantic knowledge (e.g., recognizing the appearance of a straight line or some letter of the English alphabet), as opposed to generic criteria (e.g., grouping scene elements on the basis of geometric proximity), is employed in examples of human performance. Since, at present, we cannot hope to duplicate human competence in semantic interpretation, it would be desirable to find a task domain in which the Influence of semantic knowledge is limited. In such a domain it might be possible to discover the generic criteria employed by the human visual system. One of the main goals of the research effort described in this paper is to find a set of generic rules and models that will permit a machine to duplicate human performance in partitioning planar curves. II THE PARTITIONING PROBLEM Even If we are given a problem domain in which explicit semantic cues are missing, to what extent Is partitioning dependent on the purpose, vocabulary, data representation, and past experience of the "partitioning instrument," as opposed to being a search for context Independent "intrinsic structure" in the data? We argue that rather than having a unique formulation, the partitioning problem must be paramaterized along a number of basic dimensions. In the remainder of this section we enumerate some of these dimensions and discuss their relevance. A. Intent (Purpose) of the Partitioning Task In the experiment described in Figure 1, human subjects were presented with the task of partitioning a set of two-dimensional curves with respect to three different objectives: (1) choose a set of contour points that best mark those locations at which curve segments produced by different processes were "glued" together; (2) choose a set of contour points that best allow one to reconstruct the complete curve; (3) choose a set of contour points that would best allow one to distinguish the given curve from others. Each person was given only one of the …
منابع مشابه
Vessel Junction Detection From Retinal Images
This paper presents a perceptual organization based method for detecting Vessel Junctions (VJs) from retinal images. A retinal image is first segmented into edge traces which contain vessel boundaries. Each trace is divided into generic curve segments (GCSs) at curve partitioning points (CPPs). CPPs are the places on a trace from where the continuity of GCSs was broken according to perceptual o...
متن کاملPredicting Implantation Outcome of In Vitro Fertilization and Intracytoplasmic Sperm Injection Using Data Mining Techniques
Objective The main purpose of this article is to choose the best predictive model for IVF/ICSI classification and to calculate the probability of IVF/ICSI success for each couple using Artificial intelligence. Also, we aimed to find the most effective factors for prediction of ART success in infertile couples. MaterialsAndMethods In this cross-sectional study, the data of 486 patients are colle...
متن کاملProblem-Based and Lecture-Based Methods Compared: The Mediating Role of Perceptual Control and Value Cognition
It is necessary to clarify factors affecting student emotions as they play an important role in their learning. Among such factors teaching method looms large, and given the variety of methods used, a comparison of these methods in terms of their relation to things like perceptual control and value cognition, can lead to a better choice in regards to helping the students learn better....
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملA k-Partition, Graph Theoretic Approach to Perceptual Organization
This paper presents an k-partition, graph theoretic approach to perceptual organization. Principal results include a generalization of the bi-partition normalized cut to a k-partition measure, and a derivation of a sub-optimal, polynomial time solution to the NP-hard k-partition problem. The solution is obtained by first relaxing to an eigenvalue problem, followed by a heuristic procedure to en...
متن کامل