Sciweavers

3422 search results - page 107 / 685
» Random Subset Optimization
Sort
View
191
Voted
CVPR
2012
IEEE
13 years 5 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
86
Voted
ICIP
2006
IEEE
15 years 8 months ago
Discontinuity-Adaptive De-Interlacing Scheme Using Markov Random Field Model
— In this paper, a de-interlacing algorithm to find the optimal deinterlaced results given accuracy-limited motion information is proposed. The de-interlacing process is formula...
Min Li, Truong Q. Nguyen
131
Voted
ACSC
2005
IEEE
15 years 8 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito
116
Voted
ISIPTA
2003
IEEE
140views Mathematics» more  ISIPTA 2003»
15 years 8 months ago
A Second-Order Uncertainty Model of Independent Random Variables: An Example of the Stress-Strength Reliability
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
Lev V. Utkin
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 7 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito