A note on 'A fully parallel 3D thinning algorithm and its applications'

05/01/2019
by   PetsTime, et al.
0

A 3D thinning algorithm erodes a 3D binary image layer by layer to extract the skeletons. This paper presents a correction to Ma and Sonka's thinning algorithm, A fully parallel 3D thinning algorithm and its applications, which fails to preserve connectivity of 3D objects. We start with Ma and Sonka's algorithm and examine its verification of connectivity preservation. Our analysis leads to a group of different deleting templates, which can preserve connectivity of 3D objects.

READ FULL TEXT
research
11/10/2017

Group Connectivity: Z_4 v. Z_2^2

We answer a question on group connectivity suggested by Jaeger et al. [G...
research
10/10/2021

On the complexity of structure and substructure connectivity of graphs

The connectivity of a graph is an important parameter to measure its rel...
research
01/21/2021

A Note on Connectivity of Sublevel Sets in Deep Learning

It is shown that for deep neural networks, a single wide layer of width ...
research
10/23/2019

Mimicking Networks Parameterized by Connectivity

Given a graph G=(V,E), capacities w(e) on edges, and a subset of termina...
research
03/21/2019

Parallel Batch-Dynamic Graph Connectivity

With the rapid growth of graph datasets over the past decade, a new kind...
research
09/11/2021

Implementing Parallel Quick Sort Algorithm on OTIS Hyper Hexa-Cell (OHHC) Interconnection Network

This work explores the characteristics of implementing parallel Quick So...

Please sign up or login with your details

Forgot password? Click here to reset