@article {13065,
	title = {Density-Based Multifeature Background Subtraction with Support Vector Machine},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {34},
	year = {2012},
	month = {2012/05//},
	pages = {1017 - 1023},
	abstract = {Background modeling and subtraction is a natural technique for object detection in videos captured by a static camera, and also a critical preprocessing step in various high-level computer vision applications. However, there have not been many studies concerning useful features and binary segmentation algorithms for this problem. We propose a pixelwise background modeling and subtraction technique using multiple features, where generative and discriminative techniques are combined for classification. In our algorithm, color, gradient, and Haar-like features are integrated to handle spatio-temporal variations for each pixel. A pixelwise generative background model is obtained for each feature efficiently and effectively by Kernel Density Approximation (KDA). Background subtraction is performed in a discriminative manner using a Support Vector Machine (SVM) over background likelihood vectors for a set of features. The proposed algorithm is robust to shadow, illumination changes, spatial variations of background. We compare the performance of the algorithm with other density-based methods using several different feature combinations and modeling techniques, both quantitatively and qualitatively.},
	keywords = {algorithm;density-based, application;illumination, approximation;object, background, camera;support, change;kernel, Computer, density, detection;pixelwise, detection;support, extraction;image, feature;background, generative, Haar-like, likelihood, machine;Haar, machines;vectors;, modeling, multifeature, segmentation, segmentation;object, subtraction, technique;discriminative, technique;high-level, techniques;spatial, transforms;cameras;computer, variation;spatio-temporal, variation;static, vector, vector;binary, VISION, vision;feature},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2011.243},
	author = {Han,Bohyung and Davis, Larry S.}
}
@article {12494,
	title = {Face Recognition by Computers and Humans},
	journal = {Computer},
	volume = {43},
	year = {2010},
	month = {2010/02//},
	pages = {46 - 55},
	abstract = {This article talks about how the study of how humans perceive faces can be used to help design practical systems for face recognition. Besides applications related to identification and verification-such as access control, law enforcement, ID and licensing, and surveillance-face recognition has also proven useful in applications such as human-computer interaction, virtual reality, database retrieval, multimedia, and computer entertainment. Continuing research into face recognition will provide scientists and engineers with many vital projects, in areas such as homeland security, human-computer interaction, and numerous consumer applications. The areas we are considering pursuing are recognition from unconstrained video sequences, incorporating familiarity into algorithms, modeling effects of aging, and developing biologically plausible models for human face recognition ability.},
	keywords = {access, Computer, control;aging;computer, control;face, entertainment;database, interaction;national, interaction;unconstrained, reality;access, recognition;homeland, recognition;human, retrieval;face, security;, security;human, sequences;virtual, video},
	isbn = {0018-9162},
	doi = {10.1109/MC.2010.37},
	author = {Chellapa, Rama and Sinha, P. and Phillips,P.J.}
}
@conference {13276,
	title = {Classification of non-manifold singularities from transformations of 2-manifolds},
	booktitle = {Shape Modeling and Applications, 2009. SMI 2009. IEEE International Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {179 - 184},
	abstract = {Non-manifold models are frequently encountered in engineering simulations and design as well as in computer graphics. However, these models lack shape characterization for modelling and searching purposes. Topological properties act as a kernel for deriving key features of objects. Here we propose a classification for the non-manifold singularities of non-manifold objects through continuous shape transformations of 2-manifolds without boundary up to the creation of non-manifold singularities. As a result, the non-manifold objects thus created can be categorized and contribute to the definition of a general purpose taxonomy for non-manifold shapes.},
	keywords = {classification;search, Computer, graphic;continuous, graphics;pattern, model;nonmanifold, problems;topology;, property;computer, SHAPE, singularity;topological, transformation;nonmanifold},
	doi = {10.1109/SMI.2009.5170146},
	author = {Leon,J.-C. and De Floriani, Leila and Hetroy,F.}
}
@inbook {12235,
	title = {Triangle Inequality and Routing Policy Violations in the Internet},
	booktitle = {Passive and Active Network MeasurementPassive and Active Network Measurement},
	series = {Lecture Notes in Computer Science},
	volume = {5448},
	year = {2009},
	month = {2009///},
	pages = {45 - 54},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25\% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed {\textquotedblleft}less efficient{\textquotedblright}. We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.},
	keywords = {Computer, Science},
	isbn = {978-3-642-00974-7},
	url = {http://dx.doi.org/10.1007/978-3-642-00975-4_5},
	author = {Lumezanu,Cristian and Baden,Randy and Spring, Neil and Bhattacharjee, Bobby},
	editor = {Moon,Sue and Teixeira,Renata and Uhlig,Steve}
}
@inbook {17770,
	title = {Aggregates in Generalized Temporally Indeterminate Databases},
	booktitle = {Scalable Uncertainty ManagementScalable Uncertainty Management},
	series = {Lecture Notes in Computer Science},
	volume = {4772},
	year = {2007},
	month = {2007///},
	pages = {171 - 186},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Dyreson and Snodgrass as well as Dekhtyar et. al. have provided a probabilistic model (as well as compelling example applications) for why there may be temporal indeterminacy in databases. In this paper, we first propose a formal model for aggregate computation in such databases when there is uncertainty not just in the temporal attribute, but also in the ordinary (non-temporal) attributes. We identify two types of aggregates: event correlated aggregates, and non event correlated aggregations, and provide efficient algorithms for both of them. We prove that our algorithms are correct, and we present experimental results showing that the algorithms work well in practice.},
	keywords = {Computer, Science},
	isbn = {978-3-540-75407-7},
	url = {http://dx.doi.org/10.1007/978-3-540-75410-7_13},
	author = {Udrea,Octavian and Majki{\'c},Zoran and Subrahmanian,V.},
	editor = {Prade,Henri and Subrahmanian,V.}
}
@conference {12650,
	title = {An algebraic approach to surface reconstruction from gradient fields},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/10//},
	pages = {174 - 181 Vol. 1 - 174 - 181 Vol. 1},
	abstract = {Several important problems in computer vision such as shape from shading (SFS) and photometric stereo (PS) require reconstructing a surface from an estimated gradient field, which is usually non-integrable, i.e. have non-zero curl. We propose a purely algebraic approach to enforce integrability in discrete domain. We first show that enforcing integrability can be formulated as solving a single linear system Ax =b over the image. In general, this system is under-determined. We show conditions under which the system can be solved and a method to get to those conditions based on graph theory. The proposed approach is non-iterative, has the important property of local error confinement and can be applied to several problems. Results on SFS and PS demonstrate the applicability of our method.},
	keywords = {algebra;, algebraic, approach;, Computer, confinement;, discrete, domain, error, field;, from, gradient, graph, image, integrability;, linear, local, methods;, photometric, reconstruction;, shading;, SHAPE, stereo;, surface, system;, theory;, vision;},
	doi = {10.1109/ICCV.2005.31},
	author = {Agrawal,A. and Chellapa, Rama and Raskar, R.}
}
@conference {12279,
	title = {Differentiated traffic engineering for QoS provisioning},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2349 - 2359 vol. 4 - 2349 - 2359 vol. 4},
	abstract = {We introduce a new approach for QoS provisioning in packet networks based on the notion of differentiated traffic engineering (DTE). We consider a single AS network capable of source based multi-path routing. We do not require sophisticated queuing or per-class scheduling at individual routers; instead, if a link is used to forward QoS sensitive packets, we maintain its utilization below a threshold. As a consequence, DTE eliminates the need for per-flow (IntServ) or per-class (DiffServ) packet processing tasks such as traffic classification, queueing, shaping, policing and scheduling in the core and hence poses a lower burden on the network management unit. Conversely, DTE utilizes network bandwidth much more efficiently than simple over-provisioning. In this paper, we propose a complete architecture and an algorithmic structure for DTE. We show that our scheme can be formulated as a non-convex optimization problem, and we present an optimal solution framework based on simulated annealing. We present a simulation-based performance evaluation of DTE, and compare our scheme to existing (gradient projection) methods.},
	keywords = {based, Computer, differentiated, DiffServ, DTE;, engineering;, evaluation;, link;, links;, management;, multipath, network, networks;, nonconvex, of, optimisation;, OPTIMIZATION, packet, performance, problem;, provisioning;, QoS, QUALITY, routing;, service;, simulation-based, source, Telecommunication, traffic, traffic;},
	doi = {10.1109/INFCOM.2005.1498521},
	author = {Tabatabaee,V. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.A.}
}
@inbook {17795,
	title = {Distributed Algorithms for Dynamic Survivability of Multiagent Systems},
	booktitle = {Computational Logic in Multi-Agent SystemsComputational Logic in Multi-Agent Systems},
	series = {Lecture Notes in Computer Science},
	volume = {3259},
	year = {2005},
	month = {2005///},
	pages = {139 - 144},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized survivability algorithm (CSA) ensures survivability of the MAS {\textendash} unfortunately, if the node on which the CSA exists goes down, the survivability of the MAS is questionable. Second, no mechanism exists to change how the MAS is deployed when external factors trigger a re-evaluation of the survivability of the MAS. In this paper, we present three algorithms to address these two important problems. Our algorithms can be built on top of any CSA. Our algorithms are completely distributed and can handle external triggers to compute a new deployment. We report on experiments assessing the efficiency of these algorithms.},
	keywords = {Computer, Science},
	isbn = {978-3-540-24010-5},
	url = {http://dx.doi.org/10.1007/978-3-540-30200-1_1},
	author = {Subrahmanian,V. and Kraus,Sarit and Zhang,Yingqian},
	editor = {Dix,J{\"u}rgen and Leite,Jo{\~a}o}
}
@conference {13186,
	title = {Fast multiple object tracking via a hierarchical particle filter},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/10//},
	pages = {212 - 219 Vol. 1 - 212 - 219 Vol. 1},
	abstract = {A very efficient and robust visual object tracking algorithm based on the particle filter is presented. The method characterizes the tracked objects using color and edge orientation histogram features. While the use of more features and samples can improve the robustness, the computational load required by the particle filter increases. To accelerate the algorithm while retaining robustness we adopt several enhancements in the algorithm. The first is the use of integral images for efficiently computing the color features and edge orientation histograms, which allows a large amount of particles and a better description of the targets. Next, the observation likelihood based on multiple features is computed in a coarse-to-fine manner, which allows the computation to quickly focus on the more promising regions. Quasi-random sampling of the particles allows the filter to achieve a higher convergence rate. The resulting tracking algorithm maintains multiple hypotheses and offers robustness against clutter or short period occlusions. Experimental results demonstrate the efficiency and effectiveness of the algorithm for single and multiple object tracking.},
	keywords = {(numerical, algorithm;, analysis;, Color, colour, Computer, Convergence, detection;, edge, fast, filter;, Filtering, hierarchical, histogram;, image, images;, integral, likelihood;, methods);, methods;, multiple, numerical, object, observation, of, orientation, particle, processes;, quasirandom, random, sampling;, tracking, tracking;, vision;, visual},
	doi = {10.1109/ICCV.2005.95},
	author = {Yang,Changjiang and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {13189,
	title = {On-line density-based appearance modeling for object tracking},
	booktitle = {Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/10//},
	pages = {1492 -1499 Vol. 2 - 1492 -1499 Vol. 2},
	abstract = {Object tracking is a challenging problem in real-time computer vision due to variations of lighting condition, pose, scale, and view-point over time. However, it is exceptionally difficult to model appearance with respect to all of those variations in advance; instead, on-line update algorithms are employed to adapt to these changes. We present a new on-line appearance modeling technique which is based on sequential density approximation. This technique provides accurate and compact representations using Gaussian mixtures, in which the number of Gaussians is automatically determined. This procedure is performed in linear time at each time step, which we prove by amortized analysis. Features for each pixel and rectangular region are modeled together by the proposed sequential density approximation algorithm, and the target model is updated in scale robustly. We show the performance of our method by simulations and tracking in natural videos},
	keywords = {appearance, approximation;Gaussian, Computer, density, density-based, detection;target, Gaussian, mixtures;object, modeling, modeling;real-time, processes;computer, sequences;object, technique;online, tracking;, tracking;online, vision;image, vision;sequential},
	doi = {10.1109/ICCV.2005.181},
	author = {Han,B. and Davis, Larry S.}
}
@inbook {17793,
	title = {Probabilistic Ontologies and Relational Databases},
	booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE},
	series = {Lecture Notes in Computer Science},
	volume = {3760},
	year = {2005},
	month = {2005///},
	pages = {1 - 17},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.},
	keywords = {Computer, Science},
	isbn = {978-3-540-29736-9},
	url = {http://dx.doi.org/10.1007/11575771_1},
	author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.},
	editor = {Meersman,Robert and Tari,Zahir}
}
@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.}
}
@conference {12706,
	title = {3D model refinement using surface-parallax},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/05//},
	pages = {iii - 285-8 vol.3 - iii - 285-8 vol.3},
	abstract = {We present an approach to update and refine coarse 3D models of urban environments from a sequence of intensity images using surface parallax. This generalizes the plane-parallax recovery methods to surface-parallax using arbitrary surfaces. A coarse and potentially incomplete depth map of the scene obtained from a digital elevation map (DEM) is used as a reference surface which is refined and updated using this approach. The reference depth map is used to estimate the camera motion and the motion of the 3D points on the reference surface is compensated. The resulting parallax, which is an epipolar field, is estimated using an adaptive windowing technique and used to obtain the refined depth map.},
	keywords = {3D, adaptive, arbitrary, camera, coarse, compensation;, Computer, DEM;, depth, digital, ELEVATION, environments;, epipolar, estimation;, field;, image, incomplete, INTENSITY, map;, model, MOTION, parallax;, plane-parallax, reconstruction;, recovery;, refinement;, sequence;, sequences;, surface, surfaces;, urban, vision;, windowing;},
	doi = {10.1109/ICASSP.2004.1326537},
	author = {Agrawala, Ashok K. and Chellapa, Rama}
}
@conference {13216,
	title = {Iterative figure-ground discrimination},
	booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/08//},
	pages = {67 - 70 Vol.1 - 67 - 70 Vol.1},
	abstract = {Figure-ground discrimination is an important problem in computer vision. Previous work usually assumes that the color distribution of the figure can be described by a low dimensional parametric model such as a mixture of Gaussians. However, such approach has difficulty selecting the number of mixture components and is sensitive to the initialization of the model parameters. In this paper, we employ non-parametric kernel estimation for color distributions of both the figure and background. We derive an iterative sampling-expectation (SE) algorithm for estimating the color, distribution and segmentation. There are several advantages of kernel-density estimation. First, it enables automatic selection of weights of different cues based on the bandwidth calculation from the image itself. Second, it does not require model parameter initialization and estimation. The experimental results on images of cluttered scenes demonstrate the effectiveness of the proposed algorithm.},
	keywords = {algorithm;, analysis;, Bandwidth, calculation;, Color, colour, Computer, density, dimensional, discrimination;, distribution;, distributions;, Estimation, estimation;, expectation, figure, Gaussian, ground, image, initialization;, iterative, Kernel, low, methods;, mixture;, model, model;, nonparametric, parameter, parametric, processes;, sampling, sampling;, segmentation, segmentation;, statistics;, theory;, vision;},
	doi = {10.1109/ICPR.2004.1334006},
	author = {Zhao, L. and Davis, Larry S.}
}
@conference {13209,
	title = {Multi-level fast multipole method for thin plate spline evaluation},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/10//},
	pages = {1683 - 1686 Vol. 3 - 1683 - 1686 Vol. 3},
	abstract = {Image registration is an important problem in image processing and computer vision. Much recent work in image registration is on matching non-rigid deformations. Thin plate splines are an effective image registration method when the deformation between two images can be modeled as the bending of a thin metal plate on point constraints such that the topology is preserved (non-rigid deformation). However, because evaluating the computed TPS model at all the image pixels is computationally expensive, we need to speed it up. We introduce the use of multi-level fast muitipole method (MLFMM) for this purpose. Our contribution lies in the presentation of a clear and concise MLFMM framework for TPS, which will be useful for future application developments. The achieved speedup using MLFMM is an improvement from O(N<sup>2</sup>) to O(N log N). We show that the fast evaluation outperforms the brute force method while maintaining acceptable error bound.},
	keywords = {(mathematics);, Computer, deformation;, evaluation;, fast, image, MATCHING, matching;, metal, method;, multilevel, multipole, nonrigid, pixel;, plate, plate;, processing;, registration;, resolution;, spline, splines, thin, vision;},
	doi = {10.1109/ICIP.2004.1421395},
	author = {Zandifar,A. and Lim,S. and Duraiswami, Ramani and Gumerov, Nail A. and Davis, Larry S.}
}
@inbook {18019,
	title = {PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness},
	booktitle = {Mathematical Foundations of Computer Science 2004Mathematical Foundations of Computer Science 2004},
	series = {Lecture Notes in Computer Science},
	volume = {3153},
	year = {2004},
	month = {2004///},
	pages = {104 - 105},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Consider situations where once you were told about a new technical idea you reacted by saying: {\textquotedblleft}but this is so obvious, I wonder how I missed it{\textquotedblright}. I found out recently that the US patent law has a nice formal way of characterizing such a situation. The US patent law protects inventions that meet three requirements: utility, novelty and non-obviousness. Non-obviousness is considered the most challenging of the three to establish. The talk will try to argue that a possible virtue for a technical contribution is when, in restrospect, its non-obviousness is not too obvious; and since hindsight is always 20/20, one may often need to resort to various types of circumstantial evidence in order to establish non-obviousness. There are two reasons for bringing this issue up in my talk: (i) seeking such a virtue has been an objective of my work over the years, and (ii) issues of taste in research are more legitimate for invited talks; there might be merit in reminding younger researchers that not every {\textquotedblleft}result{\textquotedblright} is necessarily also a {\textquotedblleft}contribution{\textquotedblright}; perhaps the criterion of not-so-obvious non-obviousness could be helpful in some cases to help recognize a contribution. The focus of the second focal point for my talk, the PRAM-On-Chip approach, meets at least one of the standard legal ways to support non-obviousness: {\textquotedblleft}Expressions of disbelief by experts constitute strong evidence of non-obviousness{\textquotedblright}. It is well documented that the whole PRAM algorithmic theory was considered {\textquotedblleft}unrealistic{\textquotedblright} by numerous experts in the field, prior to the PRAM-On-Chip project. In fact, I needed recently to use this documentation in a reply to the U.S. patent office. An introduction of the PRAM-On-Chip approach follows. Many parallel computer systems architectures have been proposed and built over the last several decades. The outreach of the few that survived has been severely limited due to their programmability problems. The question of how to think algorithmically in parallel has been the fundamental problem for which these architectures did not have an adequate answer. A computational model, the Parallel Random Access Model (PRAM), has been developed by numerous (theoretical computer science) algorithm researchers to address this question during the 1980s and 1990s and is considered by many as the easiest known approach to parallel programming. Despite the broad interest the PRAM generated, it had not been possible to build parallel machines that adequately support it using multi-chip multiprocessors, the only multiprocessors that were buildable in the 1990s since low-overhead coordination was not possible. Our main insight is that this is becoming possible with the increasing amounts of hardware that can be placed on a single chip. From the PRAM, as a starting point, a highly parallel explicit multi-threaded (XMT) on-chip processor architecture that relies on new low-overhead coordination mechanisms and whose performance objective is reducing single task completion time has been conceived and developed. Simulated program executions have shown dramatic performance gains over conventional processor architectures. Namely, in addition to the unique parallel programmability features, which set XMT apart from any other current approach, XMT also provides very competitive performance. If XMT will meet expectations, its introduction would greatly enhance the normal rate of improvement of conventional processor architectures leading to new applications.},
	keywords = {Computer, Science},
	isbn = {978-3-540-22823-3},
	url = {http://dx.doi.org/10.1007/978-3-540-28629-5_5},
	author = {Vishkin, Uzi},
	editor = {Fiala,Jir{\'\i} and Koubek,V{\'a}clav and Kratochv{\'\i}l,Jan}
}
@conference {13208,
	title = {Recording and reproducing high order surround auditory scenes for mixed and augmented reality},
	booktitle = {Mixed and Augmented Reality, 2004. ISMAR 2004. Third IEEE and ACM International Symposium on},
	year = {2004},
	month = {2004/11//},
	pages = {240 - 249},
	abstract = {Virtual reality systems are largely based on computer graphics and vision technologies. However, sound also plays an important role in human{\textquoteright}s interaction with the surrounding environment, especially for the visually impaired people. In this paper, we develop the theory of recording and reproducing real-world surround auditory scenes in high orders using specially designed microphone and loudspeaker arrays. It is complementary to vision-based technologies in creating mixed and augmented realities. Design examples and simulations are presented.},
	keywords = {array;, audio, auditory, augmented, Computer, graphics;, high, loudspeaker, microphone, mixed, order, processing;, reality, reality;, scene;, signal, surround, system;, technology;, virtual, VISION, vision;},
	doi = {10.1109/ISMAR.2004.51},
	author = {Zhiyun Li and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {12696,
	title = {Role of shape and kinematics in human movement analysis},
	booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on},
	volume = {1},
	year = {2004},
	month = {2004/07/02/june},
	pages = {I-730 - I-737 Vol.1 - I-730 - I-737 Vol.1},
	abstract = {Human gait and activity analysis from video is presently attracting a lot of attention in the computer vision community. In this paper we analyze the role of two of the most important cues in human motion-shape and kinematics. We present an experimental framework whereby it is possible to evaluate the relative importance of these two cues in computer vision based recognition algorithms. In the process, we propose a new gait recognition algorithm by computing the distance between two sequences of shapes that lie on a spherical manifold. In our experiments, shape is represented using Kendall{\textquoteright}s definition of shape. Kinematics is represented using a Linear Dynamical system We place particular emphasis on human gait. Our conclusions show that shape plays a role which is more significant than kinematics in current automated gait based human identification algorithms. As a natural extension we study the role of shape and kinematics in activity recognition. Our experiments indicate that we require models that contain both shape and kinematics in order to perform accurate activity classification. These conclusions also allow us to explain the relative performance of many existing methods in computer-based human activity modeling.},
	keywords = {activity, algorithm;, algorithms;, analysis;, autoregressive, average, based, classification;, community;, Computer, definition;, dynamical, extraction;, feature, Gait, hidden, human, identification, image, Kendall, linear, manifold;, Markov, modeling;, models;, MOTION, Movement, moving, processes;, recognition, sequences;, SHAPE, spherical, system;, VISION, vision;},
	doi = {10.1109/CVPR.2004.1315104},
	author = {Veeraraghavan,A. and Chowdhury, A.R. and Chellapa, Rama}
}
@inbook {12294,
	title = {Using Trust in Recommender Systems: An Experimental Analysis},
	booktitle = {Trust ManagementTrust Management},
	series = {Lecture Notes in Computer Science},
	volume = {2995},
	year = {2004},
	month = {2004///},
	pages = {221 - 235},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {Recommender systems (RS) have been used for suggesting items (movies, books, songs, etc.) that users might like. RSs compute a user similarity between users and use it as a weight for the users{\textquoteright} ratings. However they have many weaknesses, such as sparseness, cold start and vulnerability to attacks. We assert that these weaknesses can be alleviated using a Trust-aware system that takes into account the {\textquotedblleft}web of trust{\textquotedblright} provided by every user. Specifically, we analyze data from the popular Internet web site epinions.com . The dataset consists of 49290 users who expressed reviews (with rating) on items and explicitly specified their web of trust, i.e. users whose reviews they have consistently found to be valuable. We show that any two users have usually few items rated in common. For this reason, the classic RS technique is often ineffective and is not able to compute a user similarity weight for many of the users. Instead exploiting the webs of trust, it is possible to propagate trust and infer an additional weight for other users. We show how this quantity can be computed against a larger number of users.},
	keywords = {Computer, Science},
	isbn = {978-3-540-21312-3},
	url = {http://dx.doi.org/10.1007/978-3-540-24747-0_17},
	author = {Massa,Paolo and Bhattacharjee, Bobby},
	editor = {Jensen,Christian and Poslad,Stefan and Dimitrakos,Theo}
}
@article {12699,
	title = {Wide baseline image registration with application to 3-D face modeling},
	journal = {Multimedia, IEEE Transactions on},
	volume = {6},
	year = {2004},
	month = {2004/06//},
	pages = {423 - 434},
	abstract = {Establishing correspondence between features in two images of the same scene taken from different viewing angles is a challenging problem in image processing and computer vision. However, its solution is an important step in many applications like wide baseline stereo, three-dimensional (3-D) model alignment, creation of panoramic views, etc. In this paper, we propose a technique for registration of two images of a face obtained from different viewing angles. We show that prior information about the general characteristics of a face obtained from video sequences of different faces can be used to design a robust correspondence algorithm. The method works by matching two-dimensional (2-D) shapes of the different features of the face (e.g., eyes, nose etc.). A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellation of features in the two sets, thus taking into account the global spatial configuration of the features. The method is applied for creating holistic 3-D models of a face from partial representations. Although this paper focuses primarily on faces, the algorithm can also be used for other objects with small modifications.},
	keywords = {2D, 3D, algorithm;, baseline, biometrics;, Computer, configuration;, correspondence, doubly, error, extraction;, Face, feature, holistic, image, matching;, matrix;, minimization;, modeling;, models;, normalization, probability, probability;, procedure;, processes;, processing;, recognition;, registration;, representation;, sequences;, shapes;, Sinkhorn, spatial, statistics;, Stochastic, video, vision;, wide},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.827511},
	author = {Roy-Chowdhury, A.K. and Chellapa, Rama and Keaton, T.}
}
@conference {12729,
	title = {Activity recognition using the dynamics of the configuration of interacting objects},
	booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on},
	volume = {2},
	year = {2003},
	month = {2003/06//},
	pages = {II - 633-40 vol.2 - II - 633-40 vol.2},
	abstract = {Monitoring activities using video data is an important surveillance problem. A special scenario is to learn the pattern of normal activities and detect abnormal events from a very low resolution video where the moving objects are small enough to be modeled as point objects in a 2D plane. Instead of tracking each point separately, we propose to model an activity by the polygonal {\textquoteright}shape{\textquoteright} of the configuration of these point masses at any time t, and its deformation over time. We learn the mean shape and the dynamics of the shape change using hand-picked location data (no observation noise) and define an abnormality detection statistic for the simple case of a test sequence with negligible observation noise. For the more practical case where observation (point locations) noise is large and cannot be ignored, we use a particle filter to estimate the probability distribution of the shape given the noisy observations up to the current time. Abnormality detection in this case is formulated as a change detection problem. We propose a detection strategy that can detect both {\textquoteright}drastic{\textquoteright} and {\textquoteright}slow{\textquoteright} abnormalities. Our framework can be directly applied for object location data obtained using any type of sensors - visible, radar, infrared or acoustic.},
	keywords = {2D, abnormal, abnormality, abnormality;, acoustic, activity, analysis;, change;, Computer, configuration, configuration;, data;, DETECTION, detection;, distribution;, drastic, dynamics;, event;, filter;, hand-picked, image, infrared, interacting, learning;, location, low, mean, model;, monitoring;, MOTION, moving, noise;, noisy, object, object;, observation, observation;, particle, pattern, plane;, point, polygonal, probability, probability;, problem;, processing;, radar, recognition;, resolution, sensor;, sensors;, sequence;, SHAPE, shape;, signal, slow, statistic;, strategy;, Surveillance, surveillance;, target, test, tracking;, video, video;, visible, vision;},
	doi = {10.1109/CVPR.2003.1211526},
	author = {Vaswani, N. and RoyChowdhury, A. and Chellapa, Rama}
}
@article {18023,
	title = {Deterministic Resource Discovery in Distributed Networks},
	journal = {Theory of Computing Systems},
	volume = {36},
	year = {2003},
	month = {2003///},
	pages = {479 - 495},
	abstract = {The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph that represents the vertices{\textquoteright} knowledge about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity $O(n^3)$ (with message complexity $O(n^2)$), or message complexity $O(|E_0| {\l}og n)$ (where $E_0$ is the arc set of the initial graph $G_0$). Compared with the main randomized algorithm of Harchol-Balter, Leighton, and Lewin, the time complexity is reduced from $O({\l}og^2n)$ to\pagebreak[4] $O({\l}og n )$, the message complexity from $O(n {\l}og^2 n)$ to $O(n {\l}og n )$, and the communication complexity from $O(n^2 {\l}og^3 n)$ to $O(|E_0|{\l}og ^2 n )$. \par Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to Lipton.},
	keywords = {Computer, Science},
	isbn = {1432-4350},
	url = {http://dx.doi.org/10.1007/s00224-003-1084-8},
	author = {Kutten,Shay and Peleg,David and Vishkin, Uzi}
}
@article {13235,
	title = {Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/11//},
	pages = {1499 - 1504},
	abstract = {Many vision algorithms depend on the estimation of a probability density function from observations. Kernel density estimation techniques are quite general and powerful methods for this problem, but have a significant disadvantage in that they are computationally intensive. In this paper, we explore the use of kernel density estimation with the fast Gauss transform (FGT) for problems in vision. The FGT allows the summation of a mixture of ill Gaussians at N evaluation points in O(M+N) time, as opposed to O(MN) time for a naive evaluation and can be used to considerably speed up kernel density estimation. We present applications of the technique to problems from image segmentation and tracking and show that the algorithm allows application of advanced statistical techniques to solve practical vision problems in real-time with today{\textquoteright}s computers.},
	keywords = {algorithms;, Color, Computer, density, estimation;, fast, function;, Gauss, image, Kernel, modeling;, segmentation;, tracking;, transform;, transforms;, VISION, vision;},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1240123},
	author = {Elgammal,A. and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {13247,
	title = {Learning dynamics for exemplar-based gesture recognition},
	booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on},
	volume = {1},
	year = {2003},
	month = {2003/06//},
	pages = {I-571 - I-578 vol.1 - I-571 - I-578 vol.1},
	abstract = {This paper addresses the problem of capturing the dynamics for exemplar-based recognition systems. Traditional HMM provides a probabilistic tool to capture system dynamics and in exemplar paradigm, HMM states are typically coupled with the exemplars. Alternatively, we propose a non-parametric HMM approach that uses a discrete HMM with arbitrary states (decoupled from exemplars) to capture the dynamics over a large exemplar space where a nonparametric estimation approach is used to model the exemplar distribution. This reduces the need for lengthy and non-optimal training of the HMM observation model. We used the proposed approach for view-based recognition of gestures. The approach is based on representing each gesture as a sequence of learned body poses (exemplars). The gestures are recognized through a probabilistic framework for matching these body poses and for imposing temporal constraints between different poses using the proposed non-parametric HMM.},
	keywords = {arbitrary, body, by, Computer, constraint;, detection;, discrete, distribution, dynamics;, edge, estimation;, example;, exemplar, exemplar-based, extraction;, feature, framework;, gesture, gesture;, hidden, HMM;, human, image, learning, Markov, matching;, model;, models;, motion;, nonparametric, pose, probabilistic, recognition;, sequence;, space;, state;, statistics;, system, temporal, tool;, view-based, vision;},
	doi = {10.1109/CVPR.2003.1211405},
	author = {Elgammal,A. and Shet,V. and Yacoob,Yaser and Davis, Larry S.}
}
@conference {13246,
	title = {Modelling pedestrian shapes for outlier detection: a neural net based approach},
	booktitle = {Intelligent Vehicles Symposium, 2003. Proceedings. IEEE},
	year = {2003},
	month = {2003/06//},
	pages = {428 - 433},
	abstract = {In this paper we present an example-based approach to learn a given class of complex shapes, and recognize instances of that shape with outliers. The system consists of a two-layer custom-designed neural network. We apply this approach to the recognition of pedestrians carrying objects from a single camera. The system is able to capture and model an ample range of pedestrian shapes at varying poses and camera orientations, and achieves a 90\% correct recognition rate.},
	keywords = {(artificial, complex, Computer, computing;, custom, design;, detection;, engineering, intelligence);, layer, learning, method;, modelling;, net;, nets;, neural, object, outlier, pedestrian, pedestrians, rate;, recognition, recognition;, SHAPE, shapes;, traffic, two, vision;},
	doi = {10.1109/IVS.2003.1212949},
	author = {Nanda,H. and Benabdelkedar,C. and Davis, Larry S.}
}
@conference {13248,
	title = {Probabilistic tracking in joint feature-spatial spaces},
	booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on},
	volume = {1},
	year = {2003},
	month = {2003/06//},
	pages = {I-781 - I-788 vol.1 - I-781 - I-788 vol.1},
	abstract = {In this paper, we present a probabilistic framework for tracking regions based on their appearance. We exploit the feature-spatial distribution of a region representing an object as a probabilistic constraint to track that region over time. The tracking is achieved by maximizing a similarity-based objective function over transformation space given a nonparametric representation of the joint feature-spatial distribution. Such a representation imposes a probabilistic constraint on the region feature distribution coupled with the region structure, which yields an appearance tracker that is robust to small local deformations and partial occlusion. We present the approach for the general form of joint feature-spatial distributions and apply it to tracking with different types of image features including row intensity, color and image gradient.},
	keywords = {analysis;, appearance, appearance;, color;, colour, Computer, constraint;, deformation;, detection;, distribution;, edge, estimation;, extraction;, feature, feature-spatial, feature;, function, gradient;, image, intensity;, joint, likelihood, local, maximization;, maximum, nonparametric, object, objective, occlusion;, optical, partial, probabilistic, probability;, region, representation;, row, similarity-based, small, space;, structure;, target, tracker;, tracking;, transformation, vision;},
	doi = {10.1109/CVPR.2003.1211432},
	author = {Elgammal,A. and Duraiswami, Ramani and Davis, Larry S.}
}
@conference {16896,
	title = {Simultaneous pose and correspondence determination using line features},
	booktitle = {Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on},
	volume = {2},
	year = {2003},
	month = {2003/06//},
	pages = {II-424 - II-431 vol.2 - II-424 - II-431 vol.2},
	abstract = {We present a new robust line matching algorithm for solving the model-to-image registration problem. Given a model consisting of 3D lines and a cluttered perspective image of this model, the algorithm simultaneously estimates the pose of the model and the correspondences of model lines to image lines. The algorithm combines softassign for determining correspondences and POSIT for determining pose. Integrating these algorithms into a deterministic annealing procedure allows the correspondence and pose to evolve from initially uncertain values to a joint local optimum. This research extends to line features the SoftPOSIT algorithm proposed recently for point features. Lines detected in images are typically more stable than points and are less likely to be produced by clutter and noise, especially in man-made environments. Experiments on synthetic and real imagery with high levels of clutter, occlusion, and noise demonstrate the robustness of the algorithm.},
	keywords = {algorithm;, algorithms;, annealing;, clutter;, cluttered, Computer, correspondence, detection;, determination;, deterministic, environment;, extraction;, feature, feature;, image, image;, imagery;, images;, joint, line, local, man-made, MATCHING, matching;, measurement;, model-to-image, noise;, occlusion;, optimum;, perspective, point, pose, position, problem;, processing;, real, realistic, registration, simulated, softassign;, SoftPOSIT, stereo, synthetic, vision;},
	doi = {10.1109/CVPR.2003.1211499},
	author = {David,P. and DeMenthon,D. and Duraiswami, Ramani and Samet, Hanan}
}
@conference {12765,
	title = {3D face reconstruction from video using a generic model},
	booktitle = {Multimedia and Expo, 2002. ICME {\textquoteright}02. Proceedings. 2002 IEEE International Conference on},
	volume = {1},
	year = {2002},
	month = {2002///},
	pages = {449 - 452 vol.1 - 449 - 452 vol.1},
	abstract = {Reconstructing a 3D model of a human face from a video sequence is an important problem in computer vision, with applications to recognition, surveillance, multimedia etc. However, the quality of 3D reconstructions using structure from motion (SfM) algorithms is often not satisfactory. One common method of overcoming this problem is to use a generic model of a face. Existing work using this approach initializes the reconstruction algorithm with this generic model. The problem with this approach is that the algorithm can converge to a solution very close to this initial value, resulting in a reconstruction which resembles the generic model rather than the particular face in the video which needs to be modeled. We propose a method of 3D reconstruction of a human face from video in which the 3D reconstruction algorithm and the generic model are handled separately. A 3D estimate is obtained purely from the video sequence using SfM algorithms without use of the generic model. The final 3D model is obtained after combining the SfM estimate and the generic model using an energy function that corrects for the errors in the estimate by comparing local regions in the two models. The optimization is done using a Markov chain Monte Carlo (MCMC) sampling strategy. The main advantage of our algorithm over others is that it is able to retain the specific features of the face in the video sequence even when these features are different from those of the generic model. The evolution of the 3D model through the various stages of the algorithm is presented.},
	keywords = {3D, algorithm;, algorithms;, analysis;, Carlo, chain, Computer, Face, from, function;, generic, human, image, Markov, MCMC, methods;, model;, Monte, MOTION, optimisation;, OPTIMIZATION, processes;, processing;, recognition;, reconstruction, reconstruction;, sampling;, sequence;, sequences;, SfM, signal, structure, surveillance;, video, vision;},
	doi = {10.1109/ICME.2002.1035815},
	author = {Chowdhury, A.R. and Chellapa, Rama and Krishnamurthy, S. and Vo, T.}
}
@inbook {17817,
	title = {Error-Tolerant Agents},
	booktitle = {Computational Logic: Logic Programming and BeyondComputational Logic: Logic Programming and Beyond},
	series = {Lecture Notes in Computer Science},
	volume = {2407},
	year = {2002},
	month = {2002///},
	pages = {83 - 104},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The use of agents in today{\textquoteright}s Internet world is expanding rapidly. Yet, agent developers proceed largely under the optimistic assumption that agents will be error-free. Errors may arise in agents for numerous reasons {\textemdash} agents may share a workspace with other agents or humans and updates made by these other entities may cause an agent to face a situation that it was not explicitly programmed to deal with. Likewise, errors in coding agents may lead to inconsistent situations where it is unclear how the agent should act. In this paper, we define an agent execution model that allows agents to continue acting {\textquotedblleft}reasonably{\textquotedblright} even when some errors of the above types occur. More importantly, in our framework, agents take {\textquotedblleft}repair{\textquotedblright} actions automatically when confronted with such situations, but while taking such repair actions, they can often continue to engage in work and/or interactions with other agents that are unaffected by repairs.},
	keywords = {Computer, Science},
	isbn = {978-3-540-43959-2},
	url = {http://dx.doi.org/10.1007/3-540-45628-7_22},
	author = {Eiter,Thomas and Mascardi,Viviana and Subrahmanian,V.},
	editor = {Kakas,Antonis and Sadri,Fariba}
}
@conference {16153,
	title = {Interactive information visualization of a million items},
	booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {117 - 124},
	abstract = {Existing information visualization techniques are usually limited to the display of a few thousand items. This article describes new interactive techniques capable of handling a million items (effectively visible and manageable on screen). We evaluate the use of hardware-based techniques available with newer graphics cards, as well as new animation techniques and non-standard graphical features such as stereovision and overlap count. These techniques have been applied to two popular information visualizations: treemaps and scatter plot diagrams; but are generic enough to be applied to other 2D representations as well.},
	keywords = {animation, animation;, cards;, Computer, count;, data, diagrams;, Graphics, hardware-based, information, interactive, interpolation;, overlap, plot, scatter, stereovision;, systems;, techniques;, treemaps;, visualisation;, visualization;},
	doi = {10.1109/INFVIS.2002.1173156},
	author = {Fekete,J.-D. and Plaisant, Catherine}
}
@article {17815,
	title = {Presentation planning for distributed VoD systems},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {14},
	year = {2002},
	month = {2002/10//sep},
	pages = {1059 - 1077},
	abstract = {A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.},
	keywords = {Computer, computing;, databases;, demand;, distributed, local, multimedia, network;, on, optimal, plan;, plans;, presentation, presentation;, server;, servers;, video, video-on-demand;, VoD;},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2002.1033774},
	author = {Hwang,Eenjun and Prabhakaran,B. and V.S. Subrahmanian}
}
@conference {18453,
	title = {What we have learned about fighting defects},
	booktitle = {Software Metrics, 2002. Proceedings. Eighth IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {249 - 258},
	abstract = {The Center for Empirically Based Software Engineering helps improve software development by providing guidelines for selecting development techniques, recommending areas for further research, and supporting software engineering education. A central activity toward achieving this goal has been the running of "e- Workshops" that capture expert knowledge with a minimum of overhead effort to formulate heuristics on a particular topic. The resulting heuristics are a useful summary of the current state of knowledge in an area based on expert opinion. This paper discusses the results to date of a series of e-Workshops on software defect reduction. The original discussion items are presented along with an encapsulated summary of the expert discussion. The reformulated heuristics can be useful both to researchers (for pointing out gaps in the current state of the knowledge requiring further investigation) and to practitioners (for benchmarking or setting expectations about development practices).},
	keywords = {based, Center, Computer, defect, development;, education;, electronic, Empiric, engineering, engineering;, eWorkshops;, for, heuristics;, reduction;, Science, software, workshops;},
	doi = {10.1109/METRIC.2002.1011343},
	author = {Shull, F. and Basili, Victor R. and Boehm,B. and Brown,A. W and Costa,P. and Lindvall,M. and Port,D. and Rus,I. and Tesoriero,R. and Zelkowitz, Marvin V}
}
@conference {12747,
	title = {Wide baseline image registration using prior information},
	booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on},
	year = {2002},
	month = {2002/12//},
	pages = {37 - 40},
	abstract = {Establishing correspondence between features in two images of the same scene taken from different viewing angles in a challenging problem in image processing and computer vision. However, its solution is an important step in many applications like wide baseline stereo, 3D model alignment, creation of panoramic views etc. In this paper, we propose a technique for registration of two images of a face obtained from different viewing angles. We show that prior information about the general characteristics of a face obtained from video sequences of different faces can be used to design a robust correspondence algorithm. The method works by matching 2D shapes of the different features of the face. A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellations of features in the two sets, thus taking into account the global spatial configuration of the features. The method is applied for creating holistic 3D models of a face from partial representations. Although this paper focuses primarily on faces, the algorithm can also be used for other objects with small modifications.},
	keywords = {2D, 3D, algorithm;, alignment;, angles;, baseline, Computer, configuration;, constellation;, correspondence, creation;, doubly, error, extraction;, Face, feature, global, holistic, image, images;, matching;, matrix;, model, models;, normalization, panoramic, probability;, procedure;, processes;, processing;, registration;, robust, sequences;, SHAPE, signal, Sinkhorn, spatial, statistics;, stereo;, Stochastic, video, view, viewing, vision;, wide},
	doi = {10.1109/MMSP.2002.1203242},
	author = {Chowdhury, AM and Chellapa, Rama and Keaton, T.}
}
@article {18438,
	title = {The empirical investigation of Perspective-Based Reading},
	journal = {Empirical Software Engineering},
	volume = {1},
	year = {1996},
	month = {1996///},
	pages = {133 - 164},
	abstract = {We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.},
	keywords = {Computer, Science},
	isbn = {1382-3256},
	url = {http://dx.doi.org/10.1007/BF00368702},
	author = {Basili, Victor R. and Green,Scott and Laitenberger,Oliver and Lanubile,Filippo and Shull, Forrest and S{\o}rumg{\r a}rd,Sivert and Zelkowitz, Marvin V}
}
@conference {14855,
	title = {Stochastic completion fields: a neural model of illusory contour shape and salience},
	booktitle = {Computer Vision, 1995. Proceedings., Fifth International Conference on},
	year = {1995},
	month = {1995/06//},
	pages = {408 - 415},
	abstract = {We describe an algorithm and representation level theory of illusory contour shape and salience. Unlike previous theories, our model is derived from a single assumption-namely, that the prior probability distribution of boundary completion shape can be modeled by a random walk in a lattice whose points are positions and orientations in the image plane (i.e. the space which one can reasonably assume is represented by neurons of the mammalian visual cortex). Our model does not employ numerical relaxation or other explicit minimization, but instead relies on the fact that the probability that a particle following a random walk will pass through a given position and orientation on a path joining two boundary fragments can be computed directly as the product of two vector-field convolutions. We show that for the random walk we define, the maximum likelihood paths are curves of least energy, that is, on average, random walks follow paths commonly assumed to model the shape of illusory contours. A computer model is demonstrated on numerous illusory contour stimuli from the literature},
	keywords = {boundary, completion, computational, Computer, contour, contours;, convolutions;, cortex;, curves, detection;, distribution;, edge, energy;, estimation;, fields;, fragments;, geometry;, illusory, image, lattice;, least, likelihood, mammalian, maximum, model;, nets;, neural, of, paths;, plane;, probability, probability;, random, recognition;, shape;, stimuli;, Stochastic, vector-field, visual, walk;},
	doi = {10.1109/ICCV.1995.466910},
	author = {Williams,L. R and Jacobs, David W.}
}
@inbook {18049,
	title = {On a parallel-algorithms method for string matching problems (overview)},
	booktitle = {Algorithms and ComplexityAlgorithms and Complexity},
	series = {Lecture Notes in Computer Science},
	volume = {778},
	year = {1994},
	month = {1994///},
	pages = {22 - 32},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	keywords = {Computer, Science},
	isbn = {978-3-540-57811-6},
	url = {http://dx.doi.org/10.1007/3-540-57811-0_3},
	author = {Sahinalp,Suleyman and Vishkin, Uzi},
	editor = {Bonuccelli,M. and Crescenzi,P. and Petreschi,R.}
}
@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 (<e1>N</e1> times;<e1>N</e1> times; . . . times;<e1>N</e1>) <e1>d</e1>-dimensional linear separable transforms. For fixed-precision arithmetic with <e1>b</e1> bits, the architectures have an area <e1>A</e1>=<e1>O</e1>(<e1>N</e1><sup>d+2a</sup>) and computation time <e1>T</e1>=<e1>O</e1>(<e1>dN</e1><sup>d/2-a</sup><e1>b </e1>), and achieve the <e1>AT</e1><sup>2</sup> bound of <e1>AT</e1><sup>2</sup>=<e1>O</e1>(<e1>n</e1><sup>2</sup><e1>b</e1> <sup>2</sup>) for constant <e1>d</e1>, where <e1>n</e1>=<e1>N</e1><sup>d </sup> and <e1>O</e1> lt;<e1>a</e1> les;<e1>d</e1>/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.}
}
