Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Reasoning with near set-based digital image flow graphs
Loading...
Thumbnail Image

Reasoning with near set-based digital image flow graphs

Author(s)
Peters, James F.
Chitcharoen, Doungrat
Ramanna, Sheela
Date Issued
December 1, 2013
Type
Conference Paper
DOI
10.1007/978-3-642-44949-9_19
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.
Citation
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 8271 LNAI, 199-210, 2013
Subjects

digital image flow gr...

near sets

perceptual system

probe functions

sufficiently near

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback