We present a new method for rendering novel images of flexible 3D objects from a small number of example images in correspondence. The strength of the method is the ability to synthesize images whose viewing position is significantly far away from the viewing cone of the example images ("view extrapolation"), yet without ever modeling the 3D structure of the scene. The method relies on synthesizing a chain of "trilinear tensors" that governs the warping function from the example images to the novel image, together with a multi-dimensional interpolation function that synthesizes the non-rigid motions of the viewed object from the virtual camera position. We show that two closely spaced example images alone are sufficient in practice to synthesize a significant viewing cone, thus demonstrating the ability of representing an object by a relatively small number of model images --- for the purpose of cheap and fast viewers that can run on standard hardware.

This paper presents an image-based rendering system using algebraic relations between different views of an object. The system uses pictures of an object taken from known positions. Given three such images it can generate "virtual'' ones as the object would look from any position near the ones that the two input images were taken from. The extrapolation from the example images can be up to about 60 degrees of rotation. The system is based on the trilinear constraints that bind any three view so fan object. As a side result, we propose two new methods for camera calibration. We developed and used one of them. We implemented the system and tested it on real images of objects and faces. We also show experimentally that even when only two images taken from unknown positions are given, the system can be used to render the object from other view points as long as we have a good estimate of the internal parameters of the camera used and we are able to find good correspondence between the example images. In addition, we present the relation between these algebraic constraints and a factorization method for shape and motion estimation. As a result we propose a method for motion estimation in the special case of orthographic projection.

No description available.

No description available.

[pt] O Marching Cubes 33 proposto por Chernyaev é um dos primeiros algoritmos de extração de isosuperfície destinados a preservar a topologia do interpolante trilinear. Neste trabalho, abordamos três problemas no algoritmo do Marching Cubes 33, dois dos quais estão relacionados com a sua descrição original. Em particular, resolvemos um problema no procedimento para resolver ambiguidades interiores do Marching Cubes 33, que impede que a isosuperfície seja extraída corretamente para o caso ambíguo 13.5. O algoritmo Marching Cubes é considerado simples, robusto e com baixo custo computacional, características que contribuíram para torná-lo popular entre os algoritmo de extração de isosuperfícies. Porém no que se refere a qualidade da triangulação da malha resultante, não raramente observamos um grande número de triângulos finos (triângulos com ângulos pequenos) e até mesmo degenerados (triângulos com área zero). Buscando unir à coerência topológica uma melhor qualidade na triangulação gerada, propomos uma extensão da tabela de triangulação proposta por Chernyaev, de modo que os vértices da grade passem a fazer parte da triangulação, eliminando assim a possibilidade de geração de triângulos degenerados. Esta nova tabela é utilizada para evitar a criação de triângulos finos, através de pequenas alterações do campo escalar nos vértices da grade. / [en] Chernyaev s Marching Cubes 33 is one of the first isosurface extraction algorithms intended to preserve the topology of the trilinear interpolant. In this work, we address three issues in the Marching Cubes 33 algorithm, two of which are related to its original description. In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prevents the extraction of topologically correct isosurfaces for the ambiguous configuration 13.5 thus fixing the original formulation of the algorithm. The Marching Cubes algorithm is considered simple, robust and with low computational cost, characteristics that contributed to make it the most popular algorithm for isosurfaces extraction. However, regarding the quality of the resulting mesh, frequently it is possible to observe a large number of badly-shaped triangles (triangles with small angles) and even degenerate (triangles with zero area) ones. Seeking to unite a better triangulation quality of the resulting mesh to the topological consistency, we propose an extension of the triangulation table proposed by Chernyaev, so that the vertices of the grid become part of the triangulation generated, thus eliminating the possibility of generation of degenerate triangles. This new table is used to avoid the creation of badly-shaped triangles via small changes of the scalar field on the vertices of the grid.

The thesis is structured into 5 chapters as follows: <strong>Chapter 1</strong> is an introduction to the tools and methods we use most frequently. <strong>Chapter 2</strong> Pairs of k-free Numbers, consecutive square-full Numbers. In this chapter, we refine the approximate determinant method by Heath-Brown. We present applications to asymptotic formulas for consecutive k-free integers, and more generally for k-free integers represented by r-tuples of linear forms. We also show how the method can be used to derive an upper bound for the number of consecutive square-full integers. Finally, we apply the method to make a statement about the size of the fundamental solution of Pell equations. <strong>Chapter 3</strong> Power-Free Values of Polynomials. A conjecture by Erdös states that for any irreducible polynomial f of degree d&ge;3 with no fixed (d-1)-th power prime divisor, there are infinfinitely many primes p such that f(p) is (d-1)-free. We prove this conjecture and derive the corresponding asymptotic formulas. <strong>Chapter 4</strong> Integer Points on Bilinear and Trilinear Equations. In the fourth chapter, we derive upper bounds for the number of integer solutions on bilinear or trilinear forms. <strong>Chapter 5</strong> In the fifth chapter, we present a method to count the monomials that occur in the projective determinant method when the method is applied to cubic varieties.

Doctor of Philosophy / Department of Physics / Yurii Maravin / In this dissertation, you will find a study of di-boson production in pp collision with the Compact Muon Solenoid (CMS) detector at Large Hadron Collider (LHC). A study of Z+gamma process is performed on the data collected by the CMS during 2011 and corresponding to integrated luminosity L= 5 fb[superscript]-1. The study consists of two parts: cross section measurement and setting the limits on anomalous trilinear gauge couplings (aTGC) between a Z boson and a photon. The measured cross-section of Z+gamma agrees within the uncertainties with the standard model predicted cross section at next to leading order. Having found no excess in cross section measurement, we set the 95% con fidence level (C.L.) limit on aTGC. Another study discussed is a study of a low-scale walking Technicolor model with rho[subscript]T and a[subscript]T production in the fully leptonic fi nal state at 95% C.L. in proton-proton collisions at center of mass energy 10 TeV scenario using Monte Carlo simulation. We conclude that such processes can be excluded with 366 pb[superscript]-1 of data for rho[superscript]T masses up to 400 GeV and the observation would require 2.8 fb[superscript]-1 of data with 5 sigma precision.

Ultrafast spectroscopy allows us to probe and understand material properties. With it, we can measure phonon-polaritons (optical phonons coupled with light) and the resulting dispersion curve in lithium niobate. Customizing the excitation source in ultrafast measurements can excite phonon modes to large amplitudes, allowing the experimental exploration of the Potential Energy Surface in solids. However, stronger pump fluences and bigger signal isn't always the answer in ultrafast spectroscopy. When sample signals and their nonlinear and mechanisms cannot be distinguished with 1D measurements, simple 2D THz measurements are a great place to start searching for distinct factors as was the case in cadmium tungstate. 2D measurements when paired with modeling and first principles calculations can reveal cutting edge information about exciting materials.

京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第20151号 / 理博第4236号 / 新制||理||1609(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)准教授 伊藤 哲史, 教授 池田 保, 教授 雪江 明彦 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM

No description available.