An automated threshold Edge Drawing algorithm

10/11/2021
by   Ciprian Orhei, et al.
0

Parameter choosing in classical edge detection algorithms can be a costly and complex task. Choosing the correct parameters can improve considerably the resulting edge-map. In this paper we present a version of Edge Drawing algorithm in which we include an automated threshold choosing step. To better highlight the effect of this additional step we use different first order operators in the algorithm. Visual and statistical results are presented to sustain the benefits of the proposed automated threshold scheme.

READ FULL TEXT
research
09/16/2019

Extending simple drawings with one edge is hard

A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
research
06/10/2020

A different approach for choosing a threshold in peaks over threshold

Abstract In Extreme Value methodology the choice of threshold plays an i...
research
08/24/2022

Improved Scheduling of Morphing Edge Drawing

Morphing edge drawing (MED), a graph drawing technique, is a dynamic ext...
research
04/07/2022

Just-Noticeable-Difference Based Edge Map Quality Measure

The performance of an edge detector can be improved when assisted with a...
research
07/24/2018

Graph Compact Orthogonal Layout Algorithm

There exist many orthogonal graph drawing algorithms that minimize edge ...
research
09/01/2023

Evaluating Animation Parameters for Morphing Edge Drawings

Partial edge drawings (PED) of graphs avoid edge crossings by subdividin...
research
05/31/2020

Defect-Deferred Correction Method Based on a Subgrid Artificial Viscosity Modeling

An alternative first step approximation based on subgrid artificial visc...

Please sign up or login with your details

Forgot password? Click here to reset