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.
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.
14511860
Index for fast retrieval of uncertain spatial point data
Location information gathered from a variety of sources in the form of sensor data, video streams, human observations, and so on, is often imprecise and uncertain and needs to be represented approximately. To represent such uncertain location information, the use of a probabilistic model that captures the imprecise location as a probability density function (pdf) has been recently proposed. The pdfs can be arbitrarily complex depending on the type of application and the source of imprecision. Hence, efficiently representing, storing and querying pdfs is a very challenging task. While the current state of the art indexing approaches treat the representation and storage of pdfs as a black box, in this paper, we take the challenge of representing and storing any complex pdf in an efficient way. We further develop techniques to index such pdfs to support the efficient processing of location queries. Our extensive experiments demonstrate that our indexing techniques significantly outperform the best existing solutions.
2268413
Web object retrieval
The primary function of current Web search engines is essentially relevance ranking at the document level. However, myriad structured information about real-world objects is embedded in static Web pages and online Web databases. Document-level information retrieval can unfortunately lead to highly inaccurate relevance ranking in answering object-oriented queries. In this paper, we propose a paradigm shift to enable searching at the object level. In traditional information retrieval models, documents are taken as the retrieval units and the content of a document is considered reliable. However, this reliability assumption is no longer valid in the object retrieval context when multiple copies of information about the same object typically exist. These copies may be inconsistent because of diversity of Web site qualities and the limited performance of current information extraction techniques. If we simply combine the noisy and inaccurate attribute information extracted from different sources, we may not be able to achieve satisfactory retrieval performance. In this paper, we propose several language models for Web object retrieval, namely an unstructured object retrieval model, a structured object retrieval model, and a hybrid model with both structured and unstructured retrieval features. We test these models on a paper search engine and compare their performances. We conclude that the hybrid model is the superior by taking into account the extraction errors at varying levels.
8131766
Segmentation of a piece-wise planar scene from perspective images
We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of different homographies can be embedded in different ways to a higher-dimensional real or complex space, so that each homography corresponds to either a complex bilinear form or a real quadratic form. Each embedding reveals different algebraic properties and relations of homographies. We give a closed-form segmentation solution for each case by utilizing these properties based on subspace-segmentation methods. These theoretical results show that one can intrinsically segment a piece-wise planar scene from 2-D images without explicitly performing any 3-D reconstruction. The resulting segmentation may make subsequent 3-D reconstruction much better-conditioned. We demonstrate the proposed methods with some convincing experimental results.
33501253
A design analysis model for developing world wide web sites
This study applies reader-response criticism to examine the relationship between and among designers, text, and users of the Galter Health Sciences Library Web site. It asks such questions as "How do Web site designers construct their subject?" or, "whom do the web designers think their users are?" The study ascertains the intentions of the designers of the GHSL Web site; examines the meanings made by the users through interviews; compares the similarities and differences of designers' intentions with their organization of knowlege represented in the GHSL Web site; and compares the similarities and differences between the designers' intentions and views of the users.
43689222
Symmetry-based photo-editing
In this paper, we demonstrate how to edit digital photos based on the understanding of high-level geometric knowledge imposed upon objects in the photos. This is achieved by the correct recovery of the 3-D shape and relationships of the objects, without explicitly performing full 3-D reconstruction. Symmetry is proposed as the central notion that unifies both conceptually and algorithmically all types of geometric regularities such as parallelism, orthogonality, and similarity. The methods are extremely simple, accurate, easy to implement, and they demonstrate the utility of applying scene knowledge to image understanding and editing.
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.