Reasoning with near set-based digital image flow graphs

Abstract

This paper introduces sufficiently near points in pairs of digital image flow graphs (DIFGs). This work is an extension of earlier work on a framework for layered perceptual flow graphs, where analysis of such graphs was performed in terms of flow graph nodes, branches, and paths using near set theory. A description-based method for determining nearness between flow graphs is given in terms of a practical application to digital image analysis. © 2013 Springer-Verlag.