843 search results - page 167 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
EGH
2010
Springer
13 years 4 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
COMGEO
1999
ACM
13 years 6 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
EUROGRAPHICS
2010
Eurographics
14 years 1 months ago
2010
Eurographics
We present a novel representation and rendering method for free-viewpoint video of human characters based on multiple input video streams. The basic idea is to approximate the art...
TIP
2008
13 years 6 months ago
2008
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
ISBI
2004
IEEE
14 years 7 months ago
2004
IEEE
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...