TY - JOUR
T1 - Representing space for practical reasoning
AU - Fleck, Margaret M.
N1 - Funding Information:
Department of Engineering Science, Oxford Building, 19 Parks Road, Oxford OX1 3PJ, UK The research described in this paper was done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology, Cambridge, MA, USA, and at the Department of Engineering Science, Oxford University, UK. The author is supported by the Fannie and John Hertz Foundation and by the Bell Laboratories Graduate Research Program for Women
Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 1988/5
Y1 - 1988/5
N2 - The paper describes a new approach to representing space and time for practical reasoning, based on space-filling cells. Unlike Rn, the new models can represent a bounded region of space using only a finite number of cells, so they can be manipulated directly. Unlike Zn, they have useful notions of function continuity and region 'connectedness'. The topology of space is allowed to depend on the situation being represented, accounting for sharp changes in function values and lack of connectedness across object boundaries. Algorithms based on this model of space are neither purely region based not purely boundary based, but a blend of the two. This new style of algorithm design is illustrated by a new program for finding edges in grey-scale images. Although the program is based on a fairly conventional second directional difference operator, it can detect fine texture in the presence of camera noise, produce connected boundaries around sharp corners and return thin boundaries without 'feathering'. New algorithms are presented for combining directional differences, suppressing the effects of camera noise, reconstructing image intensities from the second difference values and merging results from different scales (including suppression of spurious boundaries in staircase patterns).
AB - The paper describes a new approach to representing space and time for practical reasoning, based on space-filling cells. Unlike Rn, the new models can represent a bounded region of space using only a finite number of cells, so they can be manipulated directly. Unlike Zn, they have useful notions of function continuity and region 'connectedness'. The topology of space is allowed to depend on the situation being represented, accounting for sharp changes in function values and lack of connectedness across object boundaries. Algorithms based on this model of space are neither purely region based not purely boundary based, but a blend of the two. This new style of algorithm design is illustrated by a new program for finding edges in grey-scale images. Although the program is based on a fairly conventional second directional difference operator, it can detect fine texture in the presence of camera noise, produce connected boundaries around sharp corners and return thin boundaries without 'feathering'. New algorithms are presented for combining directional differences, suppressing the effects of camera noise, reconstructing image intensities from the second difference values and merging results from different scales (including suppression of spurious boundaries in staircase patterns).
KW - edge finding
KW - image processing
KW - space representation
UR - http://www.scopus.com/inward/record.url?scp=0024016841&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024016841&partnerID=8YFLogxK
U2 - 10.1016/0262-8856(88)90002-9
DO - 10.1016/0262-8856(88)90002-9
M3 - Article
AN - SCOPUS:0024016841
SN - 0262-8856
VL - 6
SP - 75
EP - 86
JO - Image and Vision Computing
JF - Image and Vision Computing
IS - 2
ER -