9927329
CAMAS: a citizen awareness system for crisis mitigation
1 ITR-Rescue, 5251 California Avenue, Suite 210, Irvine CA 92612-2815, Phone: 949-824-1147 http://www.itr-rescue.org 2 Union Bank Building, 400 Oceangate, Suite 1050, Long Beach CA 90802 Phone: 562-628-1675, http://imagecatinc.com ABSTRACT This demo paper provides a brief description of the intuition and design philosophy of CAMAS, one of the main testbeds being developed in the context of the RESCUE (Responding to the Unexpected) project [9]. The goal of our work is to enhance the mitigation capabilities of first responders in the event of a crisis by dramatically transforming their ability to collect, store, analyze, interpret, share and disseminate data. CAMAS specifically is a system designed to allow a variety of users, including the average citizen to report incidents and potentially hazardous situations, analyze and evaluate these reports and notify appropriate personnel for further action. The multidisciplinary approach incorporates a variety of information technologies: networks; distributed systems; databases; image and video processing; GIS; and machine learning, together with subjective information obtained through social science. Besides providing an overview of the CAMAS architecture, we describe the demonstration platform and specific experiments that will illustrate issues of event extraction, ranking, access control and visualization.
1599574
Interactive Refinement of Filtering Queries on Streaming Intelligence Data
Intelligence analysis involves routinely monitoring and correlating large amount of data streaming from multiple sources. In order to detect important patterns, the analyst normally needs to look at data gathered over a certain time window. Given the size of data and rate at which it arrives, it is usually impossible to manually process every record or case. Instead, automated filtering (classification) mechanisms are employed to identify information relevant to the analyst’s task. In this paper, we present a novel system framework called FREESIA (Filter REfinement Engine for Streaming InformAtion) to effectively generate, utilize and update filtering queries on streaming data.
1012168
SAT: Spatial Awareness from Textual Input
Recent events (WTC attacks, Southeast Asia Tsunamis, Hurricane Katrina, London bombings) have illustrated the need for accurate and timely situational awareness tools in emergency response. Developing effective situational awareness (SA) systems has the potential to radically improve decision support in crises by improving the accuracy and reliability of the information available to the decision-makers. In an evolving crisis, raw situational information comes from a variety of sources in the form of situational reports, live radio transcripts, sensor data, video streams. Much of the data resides (or can be converted) in the form of free text, from which events of interest are extracted. Spatial or location information is one of the fundamental attributes of the events, and is useful for a variety of situational awareness (SA) tasks.
9332901
On-Demand Information Portals for Disaster Situations
This paper describes our work on developing technology for rapidly assembling information portals that provide integrated access to and analysis of information from multiple sources in the case of any disaster. Many recent disasters (the S.E. Asian Tsunamis, the London subway bombings, the Katrina hurricane, to name a few) have demonstrated that a lot of valuable information becomes available in the hours and days immediately following the disaster, and such information is indeed valuable to disaster managers or even citizens in their response. In this paper we describe our work on developing information portals for disasters in general; we describe many key information processing capabilities and challenges that we consider important in such portals and also describe our approach to developing such capabilities.
14652056
A framework for refining similarity queries using learning techniques
In numerous applications that deal with similarity search, a user may not have an exact idea of his information need and/or may not be able to construct a query that exactly captures his notion of similarity. A promising approach to mitigate this problem is to enable the user to submit a rough approximation of the desired query and use the feedback on the relevance of the retrieved objects to refine the query. In this paper, we explore such a refinement strategy for a general class of SQL similarity queries. Our approach casts the refinement problem as that of learning concepts using examples. This is achieved by viewing the tuples on which a user provides feedback as a labeled training set for a learner. Under this setup, SQL query refinement consists of two learning tasks, namely learning the structure of the SQL query and learning the relative importance of the query components. The paper develops appropriate machine learning approaches suitable for these two learning tasks. The primary contribution of the paper is a general refinement framework that decides when each learner is invoked in order to quickly learn the user query. Experimental analyses over many real life datasets and queries show that our strategy outperforms the existing approaches significantly in terms of retrieval accuracy and query simplicity.
42056704
RAF: An Activation Framework for Refining Similarity Queries Using Learning Techniques
In numerous applications that deal with similarity search, a user may not have an exact specification of his information need and/or may not be able to formulate a query that exactly captures his notion of similarity. A promising approach to mitigate this problem is to enable the user to submit a rough approximation of the desired query and use relevance feedback on retrieved objects to refine the query. In this paper, we explore such a refinement strategy for a general class of structured similarity queries. Our approach casts the refinement problem as that of learning concepts using the tuples on which the user provides feedback as a labeled training set. Under this setup, similarity query refinement consists of two learning tasks: learning the structure of the query and learning the relative importance of query components. The paper develops machine learning approaches suitable for the two learning tasks. The primary contribution of the paper is the Refinement Activation Framework (RAF) that decides when each learner is invoked. Experimental analysis over many real life datasets shows that our strategy significantly outperforms existing approaches in terms of retrieval quality.
696914
Generalized principal component analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represent the subspaces with a set of homogeneous polynomials whose degree is the number of subspaces and whose derivatives at a data point give normal vectors to the subspace passing through the point. When the number of subspaces is known, we show that these polynomials can be estimated linearly from data; hence, subspace segmentation is reduced to classifying one point per subspace. We select these points optimally from the data set by minimizing certain distance function, thus dealing automatically with moderate noise in the data. A basis for the complement of each subspace is then recovered by applying standard PCA to the collection of derivatives (normal vectors). Extensions of GPCA that deal with data in a high-dimensional space and with an unknown number of subspaces are also presented. Our experiments on low-dimensional data show that GPCA outperforms existing algebraic algorithms based on polynomial factorization and provides a good initialization to iterative techniques such as k-subspaces and expectation maximization. We also present applications of GPCA to computer vision problems such as face clustering, temporal video segmentation, and 3D motion segmentation from point correspondences in multiple affine views.
13886373
A multiscale hybrid linear model for lossy image representation
This paper introduces a simple and efficient representation for natural images. We partition an image into blocks and treat the blocks as vectors in a high-dimensional space. We then fit a piecewise linear model (i.e. a union of affine subspaces) to the vectors at each down-sampling scale. We call this a multiscale hybrid linear model of the image. The hybrid and hierarchical structure of this model allows us effectively to extract and exploit multimodal correlations among the imagery data at different scales. It conceptually and computationally remedies limitations of many existing image representation methods that are based on either a fixed linear transformation (e.g. DCT, wavelets), an adaptive unimodal linear transformation (e.g. PCA), or a multi-modal model at a single scale. We will justify both analytically and experimentally why and how such a simple multiscale hybrid model is able to reduce simultaneously the model complexity and computational cost. Despite a small overhead for the model, our results show that this new model gives more compact representations for a wide variety of natural images under a wide range of signal-to-noise ratio than many existing methods, including wavelets.
7391513
Asymptotic performance of hybrid-selection/maximal-ratio combining over fading channels
In this letter, we study the asymptotic performance of hybrid-selection/maximal-ratio combining (HS/MRC) and postdetection HS/equal-gain combining (HS/EGC) over generalized fading channels for large average signal-to-noise ratios (ASNRs). By evaluating the asymptotic moment generating function of the HS/MRC output SNR at high ASNR, we derive the diversity and coding gains for HS/MRC for a large class of modulation formats and versatile fading conditions, including different types of fading channels and nonidentical SNR statistics across diversity branches. Our analytical results reveal that the diversity gains of HS/MRC and HS/EGC are equivalent to that of MRC, and the difference in the coding gains for different modulation formats is manifested in terms of a modulation factor defined in this letter. Some new analytical results about effects of the number of combined branches for HS/MRC and noncoherent combining loss of HS/EGC are also provided.
61335921
Minimum effective dimension for mixtures of subspaces: a robust GPCA algorithm and its applications
We propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection criteria typically assume that data can be modelled with a parametric model of certain (possibly differing) dimension and a known error distribution. However, for mixtures of subspaces with different dimensions, a generalized notion of dimensionality is needed and hence introduced in this paper. The proposed MED criterion minimizes this geometric dimension subject to a given error tolerance (regardless of the noise distribution). Furthermore, combined with a purely algebraic approach to clustering mixtures of subspaces, namely the generalized PCA (GPCA), the MED is designed to also respect the global algebraic and geometric structure of the data. The result is a non-iterative algorithm called robust GPCA that estimates from noisy data an unknown number of subspaces with unknown and possibly different dimensions subject to a maximum error bound. We test the algorithm on synthetic noisy data and in applications such as motion/image/video segmentation.
17940922
Symmetry-based 3-D reconstruction from perspective images
Symmetry is an important geometric cue for 3-D reconstruction from perspective images. In this paper, we introduce a unified theoretical framework for extracting poses and structures of 2-D symmetric patterns in space from calibrated images. The framework uniformly encompasses all three fundamental types of symmetry, i.e., reflective, rotational, and translational, based on a systematic study of the homography groups in image induced by the symmetry groups in space. We claim that if a planar object admits rich enough symmetry, no 3-D geometric information is lost through perspective imaging. Based on two fundamental principles that utilize common spatial relations among symmetric objects, we have developed a prototype system which can automatically extract and segment multiple 2-D symmetric patterns present in a single perspective image. The result of such a segmentation is a hierarchy of new geometric primitives, called symmetry cells and complexes, whose 3-D structures and poses are fully recovered. Finally, we propose a new symmetry-based matching technique, which can effectively establish correspondences among the extracted symmetry cells across multiple images. We demonstrate the application of the proposed algorithms on image segmentation, matching, and 3-D reconstruction with extensive experimental results. The algorithms and systems are more accurate and easier to implement than existing point-or line-based methods.