Sciweavers

104 search results - page 6 / 21
» Solving constrained multi-objective problems by objective sp...
Sort
View
CVIU
2007
128views more  CVIU 2007»
13 years 7 months ago
Iterative relative fuzzy connectedness for multiple objects with multiple seeds
In this paper we present a new theory and an algorithm for image segmentation based on a strength of connectedness between every pair of image elements. The object definition use...
Krzysztof Ciesielski, Jayaram K. Udupa, Punam K. S...
AAAI
1994
13 years 9 months ago
Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
Brian C. Williams, Jonathan Cagan
ICIAR
2004
Springer
14 years 1 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 8 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
MOC
2002
144views more  MOC 2002»
13 years 7 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng