Results 1  10
of
6,575
Dynamic Bayesian Networks: Representation, Inference and Learning
, 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and biosequence analysis, and KFMs have bee ..."
Abstract

Cited by 770 (3 self)
 Add to MetaCart
been used for problems ranging from tracking planes and missiles to predicting the economy. However, HMMs
and KFMs are limited in their “expressive power”. Dynamic Bayesian Networks (DBNs) generalize HMMs by allowing the state space to be represented in factored form, instead of as a single discrete
Removing camera shake from a single photograph
 ACM Trans. Graph
, 2006
"... Camera shake during exposure leads to objectionable image blur and ruins many photographs. Conventional blind deconvolution methods typically assume frequencydomain constraints on images, or overly simplified parametric forms for the motion path during camera shake. Real camera motions can follow c ..."
Abstract

Cited by 325 (16 self)
 Add to MetaCart
convoluted paths, and a spatial domain prior can better maintain visually salient image characteristics. We introduce a method to remove the effects of camera shake from seriously blurred images. The method assumes a uniform camera blur over the image and negligible inplane camera rotation. In order
Pad  An Alternative Approach to the Computer Interface
 IN PROC. ACM SIGGRAPH
, 1993
"... We believe that navigation in information spaces is best supported by tapping into our natural spatial and geographic ways of thinking. To this end, we are developing a new computer interface model called Pad. The ongoing Pad project uses a spatial metaphor for computer interface design. It provides ..."
Abstract

Cited by 333 (2 self)
 Add to MetaCart
. It provides an intuitive base for the support of such applications as electronic marketplaces, information services, and online collaboration. Pad is an infinite twodimensional information plane that is shared among users, much as a network file system is shared. Objects are organized geographically; every
Single View Metrology
, 1999
"... We describe how 3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal information is typically the vanishing line of a reference plane, and a vanishing point for a direction not parallel to th ..."
Abstract

Cited by 236 (4 self)
 Add to MetaCart
We describe how 3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal information is typically the vanishing line of a reference plane, and a vanishing point for a direction not parallel
Image and depth from a conventional camera with a coded aperture
 ACM TRANS. GRAPH
, 2007
"... A conventional camera captures blurred versions of scene information away from the plane of focus. Camera systems have been proposed that allow for recording allfocus images, or for extracting depth, but to record both simultaneously has required more extensive hardware and reduced spatial resolut ..."
Abstract

Cited by 278 (24 self)
 Add to MetaCart
A conventional camera captures blurred versions of scene information away from the plane of focus. Camera systems have been proposed that allow for recording allfocus images, or for extracting depth, but to record both simultaneously has required more extensive hardware and reduced spatial
Shortest Path Queries in Rectilinear Worlds
, 1991
"... In this paper, a data structure is given for two and higher dimensional shortest path queries. For a set of n axisparallel rectangles in the plane, or boxes in dspace, and a fixed target, it is possible with this structure to find a shortest rectilinear path avoiding all rectangles or boxes from a ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
In this paper, a data structure is given for two and higher dimensional shortest path queries. For a set of n axisparallel rectangles in the plane, or boxes in dspace, and a fixed target, it is possible with this structure to find a shortest rectilinear path avoiding all rectangles or boxes from
Rectilinear Paths among Rectilinear Obstacles
 Discrete Applied Mathematics
, 1996
"... Given a set of obstacles and two distinguished points in the plane the problem of finding a collision free path subject to a certain optimization function is a fundamental problem that arises in many fields, such as motion planning in robotics, wire routing in VLSI and logistics in operations resear ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
Given a set of obstacles and two distinguished points in the plane the problem of finding a collision free path subject to a certain optimization function is a fundamental problem that arises in many fields, such as motion planning in robotics, wire routing in VLSI and logistics in operations
On rectilinear duals for vertexweighted plane graphs
 In GD ’05: Proceedings of the Symposium on Graph Drawing
, 2005
"... Abstract. Let G =(V,E) be a plane triangulated graph where each vertex is assigned a positive weight. A rectilinear dual of G is a partition of a rectangle into V  simple rectilinear regions, one for each vertex, such that two regions are adjacent if and only if the corresponding vertices are conn ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Abstract. Let G =(V,E) be a plane triangulated graph where each vertex is assigned a positive weight. A rectilinear dual of G is a partition of a rectangle into V  simple rectilinear regions, one for each vertex, such that two regions are adjacent if and only if the corresponding vertices
Robust Linear Programming Discrimination Of Two Linearly Inseparable Sets
, 1992
"... INTRODUCTION We consider the two pointsets A and B in the ndimensional real space R n represented by the m \Theta n matrix A and the k \Theta n matrix B respectively. Our principal objective here is to formulate a single linear program with the following properties: (i) If the convex hulls of A ..."
Abstract

Cited by 239 (32 self)
 Add to MetaCart
INTRODUCTION We consider the two pointsets A and B in the ndimensional real space R n represented by the m \Theta n matrix A and the k \Theta n matrix B respectively. Our principal objective here is to formulate a single linear program with the following properties: (i) If the convex hulls
The kSteiner Ratio in the Rectilinear Plane
, 1998
"... A Steiner minimum tree Ž SMT. in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using additional vertices. A ksize Steiner minimum tree Ž kSMT. is one that can be split into components where all regular points are leaves and al ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A Steiner minimum tree Ž SMT. in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using additional vertices. A ksize Steiner minimum tree Ž kSMT. is one that can be split into components where all regular points are leaves
Results 1  10
of
6,575