scholarly journals Shape simplification through polygonal approximation in the Fourier domain

2015 ◽  
Author(s):  
Mark Andrews ◽  
Ramakrishna Kakarala
Keyword(s):  
Fourier Domain ◽  
Polygonal Approximation ◽  
Shape Simplification

Correlation averaging of two-dimensional crystals: basic strategy and refinements

1986 ◽  
Vol 44 ◽  
pp. 136-139
Author(s):  
W. Baumeister ◽  
R. Rachel ◽  
R. Guckenberger ◽  
R. Hegerl
Keyword(s):  
Low Dose ◽  
Signal To Noise Ratio ◽  
Real Space ◽  
Fourier Domain ◽  
Two Dimensional ◽  
Signal To Noise ◽  
Unit Cells ◽  
Lateral Displacements ◽  
Established Technique ◽  
Crystalline Array

IntroductionCorrelation averaging (CAV) is meanwhile an established technique in image processing of two-dimensional crystals /1,2/. The basic idea is to detect the real positions of unit cells in a crystalline array by means of correlation functions and to average them by real space superposition of the aligned motifs. The signal-to-noise ratio improves in proportion to the number of motifs included in the average. Unlike filtering in the Fourier domain, CAV corrects for lateral displacements of the unit cells; thus it avoids the loss of resolution entailed by these distortions in the conventional approach. Here we report on some variants of the method, aimed at retrieving a maximum of information from images with very low signal-to-noise ratios (low dose microscopy of unstained or lightly stained specimens) while keeping the procedure economical.

An Improved Sequential Polygonal Approximation Algorithm on Skeleton Curves

2009 ◽  
Vol 34 (12) ◽  
pp. 1467-1474
Author(s):  
Zhe LV ◽  
Fu-Li WANG ◽  
Yu-Qing CHANG ◽  
Yang LIU
Keyword(s):  
Approximation Algorithm ◽  
Polygonal Approximation

POLYGONAL APPROXIMATION OF DIGITAL CURVE BASED ON REVERSE ENGINEERING CONCEPT

2013 ◽  
Vol 13 (04) ◽  
pp. 1350017 ◽  
Author(s):  
KUMAR S. RAY ◽  
BIMAL KUMAR RAY
Keyword(s):  
Reverse Engineering ◽  
Linear Time ◽  
Line Drawing ◽  
Approximation Error ◽  
Zero Approximation ◽  
Polygonal Approximation ◽  
Digital Curve ◽  
Symmetric Approximation ◽  
Engineering Concept ◽  
Automatic Algorithm

This paper applies reverse engineering on the Bresenham's line drawing algorithm [J. E. Bresenham, IBM System Journal, 4, 106–111 (1965)] for polygonal approximation of digital curve. The proposed method has a number of features, namely, it is sequential and runs in linear time, produces symmetric approximation from symmetric digital curve, is an automatic algorithm and the approximating polygon has the least non-zero approximation error as compared to other algorithms.

Sign in / Sign up

Export Citation Format

Share Document