We describe a unit generator based audio synthesis programming environment written in pure Java. The environment is based on a foundation structure consisting of a small number of Java interfaces and abstract classes, and a potentially unlimited number of unit generators, which are created by extending the abstract classes and implementing a single method. Filter-graphs, sometimes called “patch...

This paper describes an new and optimized direct ray tracing algorithm over complex implicit surfaces generated by skeletons. Its main originality is its ability to avoid unwanted blending between parts of the same object, thanks to the partitioning of the surface into several pieces, so called Implicit Patches. Moreover, these patches enable to exploit the properties of local field functions, ...

We present a new method for the interpolation of given data points and associated normals with surface parametric patches with rational normal fields. We give some arguments why a dual approach is the most convenient for these surfaces, which are traditionally called Pythagorean normal vector (PN) surfaces. Our construction is based on the isotropic model of the dual space to which the original...

We consider population dynamics on a network of patches, each of which has a the same local dynamics, with different population scales (carrying capacities). It is reasonable to assume that if the patches are coupled by very fast migration the whole system will look like an individual patch with a large effective carrying capacity. This is called a “well-mixed” system. We show that, in general,...

The analysis of natural images with independent component analysis (ICA) yields localized bandpass Gabor-type filters similar to receptive fields of simple cells in visual cortex. We applied ICA on a subset of patches called position-centered patches, selected for forming a translation-invariant representation of small patches. The resulting filters were qualitatively different in two respects....

An improved algorithm for the computation of the intersection curve of two general parametric surfaces is presented. The introduced subdivision algorithm follows a divide-and-conquer-approach. For each pair of patches, it rst checks if the corresponding bounding volumes intersect. If they intersect, then it tries to nd dispensable parts of one patch (and the corresponding parts in the parameter...

This paper presents a new method for embedding digital watermarks into Bézier polynomial patches. An object surface is supposed to be represented by multiple piecewise Bézier polynomial patches. A Bézier patch passes through its four-corner control points, which are called data points, and does not pass through the other control points. To embed a watermark, a Bézier patch is divided into two p...

Current Level of Detail (LoD) approaches for triangle meshes use variably triangulated mesh patches, in order to approximate the original mesh surface. The approximation is synthesized from some of these patches, which must cover the whole surface and must not intersect each other. The patches are chosen according to the necessary view dependent triangulation. This paper addresses the creation ...

Small sample size is one of the most challenging problems in face recognition due to the difficulty of sample collection in many real-world applications. By representing the query sample as a linear combination of training samples from all classes, the so-called collaborative representation based classification (CRC) shows very effective face recognition performance with low computational cost....

This paper describes two preliminary experiments concerned with the construction of a robot head. The initial design and research is aimed at producing a system with two cameras and two microphones on a system capable of operating with the same degrees of freedom and reflex times as its biological counterpart. Whilst the primary goal of the project is develop an anthropomorphic system with the ...