Physical Sciences and Mathematics Commons^™

Baldur's Gate Ii - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted by Yngvi Björnsson from Baldur's Gate II with explicit permission from BioWare Corp. for use and distribution as benchmark problems.

Contains 75 maps and benchmark problem sets scaled to 512 x 512 and 120 original scale maps.

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a new ly developed scheme for automatical ly partitioning videos into scenes. A scene is general ly referred to as a group of shots taken place in the same site. In this paper, we first propose a motion annotation algorithm based on the analysis of spatiotemporal image volumes. The algorithm characterizes the motions within shots by extracting and analyzing the motion trajectories encoded in the temporal slices of image volumes. A motion-based keyframe computing and selection strategy is thus proposed to compactly represent the content of shots. With these techniques, we further present a scene change detection algorithm …

Image-Based Change Detection Using An Integrated Spatiotemporal Gazetteer, Georgios Mountrakis

Electronic Theses and Dissertations

This thesis addresses image-based change detection. Motivation was provided by the lack of algorithms that incorporate in their solution diverse types of pre-existing and complementary information and have the ability to interact with a spatiotemporal environment. The main differentiation with our approach is that we develop our algorithm within an integrated spatiotemporal environment and we make use of all change evidence that might exist within that environment. In addition, a change resolution model is developed that will distinguish meaningful changes based on user requirements. A model for change is proposed that establishes a general framework for the incorporation of image …

Motion Characterization By Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

This paper describes an approach to characterize camera and object motions based on the analysis of spatio temporal image volumes. In the spatio-temporal slices of image volumes, motion is depicted as oriented patterns. We propose a tensor histogram computation algorithm to represent these oriented patterns. The motion trajectories in a histogram are tracked to describe both the camera and object motions. In addition, we exploit the similarity of the temporal slices in a volume to reliably partition a volume into motion tractable units.

Anytime Algorithms For Maximal Constraint Satisfaction Problems, Noha Kaptan

Archived Theses and Dissertations

No abstract provided.

Using Raster Sketches For Digital Image Retrieval, James Carswell

Electronic Theses and Dissertations

This research addresses the problem of content-based image retrieval using queries on image-object shape, completely in the raster domain. It focuses on the particularities of image databases encountered in typical topographic applications and presents the development of an environment for visual information management that enables such queries. The query consists of a user-provided raster sketch of the shape of an imaged object. The objective of the search is to retrieve images that contain an object sufficiently similar to the one specified in the query. The new contribution of this work combines the design of a comprehensive digital image database on-line …

Predictive Adaptive Resonance Theory And Knowledge Discovery In Databases, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This paper investigates the scalability of predictive Adaptive Resonance Theory (ART) networks for knowledge discovery in very large databases. Although predictive ART performs fast and incremental learning, the number of recognition categories or rules that it creates during learning may become substantially large and cause the learning speed to slow down. To tackle this problem, we introduce an on-line algorithm for evaluating and pruning categories during learning. Benchmark experiments on a large scale data set show that on-line pruning has been effective in reducing the number of the recognition categories and the time for convergence. Interestingly, the pruned networks also …

Stochastic Modeling-Based Dgps Estimation Algorithm, James T. Broaddus

Theses and Dissertations

A Kinematic Differential Global Positioning System (KDGPS) algorithm is developed. A number of mobile receivers is considered, one of which will be designated the reference station' which will have known position and velocity information at the beginning of the time interval examined. Satellite clock biases are used to model Selective Availability. The measurement situation on hand is properly modeled and a centralized estimation algorithm processing several epochs of data. The effect of uncertainty in the reference receiver's position and the level of receiver noise is examined. Monte Carlo simulations are performed to examine the ability of the algorithm to correctly …

Global Positioning System (Gps) Error Source Prediction, Marcus G. Ferguson

Theses and Dissertations

With the initiation of the navigation accuracy prediction algorithm used to estimate the amount of GPS solution (location and time) error for receivers, the capability to accurately predict solution errors due to the major GPS error sources is growing. Although some sources of error within the GPS solution have been previously analyzed, modeled, and/or accounted for within various modeling efforts, a formal evaluation of the seven major error sources that distort GPS activity has not been officially conducted up until this point. This research offers a logical assessment of all the major GPS error sources and their definitive impact on …

Personalizing The Gams Cross-Index, Saverio Perugini, Priya Lakshminarayanan, Naren Ramakrishnan

Computer Science Faculty Publications

The NIST Guide to Available Mathematical Software (GAMS) system at http://gams.nist .gov serves as the gateway to thousands of scientific codes and modules for numerical computation. We describe the PIPE personalization facility for GAMS, whereby content from the cross-index is specialized for a user desiring software recommendations for a specific problem instance. The key idea is to (i) mine structure, and (ii) exploit it in a programmatic manner to generate personalized web pages. Our approach supports both content-based and collaborative personalization and enables information integration from multiple (and complementary) web resources. We present case studies for the domain of linear, …

Vhdl Design And Simulation For Embedded Zerotree Wavelet Quantisation, Hung Huynh

Theses : Honours

This thesis discusses a highly effective still image compression algorithm – The Embedded Zerotree Wavelets coding technique, as it is called. This technique is simple but achieves a remarkable result. The image is wavelet-transformed, symbolically coded and successive quantised, therefore the compression and transmission/storage saving can be achieved by utilising the structure of zerotree. The algorithm was first proposed by Jerome M. Shapiro in 1993, however to minimise the memory usage and speeding up the EZW processor, a Depth First Search method is used to transverse across the image rather than Breadth First Search method as initially discussed in Shapiro's …