Character design is a key ingredient to the success of any comicbook, graphic novel, or animated feature. Artists typically use shape, size and proportion as the first design layer to express role, physicality and personality traits. In this paper, we propose a knowledge mining framework that extracts primitive shape features from finished art, and trains models with labeled metadata attributes...

The Hong’s modified histogram shifting method is best method of reversible watermarking. But Hong’s modified histogram method is not suitable for cartoon images. Our improved backward histogram shifting method overcome drawback of Hong’s method. Generally PSNR decreases when embedding capacity increases. But our improved backward histogram shifting method gives more embedding capacity and high ...

A new framework for cartoon animation is proposed in this work. By using the wavelet coefficients as the control points, one can manipulate curves so that shape metamorphosis occurs along resolutions as well as spatial locations. We model the motion of a cartoon character with the Lagrangian dynamic equation where the multiscale curve is driven by relevant forces. The spatial and frequency loca...

OBJECTIVES Although the spectrally degraded input provided by cochlear implants (CIs) is sufficient for speech perception in quiet, it poses problems for talker identification. The present study examined the ability of normally hearing (NH) children and child CI users to recognize cartoon voices while listening to spectrally degraded speech. DESIGN In Experiment 1, 5- to 6-year-old NH childre...

In this paper, we describe a hidden line removal scheme for 2D cartoon images. The depths are introduced to the polylines of the image. The surfaces of the image are classified and their depths updated according to the depths of polylines forming the surfaces. The hidden lines are identified by comparing the depths of the polylines with the depths of the surfaces. This algorithm has been applie...

Retexturing videos of deformable surfaces is an important problem in computer vision as it has a wide variety of applications. A key step in producing visually pleasing retexturing results is registration. Traditional registration methods require a certain amount of texture on the surface in order to capture all the deformation details. However, in cases such as cartoon videos, there is a high ...

The idea of decomposing a given image into the cartoon part and the texture-noise part has become classical and there are basic standard algorithms to do that such as RudinOsher-Fatemi [ROF92], and modifications (e.g. Meyer [Mey01]; Osher, Solé, Vese [OSV03] and others). We discuss the Osher-Solé-Vese Ḣ−1-model of image decomposition and propose several natural modifications by using alternativ...