Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra
Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra
Theses and Dissertations
The most recent research involved registering images in the presence of translations and rotations using one iteration of the redundant discrete wavelet transform. We extend this work by creating a new multiscale transform to register two images with translation or rotation differences, independent of scale differences between the images. Our two-dimensional multiscale transform uses an innovative combination of lowpass filtering and the continuous wavelet transform to mimic the two-dimensional redundant discrete wavelet transform. This allows us to obtain multiple subbands at various scales while maintaining the desirable properties of the redundant discrete wavelet transform. Whereas the discrete wavelet transform produces …
Efficient Modeling Of Discontinuities And Dispersive Media In Printed Transmission Lines, R. Araneo, Chen Wang, Xiaoxiong Gu, James L. Drewniak, S. Celozzi
Efficient Modeling Of Discontinuities And Dispersive Media In Printed Transmission Lines, R. Araneo, Chen Wang, Xiaoxiong Gu, James L. Drewniak, S. Celozzi
Electrical and Computer Engineering Faculty Research & Creative Works
The finite-difference time-domain method is applied to the analysis of transmission lines on printed circuit boards. The lossy, dispersive behavior of the dielectric substrate is accurately accounted for by means of several algorithms whose accuracy is discussed and compared. Numerical results are validated by comparisons with measurements and an equivalent circuit of slot in the ground plane is proposed.
Offline And Online Variants Of The Traveling Salesman Problem, John Ebenezer Augustine
Offline And Online Variants Of The Traveling Salesman Problem, John Ebenezer Augustine
LSU Master's Theses
In this thesis, we study several well-motivated variants of the Traveling Salesman Problem (TSP). First, we consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2-approximation algorithms were known for several variants of the single vehicle problem on a path. A 3/2-approximation algorithm was known for the single vehicle problem on a path where there is a fixed starting point and the vehicle must return to the starting point upon completion. Karuno, Nagamochi and Ibaraki give a 2-approximation algorithm for the single vehicle problem on trees. We develop a Polynomial Time Approximation Scheme (PTAS) for …