Sciweavers

3020 search results - page 475 / 604
» Optimal partition trees
Sort
View
ICIP
2009
IEEE
15 years 4 months ago
Graph-based foreground extraction in extended color space
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
Hansung Kim, Adrian Hilton
IJRR
2010
132views more  IJRR 2010»
15 years 3 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
CVPR
2011
IEEE
15 years 1 months ago
Mining Discriminative Co-occurrence Patterns for Visual Recognition
The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action rec...
Junsong Yuan, Ming Yang, Ying Wu
CORR
2011
Springer
183views Education» more  CORR 2011»
15 years 1 months ago
Pattern tree-based XOLAP rollup operator for XML complex hierarchies
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
Marouane Hachicha, Jérôme Darmont
CORR
2011
Springer
184views Education» more  CORR 2011»
15 years 1 months ago
Acyclic and Star Colorings of Cographs
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
Andrew Lyons