Sciweavers

455 search results - page 7 / 91
» On Trees and Noncrossing Partitions
Sort
View
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
14 years 4 days ago
Visual Segment Tree Creation for MPEG-7 Description Schemes
This paper deals with the creation of visual segment trees involved in MPEG-7 Description Schemes. After a brief overview of MPEG7 description schemes in general and of the Segmen...
Philippe Salembier, Joan Llach, Luis Garrido
ICIP
2008
IEEE
14 years 2 months ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...
DAM
2007
81views more  DAM 2007»
13 years 7 months ago
Graphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
GD
2004
Springer
14 years 1 months ago
Partitions of Complete Geometric Graphs into Plane Trees
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Cam...
ICIP
1999
IEEE
14 years 9 months ago
Representing and Retrieving Regions Using Binary Partition Trees
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees c...
Luis Garrido, Philippe Salembier, Josep R. Casas