@article {20298, title = {Virulence-Related Genes Identified from the Genome Sequence of the Non-O1/Non-O139 Vibrio cholerae Strain VcN1, Isolated from Dhaka, Bangladesh}, journal = {Genome Announcements}, year = {2018}, month = {Aug-03-2018}, abstract = {We report here the first draft genome sequence of the non-O1/non-O139 Vibrio cholerae strain VcN1, isolated from Dhaka, Bangladesh. The data submitted to GenBank for this strain will contribute to advancing our understanding of this environmentally disseminated bacterium, including its virulence and its evolution as an important pathogen.}, doi = {10.1128/genomeA.01513-17}, url = {https://mra.asm.org/content/6/10/e01513-17}, author = {Hossain, Maqsud and Alam, Munirul and Khaleque, Abdul and Islam, Sohidul and Sadique, Abdus and Khan, Nayeim and Halim, Zahra and Sarker, Mrinmoy and El-Sayed, Najib M. and Huq, Anwar and Ahsan, Gias Uddin and Rita R Colwell} } @article {20360, title = {Validation of high throughput sequencing and microbial forensics applications}, journal = {Investigative Genetics}, volume = {5}, year = {2014}, month = {Jan-01-2014}, pages = {9}, abstract = {High throughput sequencing (HTS) generates large amounts of high quality sequence data for microbial genomics. The value of HTS for microbial forensics is the speed at which evidence can be collected and the power to characterize microbial-related evidence to solve biocrimes and bioterrorist events. As HTS technologies continue to improve, they provide increasingly powerful sets of tools to support the entire field of microbial forensics. Accurate, credible results allow analysis and interpretation, significantly influencing the course and/or focus of an investigation, and can impact the response of the government to an attack having individual, political, economic or military consequences. Interpretation of the results of microbial forensic analyses relies on understanding the performance and limitations of HTS methods, including analytical processes, assays and data interpretation. The utility of HTS must be defined carefully within established operating conditions and tolerances. Validation is essential in the development and implementation of microbial forensics methods used for formulating investigative leads attribution. HTS strategies vary, requiring guiding principles for HTS system validation. Three initial aspects of HTS, irrespective of chemistry, instrumentation or software are: 1) sample preparation, 2) sequencing, and 3) data analysis. Criteria that should be considered for HTS validation for microbial forensics are presented here. Validation should be defined in terms of specific application and the criteria described here comprise a foundation for investigators to establish, validate and implement HTS as a tool in microbial forensics, enhancing public safety and national security.}, issn = {2041-2223}, doi = {10.1186/2041-2223-5-9}, url = {http://investigativegenetics.biomedcentral.com/articles/10.1186/2041-2223-5-9}, author = {Budowle, Bruce and Connell, Nancy D and Bielecka-Oder, Anna and Rita R Colwell and Corbett, Cindi R and Fletcher, Jacqueline and Forsman, Mats and Kadavy, Dana R and Markotic, Alemka and Morse, Stephen A and Murch, Randall S and Sajantila, Antti and Schmedes, Sarah E and Ternus, Krista L and Turner, Stephen D and Minot, Samuel} } @article {20366, title = {Viewing Marine Bacteria, Their Activity and Response to Environmental Drivers from Orbit}, journal = {Microbial Ecology}, year = {2014}, month = {Jan-04-2014}, pages = {489 - 500}, abstract = {Satellite-based remote sensing of marine microorganisms has become a useful tool in predicting human health risks associated with these microscopic targets. Early applications were focused on harmful algal blooms, but more recently methods have been developed to interrogate the ocean for bacteria. As satellite-based sensors have become more sophisticated and our ability to interpret information derived from these sensors has advanced, we have progressed from merely making fascinating pictures from space to developing process models with predictive capability. Our understanding of the role of marine microorganisms in primary production and global elemental cycles has been vastly improved as has our ability to use the combination of remote sensing data and models to provide early warning systems for disease outbreaks. This manuscript will discuss current approaches to monitoring cyanobacteria and vibrios, their activity and response to environmental drivers, and will also suggest future directions.}, issn = {0095-3628}, doi = {10.1007/s00248-013-0363-4}, url = {http://link.springer.com/10.1007/s00248-013-0363-4}, author = {Grimes, D. Jay and Ford, Tim E. and Rita R Colwell and Baker-Austin, Craig and Martinez-Urtaza, Jaime and Subramaniam, Ajit and Capone, Douglas G.} } @article {19618, title = {Verifying Search Results Over Web Collections}, journal = {arXiv:1204.5446 [cs]}, year = {2012}, month = {2012/04/24/}, abstract = {Searching accounts for one of the most frequently performed computations over the Internet as well as one of the most important applications of outsourced computing, producing results that critically affect users{\textquoteright} decision-making behaviors. As such, verifying the integrity of Internet-based searches over vast amounts of web contents is essential. We provide the first solution to this general security problem. We introduce the concept of an authenticated web crawler and present the design and prototype implementation of this new concept. An authenticated web crawler is a trusted program that computes a special "signature" $s$ of a collection of web contents it visits. Subject to this signature, web searches can be verified to be correct with respect to the integrity of their produced results. This signature also allows the verification of complicated queries on web pages, such as conjunctive keyword searches. In our solution, along with the web pages that satisfy any given search query, the search engine also returns a cryptographic proof. This proof, together with the signature $s$, enables any user to efficiently verify that no legitimate web pages are omitted from the result computed by the search engine, and that no pages that are non-conforming with the query are included in the result. An important property of our solution is that the proof size and the verification time both depend solely on the sizes of the query description and the query result, but not on the number or sizes of the web pages over which the search is performed. Our authentication protocols are based on standard Merkle trees and the more involved bilinear-map accumulators. As we experimentally demonstrate, the prototype implementation of our system gives a low communication overhead between the search engine and the user, and allows for fast verification of the returned results on the user side.}, keywords = {Computer Science - Cryptography and Security}, url = {http://arxiv.org/abs/1204.5446}, author = {Goodrich, Michael T. and Nguyen, Duy and Ohrimenko, Olga and Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikos and Lopes, Cristina Videira} } @article {14412, title = {Value of information lattice: exploiting probabilistic independence for effective feature subset acquisition}, journal = {Journal of Artificial Intelligence Research}, volume = {41}, year = {2011}, month = {2011/05//}, pages = {69 - 95}, abstract = {We address the cost-sensitive feature acquisition problem, where misclassifying an instance is costly but the expected misclassification cost can be reduced by acquiring the values of the missing features. Because acquiring the features is costly as well, the objective is to acquire the right set of features so that the sum of the feature acquisition cost and misclassification cost is minimized. We describe the Value of Information Lattice (VOILA), an optimal and eficient feature subset acquisition framework. Unlike the common practice, which is to acquire features greedily, VOILA can reason with subsets of features. VOILA eficiently searches the space of possible feature subsets by discovering and exploiting conditional independence properties between the features and it reuses probabilistic inference computations to further speed up the process. Through empirical evaluation on five medical datasets, we show that the greedy strategy is often reluctant to acquire features, as it cannot forecast the benefit of acquiring multiple features in combination.}, isbn = {1076-9757}, url = {http://dl.acm.org/citation.cfm?id=2051237.2051240}, author = {Bilgic,Mustafa and Getoor, Lise} } @conference {12445, title = {Variable remapping of images from very different sources}, booktitle = {2011 18th IEEE International Conference on Image Processing (ICIP)}, year = {2011}, month = {2011/09/11/14}, pages = {1501 - 1504}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present a system which registers image sequences acquired by very different sources, so that multiple views could be transformed to the same coordinates system. This enables the functionality of automatic object identification and confirmation across views and platforms. The capability of the system comes from three ingredients: 1) image context enlargement through temporal integration; 2) robust motion estimation using the G-RANSAC framework with a relaxed correspondence criteria; 3) constrained motion estimation within the G-RANSAC framework. The proposed system has worked successfully on thousands of frames from multiple collections with significant variations in scale and resolution.}, keywords = {automatic object identification, Buildings, CAMERAS, Conferences, constrained motion estimation, coordinates system, Estimation, G-RANSAC framework, image context enlargement, Image Enhancement, image registration, image sequence registration, Image sequences, Motion estimation, Robustness, temporal integration, variable image remapping}, isbn = {978-1-4577-1304-0}, doi = {10.1109/ICIP.2011.6115729}, author = {Wei Zhang and Yanlin Guo and Meth, R. and Sokoloff, H. and Pope, A. and Strat, T. and Chellapa, Rama} } @conference {19259, title = {Vectorization and mapping of software defined radio applications on heterogeneous multi-processor platforms}, booktitle = {2011 IEEE Workshop on Signal Processing Systems (SiPS)}, year = {2011}, month = {2011}, pages = {31 - 36}, abstract = {A variety of multiprocessor architectures have proliferated even for off-the-shelf computing platforms. To improve performance and productivity for common heterogeneous systems, we have developed a workflow to generate efficient solutions. By starting with a formal description of an application and the mapping problem we are able to generate a range of designs that efficiently trade-of latency and throughput. In this approach, efficient utilization of SIMD cores is achieved by applying extensive block processing in conjunction with efficient mapping and scheduling. We demonstrate our approach through an integration into the GNU Radio environment for software defined radio system design.}, keywords = {Benchmark testing, block processing, Design methodology, formal description, GNU radio environment, Graphic Processor Unit, Graphics processing unit, heterogeneous multiprocessor platform, mapping problem, Multicore processing, Multiprocessing systems, multiprocessor architecture, multiprocessor scheduling, operating systems (computers), PARALLEL PROCESSING, Processor scheduling, Schedules, SIMD core, Software Defined Radio, software defined radio system design, software radio, telecommunication computing, Throughput, vectorization, workflow}, author = {Zaki, G.F. and Plishker,W. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.} } @article {13076, title = {Vehicle Detection Using Partial Least Squares}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {33}, year = {2011}, month = {2011/06//}, pages = {1250 - 1265}, abstract = {Detecting vehicles in aerial images has a wide range of applications, from urban planning to visual surveillance. We describe a vehicle detector that improves upon previous approaches by incorporating a very large and rich set of image descriptors. A new feature set called Color Probability Maps is used to capture the color statistics of vehicles and their surroundings, along with the Histograms of Oriented Gradients feature and a simple yet powerful image descriptor that captures the structural characteristics of objects named Pairs of Pixels. The combination of these features leads to an extremely high-dimensional feature set (approximately 70,000 elements). Partial Least Squares is first used to project the data onto a much lower dimensional subspace. Then, a powerful feature selection analysis is employed to improve the performance while vastly reducing the number of features that must be calculated. We compare our system to previous approaches on two challenging data sets and show superior performance.}, keywords = {aerial images;color probability maps;oriented gradients feature;partial least squares;powerful feature selection analysis;urban planning;vehicle detection;visual surveillance;gradient methods;image colour analysis;least squares approximations;road vehicle, Automated;}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2010.182}, author = {Kembhavi,A. and Harwood,D. and Davis, Larry S.} } @conference {17484, title = {Visual Analysis of Temporal Trends in Social Networks Using Edge Color Coding and Metric Timelines}, booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)}, year = {2011}, month = {2011/10/09/11}, pages = {549 - 554}, publisher = {IEEE}, organization = {IEEE}, abstract = {We present Net EvViz, a visualization tool for analysis and exploration of a dynamic social network. There are plenty of visual social network analysis tools but few provide features for visualization of dynamically changing networks featuring the addition or deletion of nodes or edges. Our tool extends the code base of the Node XL template for Microsoft Excel, a popular network visualization tool. The key features of this work are (1) The ability of the user to specify and edit temporal annotations to the network components in an Excel sheet, (2) See the dynamics of the network with multiple graph metrics plotted over the time span of the graph, called the Timeline, and (3) Temporal exploration of the network layout using an edge coloring scheme and a dynamic Time slider. The objectives of the new features presented in this paper are to let the data analysts, computer scientists and others to observe the dynamics or evolution in a network interactively. We presented Net EvViz to five users of Node XL and received positive responses.}, keywords = {Color, computer scientists, data analysts, data visualisation, Data visualization, dynamic social network, dynamic timeslider, edge color coding, excel sheet, Image coding, image colour analysis, Layout, measurement, metric timelines, Microsoft excel, multiple graph metrics, Net EvViz, network components, network layout, network visualization tool, NodeXL template, social networking (online), temporal trends, Twitter, Visualization}, isbn = {978-1-4577-1931-8}, doi = {10.1109/PASSAT/SocialCom.2011.212}, author = {Khurana,U. and Nguyen,Viet-An and Hsueh-Chien Cheng and Ahn,Jae-wook and Chen,Xi and Shneiderman, Ben} } @article {17487, title = {Visual Exploration across Biomedical Databases}, journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, year = {2011}, month = {2011/04//March}, pages = {536 - 550}, abstract = {Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration.}, keywords = {Bioinformatics, Biomedical computing, biomedical databases, cross-database exploration, Data exploration and discovery, Data visualization, database management systems, Databases, Factual, DNA, graph theory, Information Storage and Retrieval, information visualization., Keyword search, medical computing, natural language processing, Proteins, semantic networks, semantics, sequences, text mining, User-Computer Interface, user-defined semantics, visual databases}, isbn = {1545-5963}, doi = {10.1109/TCBB.2010.1}, author = {Lieberman,M.D. and Taheri, S. and Guo,Huimin and Mirrashed,F. and Yahav,I. and Aris,A. and Shneiderman, Ben} } @conference {14274, title = {Visual Scene Interpretation as a Dialogue between Vision and Language}, booktitle = {Workshops at the Twenty-Fifth AAAI Conference on Artificial Intelligence}, year = {2011}, month = {2011/08/24/}, abstract = {We present a framework for semantic visual scene interpretation in a system with vision and language. In this framework the system consists of two modules, a language module and a vision module that communicate with each other in a form of a dialogue to actively interpret the scene. The language module is responsible for obtaining domain knowledge from linguistic resources and reasoning on the basis of this knowledge and the visual input. It iteratively creates questions that amount to an attention mechanism for the vision module which in turn shifts its focus to selected parts of the scene and applies selective segmentation and feature extraction. As a formalism for optimizing this dialogue we use information theory. We demonstrate the framework on the problem of recognizing a static scene from its objects and show preliminary results for the problem of human activity recognition from video. Experiments demonstrate the effectiveness of the active paradigm in introducing attention and additional constraints into the sensing process.}, url = {http://www.aaai.org/ocs/index.php/WS/AAAIW11/paper/viewPaper/3989}, author = {Yu,Xiaodong and Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {16035, title = {Visualizing Missing Data: Graph Interpretation User Study}, journal = {IFIP Lecture Notes in Computer Science (LNCS)}, volume = {3585}, year = {2011}, month = {2011/03/31/}, pages = {861 - 872}, abstract = {Visualizing Missing Data: Graph Interpretation User Study}, url = {http://dl.ifip.org/index.php/lncs/article/view/25927}, author = {Drizd,Terence and Eaton,Cyntrica and Plaisant, Catherine} } @article {13030, title = {Validating the systematic position of {\i}t Plationus Segers, Murugan \& Dumont, 1993 (Rotifera: Brachionidae) using sequences of the large subunit of the nuclear ribosomal DNA and of cytochrome C oxidase}, journal = {Hydrobiologia}, volume = {644}, year = {2010}, month = {2010/05//}, pages = {361 - 370}, abstract = {Members of the family Brachionidae are free-living organisms that range in size from 170 to 250 microns. They comprise part of the zooplankton in freshwater and marine systems worldwide. Morphologically, members of the family are characterized by a single piece loricated body without furrows, grooves, sulci or dorsal head shields, and a malleate trophi. Differences in these structures have been traditionally used to recognize 217 species that are classified into seven genera. However, the validity of the species, Plationus patulus, P. patulus macracanthus P. polyacanthus, and P. felicitas have been confused because they were alternatively assigned in Brachionus or Platyias, when considering only morphological and ecological characters. Based on scanning electron microscope (SEM) images of the trophi, these taxa were assigned in a new genus, Plationus. In this study, we examined the systematic position of P. patulus and P. patulus macracanthus using DNA sequences of two genes: the cytochrome oxidase subunit 1 (cox1) and domains D2 and D3 of the large subunit of the nuclear ribosomal RNA (LSU). In addition, the cox1 and LSU sequences representing five genera of Brachionidae (Anuraeopsis, Brachionus, Keratella, Plationus, and Platyias) plus four species of three families from the order Ploima were used as the outgroup. The maximum likelihood (ML) analyses were conducted for each individual gene as well as for the combined (cox1 + LSU) data set. The ML tree from the combined data set yielded the family Brachionidae as a monophyletic group with weak bootstrap support (< 50\%). Five main clades in this tree had high (> 85\%) bootstrap support. The first clade was composed of three populations of P. patulus + P. patulus macracanthus. The second clade was composed of a single species of Platyias. The third clade was composed of six species of Brachionus. The fourth clade included a single species of the genus Anuraeopsis, and the fifth clade was composed of three species of the genus Keratella. The genetic divergence between Plationus and Platyias ranged from 18.4 to 19.2\% for cox1, and from 4.5 to 4.9\% for LSU, and between Brachionus and Plationus, it ranged from 16.9 to 23.1\% (cox1), and from 7.3 to 9.1\% (LSU). Morphological evidence, the amount of genetic divergence, the systematic position of Plationus within the family Brachionidae, and the position of Plationus as a sister group of Brachionus and Platyias support the validity of Plationus patulus and P. patulus macracanthus into the genus Plationus.}, keywords = {Cox1;, likelihood;, LSU;, maximum, Phylogeny, Plationus;}, doi = {DOI 10.1007/s10750-010-0203-1}, author = {Reyna-Fabian,ME and Laclette,J. P and Cummings, Michael P. and Garc{\'\i}a-Varela,M} } @conference {15862, title = {Values of Stakeholders in the Net Neutrality Debate: Applying Content Analysis to Telecommunications Policy}, booktitle = {Hawaii International Conference on System Sciences}, year = {2010}, month = {2010///}, pages = {1 - 10}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {Net neutrality is an important telecommunications policy debate. This debate is closely tied to technological innovation, economic development, and information access. Values help shape stakeholders{\textquoteright} positions on this debate. This paper examines the role of values in shaping the Net neutrality debate through a content analysis of public hearings on Net neutrality. The paper presents a quantitative analysis that reveals the top values implicated in the Net neutrality debate and statistically significant differences among individuals on opposite sides of the Net neutrality debate. A qualitative analysis reveals insights into the connection between specific values and positions on the Net neutrality debate. The paper concludes that values, technology, and policy are interconnected, and that it is useful to understand the values of the various stakeholders within policy debates.}, isbn = {978-0-7695-3869-3}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.2010.434}, author = {Cheng,An-Shou and Fleischmann,Kenneth R. and Wang,Ping and Ishita,Emi and Oard, Douglas} } @conference {16047, title = {VAST 2010 Challenge: Arms dealings and pandemics}, booktitle = {Visual Analytics Science and Technology (VAST), 2010 IEEE Symposium on}, year = {2010}, month = {2010/10//}, pages = {263 - 264}, abstract = {The 5th VAST Challenge consisted of three mini-challenges that involved both intelligence analysis and bioinformatics. Teams could solve one, two or all three mini-challenges and assess the overall situation to enter the Grand Challenge. Mini-challenge one involved text reports about people and events giving information about arms dealers, situations in various countries and linkages between different countries. Mini-challenge two involved hospital admission and death records from various countries providing information about the spread of a world wide pandemic. Mini-challenge three involved genetic data to be used to identify the origin of the pandemic and the most dangerous viral mutations. The Grand Challenge was to determine how these various mini-challenges were connected. As always the goal was to analyze the data and provide novel interactive visualizations useful in the analytic process. We received 58 submissions in total and gave 15 awards.}, keywords = {2010, administrative, admission;intelligence, analysis;interactive, analysis;medical, challenge;arms, challenge;hospital, data, data;grand, dealings;bioinformatics;dangerous, mutations;death, processing;weapons;, records;genetic, reports;bioinformatics;data, VAST, viral, visualizations;minichallenge;pandemics;text}, doi = {10.1109/VAST.2010.5649054}, author = {Grinstein,G. and Konecni,S. and Scholtz,J. and Whiting,M. and Plaisant, Catherine} } @article {12478, title = {Video Metrology Using a Single Camera}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {32}, year = {2010}, month = {2010/07//}, pages = {1329 - 1335}, abstract = {This paper presents a video metrology approach using an uncalibrated single camera that is either stationary or in planar motion. Although theoretically simple, measuring the length of even a line segment in a given video is often a difficult problem. Most existing techniques for this task are extensions of single image-based techniques and do not achieve the desired accuracy especially in noisy environments. In contrast, the proposed algorithm moves line segments on the reference plane to share a common endpoint using the vanishing line information followed by fitting multiple concentric circles on the image plane. A fully automated real-time system based on this algorithm has been developed to measure vehicle wheelbases using an uncalibrated stationary camera. The system estimates the vanishing line using invariant lengths on the reference plane from multiple frames rather than the given parallel lines, which may not exist in videos. It is further extended to a camera undergoing a planar motion by automatically selecting frames with similar vanishing lines from the video. Experimental results show that the measurement results are accurate enough to classify moving vehicles based on their size.}, keywords = {camera;vanishing, circles;uncalibrated, concentric, image-based, information;vehicle, line, measurement;video, metrology;cameras;image, processing;, segment;multiple, segmentation;video, signal, single, techniques;line, wheelbase}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2010.26}, author = {Guo,Feng and Chellapa, Rama} } @article {12464, title = {Video Pr{\'e}cis: Highlighting Diverse Aspects of Videos}, journal = {IEEE Transactions on Multimedia}, volume = {12}, year = {2010}, month = {2010/12//}, pages = {853 - 868}, abstract = {Summarizing long unconstrained videos is gaining importance in surveillance, web-based video browsing, and video-archival applications. Summarizing a video requires one to identify key aspects that contain the essence of the video. In this paper, we propose an approach that optimizes two criteria that a video summary should embody. The first criterion, {\textquotedblleft}coverage,{\textquotedblright} requires that the summary be able to represent the original video well. The second criterion, {\textquotedblleft}diversity,{\textquotedblright} requires that the elements of the summary be as distinct from each other as possible. Given a user-specified summary length, we propose a cost function to measure the quality of a summary. The problem of generating a précis is then reduced to a combinatorial optimization problem of minimizing the proposed cost function. We propose an efficient method to solve the optimization problem. We demonstrate through experiments (on KTH data, unconstrained skating video, a surveillance video, and a YouTube home video) that optimizing the proposed criterion results in meaningful video summaries over a wide range of scenarios. Summaries thus generated are then evaluated using both quantitative measures and user studies.}, keywords = {$K$-means, CAMERAS, combinatorial mathematics, combinatorial optimization, Cost function, data compression, Exemplar selection, Image segmentation, Internet, Iron, Length measurement, multimedia systems, Ncut, optimisation, Optimization methods, original video, Permission, shot segmentation, Surveillance, user specified summary length, video précis, Video sharing, video signal processing, Video summarization}, isbn = {1520-9210}, doi = {10.1109/TMM.2010.2058795}, author = {Shroff, N. and Turaga,P. and Chellapa, Rama} } @article {14757, title = {Viewpoint Adapting agile software development methodology toward more efficient management of academic research groups.}, journal = {Communications of the ACM}, volume = {53}, year = {2010}, month = {2010///}, pages = {30 - 30}, author = {Hicks, Michael W. and Foster, Jeffrey S.} } @conference {16051, title = {Visual information seeking in multiple electronic health records: design recommendations and a process model}, booktitle = {Proceedings of the 1st ACM International Health Informatics Symposium}, series = {IHI {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {46 - 55}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Current electronic health record (EHR) systems facilitate the storage, retrieval, persistence, and sharing of patient data. However, the way physicians interact with EHRs has not changed much. More specifically, support for temporal analysis of a large number of EHRs has been lacking. A number of information visualization techniques have been proposed to alleviate this problem. Unfortunately, due to their limited application to a single case study, the results are often difficult to generalize across medical scenarios. We present the usage data of Lifelines2,[22] our information visualization system, and user comments, both collected over eight different medical case studies. We generalize our experience into an information-seeking process model for multiple EHRs. Based on our analysis, we make recommendations to future information visualization designers for EHRs on design requirements and future research directions.}, keywords = {design requriements, electronic health records, human-computer interaction (hci), Information Visualization}, isbn = {978-1-4503-0030-8}, doi = {10.1145/1882992.1883001}, url = {http://doi.acm.org/10.1145/1882992.1883001}, author = {Wang,Taowei David and Wongsuphasawat,Krist and Plaisant, Catherine and Shneiderman, Ben} } @inbook {17503, title = {Visualizing Threaded Conversation Networks: Mining Message Boards and Email Lists for Actionable Insights}, booktitle = {Active Media TechnologyActive Media Technology}, series = {Lecture Notes in Computer Science}, volume = {6335}, year = {2010}, month = {2010///}, pages = {47 - 62}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Analyzing complex online relationships is a difficult job, but new information visualization tools are enabling a wider range of users to make actionable insights from the growing volume of online data. This paper describes the challenges and methods for conducting analyses of threaded conversations such as found in enterprise message boards, email lists, and forums. After defining threaded conversation, we characterize the types of networks that can be extracted from them. We then provide 3 mini case studies to illustrate how actionable insights for community managers can be gained by applying the network analysis metrics and visualizations available in the free, open source NodeXL tool, which is a powerful, yet easy-to-use tool embedded in Excel 2007/2010.}, isbn = {978-3-642-15469-0}, url = {http://dx.doi.org/10.1007/978-3-642-15470-6_7}, author = {Hansen,Derek and Shneiderman, Ben and Smith,Marc}, editor = {An,Aijun and Lingras,Pawan and Petty,Sheila and Huang,Runhe} } @conference {18355, title = {VizWiz: nearly real-time answers to visual questions}, booktitle = {Proceedings of the 23nd annual ACM symposium on User interface software and technology}, series = {UIST {\textquoteright}10}, year = {2010}, month = {2010///}, pages = {333 - 342}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {The lack of access to visual information like text labels, icons, and colors can cause frustration and decrease independence for blind people. Current access technology uses automatic approaches to address some problems in this space, but the technology is error-prone, limited in scope, and quite expensive. In this paper, we introduce VizWiz, a talking application for mobile phones that offers a new alternative to answering visual questions in nearly real-time - asking multiple people on the web. To support answering questions quickly, we introduce a general approach for intelligently recruiting human workers in advance called quikTurkit so that workers are available when new questions arrive. A field deployment with 11 blind participants illustrates that blind people can effectively use VizWiz to cheaply answer questions in their everyday lives, highlighting issues that automatic approaches will need to address to be useful. Finally, we illustrate the potential of using VizWiz as part of the participatory design of advanced tools by using it to build and evaluate VizWiz::LocateIt, an interactive mobile tool that helps blind people solve general visual search problems.}, keywords = {blind users, non-visual interfaces, real-time human computation}, isbn = {978-1-4503-0271-5}, doi = {10.1145/1866029.1866080}, url = {http://doi.acm.org/10.1145/1866029.1866080}, author = {Bigham,Jeffrey P. and Jayant,Chandrika and Ji,Hanjie and Little,Greg and Miller,Andrew and Miller,Robert C. and Miller,Robin and Tatarowicz,Aubrey and White,Brandyn and White,Samual and Tom Yeh} } @conference {18356, title = {VizWiz::LocateIt - enabling blind people to locate objects in their environment}, booktitle = {Computer Vision and Pattern Recognition Workshops (CVPRW), 2010 IEEE Computer Society Conference on}, year = {2010}, month = {2010/06//}, pages = {65 - 72}, publisher = {IEEE}, organization = {IEEE}, abstract = {Blind people face a number of challenges when interacting with their environments because so much information is encoded visually. Text is pervasively used to label objects, colors carry special significance, and items can easily become lost in surroundings that cannot be quickly scanned. Many tools seek to help blind people solve these problems by enabling them to query for additional information, such as color or text shown on the object. In this paper we argue that many useful problems may be better solved by directly modeling them as search problems, and present a solution called VizWiz::LocateIt that directly supports this type of interaction. VizWiz::LocateIt enables blind people to take a picture and ask for assistance in finding a specific object. The request is first forwarded to remote workers who outline the object, enabling efficient and accurate automatic computer vision to guide users interactively from their existing cellphones. A two-stage algorithm is presented that uses this information to guide users to the appropriate object interactively from their phone.}, isbn = {978-1-4244-7029-7}, doi = {10.1109/CVPRW.2010.5543821}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5543821}, author = {Bigham,Jeffrey P. and Jayant,Chandrika and Miller,Andrew and White,Brandyn and Tom Yeh} } @conference {12806, title = {Validating Automotive Control Software Using Instrumentation-Based Verification}, booktitle = {Automated Software Engineering, International Conference on}, year = {2009}, month = {2009///}, pages = {15 - 25}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, abstract = {This paper discusses the results of an application of a formally based verification technique, called Instrumentation-Based Verification (IBV), to a production automotive lighting controller. The goal of the study is to assess, from both a tools as well as a methodological perspective, the performance of IBV in an industrial setting. The insights obtained as a result of the project include a refinement of a previously developed architecture for requirements specifications; observations about changes to model-based design workflows; insights into the role of requirements during development; and the capability of automated verification to detect inconsistencies among requirements as well as between requirements and design models.}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASE.2009.98}, author = {Ray,Arnab and Morschhaeuser,Iris and Ackermann,Chris and Cleaveland, Rance and Shelton,Charles and Martin,Chris} } @conference {16058, title = {VAST 2009 challenge: An insider threat}, booktitle = {Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on}, year = {2009}, month = {2009/10//}, pages = {243 - 244}, abstract = {The 4th VAST Challenge centered on a cyber analytics scenario and offered three mini-challenges with datasets of badge and network traffic data, a social network including geospatial information, and security video. Teams could also enter the Grand challenge which combined all three datasets. In this paper, we summarize the dataset, the overall scenario and the questions asked in the challenges. We describe the judging process and new infrastructure developed to manage the submissions and compute accuracy measures in the social network mini challenge. We received 49 entries from 30 teams, and gave 23 different awards to a total of 16 teams.}, keywords = {2009, analytics;data, analytics;geospatial, challenge;cyber, data;security, information, information;human, interaction;network, interfaces;, network;visual, traffic, user, VAST, video;social, visualisation;graphical}, doi = {10.1109/VAST.2009.5334454}, author = {Grinstein,G. and Scholtz,J. and Whiting,M. and Plaisant, Catherine} } @article {12525, title = {Vehicle Speed Estimation Using Acoustic Wave Patterns}, journal = {Signal Processing, IEEE Transactions on}, volume = {57}, year = {2009}, month = {2009/01//}, pages = {30 - 47}, abstract = {We estimate a vehicle{\textquoteright}s speed, its wheelbase length, and tire track length by jointly estimating its acoustic wave pattern with a single passive acoustic sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave pattern is determined using the vehicle{\textquoteright}s speed, the Doppler shift factor, the sensor{\textquoteright}s distance to the vehicle{\textquoteright}s closest-point-of-approach, and three envelope shape (ES) components, which approximate the shape variations of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with estimates of the vehicle engine RPM, the number of cylinders, and the vehicle{\textquoteright}s initial bearing, loudness and speed to form a vehicle profile vector. This vector provides a fingerprint that can be used for vehicle identification and classification. We also provide possible reasons why some of the existing methods are unable to provide unbiased vehicle speed estimates using the same framework. The approach is illustrated using vehicle speed estimation and classification results obtained with field data.}, keywords = {acoustic, Doppler, estimation;passive, estimation;road, estimation;wheelbase, factor;acoustic, identification;vehicle, length;Doppler, length;vehicle, likelihood, patterns;envelope, processing;maximum, profile, sensor;tire, shape;maximum, shift, shift;acoustic, signal, speed, track, vector;vehicle, vehicles;, wave}, isbn = {1053-587X}, doi = {10.1109/TSP.2008.2005750}, author = {Cevher, V. and Chellapa, Rama and McClellan, J.H.} } @article {14756, title = {Verified enforcement of stateful information release policies}, journal = {SIGPLAN Not.}, volume = {43}, year = {2009}, month = {2009/02//}, pages = {21 - 31}, abstract = {Many organizations specify information release policies to describe the terms under which sensitive information may be released to other organizations. This paper presents a new approach for ensuring that security-critical software correctly enforces its information release policy. Our approach has two parts. First, an information release policy is specified as a security automaton written in a new language called AIR. Second, we enforce an AIR policy by translating it into an API for programs written in lAIR, a core formalism for a functional programming language. lAIR uses a novel combination of dependent, affine, and singleton types to ensure that the API is used correctly. As a consequence we can certify that programs written in lAIR meet the requirements of the original AIR policy specification.}, keywords = {affine types, certified evaluation, declassification, dependent types, singleton types, state modifying policies}, isbn = {0362-1340}, doi = {10.1145/1513443.1513448}, url = {http://doi.acm.org/10.1145/1513443.1513448}, author = {Swamy,Nikhil and Hicks, Michael W.} } @article {12894, title = {Viable but not cultivable bacteria}, journal = {Uncultivated Microorganisms}, year = {2009}, month = {2009///}, pages = {121 - 129}, abstract = {A well-studied, long-term survival mechanism employed by Gram-positive bacteria is formation of endospores. For Gram-negative bacteria, the assumption has been that a survival state does not exist. However, a dormancy state has been described for Gram-negative bacteria and designated as the viable but nonculturable (VBNC) strategy of nonspore-forming cells. A variety of environmental factors are involved in induction of the viable but nonculturable state and Vibrio cholerae provides a useful paradigm for the VBNC phenomenon. It is now accepted that plate counts cannot be relied upon to enumerate or detect VBNC cells. Therefore, direct methods employing fluorescent staining, molecular genetic probes, and other molecular methods have proven both useful and reliable in detecting and enumerating both culturable and nonculturable cells. A predictive model for cholera has been developed, based on ground truth data gathered using these molecular methods and combining them with data obtained by remote sensing, employing satellites. It is clear that microbiology in the twenty-first century has been enhanced by these new tools and paradigms.}, doi = {10.1007/978-3-540-85465-4_1}, author = {Rita R Colwell} } @article {13112, title = {Video Compression and Retrieval of Moving Object Location Applied to Surveillance}, journal = {Image Analysis and Recognition}, year = {2009}, month = {2009///}, pages = {906 - 916}, abstract = {A major problem in surveillance systems is the storage requirements for video archival; videos are recorded continuously for long periods of time, resulting in large amounts of data. Therefore, it is essential to apply efficient compression techniques. Additionally, it is useful to be able to index the archived videos based on events. In general, such events are defined by the interaction among moving objects in the scene. Consequently, besides data compression, efficient ways of storing moving objects should be considered. We present a method that exploits both temporal and spatial redundancy of videos captured from static cameras to perform compression and subsequently allows fast retrieval of moving object locations directly from the compressed data. Experimental results show that the approach achieves high compression ratios compared to other existing video compression techniques without significant quality degradation and is fast due to the simplicity of the operations required for compression and decompression.}, author = {Schwartz,W. and Pedrini,H. and Davis, Larry S.} } @article {12538, title = {Video-Based Face Recognition Algorithms}, journal = {Handbook of Remote Biometrics}, year = {2009}, month = {2009///}, pages = {193 - 216}, abstract = {Traditional face recognition systems have relied on a gallery of still images for learning and a probe of still images for recognition. While the advantage of using motion information in face videos has been widely recognized, computational models for video-based face recognition have only recently gained attention. This chapter reviews some recent advances in this novel framework. In particular, the utility of videos in enhancing performance of image-based tasks (such as recognition or localization) will be summarized. Subsequently, spatiotemporal video-based face recognition systems based on particle filters, hidden Markov models , and system theoretic approaches will be presented. Further, some useful face databases employable by researchers interested in this field will be described. Finally, some open research issues will be proposed and discussed.}, author = {Chellapa, Rama and Bicego, M. and Turaga,P.} } @book {12535, title = {Video-based Lane Detection using Boosting Principles}, year = {2009}, month = {2009///}, publisher = {Snowbird}, organization = {Snowbird}, abstract = {Autonomous navigation of road vehicles is a challenging problem that has widespread applications in intelligent systems, and robotics. An integral componentof such a system is to understand how the road is structured. Detection of road lane markings assumes importance in this regard, and this problem has been approached with different visual input- based inference algorithms ([1], [2]), besides other sensing modalities such as the GPS sensor and the internal vehicle- state sensors. But the challenge still remains when there is considerable amount of shadows on the road, variations in outdoor lighting conditions of the scene (transition from day to night), among others. To address such issues, we propose a machine learning approach based on Real Adaboost [3], and train linear classifiers for both the appearance and edge cues of the training examplars. Additionally, we incorporate prior knowledge about the relative importance of the training samples by computing their weights using kernel discriminant analysis [4], before learning the classification function through boosting. The regions identified as lane markings are then analyzed for gradient direction consistency before making the final detection decision. We illustrate the effectiveness of our algorithm on challenging daylight and night- time road scenarios. }, author = {Gopalan,R. and Hong, T. and Shneier, M. and Chellapa, Rama} } @article {14273, title = {Viewpoint Invariant Texture Description Using Fractal Analysis}, journal = {International Journal of Computer Vision}, volume = {83}, year = {2009}, month = {2009///}, pages = {85 - 100}, abstract = {Image texture provides a rich visual description of the surfaces in the scene. Many texture signatures based on various statistical descriptions and various local measurements have been developed. Existing signatures, in general, are not invariant to 3D geometric transformations, which is a serious limitation for many applications. In this paper we introduce a new texture signature, called the multifractal spectrum (MFS). The MFS is invariant under the bi-Lipschitz map, which includes view-point changes and non-rigid deformations of the texture surface, as well as local affine illumination changes. It provides an efficient framework combining global spatial invariance and local robust measurements. Intuitively, the MFS could be viewed as a {\textquotedblleft}better histogram{\textquotedblright} with greater robustness to various environmental changes and the advantage of capturing some geometrical distribution information encoded in the texture. Experiments demonstrate that the MFS codes the essential structure of textures with very low dimension, and thus represents an useful tool for texture classification.}, isbn = {0920-5691}, url = {http://dx.doi.org/10.1007/s11263-009-0220-6}, author = {Yong Xu and Hui Ji and Ferm{\"u}ller, Cornelia} } @conference {14849, title = {Visibility constraints on features of 3D objects}, booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on}, year = {2009}, month = {2009/06//}, pages = {1231 - 1238}, abstract = {To recognize three-dimensional objects it is important to model how their appearances can change due to changes in viewpoint. A key aspect of this involves understanding which object features can be simultaneously visible under different viewpoints. We address this problem in an image-based framework, in which we use a limited number of images of an object taken from unknown viewpoints to determine which subsets of features might be simultaneously visible in other views. This leads to the problem of determining whether a set of images, each containing a set of features, is consistent with a single 3D object. We assume that each feature is visible from a disk of viewpoints on the viewing sphere. In this case we show the problem is NP-hard in general, but can be solved efficiently when all views come from a circle on the viewing sphere. We also give iterative algorithms that can handle noisy data and converge to locally optimal solutions in the general case. Our techniques can also be used to recover viewpoint information from the set of features that are visible in different images. We show that these algorithms perform well both on synthetic data and images from the COIL dataset.}, keywords = {3D, algorithms;synthetic, complexity;iterative, constraints;computational, data;synthetic, dataset;NP-hard;image-based, features;COIL, framework;iterative, images;three-dimensional, methods;object, object, recognition;, recognition;viewing, sphere;visibility}, doi = {10.1109/CVPR.2009.5206726}, author = {Basri,R. and Felzenszwalb,P. F and Girshick,R. B and Jacobs, David W. and Klivans,C. J} } @article {17491, title = {Visual overviews for discovering key papers and influences across research fronts}, journal = {Journal of the American Society for Information Science and Technology}, volume = {60}, year = {2009}, month = {2009/11/01/}, pages = {2219 - 2228}, abstract = {Gaining a rapid overview of an emerging scientific topic, sometimes called research fronts, is an increasingly common task due to the growing amount of interdisciplinary collaboration. Visual overviews that show temporal patterns of paper publication and citation links among papers can help researchers and analysts to see the rate of growth of topics, identify key papers, and understand influences across subdisciplines. This article applies a novel network-visualization tool based on meaningful layouts of nodes to present research fronts and show citation links that indicate influences across research fronts. To demonstrate the value of two-dimensional layouts with multiple regions and user control of link visibility, we conducted a design-oriented, preliminary case study with 6 domain experts over a 4-month period. The main benefits were being able (a) to easily identify key papers and see the increasing number of papers within a research front, and (b) to quickly see the strength and direction of influence across related research fronts.}, isbn = {1532-2890}, doi = {10.1002/asi.21160}, url = {http://onlinelibrary.wiley.com/doi/10.1002/asi.21160/abstract}, author = {Aris,Aleks and Shneiderman, Ben and Qazvinian,Vahed and Radev,Dragomir} } @article {13105, title = {Visual Tag}, volume = {12/533,231}, year = {2009}, month = {2009/07//}, abstract = {An improved animal tag for application to an animal{\textquoteright}s ear which comprises a male portion that includes a flat segment and a projection segment, a female portion that includes a generally square or generally oval shaped flat segment and a raised segment with an aperture; wherein the projection segment of the male portion is adapted to be inserted through the animal{\textquoteright}s ear and into the aperture when pressure is applied thereto.}, url = {http://www.google.com/patents?id=ZXTTAAAAEBAJ}, author = {BRETEY,STEVE and Kuhnly,Keith and Davis, Larry S.} } @article {13107, title = {Visual Tracking by Continuous Density Propagation in Sequential Bayesian Filtering Framework}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, volume = {31}, year = {2009}, month = {2009/05//}, pages = {919 - 930}, abstract = {Particle filtering is frequently used for visual tracking problems since it provides a general framework for estimating and propagating probability density functions for nonlinear and non-Gaussian dynamic systems. However, this algorithm is based on a Monte Carlo approach and the cost of sampling and measurement is a problematic issue, especially for high-dimensional problems. We describe an alternative to the classical particle filter in which the underlying density function has an analytic representation for better approximation and effective propagation. The techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities with Gaussian mixtures, where all relevant parameters are automatically determined. The proposed analytic approach is shown to perform more efficiently in sampling in high-dimensional space. We apply the algorithm to real-time tracking problems and demonstrate its performance on real video sequences as well as synthetic examples.}, keywords = {Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted;Pattern Recognition, Computer-Assisted;Subtraction Technique;, Monte Carlo approach;continuous density propagation;density approximation;density interpolation;nonGaussian dynamic systems;nonlinear dynamic systems;particle filtering;probability density functions;sequential Bayesian filtering framework;video sequences;}, isbn = {0162-8828}, doi = {10.1109/TPAMI.2008.134}, author = {Han,Bohyung and Zhu,Ying and Comaniciu, D. and Davis, Larry S.} } @article {16060, title = {Visual-Analytics Evaluation}, journal = {Computer Graphics and Applications, IEEE}, volume = {29}, year = {2009}, month = {2009/06//may}, pages = {16 - 17}, abstract = {Visual analytics (VA) is the science of analytical reasoning facilitated by interactive visual interfaces. Assessing VA technology{\textquoteright}s effectiveness is challenging because VA tools combine several disparate components, both low and high level, integrated in complex interactive systems used by analysts, emergency responders, and others. These components include analytical reasoning, visual representations, computer-human interaction techniques, data representations and transformations, collaboration tools, and especially tools for communicating the results of their use. VA tool users{\textquoteright} activities can be exploratory and can take place over days, weeks, or months. Users might not follow a predefined or even linear work flow. They might work alone or in groups. To understand these complex behaviors, an evaluation can target the component level, the system level, or the work environment level, and requires realistic data and tasks. Traditional evaluation metrics such as task completion time, number of errors, or recall and precision are insufficient to quantify the utility of VA tools, and new research is needed to improve our VA evaluation methodology.}, keywords = {analytic, analytics, evaluation;cognition;data, generation;user, interactive, interfaces;synthetic-data-set, reasoning;visual, systems;, tools;visual, visual, visualisation;interactive}, isbn = {0272-1716}, doi = {10.1109/MCG.2009.56}, author = {Plaisant, Catherine and Grinstein,G. and Scholtz,J.} } @conference {13697, title = {Voronoi++: ADynamic Page Segmentation approach based on Voronoi and Docstrum features}, booktitle = {International Conference on Document Analysis and Recognition (ICDAR {\textquoteright}09)}, year = {2009}, month = {2009///}, pages = {1011 - 1015}, abstract = {This paper presents a dynamic approach to document page segmentation. Current page segmentation algorithms lack the ability to dynamically adapt local variations in the size, orientation and distance of components within a page. Our approach builds upon one of the best algorithms, Kise et. al. work based on Area Voronoi Diagrams, which adapts globally to page content to determine algorithm parameters. In our approach, local thresholds are determined dynamically based on parabolic relations between components, and Docstrum based angular and neighborhood features are integrated to improve accuracy. Zone-based evaluation was performed on four sets of printed and handwritten documents in English and Arabic scripts and an increase of 33\% in accuracy is reported.}, author = {Agrawal,Mudit and David Doermann} } @article {15330, title = {Validation of a DNS code for wall-bounded turbulence including finite-rate reactions and surface catalysis}, journal = {AIAA Paper 2008}, volume = {645}, year = {2008}, month = {2008///}, abstract = {This paper discusses the constitutive relations, surface catalytic model,and numerical methods for direct numerical simulation (DNS) of wall- bounded turbulence including finite-rate chemistry and gas-surface in- teraction. The validation of the code is provided for the mean flow by comparison to similarity solutions and laminar hypersonic boundary layer solutions, for the surface catalysis by comparison to analytic solutions for the one-dimensional diffusion-reaction equation, and for turbulent bound- ary layers by comparison to empirical predictions. }, author = {Duan,L. and Martin, M.P} } @article {14434, title = {Variational Bayes via Propositionalization}, journal = {Probabilistic, Logical and Relational Learning-A Further Synthesis}, year = {2008}, month = {2008///}, author = {Sato,T. and Kameya,Y. and Kurihara,K. and De Raedt,L. and Dietterich,T. and Getoor, Lise and Kersting,K. and Muggleton,S. H} } @conference {16064, title = {VAST 2008 Challenge: Introducing mini-challenges}, booktitle = {Visual Analytics Science and Technology, 2008. VAST {\textquoteright}08. IEEE Symposium on}, year = {2008}, month = {2008/10//}, pages = {195 - 196}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The VAST 2008 Challenge is the third year that such a competition was held in conjunction with the IEEE Visual Analytics Science and Technology (VAST) symposium. The authors restructured the contest format used in 2006 and 2007 to reduce the barriers to participation and offered four mini-challenges and a Grand Challenge. Mini Challenge participants were to use visual analytic tools to explore one of four heterogeneous data collections to analyze specific activities of a fictitious, controversial movement. Questions asked in the Grand Challenge required the participants to synthesize data from all four data sets. In this paper we give a brief overview of the data sets, the tasks, the participation, the judging, and the results.}, keywords = {2008, analytics;data, Challenge;heterogeneous, collections;visual, data, VAST, visualisation;}, doi = {10.1109/VAST.2008.4677383}, author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.} } @article {13688, title = {VCode - Pervasive Data Transfer Using Video Barcode}, journal = {IEEETransactions on Multimedia}, volume = {10}, year = {2008}, month = {2008/04//}, pages = {361 - 371}, abstract = {In this paper we describe a novel data transfer scheme that uses the camera in a smart phone as an alternative data channel. The data is encoded as a sequence of 2D barcode images, displayed on a flat panel display, acquired by the camera, and decoded in real time by the software embedded in device. The decoded data is written to a file. Compared with existing data channels, such as CDMA/GPRS, cables, Bluetooth, and Infrared, our method relies on visual communication and does not require special hardware or data plans. Users only need to point the camera at a monitor displaying the VCode to download. Technical challenges to overcome include correction of perspective distortion, compensation for contrast variation, and efficient implementation of small footprint software into a mobile device. We address these challenges and present our solution in detail. We have implemented a prototype which allows users to download various types of files successfully, including pictures, ring tones and Java games onto camera phones running Symbian and Windows Mobile platforms. We discuss the limitations of our solution and outline future work to overcome these limitations.}, author = {Liu,Xu and David Doermann and Huiping Li} } @article {14754, title = {Verified enforcement of automaton-based information release policies}, journal = {Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security. ACM Press}, year = {2008}, month = {2008///}, abstract = {Many organizations specify information release policies to describe the terms under which sensitive information may bereleased to other organizations. This paper presents a new approach for ensuring that security-critical software correctly enforces its information release policy. Our approach has two parts. First, an information release policy is specified as a security automaton written in a new language called AIR. Second, we enforce an AIR policy by translating it into an API for programs written in λAIR, a core formalism for a functional programming language. λAIR uses a novel combination of dependent, affine, and singleton types to ensure that the API is used correctly. As a consequence we can certify that programs written in λAIR meet the requirements of the original AIR policy specification. }, author = {Swamy,N. and Hicks, Michael W.} } @article {12909, title = {Vibrio cholerae non-O1, non-O139 strains isolated before 1992 from Varanasi, India are multiple drug resistant, contain intSXT, dfr18 and aadA5 genes}, journal = {Environmental Microbiology}, volume = {10}, year = {2008}, month = {2008/04/01/}, pages = {866 - 873}, abstract = {In this study, we report the presence of the SXT element and Class I integron in Vibrio cholerae non-O1, non-O139 strains isolated from Varanasi, India. Isolates were resistant to cotrimoxazole, trimethoprim and/or streptomycin, furazolidone and ampicillin. None contained plasmids. Polymerase chain reaction (PCR) and DNA sequencing revealed the presence of antibiotic resistance gene cassettes, aadA1, aadA2, aadA5 and dfrA15, in the Class I integron and SXT, an integrative conjugative element containing dfr18, sulII and strAB, in three and six of the isolates respectively. Conjugation experiments, followed by PCR analysis of transconjugants, provided evidence for the transferable nature of intSXT and associated antibiotic resistance gene cassettes. This is the first report of the occurrence of SXT ICE, dfr18, sulII, strAB and aadA5 genes in environmental V.~cholerae non-O1, non-O139 strains from Varanasi, India, that had been isolated before 1992.}, isbn = {1462-2920}, doi = {10.1111/j.1462-2920.2007.01502.x}, url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1462-2920.2007.01502.x/abstract?userIsAuthenticated=false\&deniedAccessCustomisedMessage=}, author = {Mohapatra,Harapriya and Mohapatra,Saswat S. and Mantri,Chinmay K. and Rita R Colwell and Singh,Durg V.} } @article {12566, title = {Video stabilization and mosaicing}, journal = {The Essential Guide to Video Processing,}, year = {2008}, month = {2008///}, pages = {109 - 138}, author = {Ramachandran, M. and Veeraraghavan,A. and Chellapa, Rama} } @article {14190, title = {A View-Point Invariant Texture Descriptor}, journal = {Journal of VisionJ Vis}, volume = {8}, year = {2008}, month = {2008/05/10/}, pages = {354 - 354}, abstract = {A new texture descriptor based on fractal geometry, called the multi fractal spectrum (MFS) is introduced. The key quantity in the study of fractal geometry is the fractal dimension, which is a measure of how an object changes over scale. Consider the intensity of an image as a 3D surface and slice it at regular intervals at the dimension of height. For each interval we obtain a point set, for which we compute the fractal dimension. The vector composed of the fractal dimensions of all point sets is called the MFS of intensity. Replacing the intensity with other quantities, such as the density function, or the output of various filters (e.g. Laplacian, Gradient filters), different MFS descriptors are obtained. The MFS is shown mathematically to be invariant under any smooth mapping (bi-Lipschitz maps), which includes view-point changes and non-rigid deformations of the surface as well as local affine illumination changes. Computational experiments on unstructured textures, such as landscapes and shelves in a supermarket, demonstrate the robustness of the MFS to environmental changes. On standard data sets the MFS performs comparable to the top texture descriptors in the task of classification. However, in contrast to other descriptors, it has extremely low dimension and can be computed very efficiently and robustly. Psychophysical demonstrate that humans can differentiate black and white textures on the basis of the fractal dimension.}, isbn = {, 1534-7362}, doi = {10.1167/8.6.354}, url = {http://www.journalofvision.org/content/8/6/354}, author = {Ferm{\"u}ller, Cornelia and Yong Xu and Hui Ji} } @conference {16765, title = {Virtual access points for vehicular networks}, booktitle = {Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications}, year = {2008}, month = {2008///}, pages = {14 - 14}, author = {Frangiadakis,N. and C{\^a}mara,D. and Filali,F. and Loureiro,A. A.F and Roussopoulos, Nick} } @inbook {16072, title = {Visualizing Functional Data with an Application to eBay{\textquoteright}s Online Auctions}, booktitle = {Handbook of Data VisualizationHandbook of Data Visualization}, series = {Springer Handbooks of Computational Statistics}, year = {2008}, month = {2008///}, pages = {873 - 898}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, abstract = {Technological advances in the measurement, collection, and storage of data have led tomore andmore complex data structures. Examples of such structures include measurements of the behavior of individuals over time, digitized two- or three-dimensional images of the brain, and recordings of three- or even four-dimensional movements of objects traveling through space and time. Such data, although recorded in a discrete fashion, are usually thought of as continuous objects that are represented by functional relationships. This gave rise to functional data analysis (FDA), which was made popular by the monographs of Ramsay and Silverman (1997, 2002), where the center of interest is a set of curves, shapes, objects, or, more generally, a set of functional observations , in contrast to classical statistics where interest centers on a set of data vectors. In that sense, functional data is not only different from the data structure studied in classical statistics, but it actually generalizes it. Many of these new data structures require new statistical methods to unveil the information that they carry.}, isbn = {978-3-540-33037-0}, url = {http://dx.doi.org/10.1007/978-3-540-33037-0_34}, author = {Chen,Chun-houh and H{\"a}rdle,Wolfgang and Unwin,Antony and Jank,Wolfgang and Shmueli,Galit and Plaisant, Catherine and Shneiderman, Ben} } @article {14572, title = {Variola virus topoisomerase: DNA cleavage specificity and distribution of sites in Poxvirus genomes}, journal = {Virology}, volume = {365}, year = {2007}, month = {2007/08/15/}, pages = {60 - 69}, abstract = {Topoisomerase enzymes regulate superhelical tension in DNA resulting from transcription, replication, repair, and other molecular transactions. Poxviruses encode an unusual type IB topoisomerase that acts only at conserved DNA sequences containing the core pentanucleotide 5{\textquoteright}-(T/C)CCTT-3{\textquoteright}. In X-ray structures of the variola virus topoisomerase bound to DNA, protein-DNA contacts were found to extend beyond the core pentanucleotide, indicating that the full recognition site has not yet been fully defined in functional studies. Here we report quantitation of DNA cleavage rates for an optimized 13~bp site and for all possible single base substitutions (40 total sites), with the goals of understanding the molecular mechanism of recognition and mapping topoisomerase sites in poxvirus genome sequences. The data allow a precise definition of enzyme-DNA interactions and the energetic contributions of each. We then used the resulting "action matrix" to show that favorable topoisomerase sites are distributed all along the length of poxvirus DNA sequences, consistent with a requirement for local release of superhelical tension in constrained topological domains. In orthopox genomes, an additional central cluster of sites was also evident. A negative correlation of predicted topoisomerase sites was seen relative to early terminators, but no correlation was seen with early or late promoters. These data define the full variola virus topoisomerase recognition site and provide a new window on topoisomerase function in vivo.}, keywords = {Annotation of topoisomerase sites, Sequence specific recognition, Topoisomerase IB, Variola virus}, isbn = {0042-6822}, doi = {16/j.virol.2007.02.037}, url = {http://www.sciencedirect.com/science/article/pii/S0042682207001225}, author = {Minkah,Nana and Hwang,Young and Perry,Kay and Van Duyne,Gregory D. and Hendrickson,Robert and Lefkowitz,Elliot J. and Hannenhalli, Sridhar and Bushman,Frederic D.} } @conference {16074, title = {VAST 2007 Contest - Blue Iguanodon}, booktitle = {Visual Analytics Science and Technology, 2007. VAST 2007. IEEE Symposium on}, year = {2007}, month = {2007/11/30/1}, pages = {231 - 232}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The second visual analytics science and technology (VAST) contest was held in conjunction with the 2007 IEEE VAST symposium. In this contest participants were to use visual analytic tools to explore a large heterogeneous data collection to construct a scenario and find evidence buried in the data of illegal and terrorist activities that were occurring. A synthetic data set was made available as well as tasks. In this paper we describe some of the advances we have made from the first competition held in 2006.}, keywords = {activities;large, activities;visual, analytic, collection;terrorist, data, heterogeneous, illegal, interfaces;, tools;data, user, visualisation;graphical}, doi = {10.1109/VAST.2007.4389032}, author = {Grinstein,G. and Plaisant, Catherine and Laskowski,S. and O{\textquoteright}Connell,T. and Scholtz,J. and Whiting,M.} } @conference {14755, title = {Verified Enforcement of Security Policies for Cross-Domain Information Flows}, booktitle = {IEEE Military Communications Conference, 2007. MILCOM 2007}, year = {2007}, month = {2007/10/29/31}, pages = {1 - 7}, publisher = {IEEE}, organization = {IEEE}, abstract = {We describe work in progress that uses program analysis to show that security-critical programs, such as cross-domain guards, correctly enforce cross-domain security policies. We are enhancing existing techniques from the field of Security-oriented Programming Languages to construct a new language for the construction of secure networked applications, SELINKS. In order to specify and enforce expressive and fine-grained policies, we advocate dynamically associating security labels with sensitive entities. Programs written in SELINKS are statically guaranteed to correctly manipulate an entity{\textquoteright}s security labels and to ensure that the appropriate policy checks mediate all operations that are performed on the entity. We discuss the design of our main case study : a web-based Collaborative Planning Application that will permit a collection of users, with varying security requirements and clearances, to access sensitive data sources and collaboratively create documents based on these sources.}, keywords = {Collaboration, Computer languages, Data security, Educational institutions, Government, Information analysis, Information filtering, Information filters, Information security, Vehicles}, isbn = {978-1-4244-1513-7}, doi = {10.1109/MILCOM.2007.4455189}, author = {Swamy,Nikhil and Hicks, Michael W. and Tsang,Simon} } @article {12923, title = {Viable but nonculturable Vibrio cholerae O1 in biofilms in the aquatic environment and their role in cholera transmission}, journal = {Proceedings of the National Academy of Sciences}, volume = {104}, year = {2007}, month = {2007///}, pages = {17801 - 17801}, abstract = {Vibrio cholerae persists in aquatic environments predominantly in a nonculturable state. In this study coccoid, nonculturable V. cholerae O1 in biofilms maintained for 495 days in Mathbaria, Bangladesh, pond water became culturable upon animal passage. Culturability, biofilm formation, and the wbe, ctxA, and rstR2 genes were monitored by culture, direct fluorescent antibody (DFA), and multiplex PCR. DFA counts were not possible after formation of biofilm. Furthermore, wbe, but not ctxA, were amplifiable, even after incubation for 54 and 68 days at room temperature (≈25{\textdegree}C) and 4{\textdegree}C, respectively, when no growth was detectable. Slower biofilm formation and extended culturability were observed for cultures incubated at 4{\textdegree}C, compared with ≈25{\textdegree}C, suggesting biofilm production to be temperature dependent and linked to loss of culturability. Small colonies appearing after incubation in microcosms for 54 and 68 days at 25{\textdegree}C and 4{\textdegree}C, respectively, were wbe positive and ctxA and rstR2 negative, indicating loss of bacteriophage CTXΦ. The coccoid V. cholerae O1 observed as free cells in microcosms incubated for 495 days could not be cultured, but biofilms in the same microcosms yielded culturable cells. It is concluded that biofilms can act as a reservoir for V. cholerae O1 between epidemics because of its long-term viability in biofilms. In contrast to biofilms produced in Mathbaria pond water, V. cholerae O1 in biofilms present in cholera stools and incubated under identical conditions as the Mathbaria pond water biofilms could not be cultured after 2 months, indicating that those V. cholerae cells freshly discharged into the environment are significantly less robust than cells adapted to environmental conditions.Bangladesh bacteriophage CTXΦ DFA multiplex-PCR ctxA }, isbn = {0027-8424, 1091-6490}, doi = {10.1073/pnas.0705599104}, url = {http://www.pnas.org/content/104/45/17801}, author = {Alam,M. and Sultana,M. and Nair,G. B. and Siddique,A. K. and Hasan,N. A. and Sack,R. B. and Sack,D. A. and Ahmed,K. U. and Sadique,A. and Watanabe,H. and Rita R Colwell} } @conference {12578, title = {Video Biometrics}, booktitle = {Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on}, year = {2007}, month = {2007/09//}, pages = {363 - 370}, abstract = {A strong requirement to come up with secure and user- friendly ways to authenticate and identify people, to safeguard their rights and interests, has probably been the main guiding force behind biometrics research. Though a vast amount of research has been done to recognize humans based on still images, the problem is still far from solved for unconstrained scenarios. This has led to an increased interest in using video for the task of biometric recognition. Not only does video provide more information, but also is more suitable for recognizing humans in general surveillance scenarios. Other than the multitude of still frames, video makes it possible to characterize biometrics based on inherent dynamics like gait which is not possible with still images. In this paper, we describe several recent algorithms to illustrate the usefulness of videos to identify humans. A brief discussion on remaining challenges is also included.}, keywords = {(access, analysis;video, biometrics;biometrics, control);face, dynamics;ofbiometric, images;surveillance, inherent, MOTION, processing;, recognition;image, recognition;still, scenarios;unconstrained, scenarios;video, signal}, doi = {10.1109/ICIAP.2007.4362805}, author = {Chellapa, Rama and Aggarwal,G.} } @article {11970, title = {View-invariant modeling and recognition of human actions using grammars}, journal = {Dynamical Vision}, year = {2007}, month = {2007///}, pages = {115 - 126}, author = {Ogale, A. and Karapurkar, A. and Aloimonos, J.} } @article {15657, title = {Vision Geometry XV}, journal = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {6499}, year = {2007}, month = {2007///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {14361, title = {Visual analysis of dynamic group membership in temporal social networks}, journal = {ACM SIGKDD Explorations Newsletter}, volume = {9}, year = {2007}, month = {2007/12//}, pages = {13 - 21}, abstract = {C-Group is a tool for analyzing dynamic group membership in temporal social networks over time. Unlike most network visualization tools, which show the group structure within an entire network, or the group membership for a single actor, C-Group allows users to focus their analysis on a pair of individuals. While C-Group allows for viewing the addition and deletion of nodes (actors) and edges (relationships) over time, its major contribution is its focus on changing group memberships over time. By doing so, users can investigate the context of temporal group memberships for the pair. C-Group provides users with a flexible interface for defining (and redefining) groups interactively, and supports two novel visual representations of the evolving group memberships. This flexibility gives users alternate views that are appropriate for different network sizes and provides users with different insights into the grouping behavior. We demonstrate the utility of the tool on a scientific publication network.}, keywords = {dynamic group detection, group visualization, visual data mining}, isbn = {1931-0145}, doi = {10.1145/1345448.1345452}, url = {http://doi.acm.org/10.1145/1345448.1345452}, author = {Kang,Hyunmo and Getoor, Lise and Singh,Lisa} } @conference {14405, title = {Visual Mining of Multi-Modal Social Networks at Different Abstraction Levels}, booktitle = {Information Visualization, 2007. IV {\textquoteright}07. 11th International Conference}, year = {2007}, month = {2007/07//}, pages = {672 - 679}, abstract = {Social networks continue to become more and more feature rich. Using local and global structural properties and descriptive attributes are necessary for more sophisticated social network analysis and support for visual mining tasks. While a number of visualization tools for social network applications have been developed, most of them are limited to uni-modal graph representations. Some of the tools support a wide range of visualization options, including interactive views. Others have better support for calculating structural graph properties such as the density of the graph or deploying traditional statistical social network analysis. We present Invenio, a new tool for visual mining of socials. Invenio integrates a wide range of interactive visualization options from Prefuse, with graph mining algorithm support from JUNG. While the integration expands the breadth of functionality within the core engine of the tool, our goal is to interactively explore multi-modal, multi-relational social networks. Invenio also supports construction of views using both database operations and basic graph mining operations.}, keywords = {computing;, database;interactive, graph, management, mining;data, network;structural, property;visual, sciences, social, systems;graph, systems;social, theory;interactive, visualisation;database, visualization;multimodal}, doi = {10.1109/IV.2007.126}, author = {Singh,L. and Beard,M. and Getoor, Lise and Blake,M.B.} } @article {14475, title = {Voila: Efficient feature-value acquisition for classification}, journal = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE}, volume = {22}, year = {2007}, month = {2007///}, pages = {1225 - 1225}, abstract = {We address the problem of efficient feature-value acquisi- tion for classification in domains in which there are varying costs associated with both feature acquisition and misclassi- fication. The objective is to minimize the sum of the infor- mation acquisition cost and misclassification cost. Any de- cision theoretic strategy tackling this problem needs to com- pute value of information for sets of features. Having cal- culated this information, different acquisition strategies are possible (acquiring one feature at time, acquiring features in sets, etc.). However, because the value of information cal- culation for arbitrary subsets of features is computationally intractable, most traditional approaches have been greedy, computing values of features one at a time. We make the problem of value of information calculation tractable in prac- tice by introducing a novel data structure called the Value of Information Lattice (VOILA). VOILA exploits dependencies between missing features and makes sharing of information value computations between different feature subsets possi- ble. To the best of our knowledge, performance differences between greedy acquisition, acquiring features in sets, and a mixed strategy have not been investigated empirically in the past, due to inherit intractability of the problem. With the help of VOILA, we are able to evaluate these strategies on five real world datasets under various cost assumptions. We show that VOILA reduces computation time dramatically. We also show that the mixed strategy outperforms both greedy acqui- sition and acquisition in sets.}, author = {Bilgic,M. and Getoor, Lise} } @conference {16083, title = {VAST 2006 Contest - A Tale of Alderwood}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/2}, pages = {215 - 216}, abstract = {Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The first visual analytics science and technology (VAST) contest was held in conjunction with the 2006 IEEE VAST Symposium. The competition entailed the identification of possible political shenanigans in the fictitious town of Alderwood. A synthetic data set was made available as well as tasks. We summarize how we prepared and advertised the contest, developed some initial metrics for evaluation, and selected the winners. The winners were invited to participate at an additional live competition at the symposium to provide them with feedback from senior analysts}, keywords = {Alderwood;human, analysis;data, analytics, and, contest;data, information, interaction;sense, making;visual, Science, technology, visualisation;}, doi = {10.1109/VAST.2006.261420}, author = {Grinstein,G. and O{\textquoteright}Connell,T. and Laskowski,S. and Plaisant, Catherine and Scholtz,J. and Whiting,M.} } @article {15358, title = {Vector Preisach models of hysteresis}, journal = {The Science of Hysteresis: Mathematical modeling and applications}, volume = {1}, year = {2006}, month = {2006///}, pages = {447 - 447}, author = {Mayergoyz, Issak D} } @article {12606, title = {Vehicle Fingerprinting Using Drive-By Sounds}, year = {2006}, month = {2006/11//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {We estimate a vehicle{\textquoteright}s speed, width, and length by jointly estimating its acoustic wave-pattern using a single passive acoustic sensor that records the vehicle{\textquoteright}s drive-by noise. The acoustic wave-pattern is estimated using three envelope shape (ES) components, which approximate the shape of the received signal{\textquoteright}s power envelope. We incorporate the parameters of the ES components along with estimates of the vehicle engine RPM and number of cylinders to form a vehicle profile vector. This vector provides a compressed statistics that can be used for vehicle identification and classification. Vehicle speed estimation and classification results are provided using field data.}, keywords = {*ACOUSTIC DETECTORS, *GROUND VEHICLES, *SIGNAL PROCESSING, ACOUSTIC DETECTION AND DETECTORS, AMPLITUDE, Interference, PASSIVE SYSTEMS, spatial distribution, STATISTICAL PROCESSES, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, WAVE PROPAGATION}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA481471}, author = {Cevher, V. and Chellapa, Rama and Gurbuz, A.C. and Shah, F. and McClellan, J.H.} } @article {16406, title = {Verification and Validation through Replication: A Case Study Using Axelrod and Hammond{\textquoteright}s Ethnocentrism Model}, journal = {North American Association for Computational Social and Organization Sciences (NAACSOS)}, year = {2006}, month = {2006///}, abstract = {Recent years have seen a proliferation of agent-based models (ABMs), but with the exceptionof a few "classic" models, most of these models have never been replicated. We argue that replication has even greater benefits when applied to computational models than when applied to physical experiments. Replication affects model verification, in that it aids in determining if the implemented model reflects the conceptual model. It affects model validation, since a replication of a conceptual model may change the output from an implemented model and thus alter the correspondence between the model and the real world. Replication also affects validation by forcing the model developer and replicator to re-examine assumptions made in the original model. In addition replication fosters shared understanding of the details of modeling decisions within the research community. To facilitate the practice of replication, we argue for the creation of standards for both how to replicate models and how to evaluate the replication. In this paper, we present a case study of our attempt to replicate an ABM developed by Axelrod and Hammond. We detail our effort to replicate that model and the challenges that arose in recreating the model and in determining if the replication was successful. }, author = {Rand, William and Wilensky,U.} } @article {17919, title = {Vertex{\textendash}transformation streams}, journal = {Graphical Models}, volume = {68}, year = {2006}, month = {2006/07//}, pages = {371 - 383}, abstract = {Recent trends in parallel computer architecture strongly suggest the need to improve the arithmetic intensity (the compute to bandwidth ratio) for greater performance in time-critical applications, such as interactive 3D graphics. At the same time, advances in stream programming abstraction for graphics processors (GPUs) have enabled us to use parallel algorithm design methods for GPU programming. Inspired by these developments, this paper explores the interactions between multiple data streams to improve arithmetic intensity and address the input geometry bandwidth bottleneck for interactive 3D graphics applications. We introduce the idea of creating vertex and transformation streams that represent large point datasets via their interaction. We discuss how to factor such point datasets into a set of source vertices and transformation streams by identifying the most common translations amongst vertices. We accomplish this by identifying peaks in the cross-power spectrum of the dataset in the Fourier domain. We validate our approach by integrating it with a view-dependent point rendering system and show significant improvements in input geometry bandwidth requirements as well as rendering frame rates.}, keywords = {Arithmetic intensity, Geometry instancing, Stream programming, Streaming algorithms, Transformation encoding}, isbn = {1524-0703}, doi = {10.1016/j.gmod.2006.03.005}, url = {http://www.sciencedirect.com/science/article/pii/S1524070306000373}, author = {Kim,Youngmin and Lee,Chang Ha and Varshney, Amitabh} } @article {14008, title = {Very fast optimal bandwidth selection for univariate kernel density estimation}, journal = {Technical Reports from UMIACS UMIACS-TR-2005-73}, year = {2006}, month = {2006/01/03/T15:1}, abstract = {Most automatic bandwidth selection procedures for kernel density estimates require estimation of quantities involvingthe density derivatives. Estimation of modes and inflexion points of densities also require derivative estimates. The computational complexity of evaluating the density derivative at M evaluation points given N sample points from the density is O(MN). In this paper we propose a computationally efficient $\epsilon$-exact approximation algorithm for univariate, Gaussian kernel based, density derivative estimation that reduces the computational complexity from O(MN) to linear order (O(N+M)). The constant depends on the desired arbitrary accuracy, $\epsilon$. We apply the density derivative evaluation procedure to estimate the optimal bandwidth for kernel density estimation, a process that is often intractable for large data sets. For example for N = M = 409,600 points while the direct evaluation of the density derivative takes around 12.76 hours the fast evaluation requires only 65 seconds with an error of around $10^{-12)$. Algorithm details, error bounds, procedure to choose the parameters and numerical experiments are presented. We demonstrate the speedup achieved on the bandwidth selection using the {\textquoteleft}{\textquoteleft}solve-the-equation plug-in method{\textquoteright}{\textquoteright} [18]. We also demonstrate that the proposed procedure can be extremely useful for speeding up exploratory projection pursuit techniques. }, keywords = {Approximation algorithms, computational statistics, fast gauss transform, kernel density estimation, projection pursuit}, url = {http://drum.lib.umd.edu/handle/1903/3028}, author = {Raykar,Vikas Chandrakant and Duraiswami, Ramani} } @inbook {12638, title = {Video Mensuration Using a Stationary Camera}, booktitle = {Computer Vision {\textendash} ECCV 2006Computer Vision {\textendash} ECCV 2006}, series = {Lecture Notes in Computer Science}, volume = {3953}, year = {2006}, month = {2006///}, pages = {164 - 176}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {This paper presents a method for video mensuration using a single stationary camera. The problem we address is simple, i.e., the mensuration of any arbitrary line segment on the reference plane using multiple frames with minimal calibration. Unlike previous solutions that are based on planar rectification, our approach is based on fitting the image of multiple concentric circles on the plane. Further, the proposed method aims to minimize the error in mensuration. Hence we can calculate the mensuration of the line segments not lying on the reference plane. Using an algorithm for detecting and tracking wheels of an automobile, we have implemented a fully automatic system for wheel base mensuration. The mensuration results are accurate enough that they can be used to determine the vehicle classes. Furthermore, we measure the line segment between any two points on the vehicle and plot them in top and side views.}, isbn = {978-3-540-33836-9}, url = {http://dx.doi.org/10.1007/11744078_13}, author = {Guo,Feng and Chellapa, Rama}, editor = {Leonardis,Ale{\v s} and Bischof,Horst and Pinz,Axel} } @article {13692, title = {Video Retrieval of Near-Duplicates using k-Nearest Neighbor Retrieval of Spatio-Temporal Descriptors}, journal = {Multimedia Tools and Applications (MTAP)}, volume = {30}, year = {2006}, month = {2006///}, abstract = {This paper describes a novel methodology for implementing video search func- tions such as retrieval of near-duplicate videos and recognition of actions in surveil- lance video. Videos are divided into half-second clips whose stacked frames produce 3D space-time volumes of pixels. Pixel regions with consistent color and motion prop- erties are extracted from these 3D volumes by a threshold-free hierarchical space- time segmentation technique. Each region is then described by a high-dimensional point whose components represent the position, orientation and, when possible, color of the region. In the indexing phase for a video database, these points are assigned labels that specify their video clip of origin. All the labeled points for all the clips are stored into a single binary tree for efficient k-nearest neighbor retrieval. The retrieval phase uses video segments as queries. Half-second clips of these queries are again segmented by space-time segmentation to produce sets of points, and for each point the labels of its nearest neighbors are retrieved. The labels that receive the largest numbers of votes correspond to the database clips that are the most similar to the query video segment.We illustrate this approach for video indexing and retrieval and for action recognition. First, we describe retrieval experiments for dynamic logos, and for video queries that differ from the indexed broadcasts by the addition of large overlays. Then we describe experiments in which office actions (such as pulling and closing drawers, taking and storing items, picking up and putting down a phone) are recognized. Color information is ignored to insure independence of action recognition to people{\textquoteright}s appearance. One of the distinct advantages of using this approach for action recognition is that there is no need for detection or recognition of body parts.}, author = {DeMenthon,Daniel and David Doermann} } @article {12627, title = {View Invariance for Human Action Recognition}, journal = {International Journal of Computer Vision}, volume = {66}, year = {2006}, month = {2006///}, pages = {83 - 101}, abstract = {This paper presents an approach for viewpoint invariant human action recognition, an area that has received scant attention so far, relative to the overall body of work in human action recognition. It has been established previously that there exist no invariants for 3D to 2D projection. However, there exist a wealth of techniques in 2D invariance that can be used to advantage in 3D to 2D projection. We exploit these techniques and model actions in terms of view-invariant canonical body poses and trajectories in 2D invariance space, leading to a simple and effective way to represent and recognize human actions from a general viewpoint. We first evaluate the approach theoretically and show why a straightforward application of the 2D invariance idea will not work. We describe strategies designed to overcome inherent problems in the straightforward approach and outline the recognition algorithm. We then present results on 2D projections of publicly available human motion capture data as well on manually segmented real image sequences. In addition to robustness to viewpoint change, the approach is robust enough to handle different people, minor variabilities in a given action, and the speed of aciton (and hence, frame-rate) while encoding sufficient distinction among actions.}, isbn = {0920-5691}, url = {http://dx.doi.org/10.1007/s11263-005-3671-4}, author = {Parameswaran,Vasu and Chellapa, Rama} } @article {13183, title = {View-invariant estimation of height and stride for gait recognition}, journal = {Biometric Authentication}, year = {2006}, month = {2006///}, pages = {155 - 167}, abstract = {We present a parametric method to automatically identify people in monocular low-resolution video by estimating the height and stride parameters of their walking gait. Stride parameters (stride length and cadence) are functions of body height, weight, and gender. Previous work has demonstrated effective use of these biometrics for identification and verification of people. In this paper, we show that performance is significantly improved by using height as an additional discriminant feature. Height is estimated by robustly segmenting the person from the background and fitting their apparent height to a time-dependent model. This method is correspondence-free and works with low-resolution images of people. It is also view-invariant, albeit performance is optimal in near fronto-parallel configurations. Identification accuracy is estimated at 47\% for fronto-parallel sequences of 41 people, and 65\% for non-fronto-parallel sequences of 17 people, compared with 18\% and 51\%, respectively, when only stride and cadence are used.}, author = {BenAbdelkader,C. and Cutler, R. and Davis, Larry S.} } @conference {16951, title = {A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories}, booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On}, year = {2006}, month = {2006/11/31/Oct. }, pages = {167 - 174}, publisher = {IEEE}, organization = {IEEE}, abstract = {Finding patterns of events over time is important in searching patient histories, Web logs, news stories, and criminal activities. This paper presents PatternFinder, an integrated interface for query and result-set visualization for search and discovery of temporal patterns within multivariate and categorical data sets. We define temporal patterns as sequences of events with inter-event time spans. PatternFinder allows users to specify the attributes of events and time spans to produce powerful pattern queries that are difficult to express with other formalisms. We characterize the range of queries PatternFinder supports as users vary the specificity at which events and time spans are defined. Pattern Finder{\textquoteright}s query capabilities together with coupled ball-and-chain and tabular visualizations enable users to effectively query, explore and analyze event patterns both within and across data entities (e.g. patient histories, terrorist groups, Web logs, etc.)}, keywords = {ball-and-chain visualization, Chromium, Computer science, Data analysis, data visualisation, Data visualization, Database languages, event pattern discovery, Graphical user interfaces, History, Information Visualization, Medical treatment, multivariate temporal data, Pattern analysis, pattern recognition, PatternFinder integrated interface, Query processing, query visualization, result-set visualization, Spatial databases, tabular visualization, temporal pattern discovery, temporal pattern searching, Temporal query, user interface, User interfaces, visual databases, visual interface}, isbn = {1-4244-0591-2}, doi = {10.1109/VAST.2006.261421}, author = {Fails,J. A and Karlson,A. and Shahamat,L. and Shneiderman, Ben} } @conference {13481, title = {Visualization Support for Fusing Relational, Spatio-Temporal Data: Building Career Histories}, booktitle = {Information Fusion, 2006 9th International Conference on}, year = {2006}, month = {2006/07//}, pages = {1 - 7}, publisher = {IEEE}, organization = {IEEE}, abstract = {Many real-world domains resist analysis because they are best characterized by a variety of data types, including relational, spatial, and temporal components. Examples of such domains include disease outbreaks, criminal networks, and the World-Wide Web. We present two types of visualizations based on physical metaphors that facilitate fusion, analysis, and deep understanding of relational, spatio-temporal data. The first visualization is based on the metaphor of fluid flow through elastic pipes, and the second on wave propagation. We discuss both types of visualizations in the context of fusing information about the activities of scientists over time with the goal of constructing career histories}, isbn = {1-4244-0953-5, 0-9721844-6-5}, doi = {10.1109/ICIF.2006.301772}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4086058}, author = {Blythe,Jim and Patwardhan,Mithila and Oates,Tim and desJardins, Marie and Rheingans,Penny} } @inbook {16090, title = {Visualizing Graphs as Trees: Plant a Seed and Watch it Grow}, booktitle = {Graph DrawingGraph Drawing}, series = {Lecture Notes in Computer Science}, volume = {3843}, year = {2006}, month = {2006///}, pages = {516 - 518}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific node and incrementally explore the local structure of graphs. We believe that it supports particularly well tasks that require rapid reading of labels.}, isbn = {978-3-540-31425-7}, url = {http://dx.doi.org/10.1007/11618058_50}, author = {Lee,Bongshin and Parr,Cynthia and Plaisant, Catherine and Bederson, Benjamin B.}, editor = {Healy,Patrick and Nikolov,Nikola} } @article {19462, title = {VoIP deregulation in South Africa: Implications for underserviced areas}, journal = {Telecommunications Policy}, volume = {30}, year = {2006}, month = {2006/06//}, pages = {332 - 344}, abstract = {Several statutory restrictions have recently been lifted on the use of Voice over Internet Protocol (VoIP) in South Africa. Previously, VoIP could only be utilised by the incumbent telecommunications operator, Telkom, the Second National Operator (SNO) and under serviced area licensees (USALs). This means new opportunities and cost savings for both network service providers and consumers. However, in rural and remote regions, further liberalisation is required so that service providers can take advantage of wireless technologies to provide connectivity in these areas. This paper discusses the legislative environment in South Africa and around the world with respect to VoIP and Wireless Fidelity (WiFi). In addition, examples are provided of how these technologies have been combined to provide last mile solutions around the world and particularly in South Africa. The paper concludes that further liberalisation in the telecommunications environment in South Africa is required if the goal of providing affordable access in rural areas is to be attained. Specifically, it is recommended that wireless technologies be deregulated since the combination of VoIP and WiFi may benefit rural areas. Also, the paper finds that USALs may not be the right model for underserviced areas in South Africa. Lastly, it is apparent that applications drive development and dictate which technologies are relevant for rural areas.}, keywords = {South Africa, VoIP, WiFi}, isbn = {0308-5961}, url = {http://www.sciencedirect.com/science/article/pii/S0308596106000231}, author = {Marshini Chetty and Blake, Edwin and McPhie, Ewan} } @inbook {19210, title = {Voting with Your Feet: An Investigative Study of the Relationship Between Place Visit Behavior and Preference}, booktitle = {UbiComp 2006: Ubiquitous Computing}, series = {Lecture Notes in Computer Science}, volume = {4206}, year = {2006}, month = {2006}, pages = {333 - 350}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Real world recommendation systems, personalized mobile search, and online city guides could all benefit from data on personal place preferences. However, collecting explicit rating data of locations as users travel from place to place is impractical. This paper investigates the relationship between explicit place ratings and implicit aspects of travel behavior such as visit frequency and travel time. We conducted a four-week study with 16 participants using a novel sensor-based experience sampling tool, called My Experience (Me), which we developed for mobile phones. Over the course of the study Me was used to collect 3,458 in-situ questionnaires on 1,981 place visits. Our results show that, first, sensor-triggered experience sampling is a useful methodology for collecting targeted information in situ. Second, despite the complexities underlying travel routines and visit behavior, there exist positive correlations between place preference and automatically detectable features like visit frequency and travel time. And, third, we found that when combined, visit frequency and travel time result in stronger correlations with place rating than when measured individually. Finally, we found no significant difference in place ratings due to the presence of others.}, isbn = {978-3-540-39634-5}, url = {http://dx.doi.org/10.1007/11853565_20}, author = {Jon Froehlich and Chen,Mike and Smith,Ian and Potter,Fred}, editor = {Dourish,Paul and Friday,Adrian} } @article {13201, title = {A video-based framework for the analysis of presentations/posters}, journal = {International Journal on Document Analysis and Recognition}, volume = {7}, year = {2005}, month = {2005///}, pages = {178 - 187}, abstract = {Detection and recognition of textual information in an image or video sequence is important for many applications. The increased resolution and capabilities of digital cameras and faster mobile processing allow for the development of interesting systems. We present an application based on the capture of information presented at a slide-show presentation or at a poster session. We describe the development of a system to process the textual and graphical information in such presentations. The application integrates video and image processing, document layout understanding, optical character recognition (OCR), and pattern recognition. The digital imaging device captures slides/poster images, and the computing module preprocesses and annotates the content. Various problems related to metric rectification, key-frame extraction, text detection, enhancement, and system integration are addressed. The results are promising for applications such as a mobile text reader for the visually impaired. By using powerful text-processing algorithms, we can extend this framework to other applications, e.g., document and conference archiving, camera-based semantics extraction, and ontology creation.}, author = {Zandifar,A. and Duraiswami, Ramani and Davis, Larry S.} } @conference {13191, title = {VidMAP: video monitoring of activity with Prolog}, booktitle = {Advanced Video and Signal Based Surveillance, 2005. AVSS 2005. IEEE Conference on}, year = {2005}, month = {2005/09//}, pages = {224 - 229}, abstract = {This paper describes the architecture of a visual surveillance system that combines real time computer vision algorithms with logic programming to represent and recognize activities involving interactions amongst people, packages and the environments through which they move. The low level computer vision algorithms log primitive events of interest as observed facts, while the higher level Prolog based reasoning engine uses these facts in conjunction with predefined rules to recognize various activities in the input video streams. The system is illustrated in action on a multi-camera surveillance scenario that includes both security and safety violations.}, keywords = {activities, algorithms;, based, Computer, computerised, engine;, higher, image, level, Logic, monitoring;, multicamera, processing;, programming;, Prolog, PROLOG;, reasoning, recognition;, scenario;, signal, streaming;, streams;, Surveillance, surveillance;, system;, video, VISION, vision;, visual}, doi = {10.1109/AVSS.2005.1577271}, author = {Shet,V. D and Harwood,D. and Davis, Larry S.} } @article {15664, title = {Vision geometry XIII(San Jose CA, 18-19 January 2005)}, journal = {SPIE proceedings series}, year = {2005}, month = {2005///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {17494, title = {Visual Specification of Queries for Finding Patterns in Time-Series Data (2001)}, year = {2005}, month = {2005///}, abstract = {Widespread interest in discovering features and trends in time- series has generated a need for tools that support interactive exploration.This paper introduces timeboxes: a powerful graphical, directmanipulation metaphor for the specification of queries over time-series datasets. Our TimeFinder implementation of timeboxes supports interactive formulation and modification of queries, thus speeding the process of exploring time-series data sets and guiding data mining. TimeFinder includes windows for timebox queries, individual time-series, and details-on-demand. Other features include drag-and-drop support for query-by-example and graphical envelopes for displaying the extent of the entire data set and result set from a given query. Extensions involving increased expressive power and general temporal data sets are discussed.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6479}, author = {Hochheiser,Harry and Shneiderman, Ben} } @article {17499, title = {Visualization Methods for Personal Photo Collections: Browsing and Searching in the PhotoFinder (2000)}, year = {2005}, month = {2005///}, abstract = {Software tools for personal photo collection management are proliferating, but they usually have limited searching and browsing functions. We implemented the PhotoFinder prototype to enable non-technical users of personal photo collections to search and browse easily. PhotoFinder provides a set of visual Boolean query interfaces, coupled with dynamic query and query preview features. It gives users powerful search capabilities. Using a scatter plot thumbnail display and drag-and-drop interface, PhotoFinder is designed to be easy to use for searching and browsing photos.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/6472}, author = {Kang,Hyunmo and Shneiderman, Ben} } @article {16109, title = {Visualizing missing data: classification and empirical study}, journal = {Proceedings of INTERACT}, year = {2005}, month = {2005///}, pages = {861 - 872}, abstract = {Most visualization tools fail to provide support for missing data. We identify sources of missing, and categorize data visualization techniques based on the impact missing data have on the display: region dependent, attribute dependent, and neighbor dependent. We then report on a user study with 30 participants that compared three design variants. A between-subject graph interpretation study provides strong evidence for the need of indicating the presence of missing information, and some direction for addressing the problem.}, author = {Eaton,C. and Plaisant, Catherine and Drizd,T.} } @inbook {16108, title = {Visualizing Missing Data: Graph Interpretation User Study}, booktitle = {Human-Computer Interaction - INTERACT 2005}, series = {Lecture Notes in Computer Science}, volume = {3585}, year = {2005}, month = {2005///}, pages = {861 - 872}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Most visualization tools fail to provide support for missing data. In this paper, we identify sources of missing data and describe three levels of impact missing data can have on the visualization: perceivable, invisible or propagating. We then report on a user study with 30 participants that compared three design variants. A between-subject graph interpretation study provides strong evidence for the need of indicating the presence of missing information, and some direction for addressing the problem.}, isbn = {978-3-540-28943-2}, url = {http://dx.doi.org/10.1007/11555261_68}, author = {Eaton,Cyntrica and Plaisant, Catherine and Drizd,Terence}, editor = {Costabile,Maria and Patern{\`o},Fabio} } @article {15490, title = {Validating quality of service for reusable software via model-integrated distributed continuous quality assurance}, journal = {Software Reuse: Methods, Techniques, and Tools}, year = {2004}, month = {2004///}, pages = {286 - 295}, abstract = {Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. Performance-intensive systems software, such as that found in the scientific computing grid and distributed real-time and embedded (DRE) domains, increasingly run on heterogeneous combinations of OS, compiler, and hardware platforms. Such software has stringent quality of service (QoS) requirements and often provides a variety of configuration options to optimize QoS. As a result, QA performed solely in-house is inadequate since it is hard to manage software variability, i.e., ensuring software quality on all supported target platforms across all desired configuration options. This paper describes how the Skoll project is addressing these issues by developing advanced QA processes and tools that leverage the extensive computing resources of user communities in a distributed, continuous manner to improve key software quality attributes.}, doi = {10.1007/978-3-540-27799-6_24}, author = {Krishna,A. and Schmidt,D. and Memon, Atif M. and Porter, Adam and Sevilla,D.} } @article {12942, title = {Variation of toxigenic Vibrio cholerae O1 in the aquatic environment of Bangladesh and its correlation with the clinical strains}, journal = {Microbiology and immunology}, volume = {48}, year = {2004}, month = {2004///}, pages = {773 - 777}, author = {Islam,M. S. and Talukder,K. A. and Khan,N. H. and Mahmud,Z. H. and Rahman,M. Z. and Nair,G. B. and Siddique,A. K. M. and Yunus,M. and Sack,D. A. and Sack,R. B. and Rita R Colwell} } @conference {12705, title = {Vehicle detection and tracking using acoustic and video sensors}, booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on}, volume = {3}, year = {2004}, month = {2004/05//}, pages = {iii - 793-6 vol.3 - iii - 793-6 vol.3}, abstract = {Multimodal sensing has attracted much attention in solving a wide range of problems, including target detection, tracking, classification, activity understanding, speech recognition, etc. In surveillance applications, different types of sensors, such as video and acoustic sensors, provide distinct observations of ongoing activities. We present a fusion framework using both video and acoustic sensors for vehicle detection and tracking. In the detection phase, a rough estimate of target direction-of-arrival (DOA) is first obtained using acoustic data through beam-forming techniques. This initial DOA estimate designates the approximate target location in video. Given the initial target position, the DOA is refined by moving target detection using the video data. Markov chain Monte Carlo techniques are then used for joint audio-visual tracking. A novel fusion approach has been proposed for tracking, based on different characteristics of audio and visual trackers. Experimental results using both synthetic and real data are presented. Improved tracking performance has been observed by fusing the empirical posterior probability density functions obtained using both types of sensors.}, keywords = {acoustic, applications;, audio, audio-visual, beam-forming, Carlo, chain, density, detection;, direction-of-arrival, DOA, empirical, estimation;, framework;, functions;, fusion, fusion;, joint, Markov, methods;, Monte, moving, multimodal, object, optical, posterior, probability, probability;, processes;, processing;, sensing;, sensor, sensors;, signal, Surveillance, surveillance;, systems;, target, techniques;, tracking;, vehicle, video}, doi = {10.1109/ICASSP.2004.1326664}, author = {Chellapa, Rama and Qian,Gang and Qinfen Zheng} } @article {18612, title = {Verifying the Correctness of Wide-Area Internet Routing}, volume = {MIT-CSAIL-TR-2004-031}, year = {2004}, month = {2004/05/17/}, institution = {Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory}, abstract = {Several studies have shown that wide-area Internet routing is fragile, with failures occurring for a variety of reasons. Routing fragility is largely due to the flexible and powerful ways in which BGP can be configured to perform various tasks, which range from implementing the policies of commercial relationships to configuring backup paths. Configuring routers in an AS is like writing a distributed program, and BGP{\textquoteright}s flexible configuration and today{\textquoteright}s relatively low-level configuration languages make the process error-prone. The primary method used by operators to determine whether their complex configurations are correct is to try them out in operation.We believe that there is a need for a systematic approach to verifying router configurations before they are deployed. This paper develops a static analysis framework for configuration checking, and uses it in the design of rcc, a {\textquoteleft}{\textquoteleft}router configuration checker{\textquoteright}{\textquoteright}. rcc takes as input a set of router configurations and flags anomalies and errors, based on a set of well-defined correctness conditions. We have used rcc to check BGP configurations from 9 operational networks, testing nearly 700 real-world router configurations in the process. Every network we analyzed had configuration errors, some of which were potentially serious and had previously gone unnoticed. Our analysis framework and results also suggest ways in which BGP and configuration languages should be improved. rcc has also been downloaded by 30 network operators to date.}, url = {http://dspace.mit.edu/handle/1721.1/30471}, author = {Feamster, Nick and Balakrishnan,Hari} } @article {12936, title = {Viable but Nonculturable Vibrio Cholerae O1 in the Aquatic Environment of Argentina}, journal = {Applied and Environmental MicrobiologyAppl. Environ. Microbiol.}, volume = {70}, year = {2004}, month = {2004/12/01/}, pages = {7481 - 7486}, abstract = {In Argentina, as in other countries of Latin America, cholera has occurred in an epidemic pattern. Vibrio cholerae O1 is native to the aquatic environment, and it occurs in both culturable and viable but nonculturable (VNC) forms, the latter during interepidemic periods. This is the first report of the presence of VNC V. cholerae O1 in the estuarine and marine waters of the R{\'\i}o de la Plata and the Argentine shelf of the Atlantic Ocean, respectively. Employing immunofluorescence and PCR methods, we were able to detect reservoirs of V. cholerae O1 carrying the virulence-associated genes ctxA and tcpA. The VNC forms of V. cholerae O1 were identified in samples of water, phytoplankton, and zooplankton; the latter organisms were mainly the copepods Acartia tonsa, Diaptomus sp., Paracalanus crassirostris, and Paracalanus parvus. We found that under favorable conditions, the VNC form of V. cholerae can revert to the pathogenic, transmissible state. We concluded that V. cholerae O1 is a resident of Argentinean waters, as has been shown to be the case in other geographic regions of the world.}, isbn = {0099-2240, 1098-5336}, doi = {10.1128/AEM.70.12.7481-7486.2004}, url = {http://aem.asm.org/content/70/12/7481}, author = {Binsztein,Norma and Costagliola,Marcela C. and Pichel,Mariana and Jurquiza,Ver{\'o}nica and Ram{\'\i}rez,Fernando C. and Akselman,Rut and Vacchino,Marta and Huq,Anwarul and Rita R Colwell} } @article {12680, title = {Video-Based Automatic Target Recognition}, year = {2004}, month = {2004/12//}, institution = {MARYLAND UNIV COLLEGE PARK CENTER FOR AUTOMATION RESEARCH}, abstract = {We present an approach for vehicle classification in IR video sequences by integrating detection, tracking and recognition. The method has two steps. First, the moving target is automatically detected using a detection algorithm. Next, we perform simultaneous tracking and recognition using an appearance-model based particle filter. The tracking result is evaluated at each frame. Low confidence in tracking performance initiates a new cycle of detection, tracking and classification. We demonstrate the robustness of the proposed method using outdoor IR video sequences.}, keywords = {*SEQUENCES(MATHEMATICS), *TARGET RECOGNITION, *VEHICLES, *VIDEO RECORDING, algorithms, AUTOMATIC TRACKING., COMPONENT REPORTS, MOVING TARGETS, SURFACE TRANSPORTATION AND EQUIPMENT, SYMPOSIA, TARGET CLASSIFICATION, TARGET DIRECTION, RANGE AND POSITION FINDING, tracking, VIDEO SIGNALS}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA431617}, author = {Zhou,S. K and Chellapa, Rama and Mei,Xue and Wu,Hao and Qinfen Zheng} } @conference {12697, title = {View independent human body pose estimation from a single perspective image}, booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on}, volume = {2}, year = {2004}, month = {2004/07/02/june}, pages = {II-16 - II-22 Vol.2 - II-16 - II-22 Vol.2}, abstract = {Recovering the 3D coordinates of various joints of the human body from an image is a critical first step for several model-based human tracking and optical motion capture systems. Unlike previous approaches that have used a restrictive camera model or assumed a calibrated camera, our work deals with the general case of a perspective uncalibrated camera and is thus well suited for archived video. The input to the system is an image of the human body and correspondences of several body landmarks, while the output is the set of 3D coordinates of the landmarks in a body-centric coordinate system. Using ideas from 3D model based invariants, we set up a polynomial system of equations in the unknown head pitch, yaw and roll angles. If we are able to make the often-valid assumption that the torso twist is small, there are finite numbers of solutions to the head-orientation that can be computed readily. Once the head orientation is computed, the epipolar geometry of the camera is recovered, leading to solutions to the 3D joint positions. Results are presented on synthetic and real images.}, keywords = {3D, analysis;, biomechanics;, body, body-centric, camera;, capture, coordinate, coordinates;, detection;, epipolar, equation, estimation;, geometry;, human, image, image;, images;, model-based, models;, MOTION, object, optical, perspective, physiological, polynomial, polynomials;, pose, real, single, synthetic, system;, systems;, torso, tracking;, twist;, uncalibrated}, doi = {10.1109/CVPR.2004.1315139}, author = {Parameswaran, V. and Chellapa, Rama} } @article {13228, title = {Visibility analysis and sensor planning in dynamic environments}, journal = {Computer Vision-ECCV 2004}, year = {2004}, month = {2004///}, pages = {175 - 189}, abstract = {We analyze visibility from static sensors in a dynamic scene with moving obstacles (people). Such analysis is considered in a probabilistic sense in the context of multiple sensors, so that visibility from even one sensor might be sufficient. Additionally, we analyze worst-case scenarios for high-security areas where targets are non-cooperative. Such visibility analysis provides important performance characterization of multi-camera systems. Furthermore, maximization of visibility in a given region of interest yields the optimum number and placement of cameras in the scene. Our analysis has applications in surveillance {\textendash} manual or automated {\textendash} and can be utilized for sensor planning in places like museums, shopping malls, subway stations and parking lots. We present several example scenes {\textendash} simulated and real {\textendash} for which interesting camera configurations were obtained using the formal analysis developed in the paper.}, author = {Mittal,A. and Davis, Larry S.} } @article {13222, title = {Visibility Planning: Predicting Continuous Period of Unobstructed Views}, journal = {Technical Reports from UMIACS}, year = {2004}, month = {2004/04/19/}, abstract = {To perform surveillance tasks effectively, unobstructed views ofobjects are required e.g. unobstructed video of objects are often needed for gait recognition. As a result, we need to determine intervals for video collection during which a desired object is visible w.r.t. a given sensor. In addition, these intervals are in the future so that the system can effectively plan and schedule sensors for collecting these videos. We describe an approach to determine these visibility intervals. A Kalman filter is first used to predict the trajectories of the objects. The trajectories are converted to polar coordinate representations w.r.t. a given sensor. Trajectories with the same angular displacement w.r.t. the sensor over time can be found by determining intersection points of functions representing these trajectories. Intervals between these intersection points are suitable for video collection. We also address the efficiency issue of finding these intersection points. An obvious brute force approach of $O(N^2)$ exists, where $N$ is the number of objects. This approach suffices when $N$ is small. When $N$ is large, we introduce an optimal segment intersection algorithm of $O(N\log^2N+I)$, $I$ being the number of intersection points. Finally, we model the prediction errors associated with the Kalman filter using a circular object representation. Experimental results that compare the performance of the brute force and the optimal segment intersection algorithms are shown. (UMIACS-TR-2004-22) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1349}, author = {Lim,Ser-Nam and Davis, Larry S. and Wan,Yung-Chun (Justin)} } @article {15656, title = {Vision Geometry XII}, journal = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {5300}, year = {2004}, month = {2004///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {15663, title = {Vision geometry XII:(San Jose CA, 19-20 January 2004)}, journal = {SPIE proceedings series}, year = {2004}, month = {2004///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {16888, title = {Visual Content Mining in Multimedia Documents-Indexing Issues in Supporting Similarity Searching}, journal = {Lecture Notes in Computer Science}, volume = {3332}, year = {2004}, month = {2004///}, pages = {463 - 470}, author = {Samet, Hanan} } @article {12682, title = {Visual tracking and recognition using appearance-adaptive models in particle filters}, journal = {IEEE Transactions on Image Processing}, volume = {13}, year = {2004}, month = {2004/11//}, pages = {1491 - 1506}, abstract = {We present an approach that incorporates appearance-adaptive models in a particle filter to realize robust visual tracking and recognition algorithms. Tracking needs modeling interframe motion and appearance changes, whereas recognition needs modeling appearance changes between frames and gallery images. In conventional tracking algorithms, the appearance model is either fixed or rapidly changing, and the motion model is simply a random walk with fixed noise variance. Also, the number of particles is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following modifications: an observation model arising from an adaptive appearance model, an adaptive velocity motion model with adaptive noise variance, and an adaptive number of particles. The adaptive-velocity model is derived using a first-order linear predictor based on the appearance difference between the incoming observation and the previous particle configuration. Occlusion analysis is implemented using robust statistics. Experimental results on tracking visual objects in long outdoor and indoor video sequences demonstrate the effectiveness and robustness of our tracking algorithm. We then perform simultaneous tracking and recognition by embedding them in a particle filter. For recognition purposes, we model the appearance changes between frames and gallery images by constructing the intra- and extrapersonal spaces. Accurate recognition is achieved when confronted by pose and view variations.}, keywords = {adaptive filters, adaptive noise variance, algorithms, appearance-adaptive model, Artificial intelligence, Cluster Analysis, Computer Graphics, Computer simulation, Feedback, Filtering, first-order linear predictor, hidden feature removal, HUMANS, Image Enhancement, Image Interpretation, Computer-Assisted, image recognition, Information Storage and Retrieval, Kinematics, Laboratories, Male, Models, Biological, Models, Statistical, MOTION, Movement, Noise robustness, Numerical Analysis, Computer-Assisted, occlusion analysis, Particle filters, Particle tracking, Pattern Recognition, Automated, Predictive models, Reproducibility of results, robust statistics, Sensitivity and Specificity, Signal Processing, Computer-Assisted, State estimation, statistical analysis, Subtraction Technique, tracking, Training data, visual recognition, visual tracking}, isbn = {1057-7149}, doi = {10.1109/TIP.2004.836152}, author = {Zhou,Shaohua Kevin and Chellapa, Rama and Moghaddam, B.} } @article {17496, title = {Visualization and analysis of microarray and gene ontology data with treemaps}, journal = {BMC Bioinformatics}, volume = {5}, year = {2004}, month = {2004/06/28/}, pages = {84 - 84}, abstract = {The increasing complexity of genomic data presents several challenges for biologists. Limited computer monitor views of data complexity and the dynamic nature of data in the midst of discovery increase the challenge of integrating experimental results with information resources. The use of Gene Ontology enables researchers to summarize results of quantitative analyses in this framework, but the limitations of typical browser presentation restrict data access.}, isbn = {1471-2105}, doi = {10.1186/1471-2105-5-84}, url = {http://www.biomedcentral.com/1471-2105/5/84}, author = {Baehrecke,Eric H and Dang,Niem and Babaria,Ketan and Shneiderman, Ben} } @article {12189, title = {Visualizations for taxonomic and phylogenetic trees}, journal = {Bioinformatics}, volume = {20}, year = {2004}, month = {2004///}, pages = {2997 - 2997}, author = {Parr,C.S. and Lee,B. and Campbell,D. and Bederson, Benjamin B.} } @conference {14307, title = {Visualizing type qualifier inference with Eclipse}, booktitle = {Proceedings of the 2004 OOPSLA workshop on eclipse technology eXchange}, year = {2004}, month = {2004///}, pages = {57 - 61}, author = {Greenfieldboyce,D. and Foster, Jeffrey S.} } @conference {16906, title = {VASCO: visualizing and animating spatial constructs and operations}, booktitle = {Proceedings of the nineteenth annual symposium on Computational geometry}, series = {SCG {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {374 - 375}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {A video is used to demonstrate a set of spatial index JAVA applets that enable users on the worldwide web to experiment with a number of variants of the quadtree spatial data structure for different spatial data types, and, most importantly, enable them to see in an animated manner how a number of basic search operations are executed for them. The spatial data types are points, line segments, rectangles, and regions. The search operations are the window query (i.e., a spatial range query) and a nearest neighbor query that enables ranking spatial objects in the order of their distance from a given query object. The representations and algorithms are visualized and animated in a consistent manner using the same primitives and colors so that the differences between the effects of the representations can be easily understood. The video demonstrates the PR quadtree, PM1 quadtree, and R-tree. The applets can be found at: www.cs.umd.edu/~hjs/quadtree/.}, keywords = {k-d trees, Nearest neighbor algorithms, quadtrees, R-trees, Visualization}, isbn = {1-58113-663-3}, doi = {10.1145/777792.777849}, url = {http://doi.acm.org/10.1145/777792.777849}, author = {Brabec,Frantivsek and Samet, Hanan and Yilmaz,Cemal} } @conference {13690, title = {Video Analysis for Pervasive Environments}, booktitle = {ICME}, volume = {2}, year = {2003}, month = {2003///}, pages = {161 - 164}, author = {David Doermann and Karunanidhi,A.} } @conference {12727, title = {Video based rendering of planar dynamic scenes}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {1}, year = {2003}, month = {2003/07//}, pages = {I - 477-80 vol.1 - I - 477-80 vol.1}, abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene from a monocular video sequence of it. The 3-D direction of motion of the object is robustly estimated from the video sequence. Given this direction any other view of the object can be synthesized through a perspective projection approach, under assumptions of planarity. If the distance of the object from the camera is large, a planar approximation is reasonable even for non-planar scenes. Such a method has many important applications, one of them being gait recognition where a side view of the person is required. Our method can be used to synthesize the side-view of the person in case he/she does not present a side view to the camera. Since the planarity assumption is often an approximation, the effects of non-planarity can lead to inaccuracies in rendering and needs to be corrected for. Regions where this happens are examined and a simple technique based on weak perspective approximation is proposed to offset rendering inaccuracies. Examples of synthesized views using our method and performance evaluation are presented.}, keywords = {(computer, 3D, analysis;, approximation;, based, camera;, cameras;, direction;, dynamic, graphics);, image, monocular, MOTION, perspective, planar, processing;, rendering, rendering;, scenes;, sequence;, sequences;, signal, video, weak}, doi = {10.1109/ICME.2003.1220958}, author = {Kale, A. and Chowdhury, A.K.R. and Chellapa, Rama} } @book {13691, title = {Video Mining}, year = {2003}, month = {2003/08/31/}, publisher = {Springer}, organization = {Springer}, abstract = {Video Mining is an essential reference for the practitioners and academicians in the fields of multimedia search engines.Half a terabyte or 9,000 hours of motion pictures are produced around the world every year. Furthermore, 3,000 television stations broadcasting for twenty-four hours a day produce eight million hours per year, amounting to 24,000 terabytes of data. Although some of the data is labeled at the time of production, an enormous portion remains unindexed. For practical access to such huge amounts of data, there is a great need to develop efficient tools for browsing and retrieving content of interest, so that producers and end users can quickly locate specific video sequences in this ocean of audio-visual data.Video Mining is important because it describes the main techniques being developed by the major players in industry and academic research to address this problem. It is the first time research from these leaders in the field developing the next-generation multimedia search engines is being described in great detail and gathered into a single volume.Video Mining will give valuable insights to all researchers and non-specialists who want to understand the principles applied by the multimedia search engines that are about to be deployed on the Internet, in studios{\textquoteright} multimedia asset management systems, and in video-on-demand systems.}, keywords = {Computers / Client-Server Computing, Computers / Computer Science, Computers / Database Management / Data Mining, Computers / Database Management / General, Computers / Information Technology, Computers / Information Theory, Computers / Intelligence (AI) \& Semantics, Computers / Interactive \& Multimedia, Computers / Networking / General, Computers / Security / Cryptography, data mining, Data mining/ Congresses, Mathematics / General, Medical / General, multimedia systems, Multimedia systems/ Congresses, Technology \& Engineering / Electrical, Technology \& Engineering / Telecommunications}, isbn = {9781402075490}, author = {Rosenfeld,Azriel and David Doermann and DeMenthon,Daniel} } @conference {13693, title = {Video Retrieval using Spatio-Temporal Descriptors}, booktitle = {ACMMultimedia {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {508 - 517}, abstract = {This paper describes a novel methodology for implementing video search functions such as retrieval of near-duplicate videos and recognition of actions in surveillance video. Videos are divided into half-second clips whose stacked frames produce 3D space-time volumes of pixels. Pixel regions with consistent color and motion properties are extracted from these 3D volumes by a threshold-free hierarchical space-time segmentation technique. Each region is then described by a high-dimensional point whose components represent the position, motion and, when possible, color of the region. In the indexing phase for a video database, these points are assigned labels that specify their video clip of origin. All the labeled points for all the clips are stored into a single binary tree for ecient k-nearest neighbor retrieval. The retrieval phase uses video segments as queries. Half-second clips of these queries are again segmented to produce sets of points, and for each point the labels of its nearest neighbors are retrieved. The labels that receive the largest numbers of votes correspond to the database clips that are the most similar to the query video segment. We illustrate this approach for video indexing and retrieval and for action recognition. First, we describe retrieval experiments for dynamic logos, and for video queries that di er from the indexed broadcasts by the addition of large overlays. Then we describe experiments in which oce actions (such as pulling and closing drawers, taking and storing items, picking up and putting down a phone) are recognized. Color information is ignored to insure independence to people{\textquoteright}s appearance. One of the distinct advantages of using this approach for action recognition is that there is no need for detection or recognition of body parts.}, author = {DeMenthon,Daniel and David Doermann} } @article {12742, title = {VIDEO SYNTHESIS OF ARBITRARY VIEWS FOR APPROXIMATELY PLANAR SCENES}, journal = {IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS SPEECH AND SIGNAL PROCESSING}, volume = {3}, year = {2003}, month = {2003///}, author = {Chowdhury, A.R. and Kale, A. and Chellapa, Rama} } @conference {12735, title = {Video synthesis of arbitrary views for approximately planar scenes}, booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on}, volume = {3}, year = {2003}, month = {2003/04//}, pages = {III - 497-500 vol.3 - III - 497-500 vol.3}, abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene, given a monocular video sequence. The method is based on the availability of knowledge of the angle between the original and synthesized views. Such a method has many important applications, one of them being gait recognition. Gait recognition algorithms rely on the availability of an approximate side-view of the person. From a realistic viewpoint, such an assumption is impractical in surveillance applications and it is of interest to develop methods to synthesize a side view of the person, given an arbitrary view. For large distances from the camera, a planar approximation for the individual can be assumed. In this paper, we propose a perspective projection approach for recovering the direction of motion of the person purely from the video data, followed by synthesis of a new video sequence at a different angle. The algorithm works purely in the image and video domain, though 3D structure plays an implicit role in its theoretical justification. Examples of synthesized views using our method and performance evaluation are presented.}, keywords = {(access, 3D, applications;, approach;, approximately, approximation;, arbitrary, Biometrics, control);, data;, direction, estimation;, evaluation;, Gait, image, monocular, MOTION, performance, perspective, planar, processing;, projection, recognition;, recovery;, scenes;, sequence;, sequences;, side, signal, structure;, Surveillance, surveillance;, synthesis;, synthesized, video, view, views;}, doi = {10.1109/ICASSP.2003.1199520}, author = {Chowdhury, A.K.R. and Kale, A. and Chellapa, Rama} } @conference {12724, title = {View synthesis of articulating humans using visual hull}, booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on}, volume = {1}, year = {2003}, month = {2003/07//}, pages = {I - 489-92 vol.1 - I - 489-92 vol.1}, abstract = {In this paper, we present a method, which combines image-based visual hull and human body part segmentation for overcoming the inability of the visual hull method to reconstruct concave regions. The virtual silhouette image corresponding to the given viewing direction is first produced with image-based visual hull. Human body part localization technique is used to segment the input images and the rendered virtual silhouette image into convex body parts. The body parts in the virtual view are generated separately from the corresponding body parts in the input views and then assembled together. The previously rendered silhouette image is used to locate the corresponding body parts in input views and avoid the unconnected or squeezed regions in the assembled final view. Experiments show that this method can improve the reconstruction of concave regions for human postures and texture mapping.}, keywords = {analysis;, body, convex, gesture, hull;, human, image, image-based, image;, mapping;, MOTION, part, parts;, postures;, recognition;, reconstruction;, segmentation;, silhouette, synthesis;, TEXTURE, texture;, view, virtual, visual}, doi = {10.1109/ICME.2003.1220961}, author = {Yue,Zhanfeng and Liang Zhao and Chellapa, Rama} } @article {17849, title = {The virtual microscope}, journal = {IEEE Transactions on Information Technology in Biomedicine}, volume = {7}, year = {2003}, month = {2003/12//}, pages = {230 - 248}, abstract = {We present the design and implementation of the virtual microscope, a software system employing a client/server architecture to provide a realistic emulation of a high power light microscope. The system provides a form of completely digital telepathology, allowing simultaneous access to archived digital slide images by multiple clients. The main problem the system targets is storing and processing the extremely large quantities of data required to represent a collection of slides. The virtual microscope client software runs on the end user{\textquoteright}s PC or workstation, while database software for storing, retrieving and processing the microscope image data runs on a parallel computer or on a set of workstations at one or more potentially remote sites. We have designed and implemented two versions of the data server software. One implementation is a customization of a database system framework that is optimized for a tightly coupled parallel machine with attached local disks. The second implementation is component-based, and has been designed to accommodate access to and processing of data in a distributed, heterogeneous environment. We also have developed caching client software, implemented in Java, to achieve good response time and portability across different computer platforms. The performance results presented show that the Virtual Microscope systems scales well, so that many clients can be adequately serviced by an appropriately configured data server.}, keywords = {biomedical optical imaging, client software, client/server architecture, Computer architecture, Computer Graphics, computer platforms, Computer simulation, Concurrent computing, configured data server, data server software, database management systems, database software, Database systems, digital slide images, digital telepathology, diseases, emulation, Environment, Equipment Design, Equipment Failure Analysis, high power light microscope, Image databases, Image Enhancement, Image Interpretation, Computer-Assisted, Image retrieval, Information retrieval, Information Storage and Retrieval, java, local disks, microscope image data, Microscopy, multiple clients, optical microscopy, PACS, software, Software design, software system, Software systems, Systems Integration, Telepathology, User-Computer Interface, virtual microscope design, Virtual reality, Workstations}, isbn = {1089-7771}, doi = {10.1109/TITB.2004.823952}, author = {Catalyurek,U. and Beynon,M. D and Chang,Chialin and Kurc, T. and Sussman, Alan and Saltz, J.} } @inbook {16135, title = {Visual Information Management for Network Configuration}, booktitle = {The Craft of Information VisualizationThe Craft of Information Visualization}, year = {2003}, month = {2003///}, pages = {239 - 256}, publisher = {Morgan Kaufmann}, organization = {Morgan Kaufmann}, address = {San Francisco}, abstract = {Current network management systems rely heavily on forms in their user interfaces. The interfaces reflect the intricacies of the network hardware components but provide little support for guiding users through tasks. There is a scarcity of useful graphical visualizations and decision-support tools.}, isbn = {978-1-55860-915-0}, url = {http://www.sciencedirect.com/science/article/pii/B9781558609150500329}, author = {Kumar,Harsha and Plaisant, Catherine and Teittinen,Marko and Shneiderman, Ben}, editor = {Bederson, Benjamin B. and Shneiderman, Ben} } @conference {19625, title = {A Visualization of the Primal Simplex Algorithm for the Assignment Problem}, booktitle = {ITiCSE {\textquoteright}03 Proceedings of the 8th Annual Conference on Innovation and Technology in Computer Science Education }, series = {ITiCSE {\textquoteright}03}, year = {2003}, month = {2003///}, pages = {267 - 267}, publisher = {ACM}, organization = {ACM}, abstract = {An educationally-oriented Visualization Software used to assist the teaching of the Primal Simplex Algorithm for the Assignment Problem is presented.}, keywords = {Assignment problem, Visualization}, isbn = {1-58113-672-2}, url = {http://doi.acm.org/10.1145/961511.961631}, author = {Charalampos Papamanthou and Paparrizos, Konstantinos} } @article {17500, title = {Visualization Viewpoints}, journal = {IEEE Computer Graphics and Applications}, volume = {23}, year = {2003}, month = {2003///}, pages = {12 - 15}, author = {Shneiderman, Ben} } @inbook {16130, title = {Visualizing websites using a hierarchical table of contents browser: WebTOC}, booktitle = {The craft of information visualization: readings and reflectionsThe craft of information visualization: readings and reflections}, year = {2003}, month = {2003///}, pages = {438 - 438}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, isbn = {9781558609150}, author = {Plaisant, Catherine and Marchionini,G. and Komlodi,A.} } @conference {13689, title = {Video analysis applications for pervasive environments}, booktitle = {1st International Conference on Mobile and Ubiquitous Multimedia}, year = {2002}, month = {2002///}, pages = {48 - 55}, abstract = {Network capabilities are expanding at arate that will soon allow a much wider range of image and video content to be delivered to and transmitted from mobile wireless devices. Current pervasive applications provide image and video content primarily in high performance networks or by streaming video over low-bandwidth networks. For video to be truly integrated into ubiquitous applications, we must carefully consider the role of automated video analysis to move beyond simple content delivery. Compression and content adaptation have been significant areas of research for some time and deal with the problem of moving media to devices with limited network, software and hardware capabilities. In the near future, mobile wireless devices that have been primarily consumers of image and video will be able to produce such content as well. In this paper, we will review some of the significant issues associated with providing video capabilities in pervasive environments. We consider not only streaming video applications, but point-to- point video and video messaging capabilities as well. We will show how our previous work on content adaptation is being applied to these types of environments, show what role more general video analysis can play and describe a general architecture for video capture, storage, analysis and transmission. }, author = {Karunanidhi,A. and David Doermann and Parekh,N. and Rautio,V.} } @article {12764, title = {View-Based Recognition of Military Vehicles in Ladar Imagery Using CAD Model Matching}, journal = {OPTICAL ENGINEERING-NEW YORK-MARCEL DEKKER INCORPORATED-}, volume = {78}, year = {2002}, month = {2002///}, pages = {151 - 188}, author = {Der, S.Z. and Zheng,Q. and Redman, B. and Chellapa, Rama and Mahmoud, H.} } @conference {18470, title = {Virtual audio system customization using visual matching of ear parameters}, booktitle = {16th International Conference on Pattern Recognition, 2002. Proceedings}, volume = {3}, year = {2002}, month = {2002///}, pages = {1003- 1006 vol.3 - 1003- 1006 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {Applications in the creation of virtual auditory spaces (VAS) and sonification require individualized head related transfer functions (HRTFs) for perceptual fidelity. HRTFs exhibit significant variation from person to person due to differences between their pinnae, and their body sizes. We propose and preliminarily implement a simple HRTF customization based on the use of a published database of HRTFs (Algazi et al., 2001) that also contains geometrical measurements of subject pinnae. We measure some of these features via simple image processing, and select the HRTF that has features most closely corresponding to the individual{\textquoteright}s features. This selection procedure is implemented along with the virtual auditory system described in (Zotkin et al., 2002), and listener tests conducted comparing the customized HRTF and a fixed HRTF. Despite the simplicity of the method, tests reveal average improvement in localization accuracy of about 25 percent, though performance improvement varies with source location and individuals.}, keywords = {acoustic signal processing, Audio systems, Auditory system, Computer vision, database, Ear, ear parameter matching, geometrical measurements, Head, head related transfer functions, HRTF customization, Image databases, IMAGE PROCESSING, medical image processing, performance improvement, Position measurement, sonification, Spatial databases, System testing, Transfer functions, virtual audio system customization, virtual auditory spaces, virtual auditory system, visual matching}, isbn = {0-7695-1695-X}, doi = {10.1109/ICPR.2002.1048207}, author = {Zotkin,Dmitry N and Duraiswami, Ramani and Davis, Larry S. and Mohan,A. and Raykar,V.} } @article {13479, title = {Virtual Telescopes in Education}, journal = {Journal of Digital Information}, volume = {2}, year = {2002}, month = {2002///}, abstract = {Virtual Telescopes in Education is providing the services required to operate a virtual observatory comprising distributed telescopes, including an interactive, constraint-based scheduling service, data and resource archive, proposal preparation and review environment, and a VTIE Journal. A major goal of VTIE is to elicit from learners questions about the nature of celestial objects and the physical processes that give rise to the spectacular imagery that catches their imaginations. Generation of constrained science questions will assist learners in the science process. To achieve interoperability with other NSDL resources, our approach follows the Open Archives Initiative and the W3C Semantic Web activity.}, author = {Hoban,S. and desJardins, Marie and Farrell,N. and Rathod,P. and Sachs,J. and Sansare,S. and Yesha,Y. and Keating,J. and Busschots,B. and Means,J. and others} } @article {15662, title = {Vision geometry XI(Seattle WA, 7-8 July 2002)}, journal = {SPIE proceedings series}, year = {2002}, month = {2002///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @article {17492, title = {Visual queries for finding patterns in time series data}, journal = {University of Maryland, Computer Science Dept. Tech Report, CS-TR-4365}, year = {2002}, month = {2002///}, abstract = {Few tools exist for data exploration and pattern iden-tification in time series data sets. Timeboxes are rectan- gular, direct-manipulation queries for studying time-series datasets. Timeboxes are the primary query tool in our Time- Searcher application, which supports interactive explo- ration via dynamic queries, along with overviews of query results and drag-and-drop support for query-by-example. This paper describes the TimeSearcher application and pos- sible extensions to the timebox query model, along with a discussion of the use of TimeSearcher for exploring a time series data set involving gene expression profiles. }, author = {Hochheiser,H. and Shneiderman, Ben} } @article {12175, title = {A visual search tool for early elementary science students}, journal = {Journal of Science Education and Technology}, volume = {11}, year = {2002}, month = {2002///}, pages = {49 - 57}, author = {Revelle,G. and Druin, Allison and Platner,M. and Bederson, Benjamin B. and Hourcade,J. P and Sherman,L.} } @article {12060, title = {Visual space-time geometry - A tool for perception and the imagination}, journal = {Proceedings of the IEEE}, volume = {90}, year = {2002}, month = {2002/07//}, pages = {1113 - 1135}, abstract = {Although the fundamental ideas underlying research efforts in the field of computer vision have not radically changed in the past two decades, there has been a transformation in the way work in this field is conducted. This is primarily due to the emergence of a number of tools, of both a practical and a theoretical nature. One such tool, celebrated throughout the nineties, is the geometry of visual space-time. It is known under a variety of headings, such as multiple view geometry, structure from motion, and model building. It is a mathematical theory relating multiple views (images) of a scene taken at different viewpoints to three-dimensional models of the (possibly dynamic) scene. This mathematical theory gave rise to algorithms that take as input images (or video) and provide as output a model of the scene. Such algorithms are one of the biggest successes of the field and they have many applications in other disciplines, such as graphics (image-based rendering, motion capture) and robotics (navigation). One of the difficulties, however is that the current tools cannot yet be fully automated, and they do not provide very accurate results. More research is required for automation and high precision. During the past few years we have investigated a number of basic questions underlying the structure from motion problem. Our investigations resulted in a small number of principles that characterize the problem. These principles, which give rise to automatic procedures and point to new avenues for studying the next level of the structure from motion problem, are the subject of this paper.}, keywords = {3-D motion estimation, Buildings, Computer vision, Geometry, Graphics, Image sequences, Layout, Mathematical model, mathematical theory, model building, Motion estimation, multiple view geometry, multiple views, Navigation, optical flow, optical illusions, patch correspondence, Rendering (computer graphics), Robotics and automation, Solid modeling, structure from motion, three-dimensional models, visual space-time}, isbn = {0018-9219}, doi = {10.1109/JPROC.2002.801440}, author = {Ferm{\"u}ller, Cornelia and Baker, P. and Aloimonos, J.} } @article {12960, title = {A voyage of discovery: cholera, climate and complexity}, journal = {Environmental Microbiology}, volume = {4}, year = {2002}, month = {2002/04/23/}, pages = {67 - 69}, isbn = {1462-2920}, doi = {10.1046/j.1462-2920.2002.00270.x}, url = {http://onlinelibrary.wiley.com/doi/10.1046/j.1462-2920.2002.00270.x/abstract}, author = {Rita R Colwell} } @conference {16488, title = {Validating an access cost model for wide area applications}, booktitle = {Cooperative Information Systems}, year = {2001}, month = {2001///}, pages = {371 - 385}, author = {Zadorozhny,V. and Raschid, Louiqa and Zhan,T. and Bright,L.} } @conference {17937, title = {Variable-precision rendering}, booktitle = {Proceedings of the 2001 symposium on Interactive 3D graphics}, series = {I3D {\textquoteright}01}, year = {2001}, month = {2001///}, pages = {149 - 158}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {hierarchical rendering, levels of detail, variable-precision rendering, view-dependent rendering}, isbn = {1-58113-292-1}, doi = {10.1145/364338.364384}, url = {http://doi.acm.org/10.1145/364338.364384}, author = {Hao,Xuejun and Varshney, Amitabh} } @conference {16155, title = {VEHICLE SPEED INFORMATION DISPLAYS FOR PUBLIC WEBSITES: A STUDY OF USER PREFERENCES}, booktitle = {ITS 2001: Conference Proceedings}, year = {2001}, month = {2001///}, author = {Plaisant, Catherine and Bhamidipati,P. and Tarnoff,P.} } @conference {15658, title = {Vision Geometry X}, booktitle = {Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series}, volume = {4476}, year = {2001}, month = {2001///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y and Melter,R.A.} } @article {17493, title = {Visual specification of queries for finding patterns in time-series data}, journal = {Proceedings of discovery science}, year = {2001}, month = {2001///}, pages = {441 - 446}, abstract = {Widespread interest in discovering features and trends in time- series has generated a need for tools that support interactive exploration.This paper introduces timeboxes: a powerful graphical, direct-manipulation metaphor for the specification of queries over time-series datasets. Our TimeFinder implementation of timeboxes supports interactive formulation and modification of queries, thus speeding the process of exploring time-series data sets and guiding data mining. TimeFinder includes windows for timebox queries, individual time-series, and details-on-demand. Other features include drag-and-drop support for� query-by-example and graphical envelopes for displaying the extent of the entire data set and result set from a given query. Extensions involving increased expressive power and general temporal data sets are discussed.}, author = {Hochheiser,H. and Shneiderman, Ben} } @article {17842, title = {Visualization of large data sets with the Active Data Repository}, journal = {IEEE Computer Graphics and Applications}, volume = {21}, year = {2001}, month = {2001/08//Jul}, pages = {24 - 33}, abstract = {We implement ray-casting-based volume rendering and isosurface rendering methods using the Active Data Repository (ADR) for visualizing out-of-core data sets. We have developed the ADR object-oriented framework to provide support for applications that employ range queries with user-defined mapping and aggregation operations on large-scale multidimensional data. ADR targets distributed-memory parallel machines with one or more disks attached to each node. It is designed as a set of modular services implemented in C++, which can be customized for application-specific processing. The ADR runtime system supports common operations such as memory management, data retrieval, and scheduling of processing across a parallel machine}, keywords = {active data repository, ADR runtime system, Algorithm design and analysis, application-specific processing, C++, data mining, data retrieval, data visualisation, Data visualization, distributed-memory parallel machines, Indexing, Information retrieval, isosurface rendering, Isosurfaces, large data sets, large-scale multidimensional data, Memory management, modular services, out-of-core data sets, parallel machine, Parallel machines, Partitioning algorithms, ray-casting-based volume rendering, Rendering (computer graphics), Runtime, software libraries, storage management}, isbn = {0272-1716}, doi = {10.1109/38.933521}, author = {Kurc, T. and Catalyurek,U. and Chang,Chialin and Sussman, Alan and Saltz, J.} } @conference {17669, title = {The value of strong inapproximability results for clique}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, series = {STOC {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {144 - 152}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {P vs. NP, Approximation algorithms, Clique, inapproximabilit, Independent set, Packing integer programs, random sampling}, isbn = {1-58113-184-4}, doi = {10.1145/335305.335322}, url = {http://doi.acm.org/10.1145/335305.335322}, author = {Srinivasan, Aravind} } @article {16159, title = {Vehicle Speed Information Displays for Public Websites A Survey of User Preferences}, journal = {Technical Reports from UMIACS}, year = {2000}, month = {2000/10/09/}, abstract = {The paper reports on a study comparing alternative presentations offreeway speed data on maps. The goal of the study was to inform the design of displays of real time speed data over the Internet to the general public. Subjects were presented with a series of displays and asked to rate their preferences. We looked at different choices of color (3 colors, 6 colors or a continuous range), and proposed line, sensor, and segment representations of the speed data. We also collected feedback on more complex displays such as comparison between current and "normal" speeds, and a chart of speed variation over a period of time at given locations. (Also cross-referenced as HCIL-TR-2000-23) (Also cross-referenced as UMIACS-TR-2000-73) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/1109}, author = {Plaisant, Catherine and Bhamidipati,Phanikumar} } @conference {18288, title = {Video access control via multi-level data hiding}, booktitle = {Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on}, volume = {1}, year = {2000}, month = {2000///}, pages = {381 -384 vol.1 - 381 -384 vol.1}, abstract = {The paper proposes novel data hiding algorithms and system design for high quality digital video. Instead of targeting on a single degree of robustness, which results in overestimation and/or underestimation of the noise conditions, we apply multi-level embedding to digital video to achieve more than one level of robustness-capacity tradeoff. In addition, an adaptive technique is proposed to determine how many bits are embedded in each part of the video. Besides user data, control information such as synchronization and the number of hidden user bits are embedded as well. The algorithm can be used for applications such as access control}, keywords = {access, adaptive, algorithms;hidden, bits;high, conditions;robustness;robustness-capacity, control;adaptive, data, data;video, design;user, digital, embedding;noise, encapsulation;multimedia, hiding, hiding;multi-level, information;data, processing;, QUALITY, signal, systems;authorisation;data, systems;video, technique;control, tradeoff;system, user, video;multi-level}, doi = {10.1109/ICME.2000.869620}, author = {M. Wu and Yu,Hong Heather} } @conference {18289, title = {Video transcoding by reducing spatial resolution}, booktitle = {Image Processing, 2000. Proceedings. 2000 International Conference on}, volume = {1}, year = {2000}, month = {2000///}, pages = {972 -975 vol.1 - 972 -975 vol.1}, abstract = {In network delivery of digital video, if the bandwidth required for a video is not available, the video has to be recoded at a reduced bit rate. It is highly desirable that the transcoding is carried out in real time while maintaining reasonable image quality. In this paper, we propose a fast approach to derive from an MPEG stream a new MPEG stream with half the spatial resolution. For the downsized video, we first generate from the original compressed video an improved estimate of the motion vectors. We then propose a compressed domain approach with data hiding to produce DCT residues by an open-loop method. The computational complexity is significantly lower than a number of previous approaches. Simulation suggests that our approach produces reasonable image quality}, keywords = {approach;computational, coding;, coding;video, complexity;data, compression;data, cosine, DCT, delivery;open-loop, domain, encapsulation;discrete, estimation;network, estimation;transform, hiding;digital, method;spatial, quality;motion, reduction;video, residues;MPEG, resolution, resolution;motion, stream;compressed, transcoding;computational, transforms;image, vectors, video;downsized, video;image}, doi = {10.1109/ICIP.2000.901123}, author = {Yin,Peng and M. Wu and Liu,Bede} } @article {15605, title = {Visibility stabs and depth-first spiralling on line segments in output sensitive time}, journal = {International Journal of Computational Geometry and Applications}, volume = {10}, year = {2000}, month = {2000///}, pages = {535 - 552}, abstract = {Given a set S of n non-intersecting line segments in the plane, we present a newtechnique for e ciently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. Depth- rst spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis{\textquoteright} March and depth- rst search. It is a practical method and has been implemented in C++ using LEDA. }, author = {Keil,M. and Mount, Dave and Wismath,S.K.} } @article {15661, title = {Vision geometry IX:(San Diego CA, 30-31 July 2000)}, journal = {SPIE proceedings series}, year = {2000}, month = {2000///}, author = {Latecki,L.J. and Mount, Dave and Wu,A. Y} } @book {17972, title = {Visualization 2000}, year = {2000}, month = {2000///}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, author = {Ertl,T. and Hamann,B. and Varshney, Amitabh} } @conference {17498, title = {Visualization methods for personal photo collections: browsing and searching in the PhotoFinder}, booktitle = {2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000}, volume = {3}, year = {2000}, month = {2000///}, pages = {1539-1542 vol.3 - 1539-1542 vol.3}, publisher = {IEEE}, organization = {IEEE}, abstract = {Software tools for personal photo collection management are proliferating, but they usually have limited searching and browsing functions. We implemented the PhotoFinder prototype to enable non-technical users of personal photo collections to search and browse easily. PhotoFinder provides a set of visual Boolean query interfaces, coupled with dynamic query and query preview features. It gives users powerful search capabilities. Using a scatter plot thumbnail display and drag-and-drop interface, PhotoFinder is designed to be easy to use for searching and browsing photos}, keywords = {Browsing, Computer science, digital photo library, Displays, drag-and-drop interface, dynamic query, Educational institutions, Filters, Histograms, Image retrieval, personal computing, personal photo collections, photo collection management, PhotoFinder, Prototypes, query preview, scatter plot thumbnail display, Scattering, searching, software libraries, software tools, User interfaces, visual Boolean query interfaces, visual databases, Visualization, visualization methods}, isbn = {0-7803-6536-4}, doi = {10.1109/ICME.2000.871061}, author = {Kang,Hyunmo and Shneiderman, Ben} } @conference {17501, title = {Visualizing digital library search results with categorical and hierarchical axes}, booktitle = {Proceedings of the fifth ACM conference on Digital libraries}, series = {DL {\textquoteright}00}, year = {2000}, month = {2000///}, pages = {57 - 66}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Digital library search results are usually shown as a textual list, with 10-20 items per page. Viewing several thousand search results at once on a two-dimensional display with continuous variables is a promising alternative. Since these displays can overwhelm some users, we created a simplified two-dimensional display that uses categorical and hierarchical axes, called hieraxes. Users appreciate the meaningful and limited number of terms on each hieraxis. At each grid point of the display we show a cluster of color-coded dots or a bar chart. Users see the entire result set and can then click on labels to move down a level in the hierarchy. Handling broad hierarchies and arranging for imposed hierarchies led to additional design innovations. We applied hieraxes to a digital video library of science topics used by middle school teachers, a legal information system, and a technical library using the ACM Computing Classification System. Feedback from usability testing with 32 subjects revealed strengths and weaknesses.}, keywords = {categorical axes, digital libraries, Graphical user interfaces, hierarchy, hieraxes, Information Visualization}, isbn = {1-58113-231-X}, doi = {10.1145/336597.336637}, url = {http://doi.acm.org/10.1145/336597.336637}, author = {Shneiderman, Ben and Feldman,David and Rose,Anne and Grau,Xavier Ferr{\'e}} } @conference {13482, title = {Visualizing high-dimensional predictive model quality}, booktitle = {Visualization 2000. Proceedings}, year = {2000}, month = {2000///}, pages = {493-496, - 493-496,}, publisher = {IEEE}, organization = {IEEE}, abstract = {Using inductive learning techniques to construct classification models from large, high-dimensional data sets is a useful way to make predictions in complex domains. However, these models can be difficult for users to understand. We have developed a set of visualization methods that help users to understand and analyze the behavior of learned models, including techniques for high-dimensional data space projection, display of probabilistic predictions, variable/class correlation, and instance mapping. We show the results of applying these techniques to models constructed from a benchmark data set of census data, and draw conclusions about the utility of these methods for model understanding.}, isbn = {0-7803-6478-3}, doi = {10.1109/VISUAL.2000.885740}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=885740}, author = {Rheingans,P. and desJardins, Marie} } @article {17957, title = {View-dependent topology simplification}, journal = {Virtual Environments}, volume = {99}, year = {1999}, month = {1999///}, pages = {11 - 22}, abstract = {We propose a technique for performing view-dependent sim-plifications for level-of-detail-based renderings of complex models. Our method is based on exploiting frame-to-frame coherence and is tolerant of various commonly found degeneracies in real-life polygonal models. The algorithm proceeds by preprocessing the input dataset into a binary tree of vertex collapses. This tree is used at run time to generate the triangles for display. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the tree in an implicit fashion. This obviates the need for any extra storage for dependency pointers and suggests a potential for application to external memory prefetching algo- rithms. We also propose a distance metric that can be used to unify the geometry and genus simplifications with the view-dependent parameters such as viewpoint, view-frustum, and local illumination. }, author = {El-Sana,J. and Varshney, Amitabh} } @article {15660, title = {Vision geometry VIII(Denver CO, 19-20 July 1999)}, journal = {SPIE proceedings series}, year = {1999}, month = {1999///}, author = {Latecki,L.J. and Melter,R.A. and Mount, Dave and Wu,A. Y} } @conference {13480, title = {Visualization of high-dimensional model characteristics}, booktitle = {Proceedings of the 1999 workshop on new paradigms in information visualization and manipulation in conjunction with the eighth ACM internation conference on Information and knowledge management}, series = {NPIVM {\textquoteright}99}, year = {1999}, month = {1999///}, pages = {6 - 8}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, abstract = {Using inductive learning techniques to construct explanatory models for large, high-dimensional data sets is a useful way to discover useful information. However, these models can be difficult for users to understand. We have developed a set of visualization methods that enable a user to evaluate the quality of learned models, to compare alternative models, and identify ways in which a model might be improved We describe the visualization techniques we have explored, including methods for high-dimensional data space projection, variable/class correlation, instance mapping, and model sampling We show the results of applying these techniques to several models built from a benchmark data set of census data.}, keywords = {data mining and knowledge discovery, multidimensional information spaces, Visualization}, isbn = {1-58113-254-9}, doi = {10.1145/331770.331774}, url = {http://doi.acm.org/10.1145/331770.331774}, author = {desJardins, Marie and Rheingans,Penny} } @conference {17504, title = {Visually enhanced objects}, booktitle = {Readings in information visualization}, year = {1999}, month = {1999///}, pages = {561 - 561}, publisher = {Morgan Kaufmann Publishers Inc.}, organization = {Morgan Kaufmann Publishers Inc.}, address = {San Francisco}, isbn = {1-55860-533-9}, author = {Card,S.K. and Mackinlay,J.D. and Shneiderman, Ben} } @article {18451, title = {Validating the Benefit of New Software Technology}, journal = {Software Quality Practitioner}, volume = {1}, year = {1998}, month = {1998///}, abstract = {The software engineering research community has developed methodsfor showing that new development technologies are effective and the corporate world investigates various techniques before applying them on new developments. Unfortunately, these two communities do not often work together to make technology transfer a smooth process. In this paper, methods for validating research claims in the software development domain are described and methods used by industry to investigate new technologies are given. Guidelines that allow research papers to address the needs for industrial investigations are proposed that should greatly improve the transfer of new technology to industry. }, author = {Zelkowitz, Marvin V and Wallace,D.} } @article {13695, title = {Video Summarization by Curve Simplification}, volume = {LAMP-TR-018,CFAR-TR-889,CS-TR-3916}, year = {1998}, month = {1998/07//}, institution = {University of Maryland, College Park}, abstract = {A video sequence can be represented as a trajectory curve in a high dimensional feature space. This emphvideo curve can be analyzed by tools similar to those developed for planar curves. In particular, the classic binary curve splitting algorithm has been found to be a useful tool for video analysis. With a splitting condition that checks the dimensionality of the curve segment being split, the video curve can be recursively simplified and represented as a tree structure, and the frames that are found to be junctions between curve segments at different levels of the tree can be used as keyframes to summarize the video sequences at different levels of detail. These keyframes can be combined in various spatial and temporal configurations for browsing purposes. We describe a simple video player that displays the keyframes sequentially and lets the user change the summarization level on the fly with a slider. We also describe an approach to automatically selecting a summarization level that provides a concise and representative set of keyframes.}, author = {DeMenthon,Daniel and Kobla,Vikrant and David Doermann} } @conference {13694, title = {Video Summarization by Curve Simplification}, booktitle = {Proceedings of ACM - Multimedia 98, Bristol, England}, year = {1998}, month = {1998///}, pages = {211 - 218}, abstract = {A video sequence can be represented as a trajectory curve in a high dimensional feature space. This emphvideo curve can be analyzed by tools similar to those developed for planar curves. In particular, the classic binary curve splitting algorithm has been found to be a useful tool for video analysis. With a splitting condition that checks the dimensionality of the curve segment being split, the video curve can be recursively simplified and represented as a tree structure, and the frames that are found to be junctions between curve segments at different levels of the tree can be used as keyframes to summarize the video sequences at different levels of detail. These keyframes can be combined in various spatial and temporal configurations for browsing purposes. We describe a simple video player that displays the keyframes sequentially and lets the user change the summarization level on the fly with a slider. We also describe an approach to automatically selecting a summarization level that provides a concise and representative set of keyframes.}, author = {DeMenthon,D. and David Doermann and Kobla,V.} } @inbook {14268, title = {The Video Yardstick}, booktitle = {Modelling and Motion Capture Techniques for Virtual EnvironmentsModelling and Motion Capture Techniques for Virtual Environments}, series = {Lecture Notes in Computer Science}, volume = {1537}, year = {1998}, month = {1998///}, pages = {144 - 158}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, abstract = {Given uncalibrated video sequences, how can we recover rich descriptions of the scene content, beyond two-dimensional (2D) measurements such as color/texture or motion fields {\textemdash} descriptions of shape and three-dimensional (3D) motion? This is the well known structure from motion (SFM) problem. Up to now, SFM algorithms proceeded in two well defined steps, where the first and most important step is recovering the rigid transformation between two views, and the subsequent step is using this transformation to compute the structure of the scene in view. This paper introduces a novel approach to structure from motion in which both steps are accomplished in a synergistic manner. It deals with the classical structure from motion problem considering a calibrated camera as well as the extension to an uncalibrated optical device. Existing approaches to estimation of the viewing geometry are mostly based on the use of optic flow, which, however, poses a problem at the locations of depth discontinuities. If we knew where depth discontinuities were, we could (using a multitude of approaches based on smoothness constraints) accurately estimate flow values for image patches corresponding to smooth scene patches; but to know the discontinuities requires solving the structure from motion problem first. In the past this dilemma has been addressed by improving the estimation of flow through sophisticated optimization techniques, whose performance often depends on the scene in view. In this paper we follow a different approach. We directly utilize the image derivatives and employ constraints which involve the 3D motion and shape of the scene, leading to a geometric and statistical estimation problem. The main idea is based on the interaction between 3D motion and shape which allows us to estimate the 3D motion while at the same time segmenting the scene. If we use a wrong 3D motion estimate to compute depth, we obtain a distorted version of the depth function. The distortion, however, is such that the worse the motion estimate, the more likely we are to obtain depth estimates that are locally unsmooth, i.e., they vary more than the correct ones. Since local variability of depth is due either to the existence of a discontinuity or to a wrong 3D motion estimate, being able to differentiate between these two cases provides the correct motion, which yields the {\textquotedblleft}smoothest{\textquotedblright} estimated depth as well as the image locations of scene discontinuities. We analyze the new constraints introduced by our approach and show their relationship to the minimization of the epipolar constraint, which becomes a special case of our theory. Finally, we present a number of experimental results with real image sequences indicating the robustness of our method and the improvement over traditional methods. The resulting system is a video yardstick that can be applied to any video sequence to recover first the calibration parameters of the camera that captured the video and, subsequently, the structure of the scene.}, isbn = {978-3-540-65353-0}, url = {http://dx.doi.org/10.1007/3-540-49384-0_12}, author = {Brodsk{\'y},Tom{\'a}{\v s} and Ferm{\"u}ller, Cornelia and Aloimonos, J.}, editor = {Magnenat-Thalmann,Nadia and Thalmann,Daniel} } @article {16192, title = {Viewing personal history records: A comparison of tabular format and graphical presentation using LifeLines}, journal = {Behaviour \& Information Technology}, volume = {17}, year = {1998}, month = {1998///}, pages = {249 - 262}, abstract = {Thirty-six participants used a static version of either LifeLines, a graphical interface, or a tabular representation to answer questions about a database of temporal personal history information. Results suggest that overall the LifeLines representation led to much faster response times, primarily for questions which involved interval comparisons and making intercategorical connections. A {\textquoteright}first impression{\textquoteright} test showed that LifeLines can reduce some of the biases of the tabular record summary. A post-experimental memory test led to significantly (p< 0.004) higher recall for LifeLines. Finally, simple interaction techniques are proposed to compensate for the problems of the static LifeLines display{\textquoteright}s ability to deal with precise dates, attribute coding and overlaps.Thirty-six participants used a static version of either LifeLines, a graphical interface, or a tabular representation to answer questions about a database of temporal personal history information. Results suggest that overall the LifeLines representation led to much faster response times, primarily for questions which involved interval comparisons and making intercategorical connections. A {\textquoteright}first impression{\textquoteright} test showed that LifeLines can reduce some of the biases of the tabular record summary. A post-experimental memory test led to significantly (p< 0.004) higher recall for LifeLines. Finally, simple interaction techniques are proposed to compensate for the problems of the static LifeLines display{\textquoteright}s ability to deal with precise dates, attribute coding and overlaps. }, isbn = {0144-929X}, doi = {10.1080/014492998119328}, url = {http://www.tandfonline.com/doi/abs/10.1080/014492998119328}, author = {Alonso,Diane Lindwarm and Rose,Anne and Plaisant, Catherine and Norman,Kent L} } @article {17495, title = {Visual User Interfaces for Information Exploration}, journal = {Technical Reports of the Computer Science Department}, year = {1998}, month = {1998/10/15/}, abstract = {The next generation of database management, directory browsing,information retrieval, hypermedia, scientific data management, and library systems can enable convenient exploration of growing information spaces by a wider range of users. User interface designers can provide more powerful search techniques, more comprehensible query facilities, better presentation methods, and smoother integration of technology with task. This paper offers novel graphical and direct manipulation approaches to query formulation and information presentation/manipulation. These approaches include a graphical approach to restricted boolean query formulation based on generalization/aggregation hierarchies, a filter/flow metaphor for complete boolean expressions, dynamic query methods with continuous visual presentation of results as the query is changed (possibly employing parallel computation), and color-coded 2-dimensional space-filling tree-maps that present multiple-level hierarchies in a single display (hundreds of directories and more than a thousand files can be seen at once). (Also cross-referenced as CAR-TR-577) }, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/373}, author = {Shneiderman, Ben} } @conference {16189, title = {Visualizing medical records with LifeLines}, booktitle = {CHI 98 conference summary on Human factors in computing systems}, series = {CHI {\textquoteright}98}, year = {1998}, month = {1998///}, pages = {28 - 29}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {healthcare, History, medical record, overview, timeline, Visualization}, isbn = {1-58113-028-7}, doi = {10.1145/286498.286513}, url = {http://doi.acm.org/10.1145/286498.286513}, author = {Plaisant, Catherine and Heller,Daniel and Li,Jia and Shneiderman, Ben and Mushlin,Rich and Karat,John} } @article {17502, title = {Visualizing Personal Histories: A Workshop, July 21-22, 1997}, journal = {ACM SIGCHI Bulletin}, volume = {30}, year = {1998}, month = {1998/01//}, pages = {34 - 35}, isbn = {0736-6906}, doi = {10.1145/280571.280585}, url = {http://doi.acm.org/10.1145/280571.280585}, author = {Shneiderman, Ben} } @conference {15040, title = {The vegetation canopy lidar mission}, booktitle = {Proceedings of Land Satellite Information in the Next Decade, II: Sources and Applications. Bethesda (MD): American Society of Photogrammetry and Remote Sensing}, year = {1997}, month = {1997///}, pages = {100 - 112}, abstract = {The Vegetation Canopy Lidar (VCL) is the first selected mission of NASA{\textquoteright}s new EarthSystem Science Pathfinder program. The principal goal of VCL is the characterization of the three-dimensional structure of the earth; in particular, canopy vertical and horizontal structure and land surface topography. Its primary science objectives are: landcover characterization for terrestrial ecosystem modeling, monitoring and prediction; landcover characterization for climate modeling and prediction; and, production of a global reference data set of topographic spot heights and transects. VCL will provide unique data sets for understanding important environ- mental issues including climatic change and variability, biotic erosion and sustainable landuse, and will dramatically improve our estimation of global biomass and carbon stocks, fractional forest cover, forest extent and condition. It will also provide canopy data critical for biodiversity, natural hazard, and climate studies. Scheduled for launch in early 2000, VCL is an active lidar remote sensing system consisting of a five-beam instrument with 25 m contiguous along track resolution. The five beams are in a circular configuration 8 km across and each beam traces a separate ground track spaced 2 km apart, eventually producing 2 km coverage between 65{\textdegree} N and S. VCL{\textquoteright}s core measurement objectives are: (1) canopy top heights; (2) vertical distribution of intercepted surfaces (e.g. leaves and branches); and, (3) ground surface topographic elevations. These measurements are used to derive a variety of science data products including canopy heights, canopy vertical distribution, and ground elevations gridded monthly at 1{\textdegree} resolution and every 6 months at 2 km resolution, as well as a 2 km fractional forest cover product. }, author = {Dubayah, R. and Blair,J. B. and Bufton,J. L. and Clark,D. B. and JaJa, Joseph F. and Knox,R. and Luthcke,S. B. and Prince,S. and Weishampel,J.} } @conference {13696, title = {VideoTrails: Representing and Visualizing Structure in Video Sequences}, booktitle = {Proceedings of the ACMInternational Multimedia Conference}, year = {1997}, month = {1997///}, pages = {335 - 346}, author = {Kobla,V. and David Doermann and Faloutsos,C.} } @conference {17846, title = {The virtual microscope.}, booktitle = {Proceedings of the AMIA Annual Fall Symposium}, year = {1997}, month = {1997///}, pages = {449 - 449}, author = {Ferreira,R. and Moon,B. and Humphries,J. and Sussman, Alan and Saltz, J. and Miller,R. and Demarzo,A.} } @article {17485, title = {Visual and textual consistency checking tools for graphical user interfaces}, journal = {IEEE Transactions on Software Engineering}, volume = {23}, year = {1997}, month = {1997/11//}, pages = {722 - 735}, abstract = {Designing user interfaces with consistent visual and textual properties is difficult. To demonstrate the harmful effects of inconsistency, we conducted an experiment with 60 subjects. Inconsistent interface terminology slowed user performance by 10 to 25 percent. Unfortunately, contemporary software tools provide only modest support for consistency control. Therefore, we developed SHERLOCK, a family of consistency analysis tools, which evaluates visual and textual properties of user interfaces. It provides graphical analysis tools such as a dialog box summary table that presents a compact overview of visual properties of all dialog boxes. SHERLOCK provides terminology analysis tools including an interface concordance, an interface spellchecker, and terminology baskets to check for inconsistent use of familiar groups of terms. Button analysis tools include a button concordance and a button layout table to detect variant capitalization, distinct typefaces, distinct colors, variant button sizes, and inconsistent button placements. We describe the design, software architecture, and the use of SHERLOCK. We tested SHERLOCK with four commercial prototypes. The outputs, analysis, and feedback from designers of the applications are presented}, keywords = {button analysis tools, Color, dialog box summary table, experiment, graphical analysis tools, Graphical user interfaces, human factors, inconsistent interface terminology, interface color, interface spell checker, Output feedback, Prototypes, SHERLOCK, Software architecture, Software design, software metrics, software prototyping, software tools, Terminology, terminology analysis tools, Testing, textual consistency checking tools, user interface management systems, User interfaces, user performance, visual consistency checking tools}, isbn = {0098-5589}, doi = {10.1109/32.637386}, author = {Mahajan,R. and Shneiderman, Ben} } @article {16198, title = {Visual Information Seeking in Digital Image Libraries: The Visible Human Explorer}, journal = {Information in Images}, year = {1997}, month = {1997///}, abstract = {This chapter presents the Visible Human Explorer user interface, developed at theHuman-Computer Interaction Lab of the University of Maryland at College Park, for remotely accessing the National Library of Medicine{\textquoteright}s Visible Human digital image library. With the interface, users can visualize the library, browse contents, locate data of interest, and retrieve and zoom on desired image details. The interface presents a pair of tightly coupled views of library data: an overview of the overall search space, and a preview of high-resolution images available for retrieval. To explore, the user sweeps the views through the search space and receives smooth, rapid, visual feedback of contents. Desired details are automatically downloaded over the internet from the library. The interface software is completely functional (runs on Sun Workstations) and freely available for public use, at: http://www.nlm.nih.gov/. We also present several human-computer interaction design principles used to create the Visible Human Explorer interface, describe how these were applied to the design, and discuss issues in employing these techniques in user interfaces for other information collections. These principles are direct manipulation, visual information seeking, query previews, and multiple tightly coupled views. We illustrate these concepts with a plethora of pictures of user interface screens. Please also check the included CD-ROM for additional illustration media. }, author = {North,C. and Shneiderman, Ben and Plaisant, Catherine} } @article {12016, title = {Visual Navigation: Flies, Bees, and UGV{\textquoteright}s}, journal = {Visual navigation: from biological systems to unmanned ground vehicles}, year = {1997}, month = {1997///}, author = {Aloimonos, J.} } @book {12050, title = {Visual navigation: from biological systems to unmanned ground vehicles}, year = {1997}, month = {1997///}, publisher = {Lawrence Erlbaum}, organization = {Lawrence Erlbaum}, author = {Aloimonos, J.} } @article {14275, title = {Visual space distortion}, journal = {Biological Cybernetics}, volume = {77}, year = {1997}, month = {1997///}, pages = {323 - 337}, abstract = {We are surrounded by surfaces that we perceive by visual means. Understanding the basic principles behind this perceptual process is a central theme in visual psychology, psychophysics, and computational vision. In many of the computational models employed in the past, it has been assumed that a metric representation of physical space can be derived by visual means. Psychophysical experiments, as well as computational considerations, can convince us that the perception of space and shape has a much more complicated nature, and that only a distorted version of actual, physical space can be computed. This paper develops a computational geometric model that explains why such distortion might take place. The basic idea is that, both in stereo and motion, we perceive the world from multiple views. Given the rigid transformation between the views and the properties of the image correspondence, the depth of the scene can be obtained. Even a slight error in the rigid transformation parameters causes distortion of the computed depth of the scene. The unified framework introduced here describes this distortion in computational terms. We characterize the space of distortions by its level sets, that is, we characterize the systematic distortion via a family of iso-distortion surfaces which describes the locus over which depths are distorted by some multiplicative factor. Given that humans{\textquoteright} estimation of egomotion or estimation of the extrinsic parameters of the stereo apparatus is likely to be imprecise, the framework is used to explain a number of psychophysical experiments on the perception of depth from motion or stereo.}, isbn = {0340-1200}, url = {http://dx.doi.org/10.1007/s004220050393}, author = {Ferm{\"u}ller, Cornelia and LoongFah Cheong and Aloimonos, J.} } @article {18305, title = {Visual surveillance of human activity}, journal = {Computer Vision{\textemdash}ACCV{\textquoteright}98}, year = {1997}, month = {1997///}, pages = {267 - 274}, author = {Davis, Larry S. and Fejes,S. and Harwood,D. and Yacoob,Yaser and Hariatoglu,I. and Black,M.} } @article {12841, title = {Verification of an active control system using temporal process algebra}, journal = {Engineering with computers}, volume = {12}, year = {1996}, month = {1996///}, pages = {46 - 61}, author = {Elseaidy,W. M and Baugh,J. W. and Cleaveland, Rance} } @inbook {14272, title = {Video representations}, booktitle = {Recent Developments in Computer Vision}, series = {Lecture Notes in Computer Science}, volume = {1035}, year = {1996}, month = {1996///}, pages = {33 - 41}, publisher = {Springer Berlin / Heidelberg}, organization = {Springer Berlin / Heidelberg}, isbn = {978-3-540-60793-9}, url = {http://dx.doi.org/10.1007/3-540-60793-5_60}, author = {Bolle,Ruud and Aloimonos, J. and Ferm{\"u}ller, Cornelia}, editor = {Li,Stan and Mital,Dinesh and Teoh,Eam and Wang,Han} } @conference {17490, title = {Visual metaphor and the problem of complexity in the design of Web sites: techniques for generating, recognizing and visualizing structure}, booktitle = {Proceedings of the the seventh ACM conference on Hypertext}, series = {HYPERTEXT {\textquoteright}96}, year = {1996}, month = {1996///}, pages = {257{\textendash} - 257{\textendash}}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-778-2}, doi = {10.1145/234828.234854}, url = {http://doi.acm.org/10.1145/234828.234854}, author = {Joyce,Michael and Kolker,Robert and Moulthrop,Stuart and Shneiderman, Ben and Unsworth,John Merritt} } @article {14177, title = {Vision and action}, journal = {Image and Vision Computing}, volume = {13}, year = {1995}, month = {1995/12//}, pages = {725 - 744}, abstract = {Our work on active vision has recently focused on the computational modelling of navigational tasks, where our investigations were guided by the idea of approaching vision for behavioural systems in the form of modules that are directly related to perceptual tasks. These studies led us to branch in various directions and inquire into the problems that have to be addressed in order to obtain an overall understanding of perceptual systems. In this paper, we present our views about the architecture of vision systems, about how to tackle the design and analysis of perceptual systems, and promising future research directions. Our suggested approach for understanding behavioural vision to realize the relationships of perception and action builds on two earlier approaches, the Medusa philosophy1 and the Synthetic approach2. The resulting framework calls for synthesizing an artificial vision system by studying vision competences of increasing complexity and, at the same time, pursuing the integration of the perceptual components with action and learning modules. We expect that computer vision research in the future will progress in tight collaboration with many other disciplines that are concerned with empirical approaches to vision, i.e. the understanding of biological vision. Throughout the paper, we describe biological findings that motivate computational arguments which we believe will influence studies of computer vision in the near future.}, keywords = {active vision, perceptual system design and analysis, vision system architecture}, isbn = {0262-8856}, doi = {10.1016/0262-8856(95)98754-H}, url = {http://www.sciencedirect.com/science/article/pii/026288569598754H}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {12030, title = {Vision and action* 1}, journal = {Image and vision computing}, volume = {13}, year = {1995}, month = {1995///}, pages = {725 - 744}, author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.} } @article {17483, title = {Vision, Graphic Design, and Visual Display}, journal = {Readings in human-computer interaction: toward the year 2000}, year = {1995}, month = {1995///}, pages = {411 - 411}, author = {Marcus,A. and Murch,G.M. and Baecker,R. and Small,I. and Mander,R. and Ahlberg,C. and Shneiderman, Ben} } @conference {17486, title = {Visual decision-making: using treemaps for the analytic hierarchy process}, booktitle = {Conference companion on Human factors in computing systems}, series = {CHI {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {405 - 406}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, isbn = {0-89791-755-3}, doi = {10.1145/223355.223747}, url = {http://doi.acm.org/10.1145/223355.223747}, author = {Asahi,Toshiyuki and Turo,David and Shneiderman, Ben} } @conference {17943, title = {Voxel based object simplification}, booktitle = {Proceedings of the 6th conference on Visualization {\textquoteright}95}, series = {VIS {\textquoteright}95}, year = {1995}, month = {1995///}, pages = {296{\textendash} - 296{\textendash}}, publisher = {IEEE Computer Society}, organization = {IEEE Computer Society}, address = {Washington, DC, USA}, abstract = {Presents a simple, robust and practical method for object simplification for applications where gradual elimination of high-frequency details is desired. This is accomplished by sampling and low-pass filtering the object into multi-resolution volume buffers and applying the marching cubes algorithm to generate a multi-resolution triangle-mesh hierarchy. Our method simplifies the genus of objects and can also help existing object simplification algorithms achieve better results. At each level of detail, a multi-layered mesh can be used for an optional and efficient antialiased rendering.}, keywords = {antialiased rendering, antialiasing, buffer storage, data visualisation, high-frequency detail elimination, low-pass filtering, low-pass filters, marching cubes algorithm, mesh generation, multi-layered mesh, multi-resolution triangle-mesh hierarchy, multi-resolution volume buffers, object genus, Rendering (computer graphics), sampling, Smoothing methods, voxel based object simplification}, isbn = {0-8186-7187-4}, url = {http://dl.acm.org/citation.cfm?id=832271.833850}, author = {He,Taosong and Hong,Lichan and Kaufman,A. and Varshney, Amitabh and Wang,S.} } @conference {12783, title = {Verifying an intelligent structural control system: a case study}, booktitle = {Real-Time Systems Symposium, 1994., Proceedings.}, year = {1994}, month = {1994/12/07/9}, pages = {271 - 275}, publisher = {IEEE}, organization = {IEEE}, abstract = {Describes the formal verification of the timing properties of the design of an intelligent structural control system using the Concurrency Workbench, an automatic verification tool for finite-state processes. The high-level design of the system is first given in Modechart, a graphical specification language for real-time systems, and then translated into a temporal process algebra supported by the Workbench. The facilities provided by this tool are then used to analyze the system and ultimately show it to be correct}, keywords = {automatic verification tool, case study, Concurrency Workbench, Distributed computing, Distributed control, distributed processing, finite automata, finite-state processes, formal verification, graphical specification language, high-level design, intelligent control, intelligent structural control system verification, Logic, Modechart, Process algebra, Real time systems, real-time systems, Specification languages, structural engineering computing, temporal logic, temporal process algebra, time-varying systems, Timing, timing properties, visual languages}, isbn = {0-8186-6600-5}, doi = {10.1109/REAL.1994.342708}, author = {Elseaidy,W. M and Cleaveland, Rance and Baugh,J. W.} } @conference {17489, title = {Visual information seeking: tight coupling of dynamic query filters with starfield displays}, booktitle = {Proceedings of the SIGCHI conference on Human factors in computing systems: celebrating interdependence}, series = {CHI {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {313 - 317}, publisher = {ACM}, organization = {ACM}, address = {New York, NY, USA}, keywords = {database query, dynamic queries, information seeking, starfield displays, tight coupling}, isbn = {0-89791-650-6}, doi = {10.1145/191666.191775}, url = {http://doi.acm.org/10.1145/191666.191775}, author = {Ahlberg,Christopher and Shneiderman, Ben} } @article {17488, title = {Visual information seeking using the FilmFinder}, journal = {ACM CHI94 Conference, Boston}, year = {1994}, month = {1994///}, author = {Ahlberg,C. and Shneiderman, Ben} } @conference {17497, title = {Visualization in the information highway}, booktitle = {Proceedings of the conference on Visualization {\textquoteright}94}, series = {VIS {\textquoteright}94}, year = {1994}, month = {1994///}, pages = {4 - 7}, publisher = {IEEE Computer Society Press}, organization = {IEEE Computer Society Press}, address = {Los Alamitos, CA, USA}, isbn = {0-7803-2521-4}, url = {http://dl.acm.org/citation.cfm?id=951087.951091}, author = {Gershon,Nahum and Card,Stuart K. and Roth,Steven F. and Shneiderman, Ben} } @conference {15977, title = {Vacuum-logic}, booktitle = {Proceedings of AAAI 1993 Fall Symposium Series: Instantiating Real-World Agents}, year = {1993}, month = {1993///}, pages = {51 - 54}, author = {Elgot-drapkin,J. and Kraus,S. and Miller,M. and Nirkhe,M. and Perlis, Don} } @article {15049, title = {VLSI implementation of a tree searched vector quantizer}, journal = {Signal Processing, IEEE Transactions on}, volume = {41}, year = {1993}, month = {1993/02//}, pages = {901 - 905}, abstract = {The VLSI design and implementation of a tree-searched vector quantizer is presented. The number of processors needed is equal to the depth of the tree. All processors are identical, and data flow between processors is regular. No global control signals are needed. The processors have been fabricated using 2 mu;m N-well process on a 7.9 times;9.2 mm die. Each processor chip contains 25000 transistors and has 84 pins. The processors have been thoroughly tested at a clock frequency of 20 MHz}, keywords = {(mathematics);, 2, 20, chips;, coding;, compression;, data, design;, digital, image, implementation;, MHz;, micron;, PROCESSING, quantisation;, quantizer;, searched, signal, tree, TREES, vector, VLSI, VLSI;}, isbn = {1053-587X}, doi = {10.1109/78.193225}, author = {Kolagotla,R. K. and Yu,S.-S. and JaJa, Joseph F.} } @article {15045, title = {VLSI Architectures and Implementation of Predictive Tree- Searched Vector Quantizers for Real-Time Video Compression}, volume = {ISR-TR-1992-48}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {We describe a pipelined systolic architecture for implementing predictive Tree-Searched Vector Quantization (PTSVQ) for real- time image and speech coding applications. This architecture uses identical processors for both the encoding and decoding processes. the overall design is regular and the control is simple. Input data is processed at a rate of 1 pixel per clock cycle, which allows real-time processing of images at video rates. We implemented these processors using 1.2um CMOS technology. Spice simulations indicate correct operation at 40 MHz. Prototype version of these chips fabricated using 2um CMOS technology work at 20 MHz.}, keywords = {data compression, IMAGE PROCESSING, Signal processing, Speech processing, Systems Integration, systolic architecture, Vector quantization, VLSI architectures}, url = {http://drum.lib.umd.edu/handle/1903/5230}, author = {Yu,S.-S. and Kolagotla,Ravi K. and JaJa, Joseph F.} } @article {15050, title = {VLSI Implementation of Real-Time Parallel DCT/DST Lattice Structures for Video}, volume = {ISR-TR-1992-34}, year = {1992}, month = {1992///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {The alternate use [1] of the discrete cosine transform (DCT) and the discrete sine transform (DST) can achieve a higher data compression rate and less block effect in image processing. A parallel lattice structure that can dually generate the 1-D DCT and DST is proposed. We also develop a fully-pipelined 2-D DCT lattice architecture that consists of two 1-D DCT/DST arrays without transposition. Both architectures are ideally suited for VLSI implementation because they are modular, regular, and have only local interconnections. the VLSI implementation of the lattice module using the distributed arithmetic approach is described. This realization of the lattice module using 2 um CMOS technology can achieve an 80Mb/s data rate.}, keywords = {Parallel architectures, Signal processing, Systems Integration, VLSI architectures}, url = {http://drum.lib.umd.edu/handle/1903/5216}, author = {Chiu,Ching-Te and Kolagotla,Ravi K. and Liu,K. J. Ray and JaJa, Joseph F.} } @conference {12193, title = {Voice-bandwidth visual communication through logmaps: the Telecortex}, booktitle = {Applications of Computer Vision, Proceedings, 1992., IEEE Workshop on}, year = {1992}, month = {1992///}, pages = {4 - 10}, author = {Wallace,R.S. and Bederson, Benjamin B. and Schwartz,E.L.} } @article {11950, title = {On the visual mathematics of tracking}, journal = {Image and vision computing}, volume = {9}, year = {1991}, month = {1991///}, pages = {235 - 251}, author = {Aloimonos, J. and Tsakiris, D. P} } @book {11977, title = {Visual recovery}, year = {1991}, month = {1991///}, publisher = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, organization = {University of Maryland, Center for Automation Research, Computer Vision Laboratory}, author = {Aloimonos, J. and Rosenfeld, A.} } @article {15047, title = {VLSI architectures for multidimensional transforms}, journal = {Computers, IEEE Transactions on}, volume = {40}, year = {1991}, month = {1991/09//}, pages = {1053 - 1057}, abstract = {The authors propose a family of VLSI architectures with area-time tradeoffs for computing (N times;N times; . . . times;N) d-dimensional linear separable transforms. For fixed-precision arithmetic with b bits, the architectures have an area A=O(Nd+2a) and computation time T=O(dNd/2-ab ), and achieve the AT2 bound of AT2=O(n2b 2) for constant d, where n=Nd and O lt;a les;d/2}, keywords = {architecture;, architectures;, arithmetic;, complexity;, computational, Computer, digital, fixed-precision, linear, multidimensional, separable, transforms;, VLSI}, isbn = {0018-9340}, doi = {10.1109/12.83648}, author = {Chakrabarti,C. and JaJa, Joseph F.} } @article {15048, title = {VLSI architectures for template matching and block matching}, journal = {Parallel architectures and algorithms for image understanding}, year = {1991}, month = {1991///}, pages = {3 - 27}, author = {Chakrabarti,C. and JaJa, Joseph F.} } @article {11994, title = {Visual shape computation}, journal = {Proceedings of the IEEE}, volume = {76}, year = {1988}, month = {1988/08//}, pages = {899 - 916}, abstract = {Perceptual processes responsible for computing shape from several cues, including shading, texture, contour, and stereo, are examined. It is noted that these computational problems, as well as that of computing shaping from motion, are ill-posed in the sense of Hadamard. It is suggested that regularization theory can be used along with a priori knowledge to restrict the space of possible solutions, and thus restore the problem{\textquoteright}s well-prosedness. Some alternative methods are outlined, and the idea of active vision is explored briefly in connection with the problem}, keywords = {a priori knowledge, active vision, computational problems, Computer vision, computing shaping from motion, contour, cues, Focusing, HUMANS, ill posed problems, Machine vision, Psychology, regularization theory, RETINA, sense of Hadamard, shading, SHAPE, space of possible solutions, Stereo vision, Surface texture, TEXTURE, visual shape computation, Visual system}, isbn = {0018-9219}, doi = {10.1109/5.5964}, author = {Aloimonos, J.} } @article {15046, title = {VLSI Architectures Based on the Small N Algorithms}, volume = {ISR-TR-1985-8}, year = {1985}, month = {1985///}, institution = {Institute for Systems Research, University of Maryland, College Park}, abstract = {Digital convolution and the discrete Fourier transform are basic operations whose computational requirements are of great importance in many applications. In this paper, we propose new types of VLSI architectures which are shown to be quite suitable to handle these operations. These architectures will result in fully pipelined bit-serial arrays which require no control units. Some preliminary implementations indicate a substantial speed-up gain over other existing designs.}, keywords = {Technical Report}, url = {http://drum.lib.umd.edu/handle/1903/4384}, author = {JaJa, Joseph F. and Owens,R. M.} } @article {15672, title = {Voronoi Diagrams on the Surface of a Polyhedron.}, year = {1985}, month = {1985/05//}, institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK}, abstract = {This document presents an algorithm that computes the Voronol diagram of a set of point lying on the surface of a possibly nonconvex polyhedron. Distances are measured in the Euclidean metric along the surface of the polyhedron. The algorithm runs in O(n squared log n) time and requires O(n squared) space to store the final data structure, where n is the maximum of the number of edges and source points on the polyhedron. This algorithm generalizes or improves the running times of a number of shortest path problems both on polyhedra and in the plane amidst polygonal obstacles. By applying standard algorithms for point location, we can determine the distance from a query point to the nearest source in O(log n) time and can list the shortest path in O(k + log n) time, where k is the number of faces traversed by the path. The algorithm achieves its efficiency by a novel method of searching the polyhedron{\textquoteright}s surface. (Author)}, keywords = {*POLYGONS, *Polyhedrons, algorithms, DIAGRAMS., EDGES, INTERROGATION, PATHS, PE61102F, POSITION(LOCATION), SURFACES, THEORETICAL MATHEMATICS, WUAFOSR2304A7}, url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA166220}, author = {Mount, Dave} } @article {14142, title = {Variational Iterative Methods for Nonsymmetric Systems of Linear Equations}, journal = {SIAM Journal on Numerical Analysis}, volume = {20}, year = {1983}, month = {1983/04/01/}, pages = {345 - 357}, abstract = {We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled after the conjugate gradient method, and are well suited for large sparse systems. They do not make use of any associated symmetric problems. Convergence results and error bounds are presented.}, isbn = {0036-1429}, url = {http://www.jstor.org/stable/2157222}, author = {Eisenstat, Stanley C. and Elman, Howard and Schultz, Martin H.} } @article {16748, title = {View indexing in relational databases}, journal = {ACM Transactions on Database SystemsACM Trans. Database Syst.}, volume = {7}, year = {1982}, month = {1982/06//}, pages = {258 - 290}, isbn = {03625915}, doi = {10.1145/319702.319729}, url = {http://dl.acm.org/citation.cfm?id=319702.319729}, author = {Roussopoulos, Nick} }