1190 search results - page 183 / 238 » Complex Salient Regions for Computer Vision Problems |
133
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
134
click to vote
PAMI
2007
15 years 2 months ago
2007
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...
132
click to vote
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
201
click to vote
GIS
2004
ACM
16 years 4 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
160
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
When estimating foreground and background layers (or equivalently an alpha matte), it is often the case that pixel measurements contain mixed colours which are a combination of for...