IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339)
DOI: 10.1109/ijcnn.1999.831553
|View full text |Cite
|
Sign up to set email alerts
|

An instantaneous topological mapping model for correlated stimuli

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
55
0
2

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 65 publications
(57 citation statements)
references
References 6 publications
0
55
0
2
Order By: Relevance
“…In the proposed approach, the system incrementally learns (following the observation of the location of the vehicle at each time step) a topological map via the Instantaneous Topological Map (ITM) algorithm [23]. In this algorithm, for each observed location, nearest nodes and edges are updated, including centroid adaptation for the closest node, as well as edge and node addition/deletion.…”
Section: A Related Workmentioning
confidence: 99%
“…In the proposed approach, the system incrementally learns (following the observation of the location of the vehicle at each time step) a topological map via the Instantaneous Topological Map (ITM) algorithm [23]. In this algorithm, for each observed location, nearest nodes and edges are updated, including centroid adaptation for the closest node, as well as edge and node addition/deletion.…”
Section: A Related Workmentioning
confidence: 99%
“…Therefore, structure learning consists basically in estimating the best space discretization from data and identifying neighboring regions. We have addressed this problem by building a topological map of the environment using the Instantaneous Topological Map (ITM) algorithm [4]. For parameter learning, we basically have adapted the approach proposed by Neal and Hinton [8] in order to deal with variable state cardinality and continuous observations.…”
Section: Growing Hidden Markov Modelsmentioning
confidence: 99%
“…(1) 4 Since space is limited, we have opted for providing a general overview which omits some specific information on optimizations and data structures. The interested reader is referred to [11] for more details.…”
Section: Probabilistic Modelmentioning
confidence: 99%
“…Contrary to pure color segmentation schemes, we allow for combinations of all kinds of topographic feature maps like edge maps, intensity, difference images, velocity fields, disparity, image position, or different color spaces for forming a combined feature space. In this paper, for the sake of computational efficiency we apply a straightforward vector quantization method to partition this feature space, though more advanced schemes like growing networks as the growing neural gas (29) or the instantaneous topological map (30) can also be used. The vector quantization generates a codebook and respective best-match segments for each codebook vector, which define an over-segmentation of the object and the surround.…”
Section: Introductionmentioning
confidence: 99%