Sciweavers

2210 search results - page 125 / 442
» Information complexity of neural networks
Sort
View
IJCAI
2001
15 years 7 months ago
Learning Iterative Image Reconstruction
Successful image reconstruction requires the recognition of a scene and the generation of a clean image of that scene. We propose to use recurrent neural networks for both analysi...
Sven Behnke
ICANN
2007
Springer
16 years 18 days ago
A Topology-Independent Similarity Measure for High-Dimensional Feature Spaces
In the field of computer vision feature matching in high dimensional feature spaces is a commonly used technique for object recognition. One major problem is to find an adequate s...
Jochen Kerdels, Gabriele Peters
ISNN
2004
Springer
15 years 11 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
GIS
2009
ACM
15 years 10 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
ICANN
1997
Springer
15 years 10 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer