Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication Year
Articles 1 - 20 of 20
Full-Text Articles in Physical Sciences and Mathematics
Video Snapshot: Single Image Motion Expansion Via Invertible Motion Embedding, Qianshu Zhu, Chu Han, Guoqiang Han, Tien-Tsin Wong, Shengfeng He
Video Snapshot: Single Image Motion Expansion Via Invertible Motion Embedding, Qianshu Zhu, Chu Han, Guoqiang Han, Tien-Tsin Wong, Shengfeng He
Research Collection School Of Computing and Information Systems
Unlike images, finding the desired video content in a large pool of videos is not easy due to the time cost of loading and watching. Most video streaming and sharing services provide the video preview function for a better browsing experience. In this paper, we aim to generate a video preview from a single image. To this end, we propose two cascaded networks, the motion embedding network and the motion expansion network. The motion embedding network aims to embed the spatio-temporal information into an embedded image, called video snapshot. On the other end, the motion expansion network is proposed to …
Coherence And Identity Learning For Arbitrary-Length Face Video Generation, Shuquan Ye, Chu Han, Jiaying Lin, Guoqiang Han, Shengfeng He
Coherence And Identity Learning For Arbitrary-Length Face Video Generation, Shuquan Ye, Chu Han, Jiaying Lin, Guoqiang Han, Shengfeng He
Research Collection School Of Computing and Information Systems
Face synthesis is an interesting yet challenging task in computer vision. It is even much harder to generate a portrait video than a single image. In this paper, we propose a novel video generation framework for synthesizing arbitrary-length face videos without any face exemplar or landmark. To overcome the synthesis ambiguity of face video, we propose a divide-and-conquer strategy to separately address the video face synthesis problem from two aspects, face identity synthesis and rearrangement. To this end, we design a cascaded network which contains three components, Identity-aware GAN (IA-GAN), Face Coherence Network, and Interpolation Network. IA-GAN is proposed to …
A Novel Spatiotemporal Prediction Method Of Cumulative Covid-19 Cases, Junzhe Cai
A Novel Spatiotemporal Prediction Method Of Cumulative Covid-19 Cases, Junzhe Cai
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Prediction methods are important for many applications. In particular, an accurate prediction for the total number of cases for pandemics such as the Covid-19 pandemic could help medical preparedness by providing in time a sufficient supply of testing kits, hospital beds and medical personnel. This thesis experimentally compares the accuracy of ten prediction methods for the cumulative number of Covid-19 pandemic cases. These ten methods include two types of neural networks and extrapolation methods based on best fit linear, best fit quadratic, best fit cubic and Lagrange interpolation, as well as an extrapolation method from Revesz. We also consider the …
Intelligent Intrusion Detection Using Radial Basis Function Neural Network, Alia Abughazleh, Muder Almiani, Basel Magableh, Abdul Razaque
Intelligent Intrusion Detection Using Radial Basis Function Neural Network, Alia Abughazleh, Muder Almiani, Basel Magableh, Abdul Razaque
Conference papers
Recently we witness a booming and ubiquity evolving of internet connectivity all over the world leading to dramatic amount of network activities and large amount of data and information transfer. Massive data transfer composes a fertile ground to hackers and intruders to launch cyber-attacks and various types of penetrations. As a consequence, researchers around the globe have devoted a large room for researches that can handle different types of attacks efficiently through building various types of intrusion detection systems capable to handle different types of attacks, known and unknown (novel) ones as well as have the capability to deal with …
Deep Air Learning: Interpolation, Prediction, And Feature Analysis Of Fine-Grained Air Quality, Zhongang Qi, Tianchun Wang, Guojie Song, Weisong Hu, Xi Li, Zhongfei Mark Zhang
Deep Air Learning: Interpolation, Prediction, And Feature Analysis Of Fine-Grained Air Quality, Zhongang Qi, Tianchun Wang, Guojie Song, Weisong Hu, Xi Li, Zhongfei Mark Zhang
Research Collection School Of Computing and Information Systems
The interpolation, prediction, and feature analysis of fine-gained air quality are three important topics in the area of urban air computing. The solutions to these topics can provide extremely useful information to support air pollution control, and consequently generate great societal and technical impacts. Most of the existing work solves the three problems separately by different models. In this paper, we propose a general and effective approach to solve the three problems in one model called the Deep Air Learning (DAL). The main idea of DAL lies in embedding feature selection and semi-supervised learning in different layers of the deep …
Fib: Squeezing Loop Invariants By Interpolation Between Forward/Backward Predicate Transformers, Shang-Wei Lin, Jun Sun, Hao Xiao, Yang Liu, David Sana, Henri Hansen
Fib: Squeezing Loop Invariants By Interpolation Between Forward/Backward Predicate Transformers, Shang-Wei Lin, Jun Sun, Hao Xiao, Yang Liu, David Sana, Henri Hansen
Research Collection School Of Computing and Information Systems
Loop invariant generation is a fundamental problem in program analysis and verification. In this work, we propose a new approach to automatically constructing inductive loop invariants. The key idea is to aggressively squeeze an inductive invariant based on Craig interpolants between forward and backward reachability analysis. We have evaluated our approach by a set of loop benchmarks, and experimental results show that our approach is promising.
Interpolation Guided Compositional Verification, Shang-Wei Lin, Jun Sun, Truong Khanh Nguyen, Yang Liu, Jin Song Dong
Interpolation Guided Compositional Verification, Shang-Wei Lin, Jun Sun, Truong Khanh Nguyen, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Model checking suffers from the state space explosion problem. Compositional verification techniques such as assume-guarantee reasoning (AGR) have been proposed to alleviate the problem. However, there are at least three challenges in applying AGR. Firstly, given a system M1 M2, how do we automatically construct and refine (in the presence of spurious counterexamples) an assumption A2, which must be an abstraction of M2? Previous approaches suggest to incrementally learn and modify the assumption through multiple invocations of a model checker, which could be often time consuming. Secondly, how do we keep the state space small when checking M1 A2 |= …
Designing A Bayer Filter With Smooth Hue Transition Interpolation Using The Xilinx System Generator, Zhiqiang Li, Peter Revesz
Designing A Bayer Filter With Smooth Hue Transition Interpolation Using The Xilinx System Generator, Zhiqiang Li, Peter Revesz
CSE Conference and Workshop Papers
This paper describes the design of a Bayer filter with smooth hue transition using the System Generator for DSP. We describe and compare experimentally two different designs, one based on a MATLAB implementation and the other based on a modification of the Bayer filter using bilinear interpolation.
Estimating The Flight Path Of Moving Objects Based On Acceleration Data, Peter Revesz
Estimating The Flight Path Of Moving Objects Based On Acceleration Data, Peter Revesz
CSE Conference and Workshop Papers
Inertial navigation is the problem of estimating the flight path of a moving object based on only acceleration measurements. This paper describes and compares two approaches for inertial navigation. Both approaches estimate the flight path of the moving object using cubic spline interpolation, but they find the coefficients of the cubic spline pieces by different methods. The first approach uses a tridiagonal matrix, while the second approach uses recurrence equations. They also require different boundary conditions. While both approaches work in O(n) time where n is the number of given acceleration measurements, the recurrence equation-based method can be easier updated …
Cubic Spline Interpolation By Solving A Recurrence Equation Instead Of A Tridiagonal Matrix, Peter Revesz
Cubic Spline Interpolation By Solving A Recurrence Equation Instead Of A Tridiagonal Matrix, Peter Revesz
CSE Conference and Workshop Papers
The cubic spline interpolation method is proba- bly the most widely-used polynomial interpolation method for functions of one variable. However, the cubic spline method requires solving a tridiagonal matrix-vector equation with an O(n) computational time complexity where n is the number of data measurements. Even an O(n) time complexity may be too much in some time-ciritical applications, such as continuously estimating and updating the flight paths of moving objects. This paper shows that under certain boundary conditions the tridiagonal matrix solving step of the cubic spline method could be entirely eliminated and instead the coefficients of the unknown cubic polynomials …
Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart
Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Geospatial information fusion is the process of synthesizing information from complementary data sources located at different points in space and time. Spatial phenomena are often measured at discrete locations by sensor networks, technicians, and volunteers; yet decisions often require information about locations where direct measurements do not exist. Traditional methods assume the spatial phenomena to be either discrete or continuous, an assumption that underlies and informs all subsequent analysis. Yet certain phenomena defy this dichotomy, alternating as they move across spatial and temporal scales. Precipitation, for example, appears continuous at large scales, but it can be temporally decomposed into discrete …
Adaptive Interpolation Algorithms For Temporal-Oriented Datasets, Jun Gao
Adaptive Interpolation Algorithms For Temporal-Oriented Datasets, Jun Gao
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Spatiotemporal datasets can be classified into two categories: temporal-oriented and spatial-oriented datasets depending on whether missing spatiotemporal values are closer to the values of its temporal or spatial neighbors. We present an adaptive spatiotemporal interpolation model that can estimate the missing values in both categories of spatiotemporal datasets. The key parameters of the adaptive spatiotemporal interpolation model can be adjusted based on experience.
Empirical Analysis Of Computational And Accuracy Tradeoffs Using Compactly Supported Radial Basis Functions For Surface Reconstruction, Weiming Liu, Bryan S. Morse, Lauralea Otis
Empirical Analysis Of Computational And Accuracy Tradeoffs Using Compactly Supported Radial Basis Functions For Surface Reconstruction, Weiming Liu, Bryan S. Morse, Lauralea Otis
Faculty Publications
Implicit surfaces can be constructed from scattered surface points using radial basis functions (RBFs) to interpolate the surface’s embedding function. Many researchers have used thin-plate spline RBFs for this because of their desirable smoothness properties. Others have used compactly supported RBFs, leading to a sparse matrix solution with lower computational complexity and better conditioning. However, the limited radius of support introduces a free parameter that leads to varying solutions as well as varying computational requirements: a larger radius of support leads to smoother and more accurate solutions but requires more computation. This paper presents an empirical analysis of this radius …
Image Magnification Using Level-Set Reconstruction, Bryan S. Morse, Duane Schwartzwald
Image Magnification Using Level-Set Reconstruction, Bryan S. Morse, Duane Schwartzwald
Faculty Publications
Image magnification is a common problem in imaging applications, requiring interpolation to “read between the pixels”. Although many magnification/interpolation algorithms have been proposed in the literature, all methods must suffer to some degree the effects of impefect reconstruction―false high-frequency content introduced by the underlying original sampling. Most often, these effects manifest themselves as jagged contours in the image. This paper presents a method for constrained smoothing of such artifacts that attempts to produce smooth reconstructions of the image’s level curves while still maintaining image fidelity. This is similar to other iterative reconstruction algorithms and to Bayesian restoration techniques, but instead …
Interpolating Implicit Surfaces From Scattered Surface Data Using Compactly Supported Radial Basis Functions, Bryan S. Morse, David T. Chen, Penny Rheingans, Kalpathi Subramanian, Terry S. Yoo
Interpolating Implicit Surfaces From Scattered Surface Data Using Compactly Supported Radial Basis Functions, Bryan S. Morse, David T. Chen, Penny Rheingans, Kalpathi Subramanian, Terry S. Yoo
Faculty Publications
We describe algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by Savchenko, et al. and later developed independently by Turk and O'Brien as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of …
Isophote-Based Interpolation, Bryan S. Morse, Duane Schwartzwald
Isophote-Based Interpolation, Bryan S. Morse, Duane Schwartzwald
Faculty Publications
Standard methods for image interpolation are based on smoothly fitting the image intensity surface. Recent edge-directed interpolation methods add limited geometric information (edge maps) to build more accurate and visually appealing interpolations at key contours in the image. This paper presents a method for geometry-based interpolation that smoothly fits the isophote (intensity level curve) contours at all points in the image rather than just at selected contours. By using level set methods for curve evolution, no explicit extraction or representation of these contours is required (unlike earlier edge-directed methods). The method uses existing interpolation techniques as an initial approximation and …
Faster Ray Tracing Using Adaptive Grids, Thomas W. Sederberg, Krysztof S. Klimaszewski
Faster Ray Tracing Using Adaptive Grids, Thomas W. Sederberg, Krysztof S. Klimaszewski
Faculty Publications
A new hybrid approach is presented which outperforms the regular grid technique in scenes with highly irregular object distributions by a factor of hundreds, and combined with an area interpolator, by a factor of thousands. Much has been said about scene independence of different acceleration techniques and the alleged superiority of one approach over another. Several theoretical and practical studies conducted in the past have led to the same conclusion: a space partitioning method that allows the fastest rendering of one scene often fails with another. Specialization may be the answer. This has always been pursued, consciously or not, in …
Techniques For Cubic Algebraic Surfaces Ii, Thomas W. Sederberg
Techniques For Cubic Algebraic Surfaces Ii, Thomas W. Sederberg
Faculty Publications
A survey of some techniques that may have potential for free-form modeling with algebraic surfaces is continued. Classical results as well as several recent innovations are included. Specific attention is paid to cubic algebraic surfaces, although many of the ideas presented have application to algebraic surfaces of any degree. Topics addressed include piecewise constructions, interpolation to points and space curves, and parameterization.
Techniques For Cubic Algebraic Surfaces I, Thomas W. Sederberg
Techniques For Cubic Algebraic Surfaces I, Thomas W. Sederberg
Faculty Publications
The tutorial presents some tools for free-form modeling with algebraic surfaces, that is, surfaces that can be defined using an implicit polynomial equation f(x, y, z )=0. Cubic algebraic surfaces (defined by an implicit equation of degree 3) are emphasized. While much of this material applies only to cubic surfaces, some applies to algebraic surfaces of any degree. This area of the tutorial introduces terminology, presents different methods for defining and modeling with cubic surfaces, and examines the power basis representation of algebraic surfaces. Methods of forcing an algebraic surface to interpolate a set of points or a space curve …
A Parallel-Processing Subsystem For Rapid 3-D Interpolation Of Ct Images, William A. Barrett, Stephen J. Allan, Scott R. Cannon
A Parallel-Processing Subsystem For Rapid 3-D Interpolation Of Ct Images, William A. Barrett, Stephen J. Allan, Scott R. Cannon
Faculty Publications
An inexpensive parallel-processing subsystem for the rapid interpolation of CT image planes is demonstrated with a variety of node topologies. The subsystem is based on a tree network of INMOS T414 Transputer processors and is hosted by an AT-based image workstation. The subsystem accepts a stack of eight arbitrarily-spaced 256 x 256 image planes from the host. Subsystem output to the host consists of a stack of 32 scaled and evenly-spaced image planes (256 x 256 x 32 with cubic voxels). Benchmark execution times ranged from 12.3 seconds for three nodes to 5.8 seconds for eight nodes.