Automatic ASCII Art conversion of binary images using non-negative constraints

@inproceedings{OGrady2008AutomaticAA,
  title={Automatic ASCII Art conversion of binary images using non-negative constraints},
  author={P.D. O'Grady and Scott T. Rickard},
  year={2008}
}
It is hard to avoid ASCII Art in today's digital world, from the ubiquitous emoticons-;)-to the esoteric artistic creations that reside in many people's e-mail signatures, everybody has come across ASCII art at some stage. The origins of ASCII art can be traced back to the days when computers had a high price, slow operating speeds and low graphics capabilities, which forced computer programmers and enthusiasts to develop some innovative ways to render images using the limited graphics blocks… 

Figures from this paper

An interactive system for structure-based ASCII art creation
TLDR
This paper proposes an interactive system which creates structure-based ASCII art and provides four matching metrics for converting an image into an ASCII art, finding that the suitable matching metrics to produce visually pleasant ASCII art images depend on the type of the input images.
A character art generator using the local exhaustive search, with GPU acceleration
TLDR
A new technique to generate an ASCII/JIS art that reproduces the original tone and the details of an input grey-scale image is proposed, inspired by the local exhaustive search (LES) to optimise binary images for printing based on the characteristic of the human visual system.
ASCII Art Generation Using the Local Exhaustive Search on the GPU
TLDR
A new technique to generate an ASCII art that reproduces the original tone and the details of an input gray-scale image is proposed, inspired by the local exhaustive search to optimize binary images for printing based on the characteristic of the human visual system.
Structure-based ASCII art
TLDR
This paper presents a novel method to generate structure-based ASCII art that approximates the major line structure of the reference image content with the shape of characters using a novel alignment-insensitive shape similarity (AISS) metric.
Fast Rendering of Image Mosaics and ASCII Art
TLDR
This work proposes an algorithm able to reproduce the quality of existing non‐photorealistic rendering techniques, in particular ASCII art and image mosaics, obtaining large performance speed‐ups.
ASCII Art Synthesis from Natural Photographs
TLDR
A visual perception mechanism of non-classical receptive field modulation (non-CRF modulation) from physiological findings is introduced to this ASCII art application, and a new model ofnon- CRF modulation is proposed which can better separate the weak structure from the crowded texture, and also better control the scale of texture suppression.
Increasing Efficiency of Template-Matching Algorithm using Binary-Image instead of Color-Image
TLDR
Use of binary-image as an input to template matching algorithms has been proposed, where identifying particular shape is more important and Omitting color information from image makes image more efficient for processing, storage and transmission.
Automatic hexaphonic guitar transcription using non-negative constraints
TLDR
This work builds the equipment necessary to modify a standard electric guitar into a hexaphonic guitar, and presents an application of non-negative matrix factorisation to the task of transcription-where a basis for each note on the fretboard is learned and fitted to a magnitude spectrogram of thehexaphonic recording.
Generating ASCII-Art: A Nifty Assignment from a Computer Graphics Programming Course
TLDR
A graphics application programming assignment from an introductory programming course with a computer graphics focus, asking students to write a conversion program that turns images into ASCII Art.
A DDoS Mitigation System with Multi-stage Detection and Text-Based Turing Testing in Cloud Computing
TLDR
A multi-stage detection to more precisely detect the possible attackers and a text-based turing test with question generation module to challenge the suspected requesters who are detected by the detection module to mitigate the DDoS traffic from the Internet.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
Classifying Faces with Non-negative Matrix Factorization
TLDR
This paper has directly compared performances of NMF and Principal Component Analysis using a well-known face database, the AR, that contains a large number of individuals taken under several conditions and discovered that the correlation metric is the most suitable one for such problem.
Csiszár's Divergences for Non-negative Matrix Factorization: Family of New Algorithms
TLDR
A wide class of loss (cost) functions for non-negative matrix factorization (NMF) are discus and several novel algorithms with improved efficiency and robustness to noise and outliers are derived and applied to blind (or semi blind) source separation.
Polyphonic transcription by non-negative sparse coding of power spectra
TLDR
A novel modification to this model is introduced that recognises that a short-term Fourier spectrum can be thought of as a noisy realisation of the power spectral density of an underlying Gaussian process, where the noise is essentially multiplicative and non-Gaussian.
Polyphonic music transcription by non-negative sparse coding of power spectra
TLDR
A novel modification to this model is introduced that recognises that a short-term Fourier spectrum can be thought of as a noisy realisation of the power spectral density of an underlying Gaussian process, where the noise is essentially multiplicative and non-Gaussian.
Non-negative tensor factorization with applications to statistics and computer vision
TLDR
A "direct" positive-preserving gradient descent algorithm and an alternating scheme based on repeated multiple rank-1 problems are derived and motivate the use of n-NTF in three areas of data analysis.
Algorithms for Non-negative Matrix Factorization
TLDR
Two different multiplicative algorithms for non-negative matrix factorization are analyzed and one algorithm can be shown to minimize the conventional least squares error while the other minimizes the generalized Kullback-Leibler divergence.
Discovering Convolutive Speech Phones Using Sparseness and Non-negativity
TLDR
An extension to convolutive NMF that includes a sparseness constraint is presented, in combination with a spectral magnitude transform of speech, which extracts speech phones (and their associated sparse activation patterns), which is used in a supervised separation scheme for monophonic mixtures.
Sound Source Separation Using Shifted Non-Negative Tensor Factorisation
TLDR
A shifted non-negative tensor factorisation algorithm is derived, which extends shiftednon-negative matrix factorisation to the multi-channel case and can be used to separate sound sources which have time evolving spectra from multi- channel signals.
Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values†
A new variant ‘PMF’ of factor analysis is described. It is assumed that X is a matrix of observed data and σ is the known matrix of standard deviations of elements of X. Both X and σ are of
Non-negative Matrix Factor Deconvolution; Extraction of Multiple Sound Sources from Monophonic Inputs
In this paper we present an extension to the Non-Negative Matrix Factorization algorithm which is capable of identifying components with temporal structure. We demonstrate the use of this algorithm
...
...