Sciweavers

3641 search results - page 121 / 729
» On Computability of Pattern Recognition Problems
Sort
View
GBRPR
2005
Springer
15 years 8 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
GECCO
2010
Springer
200views Optimization» more  GECCO 2010»
15 years 8 months ago
Multivariate multi-model approach for globally multimodal problems
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
Chung-Yao Chuang, Wen-Lian Hsu
CIVR
2010
Springer
235views Image Analysis» more  CIVR 2010»
15 years 1 months ago
Dynamic textures for human movement recognition
Human motion can be seen as a type of texture pattern. In this paper, we adopt the ideas of spatiotemporal analysis and the use of local features for motion description. movements...
Vili Kellokumpu, Guoying Zhao, Matti Pietikäi...
FSTTCS
1993
Springer
15 years 7 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
105
Voted
ICIP
2005
IEEE
16 years 4 months ago
Comparative study: face recognition on unspecific persons using linear subspace methods
Recently many Automatic Face Recognition (AFR) systems were developed for applications with unspecific persons, which is different from conventional pattern recognition problems wh...
Dahua Lin, Shuicheng Yan, Xiaoou Tang