843 search results - page 73 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
178
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we describe a minimal mean square error (MMSE) optimal interpolation filter for discrete random signals. We explicitly derive the interpolation filter for a firs...
110
click to vote
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
132
click to vote
NIPS
2008
15 years 2 months ago
2008
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
119
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
140
Voted
ICPR
2006
IEEE
15 years 7 months ago
2006
IEEE
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...