Sciweavers

155 search results - page 10 / 31
» The Problem with Noise and Small Disjuncts
Sort
View
98
Voted
CVPR
2010
IEEE
14 years 12 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
CVPR
1996
IEEE
16 years 1 months ago
Combining greyvalue invariants with local constraints for object recognition
This paper addresses the problem of recognizing objects in large image databases. The method is based on local characteristics which are invariant to simzlarity transformations in...
Cordelia Schmid, Roger Mohr
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
15 years 5 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
SIGPRO
2010
135views more  SIGPRO 2010»
14 years 10 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 2 days ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea