Speaker:  Yizhou Wang
Title: Statistical Inference on Markov Random Graphs 
Time: Friday(March, 18) 12:300-1:30pm
Room: BH4750
Abstract
As natural scenes contain a huge number of visual patterns generated by
various stochastic processes, how to represent and model these diverse
visual patterns, and how to learn and compute/infer those visual
patterns efficiently become fundamental problems in computer vision.

In this talk, I will present a unified generative statistical learning
and inference framework to transfer raw images into graph
representation. Based on the generic graph representation, four
important issues in image and video modeling are addressed, which are
photometric, geometric, dynamic and topological issues. The unified
framework aims to answer questions like "What do we perceive when we
look at an image or a video sequence?" It tries to identify the basic
elements in images and videos, model their attributes and interactions
in space and time. I will use three challenging examples to illustrate
the learning and inference on these four aspects. Example 1) Textured
motion modeling. Example 2) Topological changes in complex motion.
Example 3) Perceptual transitions in scale-space. The integrated
framework is generic. It can be widely applied to many vision
applications, such as tracking, video annotation, motion segmentation,
document image analysis, surveillance, and automatic cartoon animation
generation.

Speaker:  Yizhou Wang
Title:  Modeling and Inference of Complex Motion on Graphs 
Time: Friday(March, 04) 12:300-1:30pm
Room: BH4750
Abstract
As natural scenes contain a huge number of visual patterns generated by
various stochastic processes, how to represent and model these diverse
visual patterns, and how to learn and compute/infer those visual patterns
efficiently become fundamental problems in computer vision. Motion, as an
important and powerful visual cue for human perception, is one such visual
pattern being studied for long, but still remains to be challenging and
fundamental.

In this talk, firstly, I will present a unified theory with a generative
statistical learning and inference framework to model and analysis a type
of challenging motion patterns called complex motion, such as falling
snow, flying birds, wavy river, and dancing grass. This type of motion is
characterized by the movement of a large amount of particles and wave
elements, which bear rich stochastic photometric, geometric, dynamic and
topologic variations. The unified framework covers all these four aspects
with a generative attributed graph representation, and it attempts to
answer questions like "What do we perceive when we look at a motion
sequence?" This perceptual-based model is fundamental and generic. It
tries to identify the basic moving elements, their attributes and
interactions in space and time. It is not only good for complex motion,
but also can be widely applied to many vision applications, such as
tracking, video annotation, motion recognition, motion segmentation,
surveillance, and automatic cartoon animation generation. The model
learning and inference is achieved by employing Markov chain Monte Carlo
sampling method.

In the second half of the talk, I will explore the scale-space theory by
treating scaling as one type of motion. The traditional scale-space theory
is enriched by studying the perceptual transitions in a wide range of
scales, which are explained by a set of grammar rules in the generative
graph representation. The resultant multi-scale graph representation can
be beneficial to many important vision applications, including image
enhancement, super-resolution, feature detection, multi-resolution object
recognition, and motion tracking.
Speaker:  Qinghua Zou
Title: mGrid: a Matching Grid for Querying XML Streams 
Time: Friday(Feb. 11th) 12:300-1:30pm
Room: BH4750
Abstract
Efficiently querying of XML streams has gained importance as XML streams
have become popular. Many previous XML stream processors suffer from
tracking the explosive number of matching paths. In this paper, we present
techniques, based on notions of information passing and inheritance, which
can be used to drastically reduce the time and space complexity in
querying XML streams from polynomial to linear. The main contributions of
the paper are: (1) we present a qTree, where each query node is modeled as
an autonomous unit which takes inputs from its children, executes its own
logic, and generates output to its parent; (2) we introduce matching grid
(mGrid) that creates matching units (mUnits) according to the templates in
a qTree and implicitly tracks matching paths; (3) we leverage information
passing and inheritance between mUnits in an mGrid; and (4) we
theoretically prove that the time and space complexity for explicitly
tracking matching paths is O(n^k /k!) for a single-branch document of
depth n and a single-branch query of depth k (k<


Speaker:  Victor Liu
Title: Improving text retrieval using context, domain knowledge and probabilistic content modeling
Time: Friday(Jan. 28th) 12:300-1:30pm
Room: BH4750
Abstract
In recent years, textual information proliferates in all
types of application domains such as business operation, the
Web, and medical informatics. Accurate retrieval of textual
information becomes crucial to the creation of business
intelligence and a widespread gain of knowledge. In this
talk, I will present two major contributions in my thesis
research to improve text retrieval.

The first contribution is to increase the relevance of
search results. Existing retrieval systems often return an
overwhelmingly large number of documents, among which few
are truly relevant to the user's original search intention.
To improve relevance, the system needs to understand user's
search intention and context. As an initial step to this
goal, we examine how to detect users' Web search intentions
via user-click-behavior and Web-link-structure analysis.
Given the detected intention, we can further improve
relevance by refining the original query and make it more
specific and expressive in describing the user's search
intention. I will present a knowledge-based query expansion
technique that leverages domain knowledge to enhance query
refinement.

The second contribution is to improve the search accuracy of
online textual databases whose full contents are
inaccessible to a centralized search engine. This research
is different from traditional information retrieval where
the retrieval system can access the full content of a
textual database. I will present a probabilistic framework
to search such online textual databases with high accuracy.