21 search results - page 4 / 5 » Optimizing energy to minimize errors in dataflow graphs usin... |
IJCNN
2007
IEEE
13 years 12 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
SIAMSC
2010
13 years 3 months ago
2010
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 5 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...