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.
This research has been supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery grants 185986 and 194376.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Peters, J.F., Chitcharoen, D.: Sufficiently near neighbourhoods of points in flow graphs. A Near Set Approach. Fundamenta Informaticae 124(1), 175–196 (2013)
Ramanna, S., Chitcharoen, D.: Flow graphs. analysis with near sets. Mathematics in Computer Science 7(1), 11–29 (2013)
Peters, J.: Near sets. General theory about nearness of objects. Applied Math. Sci. 1(53), 2609–2629 (2007)
Peters, J.F., Naimpally, S.: Applications of near sets. Amer. Math. Soc. Notices 59(4), 536–542 (2012)
Wolski, M.: Perception and classification. A Note on Near sets and Rough sets. Fund. Inform. 101, 143–155 (2010)
Mieszkowicz-Rolka, A., Rolka, L.: Flow graphs and decision tables with fuzzy attributes. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol. 4029, pp. 268–277. Springer, Heidelberg (2006)
Pawlak, Z.: Decision algorithms, bayes theorem and flow graphs. AISC, pp. 18–24. Physica-Verlag, Heidelberg (2003)
Kostek, B., Czyzewski, A.: A processing of musical metadata employing Pawlak’s flow graphs. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B., Swiniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 279–298. Springer, Heidelberg (2004)
Butz, C., Yan, W., Yang, B.: An Efficient Algorithm for Inference in Rough Set Flow Graphs. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 102–122. Springer, Heidelberg (2006)
Sun, J., Liu, H., Zhang, H.: An extension of pawlak’s flow graphs. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 191–199. Springer, Heidelberg (2006)
Chitcharoen, D.: Mathematical Aspects of Flow Graph Approaches to Data Analysis. PhD thesis, Department of Applied Mathematics, King Mongkut Institute of Technology, Ladkrabang (2010)
Peters, J., Wasilewski, P.: Foundations of Near Sets. Inf. Sci. 179(18), 3091–3109 (2009)
Pawlak, Z.: Decision trees and flow graphs. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 1–11. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peters, J.F., Chitcharoen, D., Ramanna, S. (2013). Reasoning with Near Set-Based Digital Image Flow Graphs. In: Ramanna, S., Lingras, P., Sombattheera, C., Krishna, A. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2013. Lecture Notes in Computer Science(), vol 8271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44949-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-44949-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44948-2
Online ISBN: 978-3-642-44949-9
eBook Packages: Computer ScienceComputer Science (R0)