Choi, Yuet Kei. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 68-72). / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / Contents --- p.vi / List of Figures --- p.viii / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Previous Works --- p.3 / Chapter 1.1.1 --- Template deformation --- p.3 / Chapter 1.1.2 --- Mesh partitioning --- p.3 / Chapter 1.1.3 --- Mesh Smoothing --- p.4 / Chapter 1.2 --- Overview of the approach --- p.5 / Chapter 1.3 --- Thesis outline --- p.7 / Chapter 2. --- Global Deformation --- p.8 / Chapter 2.1 --- The closet point method --- p.10 / Chapter 2.1.1 --- Computational complexity --- p.11 / Chapter 2.2 --- Deformation Techniques --- p.12 / Chapter 2.2.1 --- Existing deformation method --- p.12 / Chapter 2.2.2 --- Radial Basis Functions (RBFs) --- p.14 / Chapter 2.2.2.1 --- Computational complexity --- p.18 / Chapter 2.2.3 --- Result --- p.18 / Chapter 2.3 --- Face flip prevention --- p.20 / Chapter 2.3.1 --- Detection of the flipped face --- p.22 / Chapter 2.3.1.1 --- Common approach: --- p.22 / Chapter 2.3.1.2 --- Our Approach --- p.23 / Chapter 2.3.1.3 --- Comparisons of the face flip detection method: --- p.26 / Chapter 2.3.2 --- Local Subdivision --- p.27 / Chapter 3. --- Partitioning of the mesh --- p.29 / Chapter 3.1 --- Existing method --- p.29 / Chapter 3.2 --- Our approach --- p.31 / Chapter 3.3 --- Computational complexity --- p.34 / Chapter 4. --- Mesh smoothing algorithm --- p.35 / Chapter 4.1 --- The Laplacian flow method --- p.36 / Chapter 4.2 --- The mean-curvature method --- p.40 / Chapter 4.3 --- Our Approach --- p.43 / Chapter 4.3.1 --- The modified mean-curvature method --- p.43 / Chapter 4.3.2 --- The modified Laplacian flow method --- p.45 / Chapter 4.3.3 --- Feature constraints --- p.47 / Chapter 4.3.4 --- Computational complexity --- p.47 / Chapter 4.4 --- Comparison of the mesh smoothing approach --- p.48 / Chapter 5. --- Implementation and Results --- p.51 / Chapter 5.1 --- Construction of the template mesh and boundary curves --- p.51 / Chapter 5.2 --- Selection of the corresponding vertex pairs --- p.52 / Chapter 5.3 --- Results --- p.54 / Chapter 6. --- Conclusions --- p.63 / Chapter 6.1 --- Future development --- p.65 / Appendix A --- p.66 / Determination of the projected path on a mesh: --- p.66 / Reference --- p.68

Computational geometry is the study of algorithms for manipulating sets of points, lines, polygons, planes and other geometric objects. For many problems in this realm, the sets considered are static and the data structures representing them do not permit efficient insertion and deletion of objects (e.g. points). Dynamic problems, in which the set and the geometric data structure change over time, are also of interest. The topic of this thesis is the presentation of fast algorithms for fully dynamic maintenance of some common geometric structures. The following configurations are examined: planar nearest-point and farthest-point Voronoi diagrams, convex hulls (in two and three dimensions), common intersection of halfspaces (2-D and 3-D), and contour of maximal vectors (2-D and 3-D). The principal techniques exploited are fast merging of substructures, and the use of extra storage. Dynamic geometric search structures based upon the configurations are also presented. / Science, Faculty of / Computer Science, Department of / Graduate

Signal-to-noise ratio (SNR) estimation is one of the important research topics in wireless communications. In the receiver, many algorithms require SNR information to achieve optimal performance. In this thesis, an autocorrelation based SNR estimator is proposed. The proposed method utilizes the correlation properties of symbol sequence and the uncorrelated properties of noise sequence to distinguish the signal power from the received signal. Curve fitting method is used for SNR estimator to predict the signal power. Mean and variance performance of the proposed SNR estimator is compared with that of the conventional SNR estimator by computer simulations. These simulations consider additive white Gaussian noise and multipath Rayleigh fading channel with BPSK, 8PSK, 16QAM and 64QAM modulation schemes. According to the simulation results, the proposed method can provide better performance than conventional methods in both mean and mean-square-error.

Thesis (M.A.)--University of Wyoming, 2008. / Title from PDF title page (viewed on Mar. 23, 2010). Includes bibliographical references (p. 93-94).

No description available.

No description available.

This thesis explores the feasibility of the application of statistical regression theory to the curve fitting of mortality data. Equations derived from Makeham's first law were used. These include:1x = ksxgcXlog lx=a+hx+bcx color pX = A + BcxThe 1941 CSO and 1958 CSO mortality tables were used for initial study.Extending this work, pure raw mortality data in conjunction with a modified version of the last equation above was employed. Results were quite interesting.

The purpose of this paper is to examine the interactions between two plant species endemic to Florida and develop a model for the growth of one of the plant species. An equation for the growth of Hypericum cumulicola is developed through analyzing how the distance to and the height of the nearest Ceratiola ericoides (Florida rosemary) affects the growth of Hypericum cumulicola. The hypericums were separated into five separate regions according to the distance to the nearest rosemary plant. The parameters for a basic growth equation were obtained in each of the five regions and compared to each other along with the average deviations in each of the five regions. Analysis of the five separate regions aided in the creation of different growth equations that each encompassed all of the regions together. Four different growth equations are developed and then compared and analyzed for their accuracy.

This research study presents two control solutions, PID and the novel hyper-clothoid control strategy, to autonomously navigate a car. These waypoint navigation solutions smoothly connect the given waypoints with C1 continuity using Hermite cubic splines which is used as a reference path for the controller to track. The PID controller uses lateral and heading error to generate a steering profile for the vehicle to track the constructed reference path. A novel real time solution is presented as the second control strategy which involves constructing clothoids to generate a steering profile. The resultant car trajectory preserves curvature and curvature rate continuity. A simulation test bench was developed in MATLAB and Simulink. Six benchmark waypoint datasets have been used for regression testing and validating the algorithms. Both the proposed control strategies have been implemented on a 2017 GM Chevy Bolt EV. A real time operating system (QNX) has been used and was time-synced with the localization suite in the test vehicle. Closed loop results with accuracies up to 50 cm of lateral error have been achieved using the test vehicle. / Doctor of Philosophy / The research into self-driving cars has been one of the most sought out areas these past couple of decades. There are many components into building a self-driving car - Sensing, Perception, Localization, Navigation. Lot of strategies have been developed over the years with waypoint navigation being the most widely used for navigation an autonomous vehicle. Waypoint Navigation utilizes GPS data to move the car from one point to the other. The traditional process of this strategy involves two parts - curve fitting between waypoints and using a control scheme to track the path with the car. Numerous methods have been developed to fit a curve in between two points. Most of these methods use a variant of 3rd degree or higher order polynomials . Also different control strategies have been developed to track the generated path. Model predictive control strategies are among the popular control architectures used for this purpose. This work proposes a novel method to track a path using clothoids. The proposed algorithm has a novel approach of integrating the path construction and control strategy. The algorithm also has a low computational requirement making it highly suitable for implementation in real-time.

Due to the fast development in 3D technology during recent decades, many approaches in 3D representation technologies have been proposed worldwide. In order to get an accurate information to render a 3D representation, more data need to be recorded compared to normal video sequence. In this case, how to find an efficient way to transmit the 3D representation data becomes an important part in the whole 3D representation technology. Recent years, many coding schemes based on the principle of encoding the depth have been proposed. Compared to the traditional multiview coding schemes, those new proposed schemes can achieve higher compression efficiency. Due to the development of depth capturing technology, the accuracy and quality of the reconstructed depth image also get improved. In this thesis we propose an efficient depth data compression scheme for 3D images. Our proposed depth data compression scheme is platelet based coding using Lagrangian optimization, quadtree decomposition and quadratic curve fitting. We study and improve the original platelet based coding scheme and achieve a compression improvement of 1-2 dB compared to the original platelet based scheme. The experimental results illustrate the improvement provided by our scheme. The quality of the reconstructed results of our proposed curve fitting based platelet coding scheme are better than that of the original scheme.