Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (10)
- Theory and Algorithms (5)
- Databases and Information Systems (4)
- Engineering (4)
- Applied Mathematics (3)
-
- Computer Engineering (3)
- Numerical Analysis and Scientific Computing (3)
- Mathematics (2)
- Chemistry (1)
- Data Storage Systems (1)
- Digital Communications and Networking (1)
- Electrical and Computer Engineering (1)
- Geography (1)
- Graphics and Human Computer Interfaces (1)
- Hardware Systems (1)
- Information Security (1)
- Nanoscience and Nanotechnology (1)
- Numerical Analysis and Computation (1)
- OS and Networks (1)
- Remote Sensing (1)
- Social and Behavioral Sciences (1)
- Institution
- Publication
- Publication Type
Articles 1 - 16 of 16
Full-Text Articles in Physical Sciences and Mathematics
An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu
An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu
Research Collection School Of Computing and Information Systems
The key challenge with 3D deformable surface tracking arises from the difficulty in estimating a large number of 3D shape parameters from noisy observations. A recent state-of-the-art approach attacks this problem by formulating it as a Second Order Cone Programming (SOCP) feasibility problem. The main drawback of this solution is the high computational cost. In this paper, we first reformulate the problem into an unconstrained quadratic optimization problem. Instead of handling a large set of complicated SOCP constraints, our new formulation can be solved very efficiently by resolving a set of sparse linear equations. Based on the new framework, a …
Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao
Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao
Research Collection School Of Computing and Information Systems
In this paper, we investigate a novel approach to accelerate the matching of two video clips by exploiting the temporal coherence property inherent in the keyframe sequence of a video. Motivated by the fact that keyframe correspondences between near-duplicate videos typically follow certain spatial arrangements, such property could be employed to guide the alignment of two keyframe sequences. We set the alignment problem as an integer quadratic programming problem, where the cost function takes into account both the visual similarity of the corresponding keyframes as well as the alignment distortion among the set of correspondences. The set of keyframe-pairs found …
Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu
Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu
Research Collection School Of Computing and Information Systems
In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …
On Graph Isomorphism And The Pagerank Algorithm, Christopher J. Augeri
On Graph Isomorphism And The Pagerank Algorithm, Christopher J. Augeri
Theses and Dissertations
A graph is a key construct for expressing relationships among objects, such as the radio connectivity between nodes contained in an unmanned vehicle swarm. The study of such networks may include ranking nodes based on importance, for example, by applying the PageRank algorithm used in some search engines to order their query responses. The PageRank values correspond to a unique eigenvector typically computed by applying the power method, an iterative technique based on matrix multiplication. The first new result described herein is a lower bound on the execution time of the PageRank algorithm that is derived by applying standard assumptions …
Knowledge Transfer Via Multiple Model Local Structure Mapping, Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
Knowledge Transfer Via Multiple Model Local Structure Mapping, Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
Research Collection School Of Computing and Information Systems
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from which test examples are to be drawn. The task can be especially difficult when the training examples are from one or several domains different from the test domain. In this paper, we propose a locally weighted ensemble framework to combine multiple models for transfer learning, where the weights are dynamically assigned according to a model's predictive power on each test example. It can integrate the advantages of various learning algorithms and the labeled information from multiple …
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Research Collection School Of Computing and Information Systems
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, …
Algorithms For Some Geometric Facility Location And Path Planning Problems., Sasanka Roy Dr.
Algorithms For Some Geometric Facility Location And Path Planning Problems., Sasanka Roy Dr.
Doctoral Theses
The facility location problem is a resource allocation problem that mainly deals with adequate placement of various types of facilities to serve a distributed set of demands satisfying the nature of interactions between the demands and facilities and optimizing the cost of placing/maintaining the facilities and the quality of services.The facility location problem is well-studied in the Operations Research literature and recently has received a lot of attention in the Computer Science community. For a company, the facility location problem provides more strategic decisions than just giving importance to locate the lowest cost space for storing its products. While identifying …
Capacity Constrained Assignment In Spatial Databases, Hou U Leong, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
Capacity Constrained Assignment In Spatial Databases, Hou U Leong, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
Research Collection School Of Computing and Information Systems
Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most nce) in M, (ii) the size of M is maximized (i.e., it comprises min{|P|,P q2Q q.k} pairs), and (iii) the total assignment cost (i.e., the sum of Euclidean distances within all pairs) is minimized. Thus, the CCA problem is …
Statistical Removal Of Shadow For Applications To Gait Recognition, Brian D. Hockersmith
Statistical Removal Of Shadow For Applications To Gait Recognition, Brian D. Hockersmith
Theses and Dissertations
The purpose of this thesis is to mathematically remove the shadow of an individual on video. The removal of the shadow will aid in the rendering of higher quality binary silhouettes than previously allowed. These silhouettes will allow researchers studying gait recognition to work with silhouettes unhindered by unrelated data. The thesis begins with the analysis of videos of solid colored backgrounds. A formulation of the effect of shadow on specified colors will aid in the derivation of a hypothesis test to remove an individual’s shadow. Video of an individual walking normally, perpendicular to the camera will be utilized to …
Algorithms For White-Box Obfuscation Using Randomized Subcircuit Selection And Replacement, Kenneth E. Norman
Algorithms For White-Box Obfuscation Using Randomized Subcircuit Selection And Replacement, Kenneth E. Norman
Theses and Dissertations
Software protection remains an active research area with the goal of preventing adversarial software exploitation such as reverse engineering, tampering, and piracy. Heuristic obfuscation techniques lack strong theoretical underpinnings while current theoretical research highlights the impossibility of creating general, efficient, and information theoretically secure obfuscators. In this research, we consider a bridge between these two worlds by examining obfuscators based on the Random Program Model (RPM). Such a model envisions the use of program encryption techniques which change the black-box (semantic) and white-box (structural) representations of underlying programs. In this thesis we explore the possibilities for white-box transformation. Under an …
Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley
Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley
Theses and Dissertations
There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …
Geometric Primitives In Digital Images: Analyses And Applications Using Digital Geometry., Partha Bhowmick Dr.
Geometric Primitives In Digital Images: Analyses And Applications Using Digital Geometry., Partha Bhowmick Dr.
Doctoral Theses
No abstract provided.
Traffic Analysis Of Udp-Based Flows In Ourmon, Jim Binkley, Divya Parekh
Traffic Analysis Of Udp-Based Flows In Ourmon, Jim Binkley, Divya Parekh
Computer Science Faculty Publications and Presentations
We present a custom UDP flow tuple with an IP address key and a set of simple related statistical attributes. Attributes are used to calculate a per host metric called the UDP work weight which roughly measures the amount of network noise caused by a host. The work weight is used to produce a near real-time sorted top N report for UDP host tuples. We also present a derived attribute based on an algorithm called the UDP guesstimator. The UDP guesstimator roughly classifies port report hosts into various traffic categories including security threats (DOS/scanning) or P2P hosts based on high …
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Computer Science Faculty Publications
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …
Chemical Analysis Of Polymer Blends Via Synchrotron X-Ray Tomography, Heath Alan Barnett
Chemical Analysis Of Polymer Blends Via Synchrotron X-Ray Tomography, Heath Alan Barnett
LSU Doctoral Dissertations
Material properties of industrial polymer blends are of great importance. X-ray tomography has been used to obtain spatial chemical information about various polymer blends. The spatial images are acquired with synchrotron X-ray tomography because of its rapidity, good spatial resolution, large field-of-view, and elemental sensitivity. The spatial absorption data acquired from X-ray tomography experiments is converted to spatial chemical information via a linear least squares fit of multi-spectral X-ray absorption data. A fiberglass-reinforced polymer blend with a new-generation flame retardant is studied with multi-energy synchrotron X-ray tomography to assess the blend homogeneity. Relative to other composite materials, this sample is …
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
Electrical & Computer Engineering Faculty Publications
Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper presents a method to automatically identify vegetation based upon satellite imagery. First, we utilize the ISODATA algorithm to cluster pixels in the images where the number of clusters is determined by the algorithm. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. After that, we compute six features for each cluster. These six features then go through a feature selection algorithm and three of them are determined to …