Imperial College London

Professor Anil Anthony Bharath

Faculty of EngineeringDepartment of Bioengineering

Academic Director (Singapore)
 
 
 
//

Contact

 

+44 (0)20 7594 5463a.bharath Website

 
 
//

Location

 

4.12Royal School of MinesSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Engin:2009:10.1109/ICASSP.2009.4960237,
author = {Engin, Z and Ng, J and Barahona, M and Bharath, AA},
doi = {10.1109/ICASSP.2009.4960237},
pages = {2929--2932--2929--2932},
title = {An analysis of the Map Seeking Circuit and Monte Carlo extensions},
url = {http://dx.doi.org/10.1109/ICASSP.2009.4960237},
year = {2009}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - The Map Seeking Circuit (MSC) has been suggested to address the inverse problem of transformation discovery as found in signal processing, vision, inverse kinematics and many other natural tasks. According to this idea, a parallel search in the transformation space of a high dimensional problem can be decomposed into parts efficiently using the ordering property of superpositions. Deterministic formulations of the circuit have been suggested. Here, we provide a probabilistic interpretation of the architecture whereby the superpositions of the circuit are seen as a series of marginalisations over parameters of the transform. Based on this, we interpret the weights of the MSC as importance weights. The latter suggests the incorporation of Monte-Carlo approaches in the MSC, providing improved resolution of parameter estimates within resource constrained implementations. As a final contribution, we model mixed serial/parallel search strategies of biological vision to reduce the problem of collusions, a common problem in the standard MSC approach.
AU - Engin,Z
AU - Ng,J
AU - Barahona,M
AU - Bharath,AA
DO - 10.1109/ICASSP.2009.4960237
EP - 2932
PY - 2009///
SN - 1520-6149
SP - 2929
TI - An analysis of the Map Seeking Circuit and Monte Carlo extensions
UR - http://dx.doi.org/10.1109/ICASSP.2009.4960237
ER -