Relevant bibliographies by topics / Forward projection

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Forward projection'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Forward projection.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Forward projection"

1

Ni, Chengcai, and Chunmei Liu. "Evaluating behaviors of factors affecting the site index estimate on the basis of a single stand using simulation approach." Canadian Journal of Forest Research 38, no. 11 (November 2008): 2762–70. http://dx.doi.org/10.1139/x08-095.

Full text
Abstract:
Height observations H1and H2present on the right- and left-hand sides of site index models, respectively. The error terms associated with H1and H2, along with parameter estimate errors, affect the estimate of the site index. Projection error variance (PEV), in a projection from A1to A2, consisted of four components associated with H1, H2, the covariance of H1and H2, and the parameter estimate errors. In this study, behaviors of these components were investigated via simulations on the basis of six equations derived from the Lundqvist–Kerf and the Hossfeld IV functions. Simulation results showed that projection interval, projection direction, and selected site-dependent parameter influenced PEV and its components. PEVs of backward and forward projections with the same projection interval lengths were remarkably different if the underlying model was anamorphic. With increasing projection interval length, the PEV of forward projections monotonically increased to a certain value, whereas the PEV of backward projections decreased to zero after reaching a maximum.
APA, Harvard, Vancouver, ISO, and other styles
2

Jin, Li Xin, Lian Jun Wang, and Song Lin Yang. "Comparision between UTM and GRAUSS KRUEGER Projection in NIGERIA Rail Project." Applied Mechanics and Materials 90-93 (September 2011): 2431–37. http://dx.doi.org/10.4028/www.scientific.net/amm.90-93.2431.

Full text
Abstract:
The national coordinates system used in Nigeria is the Universal Transverse Mercator projection, while China adopts the Gauss Krugger Transverse Mercator projection (GKTM). This paper studied the difference between UTM and Gauss(TM) projections and the regulation of projection deformation, and put forward the model of the coordinates system for the Nigeria railway, which shall be of great benefit in the survey, design, construction and referencing of the Nigeria railway project.
APA, Harvard, Vancouver, ISO, and other styles
3

A.G. Piloto, Paulo, and Vitor M. E. Teixeira. "Pedestrian forward projection after vehicle collision." Journal of Mechanical Engineering and Biomechanics 2, no. 5 (March 26, 2018): 75–81. http://dx.doi.org/10.24243/jmeb/2.5.161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Clement, G. T., and K. Hynynen. "Forward planar projection through layered media." IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control 50, no. 12 (December 2003): 1689–98. http://dx.doi.org/10.1109/tuffc.2003.1256310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Boţ, Radu Ioan, Panayotis Mertikopoulos, Mathias Staudigl, and Phan Tu Vuong. "Minibatch Forward-Backward-Forward Methods for Solving Stochastic Variational Inequalities." Stochastic Systems 11, no. 2 (June 2021): 112–39. http://dx.doi.org/10.1287/stsy.2019.0064.

Full text
Abstract:
We develop a new stochastic algorithm for solving pseudomonotone stochastic variational inequalities. Our method builds on Tseng’s forward-backward-forward algorithm, which is known in the deterministic literature to be a valuable alternative to Korpelevich’s extragradient method when solving variational inequalities over a convex and closed set governed by pseudomonotone Lipschitz continuous operators. The main computational advantage of Tseng’s algorithm is that it relies only on a single projection step and two independent queries of a stochastic oracle. Our algorithm incorporates a minibatch sampling mechanism and leads to almost sure convergence to an optimal solution. To the best of our knowledge, this is the first stochastic look-ahead algorithm achieving this by using only a single projection at each iteration.
APA, Harvard, Vancouver, ISO, and other styles
6

van Aarle, Wim, Wolfgang Ludwig, Andrew King, and Dayakar Penumadu. "An accurate projection model for diffraction image formation and inversion using a polychromatic cone beam." Journal of Applied Crystallography 48, no. 2 (February 14, 2015): 334–43. http://dx.doi.org/10.1107/s1600576715000928.

Full text
Abstract:
Recently, the concept of X-ray diffraction contrast tomography (DCT) has been extended to the case of more widely available laboratory source CT systems. Using well known concepts from geometrical ray optics, an exact formulation is derived for the forward and backward projection geometry encountered under polychromatic cone beam illumination, and it is shown how this projection model can be efficiently implemented in practice. The new projection model is subsequently used for iterative tomographic reconstruction of the three-dimensional shape of a grain from a set of experimentally observed cone beam projections and shows a clear improvement compared to the simplified projection model used previously.
APA, Harvard, Vancouver, ISO, and other styles
7

Mukhin, K. Yu. "Forward to Jackson!" Epilepsy and paroxysmal conditions 13, no. 1S (July 13, 2021): 61–64. http://dx.doi.org/10.17749/2077-8333/epi.par.con.2021.080.

Full text
Abstract:
The report shows that V.A. Karlov proved at the current level of knowledge the correctness of the ideas of the great English neurologist John Hughlings Jackson, author of works on localization of the projection motor centers of the cerebral cortex, on aphasia, and others.
APA, Harvard, Vancouver, ISO, and other styles
8

Ackermann, K. H., F. Bieser, F. P. Brady, D. Cebra, J. E. Draper, V. Eckardt, T. Eggert, et al. "The forward time projection chamber in STAR." Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 499, no. 2-3 (March 2003): 713–19. http://dx.doi.org/10.1016/s0168-9002(02)01968-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Giselsson, Pontus. "Nonlinear Forward-Backward Splitting with Projection Correction." SIAM Journal on Optimization 31, no. 3 (January 2021): 2199–226. http://dx.doi.org/10.1137/20m1345062.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Maunder, Mark N., Shelton J. Harley, and John Hampton. "Including parameter uncertainty in forward projections of computationally intensive statistical population dynamic models." ICES Journal of Marine Science 63, no. 6 (January 1, 2006): 969–79. http://dx.doi.org/10.1016/j.icesjms.2006.03.016.

Full text
Abstract:
Abstract The increased computational demands of modern statistical stock assessment models have made the standard methods to provide uncertainty estimates for forward projections impractical for timely results in many applications. However, forward projections and their associated estimates of uncertainty are an important and popular piece of management advice. We describe a less computationally intense method to estimate uncertainty in forward projections that includes both parameter uncertainty and future demographic stochastic uncertainty. This frequentist method uses penalized likelihood as an approximation to mixed effects and can be viewed as treating the future projection period as part of the estimation model rather than performing stochastic projections. This allows confidence intervals to be calculated using normal approximation based on the delta method. The method is tested using simulation analysis and compared with Bayesian analysis and with projections based on point estimates of the parameters. The method is applied to yellowfin tuna in the eastern Pacific Ocean.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Forward projection"

1

Pokhrel, Damodar. "Brachytherapy Seed and Applicator Localization via Iterative Forward Projection Matching Algorithm using Digital X-ray Projections." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2283.

Full text
Abstract:
Interstitial and intracavitary brachytherapy plays an essential role in management of several malignancies. However, the achievable accuracy of brachytherapy treatment for prostate and cervical cancer is limited due to the lack of intraoperative planning and adaptive replanning. A major problem in implementing TRUS-based intraoperative planning is an inability of TRUS to accurately localize individual seed poses (positions and orientations) relative to the prostate volume during or after the implantation. For the locally advanced cervical cancer patient, manual drawing of the source positions on orthogonal films can not localize the full 3D intracavitary brachytherapy (ICB) applicator geometry. A new iterative forward projection matching (IFPM) algorithm can explicitly localize each individual seed/applicator by iteratively matching computed projections of the post-implant patient with the measured projections. This thesis describes adaptation and implementation of a novel IFPM algorithm that addresses hitherto unsolved problems in localization of brachytherapy seeds and applicators. The prototype implementation of 3-parameter point-seed IFPM algorithm was experimentally validated using a set of a few cone-beam CT (CBCT) projections of both the phantom and post-implant patient’s datasets. Geometric uncertainty due to gantry angle inaccuracy was incorporated. After this, IFPM algorithm was extended to 5-parameter elongated line-seed model which automatically reconstructs individual seed orientation as well as position. The accuracy of this algorithm was tested using both the synthetic-measured projections of clinically-realistic Model-6711 125I seed arrangements and measured projections of an in-house precision-machined prostate implant phantom that allows the orientations and locations of up to 100 seeds to be set to known values. The seed reconstruction error for simulation was less than 0.6 mm/3o. For the physical phantom experiments, IFPM absolute accuracy for position, polar angle, and azimuthal angel were (0.78 ± 0.57) mm, (5.8 ± 4.8)o, and (6.8 ± 4.0)o, respectively. It avoids the need to match corresponding seeds in each projection and accommodates incomplete data, overlapping seed clusters, and highly-migrated seeds. IFPM was further generalized from 5-parameter to 6-parameter model which was needed to reconstruct 3D pose of arbitrary-shape applicators. The voxelized 3D model of the applicator was obtained from external complex combinatorial geometric modeling. It is then integrated into the forward projection matching method for computing the 2D projections of the 3D ICB applicators, iteratively. The applicator reconstruction error for simulation was about 0.5 mm/2o. The residual 2D registration error (positional difference) between computed and actual measured applicator images was less than 1 mm for the intrauterine tandem and about 1.5 mm for the bilateral colpostats in each detector plane. By localizing the applicator’s internal structure and the sources, the effect of intra and inter-applicator attenuation can be included in the resultant dose distribution and CBCT metal streaking artifact mitigation. The localization accuracy of better than 1 mm and 6o has the potential to support more accurate Monte Carlo-based or 2D TG-43 dose calculations in clinical practice. It is hoped the clinical implementation of IFPM approach to localize elongated line-seed/applicator for intraoperative brachytherapy planning may have a positive impact on the treatment of prostate and cervical cancers.
APA, Harvard, Vancouver, ISO, and other styles
2

Staub, David. "Time dependent cone-beam CT reconstruction via a motion model optimized with forward iterative projection matching." VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3092.

Full text
Abstract:
The purpose of this work is to present the development and validation of a novel method for reconstructing time-dependent, or 4D, cone-beam CT (4DCBCT) images. 4DCBCT can have a variety of applications in the radiotherapy of moving targets, such as lung tumors, including treatment planning, dose verification, and real time treatment adaptation. However, in its current incarnation it suffers from poor reconstruction quality and limited temporal resolution that may restrict its efficacy. Our algorithm remedies these issues by deforming a previously acquired high quality reference fan-beam CT (FBCT) to match the projection data in the 4DCBCT data-set, essentially creating a 3D animation of the moving patient anatomy. This approach combines the high image quality of the FBCT with the fine temporal resolution of the raw 4DCBCT projection data-set. Deformation of the reference CT is accomplished via a patient specific motion model. The motion model is constrained spatially using eigenvectors generated by a principal component analysis (PCA) of patient motion data, and is regularized in time using parametric functions of a patient breathing surrogate recorded simultaneously with 4DCBCT acquisition. The parametric motion model is constrained using forward iterative projection matching (FIPM), a scheme which iteratively alters model parameters until digitally reconstructed radiographs (DRRs) cast through the deforming CT optimally match the projections in the raw 4DCBCT data-set. We term our method FIPM-PCA 4DCBCT. In developing our algorithm we proceed through three stages of development. In the first, we establish the mathematical groundwork for the algorithm and perform proof of concept testing on simulated data. In the second, we tune the algorithm for real world use; specifically we improve our DRR algorithm to achieve maximal realism by incorporating physical principles of image formation combined with empirical measurements of system properties. In the third stage we test our algorithm on actual patient data and evaluate its performance against gold standard and ground truth data-sets. In this phase we use our method to track the motion of an implanted fiducial marker and observe agreement with our gold standard data that is typically within a millimeter.
APA, Harvard, Vancouver, ISO, and other styles
3

Bentata, Amel. "Projection markovienne de processus stochastiques." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2012. http://tel.archives-ouvertes.fr/tel-00766235.

Full text
Abstract:
Cette thèse porte sur l'étude mathématique du problème de projection Markovienne d'un processus aléatoire: il s'agit de construire, étant donné un processus aléatoire ξ, un processus de Markov ayant à chaque instant la même distribution que ξ. Cette construction permet ensuite de déployer les outils analytiques disponibles pour l'étude des processus de Markov (équations aux dérivées partielles ou équations integro-différentielles) dans l'étude des lois marginales de ξ, même lorsque ξ n'est pas markovien. D'abord étudié dans un contexte probabiliste, notamment par Gyöngy (1986), ce problème a connu un regain d'intêret motivé par les applications en finance, sous l'impulsion des travaux de B. Dupire. La thèse entreprend une étude systématique des aspects probabilistes (construction d'un processus de Markov mimant les lois marginales de ξ) et analytiques (dérivation d'une équation de Kolmogorov forward) de ce problème, étendant les résultats existants au cas de semimartingales discontinues. Notre approche repose sur l'utilisation de la notion de problème de martingale pour un opérateur integro-différentiel. Nous donnons en particulier un résultat d'unicité pour une équation de Kolmogorov associée à un opérateur integro-différentiel non-dégénéré. Ces résultats ont des applications en finance: nous montrons notamment comment ils peuvent servir à réduire la dimension d'un problème à travers l'exemple de l'évaluation des options sur indice en finance.
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Chu Chuan. "Advanced Projection Ultrasound Imaging with CMOS-based Sensor Array: Development, Characterization, and Potential Medical Applications." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/40492.

Full text
Abstract:
Since early 1960s, ultrasound has become one of the most widely used medical imaging device as a diagnostic tool or an image guider for surgical intervention because of its high portability, non-ionization, non-invasiveness and low cost. Although continuous improvements in commercial equipments have been underway for many years, almost all systems are developed with pulse-echo geometry. In this research, a newly invented ultrasound sensor array was incorporated into the developments of a projection imaging system. Three C-scan prototypes, which included prototypes #1, #2 and an ultrasound mammography system, were constructed. Systematic and Evaluative studies included ultrasound CT, 3-D ultrasound, and multi-modality investigations were also performed. Furthermore, a new analytical method to model ultrasound forward scattering distribution (FSD) was developed by employing a specific annular apparatus. After applying this method, the scattering-corrected C-scan images revealed more detail structures as compared to unprocessed images. This new analytical modelling approach is believed to be effective for most imaging systems operating in projection geometry. In summary, while awaiting additional clinical validation, the C-scan ultrasound prototypes with the state-of-the-art PE-CMOS sensor arrays can provide veritable value and holds real and imminent promise in medical diagnostic imaging. Potential future uses of C-scan ultrasound include but not limit to computerized tomography, biopsy guidance, therapeutic device placing, foreign object detection, pediatric imaging, breast imaging, prostate imaging, human extremities imaging and live animal imaging. With continuous research and development, we believe that C-scan ultrasound has the potential to make a significant impact in the field of medical ultrasound imaging.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
5

Sunnegårdh, Johan. "Combining analytical and iterative reconstruction in helical cone-beam CT." Licentiate thesis, Computer Vision, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8286.

Full text
Abstract:

Contemporary algorithms employed for reconstruction of 3D volumes from helical cone beam projections are so called non-exact algorithms. This means that the reconstructed volumes contain artifacts irrespective of the detector resolution and number of projection angles employed in the process. In this thesis, three iterative schemes for suppression of these so called cone artifacts are investigated.

The first scheme, iterative weighted filtered backprojection (IWFBP), is based on iterative application of a non-exact algorithm. For this method, artifact reduction, as well as spatial resolution and noise properties are measured. During the first five iterations, cone artifacts are clearly reduced. As a side effect, spatial resolution and noise are increased. To avoid this side effect and improve the convergence properties, a regularization procedure is proposed and evaluated.

In order to reduce the cost of the IWBP scheme, a second scheme is created by combining IWFBP with the so called ordered subsets technique, which we call OSIWFBP. This method divides the projection data set into subsets, and operates sequentially on each of these in a certain order, hence the name “ordered subsets”. We investigate two different ordering schemes and number of subsets, as well as the possibility to accelerate cone artifact suppression. The main conclusion is that the ordered subsets technique indeed reduces the number of iterations needed, but that it suffers from the drawback of noise amplification.

The third scheme starts by dividing input data into high- and low-frequency data, followed by non-iterative reconstruction of the high-frequency part and IWFBP reconstruction of the low-frequency part. This could open for acceleration by reduction of data in the iterative part. The results show that a suppression of artifacts similar to that of the IWFBP method can be obtained, even if a significant part of high-frequency data is non-iteratively reconstructed.

APA, Harvard, Vancouver, ISO, and other styles
6

Sunnegårdh, Johan. "Iterative Enhancement of Non-Exact Reconstruction in Cone Beam CT." Thesis, Computer Vision, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2577.

Full text
Abstract:

Contemporary algorithms employed for reconstruction of 3D volumes from helical cone beam projections are so called non-exact algorithms. This means that the reconstructed volumes will contain artifacts irrespective of the detector resolution and number of projections angles employed in the process.

It has been proposed that these artifacts can be suppressed using an iterative scheme which comprises computation of projections from the already reconstructed volume as well as the non-exact reconstruction itself.

The purpose of the present work is to examine if the iterative scheme can be applied to the non-exact reconstruction method PI-original in order to improve the reconstruction result. An important part in this implementation is a careful design of the projection operator, as a poorly designed projection operator may result in aliasing and/or other artifacts in the reconstruction result. Since the projection data is truncated, special care must be taken along the boundaries of the detector. Three different ways of handling this interpolation problem is proposed and examined.

The results show that artifacts caused by the PI-original method can indeed be reduced by the iterative scheme. However, each iteration requires at least three times more processing time than the initial reconstruction, which may call for certain compromises, smartness and/or parallelization in the innermost loops. Furthermore, at higher cone angles certain types of artifacts seem to grow by each iteration instead of being suppressed.

APA, Harvard, Vancouver, ISO, and other styles
7

Breutel, Stephan Werner. "Analysing the behaviour of neural networks." Queensland University of Technology, 2004. http://eprints.qut.edu.au/15943/.

Full text
Abstract:
A new method is developed to determine a set of informative and refined interface assertions satisfied by functions that are represented by feed-forward neural networks. Neural networks have often been criticized for their low degree of comprehensibility.It is difficult to have confidence in software components if they have no clear and valid interface description. Precise and understandable interface assertions for a neural network based software component are required for safety critical applications and for theintegration into larger software systems. The interface assertions we are considering are of the form "e if the input x of the neural network is in a region (alpha symbol) of the input space then the output f(x) of the neural network will be in the region (beta symbol) of the output space "e and vice versa. We are interested in computing refined interface assertions, which can be viewed as the computation of the strongest pre- and postconditions a feed-forward neural network fulfills. Unions ofpolyhedra (polyhedra are the generalization of convex polygons in higher dimensional spaces) are well suited for describing arbitrary regions of higher dimensional vector spaces. Additionally, polyhedra are closed under affine transformations. Given a feed-forward neural network, our method produces an annotated neural network, where each layer is annotated with a set of valid linear inequality predicates. The main challenges for the computation of these assertions is to compute the solution of a non-linear optimization problem and the projection of a polyhedron onto a lower-dimensional subspace.
APA, Harvard, Vancouver, ISO, and other styles
8

Nassif, Roula. "Estimation distribuée adaptative sur les réseaux multitâches." Thesis, Université Côte d'Azur (ComUE), 2016. http://www.theses.fr/2016AZUR4118/document.

Full text
Abstract:
L’apprentissage adaptatif distribué sur les réseaux permet à un ensemble d’agents de résoudre des problèmes d’estimation de paramètres en ligne en se basant sur des calculs locaux et sur des échanges locaux avec les voisins immédiats. La littérature sur l’estimation distribuée considère essentiellement les problèmes à simple tâche, où les agents disposant de fonctions objectives séparables doivent converger vers un vecteur de paramètres commun. Cependant, dans de nombreuses applications nécessitant des modèles plus complexes et des algorithmes plus flexibles, les agents ont besoin d’estimer et de suivre plusieurs vecteurs de paramètres simultanément. Nous appelons ce type de réseau, où les agents doivent estimer plusieurs vecteurs de paramètres, réseau multitâche. Bien que les agents puissent avoir différentes tâches à résoudre, ils peuvent capitaliser sur le transfert inductif entre eux afin d’améliorer les performances de leurs estimés. Le but de cette thèse est de proposer et d’étudier de nouveaux algorithmes d’estimation distribuée sur les réseaux multitâches. Dans un premier temps, nous présentons l’algorithme diffusion LMS qui est une stratégie efficace pour résoudre les problèmes d’estimation à simple-tâche et nous étudions théoriquement ses performances lorsqu’il est mis en oeuvre dans un environnement multitâche et que les communications entre les noeuds sont bruitées. Ensuite, nous présentons une stratégie de clustering non-supervisé permettant de regrouper les noeuds réalisant une même tâche en clusters, et de restreindre les échanges d’information aux seuls noeuds d’un même cluster
Distributed adaptive learning allows a collection of interconnected agents to perform parameterestimation tasks from streaming data by relying solely on local computations and interactions with immediate neighbors. Most prior literature on distributed inference is concerned with single-task problems, where agents with separable objective functions need to agree on a common parameter vector. However, many network applications require more complex models and flexible algorithms than single-task implementations since their agents involve the need to estimate and track multiple objectives simultaneously. Networks of this kind, where agents need to infer multiple parameter vectors, are referred to as multitask networks. Although agents may generally have distinct though related tasks to perform, they may still be able to capitalize on inductive transfer between them to improve their estimation accuracy. This thesis is intended to bring forth advances on distributed inference over multitask networks. First, we present the well-known diffusion LMS strategies to solve single-task estimation problems and we assess their performance when they are run in multitask environments in the presence of noisy communication links. An improved strategy allowing the agents to adapt their cooperation to neighbors sharing the same objective is presented in order to attain improved learningand estimation over networks. Next, we consider the multitask diffusion LMS strategy which has been proposed to solve multitask estimation problems where the network is decomposed into clusters of agents seeking different
APA, Harvard, Vancouver, ISO, and other styles
9

Millán, Reinier Díaz. "Vários algoritmos para os problemas de desigualdade variacional e inclusão." Universidade Federal de Goiás, 2015. http://repositorio.bc.ufg.br/tede/handle/tede/4562.

Full text
Abstract:
Submitted by Erika Demachki (erikademachki@gmail.com) on 2015-05-21T19:19:51Z No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2015-05-21T19:21:31Z (GMT) No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-05-21T19:21:31Z (GMT). No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-02-27
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
Nesta tese apresentamos v arios algoritmos para resolver os problemas de Desigualdade Variacional e Inclus~ao. Para o problema de desigualdade variacional propomos, no Cap tulo 2 uma generaliza c~ao do algoritmo cl assico extragradiente, utilizando vetores normais n~ao nulos do conjunto vi avel. Em particular, dois algoritmos conceituais s~ao propostos e cada um deles cont^em tr^es variantes diferentes de proje c~ao que est~ao relacionadas com algoritmos extragradientes modi cados. Duas buscas diferentes s~ao propostas, uma sobre a borda do conjunto vi avel e a outra ao longo das dire c~oes vi aveis. Cada algoritmo conceitual tem uma estrat egia diferente de busca e tr^es formas de proje c~ao especiais, gerando tr^es sequ^encias com diferente e interessantes propriedades. E feito a an alise da converg^encia de ambos os algoritmos conceituais, pressupondo a exist^encia de solu c~oes, continuidade do operador e uma condi c~ao mais fraca do que pseudomonotonia. No Cap tulo 4, n os introduzimos um algoritmo direto de divis~ao para o problema variacional em espa cos de Hilbert. J a no Cap tulo 5, propomos um algoritmo de proje c~ao relaxada em Espa cos de Hilbert para a soma de m operadores mon otonos maximais ponto-conjunto, onde o conjunto vi avel do problema de desigualdade variacional e dado por uma fun c~ao n~ao suave e convexa. Neste caso, as proje c~oes ortogonais ao conjunto vi avel s~ao substitu das por proje c~oes em hiperplanos que separam a solu c~ao da itera c~ao atual. Cada itera c~ao do m etodo proposto consiste em proje c~oes simples de tipo subgradientes, que n~ao exige a solu c~ao de subproblemas n~ao triviais, utilizando apenas os operadores individuais, explorando assim a estrutura do problema. Para o problema de Inclus~ao, propomos variantes do m etodo de divis~ao de forward-backward para achar um zero da soma de dois operadores, a qual e a modi ca c~ao cl assica do forwardbackward proposta por Tseng. Um algoritmo conceitual e proposto para melhorar o apresentado por Tseng em alguns pontos. Nossa abordagem cont em, primeramente, uma busca linear tipo Armijo expl cita no esp rito dos m etodos tipo extragradientes para desigualdades variacionais. Durante o processo iterativo, a busca linear realiza apenas um c alculo do operador forward-backward em cada tentativa de achar o tamanho do passo. Isto proporciona uma consider avel vantagem computacional pois o operador forward-backward e computacionalmente caro. A segunda parte do esquema consiste em diferentes tipos de proje c~oes, gerando sequ^encias com caracter sticas diferentes.
In this thesis we present various algorithms to solve the Variational Inequality and Inclusion Problems. For the variational inequality problem we propose, in Chapter 2, a generalization of the classical extragradient algorithm by utilizing non-null normal vectors of the feasible set. In particular, two conceptual algorithms are proposed and each of them has three di erent projection variants which are related to modi ed extragradient algorithms. Two di erent linesearches, one on the boundary of the feasible set and the other one along the feasible direction, are proposed. Each conceptual algorithm has a di erent linesearch strategy and three special projection steps, generating sequences with di erent and interesting features. Convergence analysis of both conceptual algorithms are established, assuming existence of solutions, continuity and a weaker condition than pseudomonotonicity on the operator. In Chapter 4 we introduce a direct splitting method for solving the variational inequality problem for the sum of two maximal monotone operators in Hilbert space. In Chapter 5, for the same problem, a relaxed-projection splitting algorithm in Hilbert spaces for the sum of m nonsmooth maximal monotone operators is proposed, where the feasible set of the variational inequality problem is de ned by a nonlinear and nonsmooth continuous convex function inequality. In this case, the orthogonal projections onto the feasible set are replaced by projections onto separating hyperplanes. Furthermore, each iteration of the proposed method consists of simple subgradient-like steps, which does not demand the solution of a nontrivial subproblem, using only individual operators, which explores the structure of the problem. For the Inclusion Problem, in Chapter 3, we propose variants of forward-backward splitting method for nding a zero of the sum of two operators, which is a modi cation of the classical forward-backward method proposed by Tseng. The conceptual algorithm proposed here improves Tseng's method in many instances. Our approach contains rstly an explicit Armijo-type line search in the spirit of the extragradient-like methods for variational inequalities. During the iterative process, the line search performs only one calculation of the forward-backward operator in each tentative for nding the step size. This achieves a considerable computational saving when the forward-backward operator is computationally expensive. The second part of the scheme consists of special projection steps bringing several variants.
APA, Harvard, Vancouver, ISO, and other styles
10

Hartsell, Bradley. "Projecting Culture Through Literary Exportation: How Imitation in Scandinavian Crime Fiction Reveals Regional Mores." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3323.

Full text
Abstract:
This thesis reexamines the beginnings of Swedish hardboiled crime literature, in part tracking its lineage to American culture and unpacking Swedish identity. Following the introduction, the second chapter asserts how this genre began as a form of escapism, specifically in Maj Sjöwall and Per Wahlöö’s Roseanna. The third chapter compares predecessor Raymond Chandler’s The Big Sleep with Roseanna, and how Sweden’s greater gender tolerance significantly outshining America’s is reflected in literature. The fourth chapter examines how Henning Mankell’s novels fail to fully accept Sweden’s complicity in neo-Nazism as an active component of Swedish identity. The final chapter reveals Helene Tursten’s Detective Inspector Huss engaging with gender and racial relations in unique ways, while also releasing the suppressive qualities found in the Swedish identity post-war. Therefore, this thesis will better contextualize the onset of the genre, and how its lineage reflects the fruits and the damages alike in the Swedish identity.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Forward projection"

1

Canada, Bank of. The Bank of Canada's new quarterly projection model. Part 2 . A Robust Method for stimulating forward-looking models. [Ottawa: Bank of Canada, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abad, José Vicente, ed. Research on Language Teaching and Learning: Advances and Projection. Fondo Editorial Universidad Católica Luis Amigó, 2021. http://dx.doi.org/10.21501/9789588943701.

Full text
Abstract:
In 2010, teachers from the B.A. in English Teaching at Universidad Católica Luis Amigó formed CILEX (Construcciones Investigativas en Lenguas Extranjeras). Research and teaching in the program have grown synergistically ever since, but ten years down the road it was time to take stock of our research to project the direction in which we wanted to move forward. This book is the result of that effort to recognize our shared history and thus propel our upcoming academic endeavors. The book starts out by presenting the epistemological foundations of CILEX, which is based on the threefold notion of the language teacher as an intellectual, an academic, and an educator. It thereon explains the system that arranges our academic production within five thematic nodes: cultural studies, language policy, literacies, language teacher education, and language assessment. Each chapter reports on one or two studies in which the authors participated as leading researchers or advisors. Hence, the book also reflects the formative research tradition that characterizes most of our practice. Having language teacher education as a binding thread that cuts across the entire volume, authors present their particular perspective on topics as varied as college academic performance, early childhood literacy, language policy appropriation, teacher educators’ assessment literacy, student teachers’ practicum identity crisis, research training in teacher education, and critical reading instruction. This book condenses the work of a group of teacher educators who believe in the power of research to galvanize teaching and inspire positive educational change. As readers go through its pages, it is our hope they will be able to recognize not only the singular value of each individual chapter but also the richness of our collaboration, which constitutes the fabric of our identity as an academic community.
APA, Harvard, Vancouver, ISO, and other styles
3

Authority, Personal Investment, ed. Projections: The way forward. London: Personal Investment Authority, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Steele, Vaughn R., Vani Pariyadath, Rita Z. Goldstein, and Elliot A. Stein. Reward Circuitry and Drug Addiction. Edited by Dennis S. Charney, Eric J. Nestler, Pamela Sklar, and Joseph D. Buxbaum. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780190681425.003.0044.

Full text
Abstract:
Addiction is a complex neuropsychiatric syndrome related to dysregulation of brain systems including the mesocorticolimbic dopamine reward circuit. Dysregulation of reward circuitry is related to each of the three cyclical stages in the disease model of addiction: maintenance, abstinence, and relapse. Parsing reward circuitry is confounded due to the anatomical complexity of cortico-basal ganglia-thalamocortical loops, forward and backward projections within the circuit, and interactions between neurotransmitter systems. We begin by introducing the neurobiology of the reward system, specifically highlighting nodes of the circuit beyond the basal ganglia, followed by a review of the current literature on reward circuitry dysregulation in addiction. Finally, we discuss biomarkers of addiction identified with neuroimaging that could help guide neuroprediction models and development of targets for effective new interventions, such as noninvasive brain stimulation. The neurocircuitry of reward, especially non-prototypical nodes, may hold essential keys to understanding and treating addiction.
APA, Harvard, Vancouver, ISO, and other styles
5

Araújo, Kathleen. Low Carbon Energy Transitions. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199362554.001.0001.

Full text
Abstract:
The world is at a pivotal crossroad in energy choices. There is a strong sense that our use of energy must be more sustainable. Moreover, many also broadly agree that a way must be found to rely increasingly on lower carbon energy sources. However, no single or clear solution exists on the means to carry out such a shift at either a national or international level. Traditional energy planning (when done) has revolved around limited cost projections that often fail to take longer term evidence and interactions of a wider set of factors into account. The good news is that evidence does exist on such change in case studies of different nations shifting toward low-carbon energy approaches. In fact, such shifts can occur quite quickly at times, alongside industrial and societal advance, innovation, and policy learning. These types of insights will be important for informing energy debates and decision-making going forward. Low Carbon Energy Transitions: Turning Points in National Policy and Innovation takes an in-depth look at four energy transitions that have occurred since the global oil crisis of 1973: Brazilian biofuels, Danish wind power, French nuclear power, and Icelandic geothermal energy. With these cases, Dr. Araújo argues that significant nationwide shifts to low-carbon energy can occur in under fifteen years, and that technological complexity is not necessarily a major impediment to such shifts. Dr. Araújo draws on more than five years of research, and interviews with over 120 different scientists, government workers, academics, and members of civil society in completing this study. Low Carbon Energy Transitions is written for for professionals in energy, the environment and policy as well as for students and citizens who are interested in critical decisions about energy sustainability. Technology briefings are provided for each of the major technologies in this book, so that scientific and non-scientific readers can engage in more even discussions about the choices that are involved.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Forward projection"

1

Al-Yahyai, Sultan, Yassine Charabi, Said Al-Sarmi, and Juma Al-Maskari. "Scenarios Based Climate Projection for Oman Water Resources." In Water Resources in Arid Areas: The Way Forward, 43–58. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51856-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Agrawal, Amit, Yuichi Taguchi, and Srikumar Ramalingam. "Analytical Forward Projection for Axial Non-central Dioptric and Catadioptric Cameras." In Computer Vision – ECCV 2010, 129–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15558-1_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Zhenya, Hongmei Cheng, and Xufa Wang. "Research on Stereographic Projection and It’s Application on Feed Forward Neural Network." In Lecture Notes in Computer Science, 89–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11881070_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pokhrel, D., M. J. Murphy, D. A. Todor, D. Lazos, E. Weiss, Y. Motai, and J. F. Williamson. "Brachytherapy seed localization via iterative forward projection matching (IFPM) algorithm using intraoperative cone-beam-CT sinogram projections." In IFMBE Proceedings, 307–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03474-9_87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sagitarian Warganegara, Doni, Agus Zahron, Edwin Mirfazli, and Oleh Pasko. "The effect of spot exchange rate and forward exchange rate on projection of futures spot of Rupiah on Dollar currencies." In The Future Opportunities and Challenges of Business in Digital Era 4.0, 58–61. Leiden, The Netherlands : CRC Press/Balkema, [2020]: Routledge, 2020. http://dx.doi.org/10.1201/9780367853778-15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Barthe, Gilles, Raphaëlle Crubillé, Ugo Dal Lago, and Francesco Gavazzo. "On the Versatility of Open Logical Relations." In Programming Languages and Systems, 56–83. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_3.

Full text
Abstract:
AbstractLogical relations are one among the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be immediately proved by means of logical relations, for instance program continuity and differentiability in higher-order languages extended with real-valued functions. Informally, the problem stems from the fact that these properties are naturally expressed on terms of non-ground type (or, equivalently, on open terms of base type), and there is no apparent good definition for a base case (i.e. for closed terms of ground types). To overcome this issue, we study a generalization of the concept of a logical relation, called open logical relation, and prove that it can be fruitfully applied in several contexts in which the property of interest is about expressions of first-order type. Our setting is a simply-typed $$\lambda $$ λ -calculus enriched with real numbers and real-valued first-order functions from a given set, such as the one of continuous or differentiable functions. We first prove a containment theorem stating that for any collection of real-valued first-order functions including projection functions and closed under function composition, any well-typed term of first-order type denotes a function belonging to that collection. Then, we show by way of open logical relations the correctness of the core of a recently published algorithm for forward automatic differentiation. Finally, we define a refinement-based type system for local continuity in an extension of our calculus with conditionals, and prove the soundness of the type system using open logical relations.
APA, Harvard, Vancouver, ISO, and other styles
7

"Basing and Forward Force Projection." In The Palgrave Encyclopedia of Imperialism and Anti-Imperialism, 188. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-29901-9_300094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Anderson, Lisa. "Middle East Studies for the New Millennium: Infrastructures of Knowledge." In Middle East Studies for the New Milleniu. NYU Press, 2016. http://dx.doi.org/10.18574/nyu/9781479827787.003.0013.

Full text
Abstract:
This chapter deplores the state of Middle East social sciences, which is described as demoralized, lacking academic freedom and reliable research data, and functioning in a general climate of repression, neglect, and isolation. Such conditions call into question the extent to which future social scientists will be able to build supportive scholarly communities or develop critical perspectives so key to social science research and the investigation of questions of public import. Echoing discussions in this volume on methodological shifts in the social science disciplines, it argues that the quantitative turn has produced a narrow, mechanical field unable to move forward in ways that attend to the diversity of the social and political world. As the field has emphasized technical skills over moral imperatives, and as the institutional contexts of US universities has changed, the result has been a simultaneous narrowing of the field and a projection of greater universalization for a global world.
APA, Harvard, Vancouver, ISO, and other styles
9

Goldfinger, Eliot. "Animals with Limb Variations Skeleton & Superficial Muscles (Side View)." In Animal Anatomy for Artists. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780195142143.003.0013.

Full text
Abstract:
Kangaroo characteristics: Forelimb small; has five digits with strong claws. Large, powerful hind limb with long, strong, narrow foot. Muscular thigh; muscle mass of lower leg positioned on upper half, toward knee. In foot, large fourth and smaller fifth digits transmit force during locomotion; first digit missing, small digits two and three bound together by skin. Long tail, thick at base, used for body support at rest and balance during hopping. Fast locomotion is by leaping with hind limbs only. Walking: Hind limbs, forelimbs, and tail in contact with ground at various times. Sitting: Body rests on entire foot and tail; arms hang loosely. Pouch in female opens forward, supported by two long, thin bones. Sea lion characteristics: Webbed flipper-like forefoot and hind foot. Front flipper thicker on front edge. Skin of flipper extends past tips of toe bones, supported by individual cartilages attached to ends of toe bones. Noticeable claws on three middle toes of hind foot; other claws tiny and inconspicuous. Front flipper triangular; hind flipper rectangular. Hind limb can be advanced forward—can walk, but thigh and lower leg encased in skin of abdomen (seals can’t walk—their hind limbs permanently extended backward). Elbow also enclosed in body skin, but forearms are free. Body streamlined (torpedo-shaped) for swimming. Thick insulating blubber layer between skin and muscles. Thick, flexible, muscular neck. Pelvis and femur small. Sternum has forward projection. Small external ears present (absent in seals). Ears and slit-like nostrils can be closed under water. Short, stubby tail. Very short hair; fur much darker when wet. Body uniform in color (no spots). Males larger than females. Closely related to terrestrial carnivores. Pinniped is not scientific classification, but means “fin footed.”
APA, Harvard, Vancouver, ISO, and other styles
10

Moulton, Keir. "Remarks on propositional nominalization." In Nominalization, 255–76. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198865544.003.0011.

Full text
Abstract:
Moulton’s ‘Remarks on propositional nominalization’ investigates nominalization at the highest reaches of the extended verbal projection, finite CPs. While CPs can express propositions, Moulton puts forward the novel claim that only nominalization of CPs by a semantically-contentful N can deliver reference to propositional objects. This conclusion is in contrast to the propositional nominalization operations proposed in Chierchia (1984), Potts (2002), and Takahashi (2010). Evidence comes from a correlation between two types of D+CP constructions in Spanish (Picallo, 2002; Serrano, 2014, 2015) and the kind of propositions they can describe. Moulton then shows that a similar pattern arises in the case of exophoric propositional proforms, a novel observation. Putting the two case studies together, the following picture emerges: Natural language does not permit reference to proposition-like objects directly by adding a D to a CP, but only via some content-bearing entity (e.g. Moltmann’s (2013) attitudinal objects). In the case of propositional nominalizations, this entity must come in the form a lexical N; in the case of propositional discourse anaphora, this must come in the form of a discourse referent that bears propositional content, such as an assertion event (Hacquard, 2006). <189>
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Forward projection"

1

Jeng, Elvis Ko-Yung, and Zhigang Xiang. "Forward area light map projection." In the 2nd international conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/602330.602346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hong, I. K., S. T. Chung, H. K. Kim, Y. B. Kim, Y. D. Son, and Z. H. Cho. "Fast forward projection and backward projection algorithm using SIMD." In 2006 IEEE Nuclear Science Symposium Conference Record. IEEE, 2006. http://dx.doi.org/10.1109/nssmic.2006.353723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jin, Kyung-Chan. "Forward projection model for noisy computerized tomography projection enhancement." In 2014 International Symposium on Consumer Electronics (ICSE). IEEE, 2014. http://dx.doi.org/10.1109/isce.2014.6884391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Clement, Gregory T. "Nonlinear planar forward and backward projection." In 2008 IEEE Ultrasonics Symposium (IUS). IEEE, 2008. http://dx.doi.org/10.1109/ultsym.2008.0442.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fugger, Thomas F., Bryan C. Randles, Jesse L. Wobrock, and Jerry J. Eubanks. "Pedestrian Throw Kinematics in Forward Projection Collisions." In SAE 2002 World Congress & Exhibition. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 2002. http://dx.doi.org/10.4271/2002-01-0019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Duda, Alexander, and Christopher Gaudig. "Refractive forward projection for underwater flat port cameras." In 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2016. http://dx.doi.org/10.1109/iros.2016.7759318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Walton, Simon, and Mark Jones. "Interacting with Volume Data: Deformations using Forward Projection." In International Conference on Medical Information Visualisation - BioMedical Visualisation (MediVis 2007). IEEE, 2007. http://dx.doi.org/10.1109/medivis.2007.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Kaixin, Jin Chen, Haitao Lin, and Zhao Shen. "A Subspace Projection Method for Forward-looking Imaging." In 2021 IEEE International Conference on Consumer Electronics and Computer Engineering (ICCECE). IEEE, 2021. http://dx.doi.org/10.1109/iccece51280.2021.9342417.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zeng, DaZhi, Tao Zeng, Cheng Hu, and Teng Long. "Back-Projection Algorithm Characteristic Analysis in Forward-Looking Bistatic SAR." In 2006 CIE International Conference on Radar. IEEE, 2006. http://dx.doi.org/10.1109/icr.2006.343181.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xie, Xiaobin, Madison G. McGaffin, Yong Long, Jeffrey A. Fessler, Minhua Wen, and James Lin. "Accelerating separable footprint (SF) forward and back projection on GPU." In SPIE Medical Imaging, edited by Thomas G. Flohr, Joseph Y. Lo, and Taly Gilat Schmidt. SPIE, 2017. http://dx.doi.org/10.1117/12.2252010.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Forward projection"

1

Alexander, Charles R., and Jr. Strategic Creep: From Power Projection Back to Forward Presence. Fort Belvoir, VA: Defense Technical Information Center, March 1999. http://dx.doi.org/10.21236/ada362989.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bauerle, Matthew. Developing a Massively Parallel Forward Projection Radiography Model for Large-Scale Industrial Applications. Office of Scientific and Technical Information (OSTI), August 2014. http://dx.doi.org/10.2172/1171557.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Carlucci, D., J. Cordes, S. Morris, and R. Gast. Muzzle Exit (Set Forward) Effects on Projectile Dynamics. Fort Belvoir, VA: Defense Technical Information Center, April 2006. http://dx.doi.org/10.21236/ada455215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Coastal Lidar And Radar Imaging System (CLARIS) mobile terrestrial lidar survey along the Outer Banks, North Carolina in Currituck and Dare counties. Coastal and Hydraulics Laboratory (U.S.), January 2020. http://dx.doi.org/10.21079/11681/39419.

Full text
Abstract:
The Coastal Observation and Analysis Branch (COAB) located at the Field Research Facility (FRF) conducts quarterly surveys and post-storm surveys along up to 60 kilometers of coastline within the vicinity of the FRF to assess, evaluate, and provide updated observations of the morphology of the foreshore and dune system. The surveys are conducted using a mobile terrestrial LiDAR scanner coupled with an Inertial Navigation System (INS). Traditionally the surveys coincide with a low tide, exposing the widest swath of visible sediment to the scanner as well as enough wind-sea swell or texture to induce wave breaking upon the interior sandbars. The wave field is measured with X-Band radar which records a spatial time series of wave direction and speed. Data for the survey region was collected using the VZ-2000's mobile, 3D scanning mode where the scanner continuously rotates the line scan 360 degrees as the vehicle progresses forward. Elevation measurements are acquired on all sides of the vehicle except for the topography directly underneath the vehicle. As the vehicle moves forward, the next rotation will capture the previous position's occluded data area. Laser data is acquired in mobile 3D radar mode with a pulse repetition rate of 300kHz, theta resolution of 0.19 degrees and phi resolution of 0.625 degrees. Horizontal Datum NAD83(2011), Projection North Carolina State Plane (3200) meters; Vertical Datum NAVD88, meters with geoid09 applied.
APA, Harvard, Vancouver, ISO, and other styles
5

Coastal Lidar And Radar Imaging System (CLARIS) mobile terrestrial lidar survey along the Outer Banks, North Carolina in Currituck and Dare counties. Coastal and Hydraulics Laboratory (U.S.), January 2020. http://dx.doi.org/10.21079/11681/39419.

Full text
Abstract:
The Coastal Observation and Analysis Branch (COAB) located at the Field Research Facility (FRF) conducts quarterly surveys and post-storm surveys along up to 60 kilometers of coastline within the vicinity of the FRF to assess, evaluate, and provide updated observations of the morphology of the foreshore and dune system. The surveys are conducted using a mobile terrestrial LiDAR scanner coupled with an Inertial Navigation System (INS). Traditionally the surveys coincide with a low tide, exposing the widest swath of visible sediment to the scanner as well as enough wind-sea swell or texture to induce wave breaking upon the interior sandbars. The wave field is measured with X-Band radar which records a spatial time series of wave direction and speed. Data for the survey region was collected using the VZ-2000's mobile, 3D scanning mode where the scanner continuously rotates the line scan 360 degrees as the vehicle progresses forward. Elevation measurements are acquired on all sides of the vehicle except for the topography directly underneath the vehicle. As the vehicle moves forward, the next rotation will capture the previous position's occluded data area. Laser data is acquired in mobile 3D radar mode with a pulse repetition rate of 300kHz, theta resolution of 0.19 degrees and phi resolution of 0.625 degrees. Horizontal Datum NAD83(2011), Projection North Carolina State Plane (3200) meters; Vertical Datum NAVD88, meters with geoid09 applied.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Forward projection' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography