1 |
Refined error estimates for matrix-valued radial basis functions /Fuselier, Edward J., January 2006 (has links)
Thesis (Ph. D.)--Texas A&M University, 2006. / "May 2006." "Major subject: Mathematics." Vita. Includes bibliographical references (p. 67-70). Also available online.
|
2 |
L^p Bernstein Inequalities and Radial Basis Function ApproximationWard, John P. 2010 August 1900 (has links)
In approximation theory, three classical types of results are direct theorems,
Bernstein inequalities, and inverse theorems. In this paper, we include results about
radial basis function (RBF) approximation from all three classes. Bernstein inequalities
are a recent development in the theory of RBF approximation, and on Rd, only
L2 results are known for RBFs with algebraically decaying Fourier transforms (e.g.
the Sobolev splines and thin-plate splines). We will therefore extend what is known
by establishing Lp Bernstein inequalities for RBF networks on Rd. These inequalities
involve bounding a Bessel-potential norm of an RBF network by its corresponding Lp
norm in terms of the separation radius associated with the network. While Bernstein
inequalities have a variety of applications in approximation theory, they are most commonly
used to prove inverse theorems. Therefore, using the Lp Bernstein inequalities
for RBF approximants, we will establish the corresponding inverse theorems. The
direct theorems of this paper relate to approximation in Lp(Rd) by RBFs which are
perturbations of Green's functions. Results of this type are known for certain compact
domains, and results have recently been derived for approximation in Lp(Rd)
by RBFs that are Green's functions. Therefore, we will prove that known results for
approximation in Lp(Rd) hold for a larger class of RBFs. We will then show how this
result can be used to derive rates for approximation by Wendland functions.
|
3 |
Construction of Compact 3D Objects by Radial Basis Functions and Progressive CompressionHuang, Wei-Chiuan 02 February 2006 (has links)
Abstract
The representation of 3D Computer Graphics has been studied for a long time. Most 3D object models are obtained by 3D scan systems. These kinds of data are not only very huge, but also have a lot of redundancy. It consumes a large mount of time and resources. For this reason, how to represent the object efficiently is always an important issue. The purpose of this study is to present the objects by implicit functions. Different with the presentation of polygon mesh, implicit function is very compact to present objects because that the mathematical form of object can be obtained in different data forms. The implicit function used is Radial Basis Function, and then the BSP tree is used to partition the object to reduce the amount of computing. We also use the compression of progressive mesh to decrease the storage and the computing time. In addition, the object can be rendered according to the sampling points on each implicit surface.
|
4 |
Refined error estimates for matrix-valued radial basis functionsFuselier, Edward J., Jr. 17 September 2007 (has links)
Radial basis functions (RBFs) are probably best known for their applications to
scattered data problems. Until the 1990s, RBF theory only involved functions that
were scalar-valued. Matrix-valued RBFs were subsequently introduced by Narcowich
and Ward in 1994, when they constructed divergence-free vector-valued functions
that interpolate data at scattered points. In 2002, Lowitzsch gave the first error
estimates for divergence-free interpolants. However, these estimates are only valid
when the target function resides in the native space of the RBF. In this paper we develop
Sobolev-type error estimates for cases where the target function is less smooth
than functions in the native space. In the process of doing this, we give an alternate
characterization of the native space, derive improved stability estimates for the interpolation
matrix, and give divergence-free interpolation and approximation results
for band-limited functions. Furthermore, we introduce a new class of matrix-valued
RBFs that can be used to produce curl-free interpolants.
|
5 |
Linear Approximations For Factored Markov Decision ProcessesPatrascu, Relu-Eugen January 2004 (has links)
A Markov Decision Process (MDP) is a model employed to describe problems in which a decision must be made at each one of several stages, while receiving feedback from the environment. This type of model has been extensively studied in the operations research community and fundamental algorithms have been developed to solve associated problems. However, these algorithms are quite inefficient for very large problems, leading to a need for alternatives; since MDP problems are provably hard on compressed representations, one becomes content even with algorithms which may perform well at least on specific classes of problems. The class of problems we deal with in this thesis allows succinct representations for the MDP as a dynamic Bayes network, and for its solution as a weighted combination of basis functions. We develop novel algorithms for producing, improving, and calculating the error of approximate solutions for MDPs using a compressed representation. Specifically, we develop an efficient branch-and-bound algorithm for computing the Bellman error of the compact approximate solution regardless of its provenance. We introduce an efficient direct linear programming algorithm which, using incremental constraints generation, achieves run times significantly smaller than existing approximate algorithms without much loss of accuracy. We also show a novel direct linear programming algorithm which, instead of employing constraints generation, transforms the exponentially many constraints into a compact form more amenable for tractable solutions. In spite of its perceived importance, the efficient optimization of the Bellman error towards an approximate MDP solution has eluded current algorithms; to this end we propose a novel branch-and-bound approximate policy iteration algorithm which makes direct use of our branch-and-bound method for computing the Bellman error. We further investigate another procedure for obtaining an approximate solution based on the dual of the direct, approximate linear programming formulation for solving MDPs. To address both the loss of accuracy resulting from the direct, approximate linear program solution and the question of where basis functions come from we also develop a principled system able not only to produce the initial set of basis functions, but also able to augment it with new basis functions automatically generated such that the approximation error decreases according to the user's requirements and time limitations.
|
6 |
Interactive Planning and Sensing for Aircraft in Uncertain Environments with Spatiotemporally Evolving ThreatsCooper, Benjamin S 30 November 2018 (has links)
Autonomous aerial, terrestrial, and marine vehicles provide a platform for several applications including cargo transport, information gathering, surveillance, reconnaissance, and search-and-rescue. To enable such applications, two main technical problems are commonly addressed.On the one hand, the motion-planning problem addresses optimal motion to a destination: an application example is the delivery of a package in the shortest time with least fuel. Solutions to this problem often assume that all relevant information about the environment is available, possibly with some uncertainty. On the other hand, the information gathering problem addresses the maximization of some metric of information about the environment: application examples include such as surveillance and environmental monitoring.
Solutions to the motion-planning problem in vehicular autonomy assume that information about the environment is available from three sources: (1) the vehicle’s own onboard sensors, (2) stationary sensor installations (e.g. ground radar stations), and (3) other information gathering vehicles, i.e., mobile sensors, especially with the recent emphasis on collaborative teams of autonomous vehicles with heterogeneous capabilities. Each source typically processes the raw sensor data via estimation algorithms. These estimates are then available to a decision making system such as a motion- planning algorithm. The motion-planner may use some or all of the estimates provided. There is an underlying assumption of “separation� between the motion-planning algorithm and the information about environment. This separation is common in linear feedback control systems, where estimation algorithms are designed independent of control laws, and control laws are designed with the assumption that the estimated state is the true state.
In the case of motion-planning, there is no reason to believe that such a separation between the motion-planning algorithm and the sources of estimated environment information will lead to optimal motion plans, even if the motion planner and the estimators are themselves optimal. The goal of this dissertation is to investigate whether the removal of this separation, via interactive motion-planning and sensing, can significantly improve the optimality of motion- planning.
The major contribution of this work is interactive planning and sensing. We consider the problem of planning the path of a vehicle, which we refer to as the actor, to traverse a threat field with minimum threat exposure. The threat field is an unknown, time- variant, and strictly positive scalar field defined on a compact 2D spatial domain – the actor’s workspace. The threat field is estimated by a network of mobile sensors that can measure the threat field pointwise. All measurements are noisy. The objective is to determine a path for the actor to reach a desired goal with minimum risk, which is a measure sensitive not only to the threat exposure itself, but also to the uncertainty therein. A novelty of this problem setup is that the actor can communicate with the sensor network and request that the sensors position themselves in a procedure we call sensor reconfiguration such that the actor’s risk is minimized.
This work continues with a foundation in motion planning in time-varying fields where waiting is a control input. Waiting is examined in the context of finding an optimal path with considerations for the cost of exposure to a threat field, the cost of movement, and the cost of waiting. For example, an application where waiting may be beneficial in motion-planning is the delivery of a package where adverse weather may pose a risk to the safety of a UAV and its cargo. In such scenarios, an optimal plan may include “waiting until the storm passes.� Results on computational efficiency and optimality of considering waiting in path- planning algorithms are presented. In addition, the relationship of waiting in a time- varying field represented with varying levels of resolution, or multiresolution is studied.
Interactive planning and sensing is further developed for the case of time-varying environments. This proposed extension allows for the evaluation of different mission windows, finite sensor network reconfiguration durations, finite planning durations, and varying number of available sensors. Finally, the proposed method considers the effect of waiting in the path planner under the interactive planning and sensing for time-varying fields framework. Future work considers various extensions of the proposed interactive planning and sensing framework including: generalizing the environment using Gaussian processes, sensor reconfiguration costs, multiresolution implementations, nonlinear parameters, decentralized sensor networks and an application to aerial payload delivery by parafoil.
|
7 |
A Method for Computing Spectral ReflectanceYuille, A. 01 December 1984 (has links)
Psychophysical experiments show that the perceived colour of an object is relatively independent of the spectrum of the incident illumination and depends only on the surface reflectance. We demonstrate a possible solution to this undetermined problem by expanding the illumination and surface reflectance in terms of a finite number of basis functions. This yields a number of nonlinear equations for each colour patch. We show that given a sufficient number of surface patches with the same illumination it is possible to solve these equations up to an overall scaling factor. Generalizations to the spatial dependent situation are discussed. We define a method for detecting material changes and illustrate a way of detecting the colour of a material at its boundaries and propagating it inwards.
|
8 |
Linear Approximations For Factored Markov Decision ProcessesPatrascu, Relu-Eugen January 2004 (has links)
A Markov Decision Process (MDP) is a model employed to describe problems in which a decision must be made at each one of several stages, while receiving feedback from the environment. This type of model has been extensively studied in the operations research community and fundamental algorithms have been developed to solve associated problems. However, these algorithms are quite inefficient for very large problems, leading to a need for alternatives; since MDP problems are provably hard on compressed representations, one becomes content even with algorithms which may perform well at least on specific classes of problems. The class of problems we deal with in this thesis allows succinct representations for the MDP as a dynamic Bayes network, and for its solution as a weighted combination of basis functions. We develop novel algorithms for producing, improving, and calculating the error of approximate solutions for MDPs using a compressed representation. Specifically, we develop an efficient branch-and-bound algorithm for computing the Bellman error of the compact approximate solution regardless of its provenance. We introduce an efficient direct linear programming algorithm which, using incremental constraints generation, achieves run times significantly smaller than existing approximate algorithms without much loss of accuracy. We also show a novel direct linear programming algorithm which, instead of employing constraints generation, transforms the exponentially many constraints into a compact form more amenable for tractable solutions. In spite of its perceived importance, the efficient optimization of the Bellman error towards an approximate MDP solution has eluded current algorithms; to this end we propose a novel branch-and-bound approximate policy iteration algorithm which makes direct use of our branch-and-bound method for computing the Bellman error. We further investigate another procedure for obtaining an approximate solution based on the dual of the direct, approximate linear programming formulation for solving MDPs. To address both the loss of accuracy resulting from the direct, approximate linear program solution and the question of where basis functions come from we also develop a principled system able not only to produce the initial set of basis functions, but also able to augment it with new basis functions automatically generated such that the approximation error decreases according to the user's requirements and time limitations.
|
9 |
Radial parts of invariant differential operators on Grassmann manifolds /Kurgalina, Olga S. January 2004 (has links)
Thesis (Ph.D.)--Tufts University, 2004. / Adviser: Fulton B. Gonzalez. Submitted to the Dept. of Mathematics. Includes bibliographical references (leaves 72-73). Access restricted to members of the Tufts University community. Also available via the World Wide Web;
|
10 |
CONSTRAINED DIVERGENCE-CONFORMING BASIS FUNCTIONS FOR METHOD OF MOMENTS DISCRETIZATIONS IN ELECTROMAGNETICSPfeiffer, Robert 01 January 2015 (has links)
Higher-order basis functions are widely used to model currents and fields in numerical simulations of electromagnetics problems because of the greater accuracy and computational efficiency they can provide. Different problem formulations, such as method of moments (MoM) and the finite element method (FEM) require different constraints on basis functions for optimal performance, such as normal or tangential continuity between cells. In this thesis, a method of automatically generating bases that satisfy the desired basis constraints is applied to a MoM formulation for scattering problems using surface integral equations. Numerical results demonstrate the accuracy of this approach, and show good system matrix conditioning when compared to other higher-order bases.
|
Page generated in 0.0984 seconds