We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
The modeling of volumetric objects is still a difficult problem. Solid texture synthesis methods enable the design of volumes with homogeneous textures, but global features such a...
Kenshi Takayama, Olga Sorkine, Andrew Nealen, Take...
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
Michael Bleyer (Vienna University of Technology), ...
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...