Result: Receptive fields within the combinatorial pyramid framework

Title:
Receptive fields within the combinatorial pyramid framework
Source:
DGCI 2002 : Discrete geometry for computer imagery (Bordeaux, 3-5 April 2002)Lecture notes in computer science. :92-101
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratoire d'Études et de Recherche en Informatique (EA 2618), Université de Reims, France
Institute for Computer-aided Automation, Pattern Recognition and Image Processing Group, Vienna Univ. of Technology, Austria
ISSN:
0302-9743
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14053006
Database:
PASCAL Archive

Further Information

A hierarchical structure is a stack of successively reduced image representations. Each basic element of a hierarchical structure is the father of a set of elements in the level below. The transitive closure of this father-child relationship associates to each element of the hierarchy a set of basic elements in the base level image representation. Such a set, called a receptive field, defines the embedding of one element of the hierarchy on the original image. Using the father-child relationship, global properties of a receptive field may be computed in O(log(m)) parallel processing steps where m is the diameter of the receptive field. Combinatorial pyramids are defined as a stack of successively reduced combinatorial maps, each combinatorial map being defined by two permutations acting on a set of half edges named darts. The basic element of a combinatorial pyramid is thus the dart. This paper defines the receptive field of each dart within a combinatorial pyramid and study the main properties of these sets.