Efficient compression and network adaptive video coding for distributed video surveillance

The availability of cheap network based video cameras and the prevalence of wireless networks has lead to a major thrust towards deployment of large scale Distributed Video Surveillance (DVS) systems. This has opened up an important area of research to deal with the issues involved in DVS system for efficient collection and transmission of large scale video streams from the cameras at the guarded sites, to the end users in possibly constrained network conditions. In this paper, we propose a framework based on content-based video classification and scalable compression scheme to provide a robust bandwidth efficient video transmission for DVS. The scheme builds on a Discrete Wavelet Transform (DWT) based Color-Set Partitioning for Hierarchical Trees (CSPIHT) coding to obtain a scalable bitstream. Wavelet domain segmentation and compression assists in development of a DVS architecture. The architecture includes a novel module for dynamic allocation of Network bandwidth based on the current available resources and constraints. Different frame constituents are optimally coded based on their relative significance, perceptual quality, and available estimate of network bandwidth. Experimental result over different video sequences and simulations for Network conditions demonstrate the efficient performance of the approach.     

OS-Guard: on-site signature based framework for multimedia surveillance data management

This paper presents OS-Guard(On-Site Guard), a novel on-site signature based framework for multimedia surveillance data management. One of the major concerns in widespread deployment of multimedia surveillance systems is the enormous amount of data collected from multiple media streams that need to be communicated, observed and stored for crime alerts and forensic analysis. This necessitates investigating efficient data management techniques to solve this problem. This work aims to tackle this problem, motivated by the following observation, more data does not mean more information. OS-Guard is a novel framework that attempts to collect informative data and filter out non-informative data on-site, thus taking a step towards solving the data management problem. In the framework, both audio and video cues are utilized by extracting features from the incoming data stream and the resultant real valued feature data is binarized for efficient storage and processing. A feature selection process based on association rule mining selects discriminant features. A short representative sample of the whole database is generated using a novel reservoir sampling algorithm that is stored onsite and used with an support vector machine to classify an important event. Initial experiments for a Bank ATM monitoring scenario demonstrates promising results.     

Delay composition in preemptive and non-preemptive real-time pipelines

Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt it. In this paper, we bound the end-to-end delay of a job in a multistage pipeline as a function of job execution times on different stages under preemptive as well as non-preemptive scheduling. We show that the end-to-end delay is bounded by that of a single virtual “bottleneck” stage plus a small additive component. This contribution effectively transforms the pipeline into a single stage system. The wealth of schedulability analysis techniques derived for uniprocessors can then be applied to decide the schedulability of the pipeline. The transformation does not require imposing artificial per-stage deadlines, but rather models the pipeline as a whole and uses the end-to-end deadlines directly in the single-stage analysis. It also does not make assumptions on job arrival patterns or periodicity and thus can be applied to periodic and aperiodic tasks alike. We show through simulations that this approach outperforms previous pipeline schedulability tests except for very short pipelines or when deadlines are sufficiently large. The reason lies in the way we account for execution overlap among stages. We discuss how previous approaches account for overlap and point out interesting differences that lead to different performance advantages in different cases. Further, we also show that in certain cases non-preemptive scheduling can result in higher system utilization than preemptive scheduling in pipelined systems. We hope that the pipeline delay composition rule, derived in this paper, may be a step towards a general schedulability analysis foundation for large distributed systems.

High‐Entropy Alloys: Potential Candidates for High‐Temperature Applications – An Overview

Multi‐principal elemental alloys, commonly referred to as high‐entropy alloys (HEAs), are a new class of emerging advanced materials with novel alloy design concept. Unlike the design of conventional alloys, which is based on one or at most two principal elements, the design of HEA is based on multi‐principal elements in equal or near‐equal atomic ratio. The advent of HEA has revived the alloy design perception and paved the way to produce an ample number of compositions with different combinations of promising properties for a variety of structural applications. Among the properties possessed by HEAs, sluggish diffusion and strength retention at elevated temperature have caught wide attention. The need to develop new materials for high‐temperature applications with superior high‐temperature properties over superalloys has been one of the prime concerns of the high‐temperature materials research community. The current article shows that HEAs have the potential to replace Ni‐base superalloys as the next generation high‐temperature materials. This review focuses on the phase stability, microstructural stability, and high‐temperature mechanical properties of HEAs. This article will be highly beneficial for materials engineering and science community whose interest is in the development and understanding of HEAs for high‐temperature applications.     

Urinary proteomic analysis of chronic allograft nephropathy

The pathogenesis of progressive renal allograft injury, which is termed chronic allograft nephropathy (CAN), remains obscure and is currently defined by histology. Prospective protocol-biopsy trials have demonstrated that clinical and standard laboratory tests are insufficiently sensitive indicators of the development and progression of CAN. The study aim was to determine if CAN could be characterized by urinary proteomic data and identify the proteins associated with disease. The urinary proteome of 75 renal transplant recipients and 20 healthy volunteers was analyzed using surface enhanced laser desorption and ionization MS. Patients could be classified into subgroups with normal histology and Banff CAN grades 2-3 with a sensitivity of 86% and a specificity of 92% by applying the classification algorithm Adaboost to urinary proteomic data. Several urinary proteins associated with advanced CAN were identified including α1-microglobulin, β2-microglobulin, prealbumin, and endorepellin, the antiangiogenic C-terminal fragment of perlecan. Increased urinary endorepellin was confirmed by ELISA and increased tissue expression of the endorepellin/perlecan ratio by immunofluoresence analysis of renal biopsies. In conclusion, analysis of urinary proteomic data has further characterized the more severe CAN grades and identified urinary endorepellin, as a potential biomarker of advanced CAN.     

Analysis of temporal jitter in a copper vapor laser system

Temporal jitter in a magnetic pulse compression based copper vapor laser (CVL) system is analyzed by considering ripple present in the input dc power supply and ripple present in the magnetic core resetting power supply. It is shown that the jitter is a function of the ratio of operating voltage to the designed voltage, percentage ripple, and the total propagation delay of the magnetic pulse compression circuit. Experimental results from a CVL system operating at a repetition rate of 9 kHz are presented.     

Enhanced abstract data types in object-relational databases

The explosion in complex multimedia content makes it crucial for database systems to support such data efficiently. This paper argues that the “blackbox” ADTs used in current object-relational systems inhibit their performance, thereby limiting their use in emerging applications. Instead, the next generation of object-relational database systems should be based on enhanced abstract data type (E-ADT) technology. An (E-ADT) can expose the semantics of its methods to the database system, thereby permitting advanced query optimizations. Fundamental architectural changes are required to build a database system with E-ADTs; the added functionality should not compromise the modularity of data types and the extensibility of the type system. The implementation issues have been explored through the development of E-ADTs in Predator. Initial performance results demonstrate an order of magnitude in performance improvements. Received January 1, 1998 / Accepted May 27, 1998     

Deep packet inspection using parallel bloom filters

There is a class of packet processing applications that inspect packets deeper than the protocol headers to analyze content. For instance, network security applications must drop packets containing certain malicious Internet worms or computer viruses carried in a packet payload. Content forwarding applications look at the hypertext transport protocol headers and distribute the requests among the servers for load balancing. Packet inspection applications, when deployed at router ports, must operate at wire speeds. With networking speeds doubling every year, it is becoming increasingly difficult for software-based packet monitors to keep up with the line rates. We describe a hardware-based technique using Bloom filters, which can detect strings in streaming data without degrading network throughput. A Bloom filter is a data structure that stores a set of signatures compactly by computing multiple hash functions on each member of the set. This technique queries a database of strings to check for the membership of a particular string. The answer to this query can be false positive but never a false negative. An important property of this data structure is that the computation time involved in performing the query is independent of the number of strings in the database provided the memory used by the data structure scales linearly with the number of strings stored in it. Furthermore, the amount of storage required by the Bloom filter for each string is independent of its length.