Sciweavers

315 search results - page 33 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Object Segmentation Using Graph Cuts Based Active Contours
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
Ning Xu, Ravi Bansal, Narendra Ahuja
ICIP
2000
IEEE
14 years 9 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
CASES
2003
ACM
14 years 20 days ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
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
ICIAP
2005
ACM
14 years 7 months ago
Greedy Algorithm for Local Contrast Enhancement of Images
Abstract. We present a technique that achieves local contrast enhancement by representing it as an optimization problem. For this, we first introduce a scalar objective function th...
Kartic Subr, Aditi Majumder, Sandy Irani