Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization
スポンサーリンク
概要
- 論文の詳細を見る
Digital halftoning is a problem of computing a binary image approximating an input gray (or color) image. We consider two problems on digital halftoning: mathematical evaluation of a halftoning image and design of optimization-based halftoning algorithms. We propose an efficient automatic evaluation system of halftoning images by using quality evaluation functions based on discrepancy measures. Our experimental results on the evaluation system infer that the discrepancy corresponding to a regional error is a good evaluation measurement, and thus we design algorithms to reduce this discrepancy measure.
- 東北大学の論文
著者
-
SADAKANE KUNIHIKO
Graduate School of Information Science and Electrical Engineering, Kyushu University
-
Chebihi Nadia
Graduate School Of Information Sciences Tohoku University
-
Tokuyama Takeshi
Graduate School Of Information Science Tohoku University
-
Sadakane Kunihiko
Graduate School Of Information Sciences Tohoku University
-
Sadakane Kunihiko
Graduate School Of Information Science And Electrical Engineering Kyushu University
関連論文
- Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs(Algorithm Theory)
- Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs
- Distance Trisector of a Segment and a Point
- Voronoi Diagrams with Respect to Criteria on Vision Information
- Quasi-Norms for a Double Sequence
- On Detecting Digital Line Components in a Binary Image
- Reconstructing sets from distances given by graphs (コンピュテーション)
- Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization
- Quantum Algorithms for Intersection and Proximity Problems
- Quantum Computation in Computational Geometry
- Combinatorics on Arrangements and Parametric Matroids : A Bridge between Computational Geometry and Combinatorial Optimization(Special Issue on Algorithm Engineering : Surveys)
- Peak-Reducing Fitting of a Curve under the Lp Metric
- On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs
- Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication
- DS-1-11 An Algorithm for Optimally Locating Baselines using Quad Decomposition
- Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs