A photo-realistic representation of material appearance can be achieved by means of bidirectional texture function (BTF) capturing a material's appearance for varying illumination, viewing directions, and spatial pixel coordinates.... more
A photo-realistic representation of material appearance can be achieved by means of bidirectional texture function (BTF) capturing a material's appearance for varying illumination, viewing directions, and spatial pixel coordinates. BTF captures many non-local effects in material structure such as inter-reflections, occlusions, shadowing, or scattering. The acquisition of BTF data is usually time and resource-intensive due to the high dimensionality of BTF data. This results in expensive, complex measurement setups and/or excessively long measurement times. We propose an approximate BTF acquisition setup based on a simple, affordable mechanical gantry containing a consumer camera and two LED lights. It captures a very limited subset of material surface images by shooting several video sequences. A psychophysical study comparing captured and reconstructed data with the reference BTFs of seven tested materials revealed that results of our method show a promising visual quality. Spe...
A photo-realistic representation of material appearance can be achieved by means of bidirectional texture function (BTF) capturing a material’s appearance for varying illumination, viewing directions, and spatial pixel coordinates. BTF... more
A photo-realistic representation of material appearance can be achieved by means of bidirectional texture function (BTF) capturing a material’s appearance for varying illumination, viewing directions, and spatial pixel coordinates. BTF captures many non-local effects in material structure such as inter-reflections, occlusions, shadowing, or scattering. The acquisition of BTF data is usually time and resource-intensive due to the high dimensionality of BTF data. This results in expensive, complex measurement setups and/or excessively long measurement times. We propose an approximate BTF acquisition setup based on a simple, affordable mechanical gantry containing a consumer camera and two LED lights. It captures a very limited subset of material surface images by shooting several video sequences. A psychophysical study comparing captured and reconstructed data with the reference BTFs of seven tested materials revealed that results of our method show a promising visual quality. As it a...
The analysis of Rule 90 CA by Martin, Odlyzko and Wolfram using diploynomials over finite fields is extended to Rule 60 CA with odd cylinder size. Two classes of such CA are recognized. Their maximum attractor lengths and transients... more
The analysis of Rule 90 CA by Martin, Odlyzko and Wolfram using diploynomials over finite fields is extended to Rule 60 CA with odd cylinder size. Two classes of such CA are recognized. Their maximum attractor lengths and transients characteristics are given. The basic building block, from which the entire state space can be produced, is identified for each type. An application of the results for diagnostic purpose is outlined.
Most of presently used academic logic synthesis tools, including SIS and ABC, are fully deterministic. Up to the knowledge of the authors, this holds for all available commercial tools as well. This means that no random decisions are... more
Most of presently used academic logic synthesis tools, including SIS and ABC, are fully deterministic. Up to the knowledge of the authors, this holds for all available commercial tools as well. This means that no random decisions are made; the algorithms fully rely on deterministic heuristics. In this paper we present several hints of insufficiency of such an approach and show examples of perspective randomized logic synthesis algorithms. Judging from our experiments, these algorithms have a higher potential of performing better than the deterministic ones. Further we study how much randomness is actually needed for the algorithms to perform well. We show that some algorithms require only a small amount of randomness, while still taking full advantage of their randomized nature. On the other hand, some algorithms require a very high level of randomness to perform well. We propose reasons for this behavior and show a way of computing the necessary measure of randomness required. Keyw...
The paper compares FPGA implementation of scaled polynomial basis and normal basis arithmetic units in the context of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF (2m). The hardware uses... more
The paper compares FPGA implementation of scaled polynomial basis and normal basis arithmetic units in the context of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF (2m). The hardware uses GCD division in polynomial ...