Image Segmentation and Classification Fields Are Generated Using Binary Random Fields Based on Planar Graph and Neighborhood Spanning Tree
G. Thippanna
Dr. G. Thippanna, Professor, Dept. of CSE & MCA, Ashoka Women’s Engineering College, Kurnool
Manuscript received on 06 February 2024 | Revised Manuscript received on 15 February 2024 | Manuscript Accepted on 15 February 2024 | Manuscript published on 28 February 2024 | PP: 1-8 | Volume-4 Issue-2, February 2024 | Retrieval Number: 100.1/ijipr.C102704030424 | DOI: 10.54105/ijipr.C1027.04020224
Open Access | Editorial and Publishing Policies | Cite | Zenodo | OJS | Indexing and Abstracting
© The Authors. Published by Lattice Science Publication (LSP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Image analysis plays a pivotal role in computer vision, with image segmentation and classification being fundamental tasks in this domain. This abstract presents a novel approach to image processing that leverages Binary Random Fields (BRF) with a foundation in planar graphs and neighborhood spanning trees. This innovative methodology seeks to enhance the accuracy and efficiency of image segmentation and classification, addressing key challenges in computer vision applications. Binary Random Fields (BRF) is probabilistic graphical models that have proven effective in capturing spatial dependencies and contextual information within images. Our proposed method extends the utility of BRF by incorporating planar graph theory and neighborhood spanning trees to refine the segmentation and classification processes. Planar graphs offer a structured representation of image data, preserving topological relationships among pixels, while neighborhood spanning trees provide a hierarchical framework for modeling image regions.
Keywords: Planar Graph Representation, Neighborhood Spanning Trees, Emage Enhancement Techniques, Raw images.
Scope of the Article: Classification