Sciweavers

2969 search results - page 67 / 594
» A space efficient algorithm for group structure computation
Sort
View
TIP
2008
302views more  TIP 2008»
15 years 3 months ago
Adaptive Pseudo Dilation for Gestalt Edge Grouping and Contour Detection
We consider the problem of detecting object contours in natural images. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Th...
Giuseppe Papari, Nicolai Petkov
CVPR
2003
IEEE
16 years 5 months ago
Practical Non-parametric Density Estimation on a Transformation Group for Vision
It is now common practice in machine vision to define the variability in an object's appearance in a factored manner, as a combination of shape and texture transformations. I...
Erik G. Miller, Christophe Chefd'Hotel
ANOR
2010
112views more  ANOR 2010»
15 years 3 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
DAWAK
2009
Springer
15 years 7 months ago
Skyline View: Efficient Distributed Subspace Skyline Computation
Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome ...
Jinhan Kim, Jongwuk Lee, Seung-won Hwang
ICASSP
2008
IEEE
15 years 9 months ago
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
George N. Karystinos, Athanasios P. Liavas