Data reduction of large vector graphics

DOI10.1016/J.PATCOG.2004.07.005MaRDI QIDQ1765582zbMATH OpenOpenAlexFDO

Authors Pasi Fränti, Alexander V. Kolesnikov

Publication date 23 February 2005

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2004.07.005

zbMATH Keywords

Dynamic programmingPolygonal approximationData reductionMin-e problemMultiple-objectVector data compression

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Distributed Compression of Graphical Data
• Universal Lossless Compression of Graphical Data
• scientific article; zbMATH DE number 1870059

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 2044105 (Why is no real title available?)
• A new method for polygonal approximation using genetic algorithms
• A non-parametric sequential method for polygonal approximation of digital curves
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• An adaptive split-and-merge method for binary image contour data compression
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• An efficient evolutionary algorithm for accurate polygonal approximation
• An optimal polygonal boundary encoding scheme in the rate distortion sense
• Ant colony search algorithms for optimal polygonal approximation of plane curves.
• Cartographic line simplification and polygon CSG formulae in O(n^* n) time
• Efficiently approximating polygonal paths in three and higher dimensions
• Moment-based methods for polygonal approximation of digitized curves
• Optimal polygonal approximation of digital planar curves using meta heuristics
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
• Optimum polygonal approximation of digitized curves
• Polygonal approximation by boundary reduction
• Polygonal approximation by the minimax method
• Reduced-search dynamic programming for approximation of polygonal curves
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• Segmentation of Plane Curves

Cited in

(8)

• IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule
• A data reduction algorithm for planar curves
• Generalization-oriented road line segmentation by means of an artificial neural network applied over a moving window
• Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
• Computational Science - ICCS 2004
• Data reduction of polygonal curves using B-splines.
• Improved algorithm for vector data compression based on dynamic programming
• Polygonal approximation of closed discrete curves

This page was built for publication: Data reduction of large vector graphics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765582)