Sciweavers

5 search results - page 1 / 1
» A Gradient Descent Procedure for Variational Dynamic Surface...
Sort
View
VLSM
2005
Springer
13 years 10 months ago
A Gradient Descent Procedure for Variational Dynamic Surface Problems with Constraints
Abstract. Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and...
Jan Erik Solem, Niels Chr. Overgaard
IJCNN
2006
IEEE
13 years 10 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer
TSMC
1998
82views more  TSMC 1998»
13 years 4 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 7 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
IWCM
2004
Springer
13 years 10 months ago
Bayesian Approaches to Motion-Based Image and Video Segmentation
We present a variational approach for segmenting the image plane into regions of piecewise parametric motion given two or more frames from an image sequence. Our model is based on ...
Daniel Cremers