Affiliations: Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 51-V6, Canada and School of Mathematics, University of Hyderabad, Hyderabad-500046, India. [email protected] | Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 51-V6, Canada. [email protected]
Note: [] Address for correspondence: Computational Intelligence Laboratory, University of Manitoba, 75A Chancellor's Circle, Winnipeg, Manitoba R3T 51-V6, Canada
Abstract: This paper introduces sufficiently near visual neighbourhoods of points and neighbourhoods of sets in digital image flow graphs (NDIFGs). An NDIFG is an extension of a Pawlak flow graph. The study of sufficiently near neighbourhoods in NDIFGs stems from recent work on near sets and topological spaces via near and far, especially in terms of visual neighbourhoods of points that are sufficiently near each other. From a topological perspective, non-spatially near sets represent an extension of proximity space theory and the original insight concerning spatially near sets by F. Riesz at the International Congress of Mathematicians (ICM) in 1908. In the context of Herrlich nearness, sufficiently near neighbourhoods of sets in NDIFGs provide a new perspective on topological structures in NDIFGs. The practical implications of this work are significant. With the advent of a study of the nearness of open as well as closed neighbourhods of points and of sets in NDIFGs, it is now possible to do information mining on a more global level and achieve new insights concerning the visual information embodied in the images that provide input to an NDIFG.
Keywords: Digital image, near sets, visual neighbourhood, Pawlak flow graphs, sufficiently near, topological structure
