BibTeX
@MISC{Kopf_ourresult,
author = {Johannes Kopf and Dani Lischinski},
title = {Our result},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Figure 1: Naïve upsampling of pixel art images leads to unsatisfactory results. Our algorithm extracts a smooth, resolution-independent vector representation from the image, which is suitable for high-resolution display devices. (Input image c ○ Nintendo Co., Ltd.). We describe a novel algorithm for extracting a resolutionindependent vector representation from pixel art images, which enables magnifying the results by an arbitrary amount without image degradation. Our algorithm resolves pixel-scale features in the input and converts them into regions with smoothly varying shading that are crisply separated by piecewise-smooth contour curves. In the original image, pixels are represented on a square pixel lattice, where diagonal neighbors are only connected through a single point. This causes thin features to become visually disconnected under magnification by conventional means, and creates ambiguities in the connectedness and separation of diagonal neighbors. The key to our algorithm is in resolving these ambiguities. This enables us to reshape the pixel cells so that neighboring pixels belonging to the same feature are connected through edges, thereby preserving the feature connectivity under magnification. We reduce pixel aliasing artifacts and improve smoothness by fitting spline curves to contours in the image and optimizing their control points.
Keyphrases
diagonal neighbor pixel art image pixel cell thin feature spline curve original image image degradation pixel-scale feature nintendo co unsatisfactory result conventional mean piecewise-smooth contour curve square pixel lattice input image resolutionindependent vector representation single point arbitrary amount resolution-independent vector representation novel algorithm feature connectivity high-resolution display device control point
