Contour polygonal approximation using shortest path in networks
Contour polygonal approximation is a simplified representation of a contour by line segments, so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex, so that we model a regular network. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. By analyzing of network properties, especially the geodesic path, we compute the polygonal approximation. The paper presents the main characteristics of the method, as well as its functionality. We evaluate the proposed method using benchmark contours, and compare its results with other polygonal approximation methods.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
An Object Aware Hybrid U-Net for Breast Tumour Annotation
In the clinical settings, during digital examination of histopathological slides, the pathologist annotate the slides by marking the rough boundary around the suspected tumour region. The marking or annotation is general…
Deep LearningInstance SegmentationSegmentationSemantic SegmentationPolygonal Point Set Tracking
In this paper, we propose a novel learning-based polygonal point set tracking method. Compared to existing video object segmentation~(VOS) methods that propagate pixel-wise object mask information, we propagate a polygon…
Semantic SegmentationVideo Object SegmentationVideo Semantic SegmentationOriented bounding boxes using multiresolution contours for fast interference detection of arbitrary geometry objects
Interference detection of arbitrary geometric objects is not a trivial task due to the heavy computational load imposed by implementation issues. The hierarchically structured bounding boxes help us to quickly isolate th…
Shortest path distance approximation using deep learning techniques
Computing shortest path distances between nodes lies at the heart of many graph algorithms and applications. Traditional exact methods such as breadth-first-search (BFS) do not scale up to contemporary, rapidly evolving …
Deep LearningGeneralized Shortest Path-based Superpixels for Accurate Segmentation of Spherical Images
Most of existing superpixel methods are designed to segment standard planar images as pre-processing for computer vision pipelines. Nevertheless, the increasing number of applications based on wide angle capture devices,…
ClusteringSuperpixels