2825 search results - page 354 / 565 » Robust Feature Selection Algorithms |
120
click to vote
TFS
2008
15 years 23 days ago
2008
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
114
click to vote
SMILE
2000
Springer
15 years 5 months ago
2000
Springer
Brute-forcedensematchingisusuallynotsatisfactorybecausethesame search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progr...
ICIP
2002
IEEE
16 years 3 months ago
2002
IEEE
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...
117
Voted
ICIAP
2007
ACM
16 years 2 months ago
2007
ACM
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
110
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we present a new algorithm of snakes with geometric prior. A method of shape alignment using Fourier coefficients is introduced to estimate the Euclidean transform...