Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Digital Image Warping
Topological Algorithms for Digital Image Processing
Topological Algorithms for Digital Image Processing
Image upsampling via imposed edge statistics
ACM SIGGRAPH 2007 papers
Diffusion curves: a vector representation for smooth-shaded images
ACM SIGGRAPH 2008 papers
Random-access rendering of general vector graphics
ACM SIGGRAPH Asia 2008 papers
Automatic and topology-preserving gradient mesh generation for image vectorization
ACM SIGGRAPH 2009 papers
Patch-based image vectorization with automatic curvilinear feature alignment
ACM SIGGRAPH Asia 2009 papers
A GPU Laplacian solver for diffusion curves and Poisson image editing
ACM SIGGRAPH Asia 2009 papers
Ardeco: automatic region detection and conversion
EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques
Antialiasing recovery for edit propagation
Proceedings of the 10th International Conference on Virtual Reality Continuum and Its Applications in Industry
Pixel Art with Refracted Light by Rearrangeable Sticks
Computer Graphics Forum
NPAR '12 Proceedings of the Symposium on Non-Photorealistic Animation and Rendering
NPAR '12 Proceedings of the Symposium on Non-Photorealistic Animation and Rendering
VEA 2012: Efficient antialiased edit propagation for images and videos
Computers and Graphics
Rasterizing and antialiasing vector line art in the pixel art style
Proceedings of the Symposium on Non-Photorealistic Animation and Rendering
ACM Transactions on Graphics (TOG)
WidgetLens: a system for adaptive content magnification of widgets
BCS-HCI '13 Proceedings of the 27th International BCS Human Computer Interaction Conference
| Hi-index | 0.00 |
We describe a novel algorithm for extracting a resolution-independent 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.