TL;DR
This paper introduces a comprehensive analytical framework to evaluate the effectiveness of various line chart smoothing techniques across different visual analytics tasks, aiding in selecting appropriate methods for noisy or large data sets.
Contribution
The paper develops a systematic framework based on 8 effectiveness measures linked to 8 visual tasks, and analyzes 12 smoothing methods, providing guidance on their suitability and limitations.
Findings
Gaussian filters and topology-based subsampling perform well overall.
Low-pass cutoff filters and Douglas-Peucker are effective for specific tasks.
Uniform subsampling often produces low-quality results and should be avoided.
Abstract
We present a comprehensive framework for evaluating line chart smoothing methods under a variety of visual analytics tasks. Line charts are commonly used to visualize a series of data samples. When the number of samples is large, or the data are noisy, smoothing can be applied to make the signal more apparent. However, there are a wide variety of smoothing techniques available, and the effectiveness of each depends upon both nature of the data and the visual analytics task at hand. To date, the visualization community lacks a summary work for analyzing and classifying the various smoothing methods available. In this paper, we establish a framework, based on 8 measures of the line smoothing effectiveness tied to 8 low-level visual analytics tasks. We then analyze 12 methods coming from 4 commonly used classes of line chart smoothing---rank filters, convolutional filters, frequency domain…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
