Multiscale characterization and analysis of shapes
Patent
·
OSTI ID:874453
- Los Alamos, NM
- Sunnyvale, CA
An adaptive multiscale method approximates shapes with continuous or uniformly and densely sampled contours, with the purpose of sparsely and nonuniformly discretizing the boundaries of shapes at any prescribed resolution, while at the same time retaining the salient shape features at that resolution. In another aspect, a fundamental geometric filtering scheme using the Constrained Delaunay Triangulation (CDT) of polygonized shapes creates an efficient parsing of shapes into components that have semantic significance dependent only on the shapes' structure and not on their representations per se. A shape skeletonization process generalizes to sparsely discretized shapes, with the additional benefit of prunability to filter out irrelevant and morphologically insignificant features. The skeletal representation of characters of varying thickness and the elimination of insignificant and noisy spurs and branches from the skeleton greatly increases the robustness, reliability and recognition rates of character recognition algorithms.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM
- DOE Contract Number:
- W-7405-ENG-36
- Assignee:
- The Regents of the University of California (Los Alamos, CA)
- Patent Number(s):
- US 6393159
- OSTI ID:
- 874453
- Country of Publication:
- United States
- Language:
- English
Boundary-constrained morphological skeleton minimization and skeleton reconstruction
|
journal | February 1994 |
Shape description by medial surface construction
|
journal | March 1996 |
Constrained delaunay triangulations
|
journal | June 1989 |
Skeleton-space: a multiscale shape description combining region and boundary information
|
conference | June 1994 |
Similar Records
Rectification of the chordal axis transform and a new criterion for shape decomposition.
MULTISCALE DISCRETIZATION OF SHAPE CONTOURS
Python and computer vision
Conference
·
Wed Dec 31 23:00:00 EST 2003
·
OSTI ID:977914
MULTISCALE DISCRETIZATION OF SHAPE CONTOURS
Conference
·
Fri Sep 01 00:00:00 EDT 2000
·
OSTI ID:764071
Python and computer vision
Conference
·
Mon Dec 31 23:00:00 EST 2001
·
OSTI ID:975972
Related Subjects
/382/345/
adaptive
additional
algorithms
analysis
approximates
aspect
benefit
boundaries
branches
cdt
character
characterization
characters
components
constrained
continuous
contours
creates
delaunay
densely
dependent
discretized
discretizing
efficient
elimination
features
filter
filtering
fundamental
generalizes
geometric
greatly
increases
insignificant
irrelevant
method
morphologically
multiscale
noisy
nonuniformly
parsing
polygonized
prescribed
process
prunability
purpose
rates
recognition
reliability
representation
representations
resolution
retaining
robustness
salient
sampled
scheme
semantic
shape
shapes
significance
skeletal
skeleton
skeletonization
sparsely
spurs
structure
thickness
time
triangulation
uniformly
varying
adaptive
additional
algorithms
analysis
approximates
aspect
benefit
boundaries
branches
cdt
character
characterization
characters
components
constrained
continuous
contours
creates
delaunay
densely
dependent
discretized
discretizing
efficient
elimination
features
filter
filtering
fundamental
generalizes
geometric
greatly
increases
insignificant
irrelevant
method
morphologically
multiscale
noisy
nonuniformly
parsing
polygonized
prescribed
process
prunability
purpose
rates
recognition
reliability
representation
representations
resolution
retaining
robustness
salient
sampled
scheme
semantic
shape
shapes
significance
skeletal
skeleton
skeletonization
sparsely
spurs
structure
thickness
time
triangulation
uniformly
varying