Segmentation of Plane Curves
From MaRDI portal
Cited in
(20)- Some algorithms under non-parametric framework versus an unsupervised approach
- Radial symmetries based decomposition of cell clusters in binary and gray level images
- Applications of fuzzy sets in curve fitting
- A Heuristic-adaptive procedure for segmentation of time patterns
- Uniform error bound for PCA matrix denoising
- A general data structure for image analysis based on a description of connected components
- Vision-based shape recognition and analysis of machined parts
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- Algorithms for computerized inspection of rectangular and square shapes
- Data reduction of large vector graphics
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- A time series representation model for accurate and fast similarity detection
- Numerical methods for approximating digitized curves by piecewise circular arcs
- Corner detection and curve segmentation by multiresolution chain-code linking
- Multiple straight-line fitting using a Bayes factor
- On-line segmentation of freehand sketches by knowledge-based nonlinear thresholding operations
- Combining local belief from low-level primitives for perceptual grouping
- A dynamic programming segmentation procedure for hydrological and environmental time series
- Approximation of multipath planar shapes in pattern analysis
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
This page was built for publication: Segmentation of Plane Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770015)
