Sciweavers

438 search results - page 29 / 88
» Shape from shading using graph cuts
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
ECCV
2010
Springer
13 years 4 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
CAE
2007
13 years 9 months ago
Celtic Knots Colorization based on Color Harmony Principles
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
Caroline Larboulette
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
MVA
2000
165views Computer Vision» more  MVA 2000»
13 years 8 months ago
Bayesian Shot Detection Using Structural Weighting
A video stream consists of a number of shots each of which has different boundary types such as cut, fade, and dissolve. Many previous approaches can find the cut boundary without...
Seung-Hoon Han, In-So Kweon, Chang-Yeong Kim, Yang...