Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Sequential euclidean distance transforms

Known as: SEDT, Sequential duclidean distance transforms 
In the field of computer graphics, Sequential Euclidean Distance Transforms (SEDT) are a special kind of distance transforms based on the Euclidean… Expand
Wikipedia

Related topics

Related topics

4 relations

Broader (1)

Computer graphics
Distance transformEuclidean distanceList of transforms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Structural Embedding of Syntactic Trees for Machine Comprehension
Deep neural networks for machine comprehension typically utilizes only word or character embeddings without explicitly taking… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
2017
2017
Simulation Study of Large-Scale Charge Sharing Mitigation Using Seamless Guard Band
In this paper, a novel seamless guard band (SGB) technique for charge sharing mitigation is studied using 3-D TCAD numerical… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2013
2013
硬膜外脂肪増生により腰部脊柱管狭窄症を生じた遅発性脊椎骨端異形成症 (SEDT) の1例
 
2008
2008
Construction of WISP3 gene's mutants in SEDT-PA and their expression in COS-7 cells
Objective To construct two types of Wnt-inducible secreted protein 3(WISP3)gene's mutants(1000T/C,840delT)found in… Expand
Highly Cited
2005
Highly Cited
2005
Exact medial axis with euclidean distance
Medial Axis (MA), also known as Centres of Maximal Disks, is a useful representation of a shape for image description and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
2003
2003
Look-Up Tables for Medial Axis on Squared Euclidean Distance Transform
Medial Axis (MA), also known as Centres of Maximal Disks, is a useful representation of a shape for image description and… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
1996
1996
A Parallel Euclidean Distance Transformation Algorithm
We present a parallel algorithm for the Euclidean distance transformation (EDT). It is a “divide-and-conquer” algorithm based on… Expand
1995
1995
On merging hidden Markov models with deformable templates
  • R. Rao, R. Mersereau
  • Proceedings., International Conference on Image…
  • 1995
    • Corpus ID: 8253479
Hidden Markov modeling has proven extremely useful for statistical analysis of speech signals. There are, however, inherent… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
1993
1993
A parallel Euclidean distance transformation algorithms
We present a parallel algorithm for the Euclidean distance transformation (EDT). It is a divide-and-conquer algorithm based on a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1992
Highly Cited
1992
Fast raster scan distance propagation on the discrete rectangular lattice
Abstract The main result of this paper is that simple (raster scan) sequential algorithms for computing Euclidean Distance… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE