DBSC-Based Grayscale Line Image Vectorization.

Journal of Computer Science and Technology (Impact Factor: 0.64). 03/2006; 21(2):244-248. DOI: 10.1007/s11390-006-0244-0
Source: DBLP

ABSTRACT Vector graphics plays an important role in computer animation and imaging technologies. However present techniques and tools
cannot fully replace traditional pencil and paper. Additionally, vector representation of an image is not always available.
There is not yet a good solution for vectorizing a picture drawn on a paper. This work attempts to solve the problem of vectorizing
grayscale line drawings. The solution proposed uses Disk B-Spline curves to represent strokes of an image in vector form.
The algorithm builds a vector representation from a grayscale raster image, which can be a scanned picture for instance. The
proposed method uses a Gaussian sliding window to calculate skeleton and perceptive width of a stroke. As a result of vectorization,
the given image is represented by a set of Disk B-Spline curves.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A comprehensive survey of thinning methodologies is presented. A wide range of thinning algorithms, including iterative deletion of pixels and nonpixel-based methods, is covered. Skeletonization algorithms based on medial axis and other distance transforms are not considered. An overview of the iterative thinning process and the pixel-deletion criteria needed to preserve the connectivity of the image pattern is given first. Thinning algorithms are then considered in terms of these criteria and their modes of operation. Nonpixel-based methods that usually produce a center line of the pattern directly in one pass without examining all the individual pixels are discussed. The algorithms are considered in great detail and scope, and the relationships among them are explored
    IEEE Transactions on Pattern Analysis and Machine Intelligence 10/1992; 14(9):869-885. · 5.69 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes the underlying ideas and algorithmic details of a computer program that performs at a human level of competence for a significant subset of the curve partitioning task. It extends and rounds out the technique and philosophical approach originally presented by Fischler and Bolles (1986). In particular, it provides a unified strategy for selecting and dealing with interactions between salient points, even when these points are salient at different scales of resolution. Experimental results are presented involving on the order of 1000 real and synthetically generated images
    IEEE Transactions on Pattern Analysis and Machine Intelligence 03/1994; · 5.69 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The main result of this paper shows that the block-based digital medial axis transform can be computed in parallel by a constant number of calls to scan (parallel prefix) operations. This gives time- and/or work-optimal parallel implementations for the distance-based and the block-based medial axis transform in a wide variety of parallel architectures. Since only eight scan operations plus a dozen local operations are performed, the algorithm is very easy to program and use. The originality of our approach is the use of the notion of a derived grid and the oversampling of the image in order to reduce the computation of the block-based medial axis transform in the original grid to the much easier task of computing the distance based medial axis transform of the oversampling of the image on the derived grid
    IEEE Transactions on Pattern Analysis and Machine Intelligence 04/1999; · 5.69 Impact Factor


Available from