Wavelet-Texture Method: Appearance Compression by Polarization, Parametric Reflection Model, and Daubechies Wavelet

In order to create a photorealistic Virtual Reality model, we have to record the appearance of the object from different directions under different illuminations. In this paper, we propose a method that renders photorealistic images from a small amount of data. First, we separate the images of the object into a diffuse reflection component and a specular reflection component by using linear polarizers. Then, we estimate the parameters of the reflection model for each component. Finally, we compress the difference between the input images and the rendered images by using wavelet transform. At the rendering stage, we first calculate the diffuse and specular reflection images from the reflection parameters, then add the difference decompressed by inverse wavelet transform into the calculated reflection images, and finally obtain the photorealistic image of the object.     

Mixture of spherical distributions for single-view relighting

We present a method for simultaneously estimating the illumination of a scene and the reflectance property of an object from single view images - a single image or a small number of images taken from the same viewpoint. We assume that the illumination consists of multiple point light sources and the shape of the object is known. First, we represent the illumination on the surface of a unit sphere as a finite mixture of von Mises-Fisher distributions based on a novel spherical specular reflection model that well approximates the Torrance-Sparrow reflection model. Next, we estimate the parameters of this mixture model including the number of its component distributions and the standard deviation of them, which correspond to the number of light sources and the surface roughness, respectively. Finally, using these results as the initial estimates, we iteratively refine the estimates based on the original Torrance-Sparrow reflection model. The final estimates can be used to relight single-view images such as altering the intensities and directions of the individual light sources. The proposed method provides a unified framework based on directional statistics for simultaneously estimating the intensities and directions of an unknown number of light sources as well as the specular reflection parameter of the object in the scene.     

Planning multiple observations for object recognition

Most computer vision systems perform object recognition on the basis of the features extracted from a single image of the object. The problem with this approach is that it implicitly assumes that the available features are sufficient to determine the identity and pose of the object uniquely. If this assumption is not met, then the feature set is insufficient, and ambiguity results. Consequently, much research in computer vision has gone toward finding sets of features that are sufficient for specific tasks, with the result that each system has its own associated set of features. A single, general feature set would be desirable. However, research in automatic generation of object recognition programs has demonstrated that predetermined, fixed feature sets are often incapable of providing enough information to unambiguously determine either object identity or pose. One approach to overcoming the inadequacy of any feature set is to utilize multiple sensor observations obtained from different viewpoints, and combine them with knowledge of the 3-D structure of the object to perform unambiguous object recognition. This article presents initial results toward performing object recognition by using multiple observations to resolve ambiguities. Starting from the premise that sensor motions should be planned in advance, the difficulties involved in planning with ambiguous information are discussed. A representation for planning that combines geometric information with viewpoint uncertainty is presented. A sensor planner utilizing the representation was implemented, and the results of pose-determination experiments performed with the planner are discussed.     

A method of compressing trie structures

A trie structure can immediately determine whether a desired key is in a given key set or not, and can find its longest match easily. Thanks to these attractive properties, a trie structure is frequently used for various fields, such as natural language dictionaries, database systems and compilers. However, the total number of states of a trie becomes large, so space requirements are not good for a huge key set. To resolve this disadvantage a new structure which reduces the total number of states in a traditional trie, called a double-trie, is introduced in this paper. Insertion and deletion operations, as well as key retrieval for this double-trie, are presented. The efficiency of this method is shown by the results of simulations for various key sets.     

An efficient implementation of trie structures

A new internal array structure, called a double-array, implementing a trie structure is presented. The double-array combines the fast access of a matrix form with the compactness of a list form. The algorithms for retrieval, insertion and deletion are introduced through examples. Although insertion is rather slow, it is still practical, and both the deletion and the retrieval time can be improved from the list form. From the comparison with the list for various large sets of keys, it is shown that the size of the double-array can be about 17 per cent smaller than that of the list, and that the retrieval speed of the double-array can be from 3–1 to 5–1 times faster than that of the list.     

Defect structures in cosputtered thin films of transition-metal disilicides with C11<Subscript><Emphasis Type="Italic">b</Emphasis></Subscript>, C40 and C54 structures

Defect structures in crystallites of the stable phases in thin films of transition-metal (TM) disilicides (C11 _b MoSi₂, C40 TaSi₂, and C54 TiSi₂) produced by cosputtering and subsequent annealing have been investigated by transmission electron microscopy (TEM). Crystallites in thin films of MoSi₂, TaSi₂, and TiSi₂ all contain planar faults parallel to hexagonally arranged TMSi₂ planes, which are a characteristic feature commonly observed in all three crystal structures. These planar faults are twin boundaries in all cases. Twins in thin films of these disilicides, thus, have a common characteristic that the twin habit plane is parallel to hexagonally arranged TMSi₂ stoichiometric planes. For twins in thin films of C11 _b MoSi₂, and C54 TiSi₂, the twining elements can be deduced and the twin habit plane is found not to be parallel to the twinning (K ₁) plane, but to be perpendicular to it. Twins formed in C40 TaSi₂ thin films are different from those formed in C11 _b MoSi₂ and C54 TiSi₂ thin films, in that the crystal orientation of the twin is exactly the same as that of the matrix, since they are racemic twins that are only enantiomorphically (space groups of P6₂22 or P6₄22) related to each other. This article is based on a presentation in the symposium “Terence E. Mitchell Symposium on the Magic of Materials: Structures and Properties” from the TMS Annual Meeting in San Diego, CA in March 2003.     

System design of “Ba”-like stages for improvisational acts via Leibnizian space–time and Peirce’s existential graph concepts

A framework for “improvisational” social acts and communication is introduced by referring to the idea of “relationalism” such as natural farming, permaculture and deep ecology. Based on this conception, the notion of Existential Graph by C. S. Peirce is introduced. The notion of extended self in deep ecology is substantiated based on the Roy Adaptation Model in Nursing Theory and Narrative approaches. By focusing on Leibnizian notions of space and time and by introducing Petri net, a spatio-temporal model of improvisation is constructed. This model is expected to substantiate the interesting notion of “Ba” proposed by H. Shimizu reflecting Japanese culture.     

Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors

By reducing an array matching problem to a string matching problem in a natural way, it is shown that efficient string matching algorithms may be applied to arrays. In this paper, based on the ideas due to Baker, an application of the two-dimensional on-line tessellation acceptor (2-dota) is presented for very rapid on-line detection of occurrences of a fixed set of keyarrays as embedded subarrays in a text array. The main part of the algorithm described in this paper consists of constructing two finite state pattern (string) matching machines from the keyarrays. By combining these two finite state pattern matching machines, we construct the 2-dota which, given an m × n text array, solves the two-dimensional pattern matching problem in m + n?1 steps.