Sciweavers

263 search results - page 16 / 53
» Combinatorial Shape Decomposition
Sort
View
ICIP
2000
IEEE
16 years 5 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
JCT
2010
92views more  JCT 2010»
15 years 2 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
JMM2
2008
127views more  JMM2 2008»
15 years 4 months ago
Texture Segmentation Methods Based on Combinatorial of Morphological and Statistical Operations
In this paper we introduce a novel and simple image segmentation schemes that are based on combinations of morphological and statistical operations. Mathematical morphology is very...
Vakulabharanam Vijaya Kumar, B. Eswara Reddy, A. N...
EVOW
2009
Springer
15 years 1 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
CVPR
2008
IEEE
16 years 6 months ago
Matching non-rigidly deformable shapes across images: A globally optimal solution
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
Thomas Schoenemann, Daniel Cremers