99,504 research outputs found
Single freeform surface imaging design with unconstrained object to image mapping
An imaging design approach which is free of third-order astigmatism for one freeform optical surface and the image is presented in this paper. A set of differential equations is derived from generalized ray tracing. The solution of the above derived equations provides the anastigmatic freeform optical surface, the image surface and the object to image mapping. The obtained design can be used as a good starting point for optimization. As an example, a reflective freeform surface is designed for a single reflective Head Mounted Display (HMD). This example has a 3 mm pupil, 15mm eye clearance, 24-degree diagonal full field of view, and the final design yields an average MTF of 62.6% across 17 field points
Progressive refinement rendering of implicit surfaces
The visualisation of implicit surfaces can be an inefficient task when such surfaces are complex and highly detailed. Visualising a surface by first converting it to a
polygon mesh may lead to an excessive polygon count. Visualising a surface by direct ray casting is often a slow procedure. In this paper we present a progressive refinement renderer for implicit surfaces that are Lipschitz continuous. The renderer first displays a low resolution estimate of what the final image is going to be and, as the computation progresses, increases the quality of this estimate at an interactive frame rate. This renderer provides a quick previewing facility that significantly reduces the design cycle of a new and complex implicit surface. The renderer is also capable of completing an image faster than a conventional implicit surface rendering algorithm based on ray casting
Fast reliable interrogation of procedurally defined implicit surfaces using extended revised affine arithmetic.
Techniques based on interval and previous termaffine arithmetic next term and their modifications are shown to provide previous term reliable next term function range evaluation for the purposes of previous termsurface interrogation.next term In this paper we present a technique for the previous termreliable interrogation of implicit surfacesnext term using a modification of previous termaffine arithmeticnext term called previous term revised affine arithmetic.next term We extend the range of functions presented in previous termrevised affine arithmeticnext term by introducing previous termaffinenext term operations for arbitrary functions such as set-theoretic operations with R-functions, blending and conditional operators. The obtained previous termaffinenext term forms of arbitrary functions provide previous termfasternext term and tighter function range evaluation. Several case studies for operations using previous termaffinenext term forms are presented. The proposed techniques for previous termsurface interrogationnext term are tested using ray-previous termsurfacenext term intersection for ray-tracing and spatial cell enumeration for polygonisation. These applications with our extensions provide previous termfast and reliablenext term rendering of a wide range of arbitrary previous termprocedurally defined implicit surfacesnext term (including polynomial previous termsurfaces,next term constructive solids, pseudo-random objects, previous termprocedurally definednext term microstructures, and others). We compare the function range evaluation technique based on previous termextended revised affine arithmeticnext term with other previous termreliablenext term techniques based on interval and previous termaffine arithmeticnext term to show that our technique provides the previous termfastestnext term and tightest function range evaluation for previous termfast and reliable interrogation of procedurally defined implicit surfaces.next term
Research Highlights
The main contributions of this paper are as follows. ► The widening of the scope of previous termreliablenext term ray-tracing and spatial enumeration algorithms for previous termsurfacesnext term ranging from algebraic previous termsurfaces (definednext term by polynomials) to general previous termimplicit surfaces (definednext term by function evaluation procedures involving both previous termaffinenext term and non-previous termaffinenext term operations based on previous termrevised affine arithmetic)next term. ► The introduction of a technique for representing procedural models using special previous termaffinenext term forms (illustrated by case studies of previous termaffinenext term forms for set-theoretic operations in the form of R-functions, blending operations and conditional operations). ► The detailed derivation of special previous termaffinenext term forms for arbitrary operators
Massively Parallel Ray Tracing Algorithm Using GPU
Ray tracing is a technique for generating an image by tracing the path of
light through pixels in an image plane and simulating the effects of
high-quality global illumination at a heavy computational cost. Because of the
high computation complexity, it can't reach the requirement of real-time
rendering. The emergence of many-core architectures, makes it possible to
reduce significantly the running time of ray tracing algorithm by employing the
powerful ability of floating point computation. In this paper, a new GPU
implementation and optimization of the ray tracing to accelerate the rendering
process is presented
Automatic normal orientation in point clouds of building interiors
Orienting surface normals correctly and consistently is a fundamental problem
in geometry processing. Applications such as visualization, feature detection,
and geometry reconstruction often rely on the availability of correctly
oriented normals. Many existing approaches for automatic orientation of normals
on meshes or point clouds make severe assumptions on the input data or the
topology of the underlying object which are not applicable to real-world
measurements of urban scenes. In contrast, our approach is specifically
tailored to the challenging case of unstructured indoor point cloud scans of
multi-story, multi-room buildings. We evaluate the correctness and speed of our
approach on multiple real-world point cloud datasets
AROMA: Automatic Generation of Radio Maps for Localization Systems
WLAN localization has become an active research field recently. Due to the
wide WLAN deployment, WLAN localization provides ubiquitous coverage and adds
to the value of the wireless network by providing the location of its users
without using any additional hardware. However, WLAN localization systems
usually require constructing a radio map, which is a major barrier of WLAN
localization systems' deployment. The radio map stores information about the
signal strength from different signal strength streams at selected locations in
the site of interest. Typical construction of a radio map involves measurements
and calibrations making it a tedious and time-consuming operation. In this
paper, we present the AROMA system that automatically constructs accurate
active and passive radio maps for both device-based and device-free WLAN
localization systems. AROMA has three main goals: high accuracy, low
computational requirements, and minimum user overhead. To achieve high
accuracy, AROMA uses 3D ray tracing enhanced with the uniform theory of
diffraction (UTD) to model the electric field behavior and the human shadowing
effect. AROMA also automates a number of routine tasks, such as importing
building models and automatic sampling of the area of interest, to reduce the
user's overhead. Finally, AROMA uses a number of optimization techniques to
reduce the computational requirements. We present our system architecture and
describe the details of its different components that allow AROMA to achieve
its goals. We evaluate AROMA in two different testbeds. Our experiments show
that the predicted signal strength differs from the measurements by a maximum
average absolute error of 3.18 dBm achieving a maximum localization error of
2.44m for both the device-based and device-free cases.Comment: 14 pages, 17 figure
Refraction-corrected ray-based inversion for three-dimensional ultrasound tomography of the breast
Ultrasound Tomography has seen a revival of interest in the past decade,
especially for breast imaging, due to improvements in both ultrasound and
computing hardware. In particular, three-dimensional ultrasound tomography, a
fully tomographic method in which the medium to be imaged is surrounded by
ultrasound transducers, has become feasible. In this paper, a comprehensive
derivation and study of a robust framework for large-scale bent-ray ultrasound
tomography in 3D for a hemispherical detector array is presented. Two
ray-tracing approaches are derived and compared. More significantly, the
problem of linking the rays between emitters and receivers, which is
challenging in 3D due to the high number of degrees of freedom for the
trajectory of rays, is analysed both as a minimisation and as a root-finding
problem. The ray-linking problem is parameterised for a convex detection
surface and three robust, accurate, and efficient ray-linking algorithms are
formulated and demonstrated. To stabilise these methods, novel
adaptive-smoothing approaches are proposed that control the conditioning of the
update matrices to ensure accurate linking. The nonlinear UST problem of
estimating the sound speed was recast as a series of linearised subproblems,
each solved using the above algorithms and within a steepest descent scheme.
The whole imaging algorithm was demonstrated to be robust and accurate on
realistic data simulated using a full-wave acoustic model and an anatomical
breast phantom, and incorporating the errors due to time-of-flight picking that
would be present with measured data. This method can used to provide a
low-artefact, quantitatively accurate, 3D sound speed maps. In addition to
being useful in their own right, such 3D sound speed maps can be used to
initialise full-wave inversion methods, or as an input to photoacoustic
tomography reconstructions
Fast Reliable Ray-tracing of Procedurally Defined Implicit Surfaces Using Revised Affine Arithmetic
Fast and reliable rendering of implicit surfaces is an important area in the field of implicit modelling. Direct rendering, namely ray-tracing, is shown to be a suitable technique for obtaining good-quality visualisations of implicit surfaces. We present a technique for reliable ray-tracing of arbitrary procedurally defined implicit surfaces by using a modification of Affine Arithmetic called Revised Affine Arithmetic. A wide range of procedurally defined implicit objects can be rendered using this technique including polynomial surfaces, constructive solids, pseudo-random objects, procedurally defined microstructures, and others. We compare our technique with other reliable techniques based on Interval and Affine Arithmetic to show that our technique provides the fastest, while still reliable, ray-surface intersections and ray-tracing. We also suggest possible modifications for the GPU implementation of this technique for real-time rendering of relatively simple implicit models and for near real-time for complex implicit models
Overcoming the Challenges Associated with Image-based Mapping of Small Bodies in Preparation for the OSIRIS-REx Mission to (101955) Bennu
The OSIRIS-REx Asteroid Sample Return Mission is the third mission in NASA's
New Frontiers Program and is the first U.S. mission to return samples from an
asteroid to Earth. The most important decision ahead of the OSIRIS-REx team is
the selection of a prime sample-site on the surface of asteroid (101955) Bennu.
Mission success hinges on identifying a site that is safe and has regolith that
can readily be ingested by the spacecraft's sampling mechanism. To inform this
mission-critical decision, the surface of Bennu is mapped using the OSIRIS-REx
Camera Suite and the images are used to develop several foundational data
products. Acquiring the necessary inputs to these data products requires
observational strategies that are defined specifically to overcome the
challenges associated with mapping a small irregular body. We present these
strategies in the context of assessing candidate sample-sites at Bennu
according to a framework of decisions regarding the relative safety,
sampleability, and scientific value across the asteroid's surface. To create
data products that aid these assessments, we describe the best practices
developed by the OSIRIS-REx team for image-based mapping of irregular small
bodies. We emphasize the importance of using 3D shape models and the ability to
work in body-fixed rectangular coordinates when dealing with planetary surfaces
that cannot be uniquely addressed by body-fixed latitude and longitude.Comment: 31 pages, 10 figures, 2 table
- …