AN IP-BASED LIVE DATABASE APPROACH TO SURVEILLANCE APPLICATION DEVELOPMENT

With the proliferation of inexpensive cameras, video surveillance applications are becoming ubiquitous in many domains such as public safety and security, manufacturing, intelligent transportation systems, and healthcare. IP-based video surveillance technologies, in particular, are able to bring traditional video surveillance centers to virtually any computer at any location with an Internet connection. Today’s IP-based video surveillance systems, however, are designed for specific classes of applications. For instance, one cannot use a system designed for incident detection on highways to monitor patients in a healthcare facility. To support rapid development of video surveillance applications, we designed and implemented a new class of general purpose database management system, the live video database management system (LVDBMS). We view networked IP cameras as a special class of storage devices, and allow the user to formulate ad hoc queries expressed over live video feeds. These continuous queries are processed in real time using novel distributed computing techniques. With this environment, the users are able to develop various specific web-based video surveillance systems for a variety of applications. These systems can coexist in a unified LVDBMS framework to share the expensive deployment and operating costs of the camera networks. Our contribution is the introduction of a live database approach to video surveillance software development. In this paper, we describe our prototype and present the live video data model, the query language, and the query processing technique. 1

Electric Vehicle Aggregation Review: Benefits and Vulnerabilities of Managing a Growing EV Fleet

Electric vehicles (EVs) are becoming more popular within the United States, making up an increasingly large portion of the US's electricity consumption. Hence, there is much attention has been directed on how to manage EVs within the power sector. A well-investigated strategy for managing the increase in electricity demand from EV charging is aggregation, which allows for an intermediary to manage electricity flow between EV owners and their utilities. When implemented effectively, EV aggregation provides key benefits to power grids by relieving electrical loads.. These benefits are aggregation's ability to shift EV loads to peak shave, which often leads to lower emissions, electricity generation prices, and consumer costs depending on the penetration levels of non-dispatchable electricity sources. This review seeks to appropriately highlight the broad vulnerabilities of EV aggregation alongside its benefits, namely those regarding battery degradation, rebound peaks, and cybersecurity. The holistic overview of EV aggregation provides comparisons that balance expectations with realistic performance

Approximate Regularized Least Squares Algorithm for Classification

In machine learning, a good predictive model is the one that generalizes well over future unseen data. In general, this problem is ill-posed. To mitigate this problem, a predictive model can be constructed by simultaneously minimizing an empirical error over training samples and controlling the complexity of the model. Thus, the regularized least squares (RLS) is developed. RLS requires matrix inversion, which is expensive. And as such, its big data applications can be adversely affected. To address this issue, we have developed an efficient machine learning algorithm for pattern recognition that approximates RLS. The algorithm does not require matrix inversion, and achieves competitive performance against the RLS algorithm. It has been shown mathematically that RLS is a sound learning algorithm. Therefore, a definitive statement about the relationship between the new algorithm and RLS will lay a solid theoretical foundation for the new algorithm. A recent study shows that the spectral norm of the kernel matrix in RLS is tightly bounded above by the size of the matrix. This spectral norm becomes a constant when the training samples have independent centered sub-Gaussian coordinators. For example, typical sub-Gaussian random vectors such as the standard normal and Bernoulli satisfy this assumption. Basically, each sample is drawn from a product distribution formed from some centered univariate sub-Gaussian distributions. These new results allow us to establish a bound between the new algorithm and RLS in finite samples and show that the new algorithm converges to RLS in the limit. Experimental results are provided that validate the theoretical analysis and demonstrate the new algorithm to be very promising in solving big data classification problems

Mining Best Strategy for Multi-View Classification

In multi-view classification, the goal is to find a strategy for choosing the most consistent views for a given task. A strategy is a probability distribution over views. A strategy can be considered as advice given to an algorithm. There can be several strategies, each allocating a different probability mass to a view at different times. In this paper, we propose an algorithm for mining these strategies in such a way that its trust in a view for classification comes close to that of the best strategy. As a result, the most consistent views contribute to multi-view classification. Finally, we provide experimental results to demonstrate the effectiveness of the proposed algorithm

Mobile Sensor Approach To Location-Based Services

Moving object database is the core technology for location-based services (LBS), permitting users to pose spatial queries about the environment around them. We introduce a sensor-based LBS approach that is more economical and scalable for large-scale deployments supporting a large user community. We discuss this framework in the context of k-nearest-neighbor queries. We present simulation results and efficiency analysis to show the effectiveness of the proposed technique. © 2010 IEEE

Regularized Difference Criterion for Computing Discriminants for Dimensionality Reduction

Hyperspectral data classification has shown potential in many applications. However, a large number of spectral bands cause overfitting. Methods for reducing spectral bands, e.g., linear discriminant analysis, require matrix inversion. We propose a semidefinite programming for linear discriminants regularized difference (SLRD) criterion approach that does not require matrix inversion. The paper establishes a classification error bound and provides experimental results with ten methods over six hyperspectral datasets demonstrating the efficacy of the proposed SLRD technique

Multiview Boosting with Information Propagation for Classification

Multiview learning has shown promising potential in many applications. However, most techniques are focused on either view consistency, or view diversity. In this paper, we introduce a novel multiview boosting algorithm, called Boost.SH, that computes weak classifiers independently of each view but uses a shared weight distribution to propagate information among the multiple views to ensure consistency. To encourage diversity, we introduce randomized Boost.SH and show its convergence to the greedy Boost.SH solution in the sense of minimizing regret using the framework of adversarial multiarmed bandits. We also introduce a variant of Boost.SH that combines decisions from multiple experts for recommending views for classification. We propose an expert strategy for multiview learning based on inverse variance, which explores both consistency and diversity. Experiments on biometric recognition, document categorization, multilingual text, and yeast genomic multiview data sets demonstrate the advantage of Boost.SH (85%) compared with other boosting algorithms like AdaBoost (82%) using concatenated views and substantially better than a multiview kernel learning algorithm (74%)