• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • Tagged with
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Design And Analysis Of Transfer Alignment Algorithms

Yuksel, Yigiter 01 February 2005 (has links) (PDF)
Transfer Alignment is the process of simultaneously initializing and calibrating a weapon inertial navigation system (INS) using data from host aircraft&rsquo / s navigation system. In general, this process is accomplished by calculating the difference of navigation solutions between aircraft and weapon INSs to form observations which are then used in a Kalman filter to generate desired estimates. Numerous techniques about the problem of transfer alignment exist in the literature. In this thesis, those techniques that can be applied in the presence of elastic motion of aircraft wing were analyzed. Several transfer alignment algorithms each of which process different measurement types were designed and implemented. In order to evaluate the performance of implemented algorithms under realistic conditions, a transfer alignment simulation environment was developed. Using this simulation environment, the advantages and disadvantages of each algorithm were analyzed and the dependence of transfer alignment performance on Kalman filter system model, aircraft maneuvers and alignment duration were investigated.
2

Efficient Dynamic Alignment of Motions

Zhang, Liang, Brunnett, Guido 21 February 2018 (has links) (PDF)
We consider the computation of optimal alignments between sub-sequences of given motion clips based on dynamic programming. To avoid redundant computations in multiple alignment queries, we introduced the concept of a guideboard matrix. Using this data structure, the existence inquiry for an alignment is answered in O(1) time and the extraction of the alignment is done in O(n+m) time where n and m denote the numbers of frames in the considered motions.
3

Efficient Dynamic Alignment of Motions

Zhang, Liang, Brunnett, Guido January 2018 (has links)
We consider the computation of optimal alignments between sub-sequences of given motion clips based on dynamic programming. To avoid redundant computations in multiple alignment queries, we introduced the concept of a guideboard matrix. Using this data structure, the existence inquiry for an alignment is answered in O(1) time and the extraction of the alignment is done in O(n+m) time where n and m denote the numbers of frames in the considered motions.

Page generated in 0.2263 seconds