We investigate the texture of fermion mass matrices in theories with partial unification (for example SU(2)L × SU(2)R × SU(4)c) at a scale ∼ 10 12 GeV. Starting with the low energy values of the masses and the mixing angles, we find only two viable textures with atmost four texture zeros. One of these corresponds to a somewhat modified Fritzsch textures. A theoretical derivataion of these textu...

Image quality assessment is a difficult problem in the field of image processing without any acceptable solution yet. Quality assessment of textures, which is the topic of this work, is even harder problem. This work presents an overview and a description of current state of the art methods as well as brief experiments on textures and a discussion about the usability of these methods on textures.

Sound textures, such as crackling fire or chirping crickets, represent a broad class of sounds defined by their homogeneous temporal structure. It has been suggested that the perception of texture is mediated by time-averaged summary statistics measured from early auditory representations. In this study, we investigated the perception of sound textures that contain rhythmic structure, specifica...

Solid textures or textures defined over 3d have provided computer graphics with a new set of tools. Using these tools we can obtain effects which were difficult, if not impossible, to obtain with 2d texture mapping methods. These textures are simple to implement using either scan line renderers or ray-tracers. Research in this area has focused on the generation and rendering of these textures w...

Rendering is one of the most important tasks in computer graphics and animation. It is widely recognized that texture maps are essential for adding to the visual content of the rendered image. Extraction of textures from a single photograph poses severe diiculties and is sometimes impossible, while artiicial texture synthesis does not address the full range of desired textures. In this paper we...

The local histogram transform of an image is a data cube that consists of the histograms of the pixel values that lie within a fixed neighborhood of any given pixel location. Such transforms are useful in image processing applications such as classification and segmentation, especially when dealing with textures that can be distinguished by the distributions of their pixel intensities and color...

We present a streaming compression algorithm for huge time-varying aerial imagery. New airborne optical sensors are capable of collecting billion-pixel images at multiple frames per second. These images must be transmitted through a low-bandwidth pipe requiring aggressive compression techniques. We achieve such compression by treating foreground portions of the imagery separately from backgroun...

Traditional texture mapping uses sampled images of limited resolution to represent patterns on surfaces. Sampling inherently assumes that the underlying pattern is band limited, which in plain language means that it must not contain any crisp edges. Unfortunately, most real world patterns violate that constraint, and the result is that texture mapped surfaces appear either artificially pixelate...

The real-time rendering of arbitrarily large textures is a problem that has long been studied in terrain visualization. For years, different approaches have been published that have either expensive hardware requirements or other severe limitations in quality, performance or versatility. The biggest problem is usually a strong coupling between geometry and texture, both regarding database struc...

The TEXRET-System, a texture retrieval system based on soft-computing technologies is being developed. One of the main system features is synthesis of the requested textures when these are not found in the database, which allows a growing of the database. Missing textures are synthesized interactively using Markov Random Fields and interactive genetic algorithms. This article is centered on the...