It makes sense to classify my interests into three
sections: Sets of Probabilities, Probabilistic Reasoning,
and Robotics. These titles reflect most of my past
and present interests.
Theory of sets of probabilities (credal sets)
First, I explore the
theory of sets of probabilities.
There is not a single, stable name for this theory: some people
use "theory of imprecise probabilities"; others say "theory of
credal sets", or "Quasi-Bayesian theory", or "theory of lower
expectations", or ... several other names. I believe this theory
is the right tool to model statistical uncertainty, and
will ultimately be the unifying foundation for
inference and decision-making. Some years ago I produced a
brief tutorial
on this theory; you can also look at web site of the
Society for
Imprecise Probability Theory and Applications.
I'm a founding member of this society, and currently the editor
of the society's newsletter; I also helped organized some
of the International Symposium for Imprecise Probabilities
and Their Applications (ISIPTA) and edited some of its
proceedings (see my
publications).
Credal networks
I'm interested in efficient algorithms
to obtain posterior quantities, with a particular
interest on multivariate models with graph-theoretic
representatins (in particular, the model called
"credal network"). A big part of the
work can be grasped through the papers:
- F. G. Cozman.
Graphical Models for Imprecise Probabilities,
Journal of International Journal of Approximate Reasoning,
39(2-3):167-184, 2005.
Preprint available.
- F. G. Cozman.
Credal networks, Artificial Intelligence Journal,
vol. 120, pp. 199-233, 2000.
Preprint available.
- F. G. Cozman.
Computing posterior upper expectations,
International Journal of Approximate Reasoning,
vol. 24, pp. 191-205, 2000.
Preprint available.
- F. G. Cozman.
Calculation of Posterior Bounds Given Convex Sets of
Prior Probability Measures and Likelihood Functions,
Journal of Computational and Graphical Statistics,
vol. 8(4), pp. 824-838, 1999.
Preprint available.
The following paper discusses credal networks
that can deal with some first-order constructs, much in the
way of probabilistic logic, and also presents several algorithms
for inference with credal networks:
- F. G. Cozman, C. P. de Campos, J. S. Ide, J. C. F. da Rocha.
Propositional and relational Bayesian networks associated
with imprecise and qualitative probabilistic assessments,
Conference on Uncertainty in Artificial Intelligence,
pp. 104-111, AUAI Press, 2004.
Preprint available.
The following paper also discusses
the problem of inference with credal networks:
- J. C. F. da Rocha, F. G. Cozman.
Inference in credal networks: Branch-and-bound
methods and the A/R+ algorithm,
International Journal of Approximate Reasoning,
39(2-3):279-296, 2005.
Preprint available.
Planning under risk and uncertainty
Another interesting piece is the work on planning, where
the idea is to merge "probabilistic" and "nondeterministic"
planning using the theory of sets of probabilities:
-
Felipe W. Trevizan, Fabio G. Cozman, Leliane N. de Barros.
Planning under Risk and Knightian Uncertainty,
International Joint Conference on Artificial Intelligence,
pp. 2023-2028, 2007.
Preprint available.
Here is an older effort, looking
at the problem of sequential-decision
making associated with observations:
- F. Cozman; E. Krotkov.
Quasi-Bayesian Strategies for Efficient Plan
Generation: Application to the Planning to Observe Problem,
Proc. Twelfth Conference Uncertainty in Artificial Intelligence,
pp. 186-193, 1996.
Preprint available.
Concepts of independence
I'm also interested in
concepts and properties of irrelevance/independence connected
to the theory of sets of probabilities. The following papers
contain a sample of basic issues in the topic:
-
F. G. Cozman, P. Walley.
Graphoid properties of epistemic irrelevance and
independence,
Annals of Mathematics and Artificial Intelligence,
45:173-195, 2005.
Preprint available.
- F. G. Cozman.
Computing lower expectations with
Kuznetsov's independence condition, Third International
Symposium on Imprecise Probabilities and Their
Applications, pp. 177-187, Carleton Scientific, 2003.
Preprint available.
- F. G. Cozman.
Separation
Properties of Sets of Probability Measures.
XVI Conference on Uncertainty in Artificial Intelligence,
pp. 107-115, San Francisco, California, July 2000.
Preprint available.
Statistical learning of sets of probabilities
A long time ago, I explored with Lonnie Chrisman
the possibility of learning
convex sets of probability from data; that old has been
picked up by Terry Fine and co-workers.
Probabilistic reasoning
I am quite interested in probabilistic models
for uncertainty modeling, particularly Bayesian networks.
Several activities in this track are generously funded
by HP Labs.
JavaBayes
I develop the
JavaBayes
system, a general purpose inference engine for graphical models;
the engine can generate posterior
probabilities and expectations for probabilistic models represented as
directed acyclic graphs. The system is distributed freely
(under the GNU license) in the spirit of fostering teaching and
research. JavaBayes
is now used in many university and research labs around the
world. A summary is:
- F. G. Cozman.
The JavaBayes system,
The ISBA Bulletin, vol. 7, n. 4, pp. 16-21, 2001
(invited publication without referreing process).
In the process of putting together JavaBayes, I have
developed a very general, yet easy to understand, inference
algorithm for Bayesian networks. The method is suited for
teaching due to its simplicity. You can get it:
Classification and learning
One of the most important situations where we make decisions
and use our beliefs and sensory information is when we
classify data. For example, based on measurements
we may classify a machine into one of several categories;
for example, "broken" or "functioning".
I have been looking at classification problems where we
must build ("learn") a classifier using observed data.
These data may be labeled or unlabeled;
that is, the data points themselves may be classified or not.
I am interested in methods that can learn good probabilistic
classifiers from mixtures of labeled and unlabeled data.
This problem is quite complex and displays several interesting
phenomena. Right now the focus of the research is on learning
classifiers that have Bayesian network structures.
A description of some characteristics of the labeled/unlabeled
data problem is
- I. Cohen, F. G. Cozman, N. Sebe, M. C. Cirelo, T. S. Huang.
Semisupervised learning of classifiers: Theory, algorithms,
and their application to human-computer interaction,
IEEE Transactions on Pattern Analysis and Machine Intelligence,
26(12):1553-1568, 2004.
Preprint
available.
-
F. G. Cozman, I. Cohen,
Risks of semi-supervised learning,
in Olivier Chapelle, Bernhard Scholkopf, Alexander Zien
(editors),
Semi-Supervised Learning, pp. 55-70, 2006.
Preprint available.
- F. G. Cozman, I. Cohen, M. C. Cirelo. Semi-supervised
learning of mixture models, International Conference
on Machine Learning, pp. 99-106, 2003.
Preprint available.
- I. Cohen, N. Sebe, F. G. Cozman, M. C. Cirelo, T. S. Huang.
Learning Bayesian network classifiers for facial expression
recognition using both labeled and unlabeled data, IEEE
Conference on Computer Vision and Pattern Recognition, 2003.
Preprint available.
This is joint work with
Ira Cohen,
at HP Labs Palo Alto. Other people at HP Labs
have contributed a lot, particularly Marsha Duro and Alex Bronstein.
Probabilistic reasoning in embedded systems
While
JavaBayes
is a complete system, with graphical interface, parsers, etc,
I've been investigating a system that is more geared towards
the needs of embedded systems. The
EBayes
project is an effort to produce a lightweight Bayesian network
engine that is appropriate to the growing market of embedded
devices. A complete algorithm
for probabilistic inference under time and space constraints
is presented in the following paper:
- F. T. Ramos, F. G. Cozman.
Anytime anyspace probabilistic inference,
International Journal of Approximate Reasoning,
38:53-80, 2005.
Preprint available.
Generating Bayesian networks randomly
Still on Bayesian networks, I have worked with Jaime
Shinsuke Ide on the problem of testing algorithms; we
have produced interesting methods for generating random
Bayesian networks:
- J. S. Ide, F. G. Cozman, F. T. Ramos.
Generating random Bayesian networks with constraints
on induced width,
European Conference on Artificial Intelligence (ECAI),
pp. 323-327, IOS Press, Amsterdan, 2004.
Preprint available.
- J. S. Ide, F. G. Cozman.
Random generation of Bayesian networks, Brazilian
Symposium on Artificial Intelligence (SBIA),
pp. 366-375, Porto de Galinhas, Pernambuco, Brazil, 2002.
Preprint available.
Applying Bayesian networks
Another interest of mine is the application of Bayesian
networks in practical problems. I was involved, between
2001 and 2003, in
a project with the University Hospital, where we try to
encode medical knowledge about cardiac problems in the form
of Bayesian networks.
Sensitivity analysis in Bayesian networks
Finally, I am interest in applying sensitivity analysis
techniques (from the realm of robust Statistics) to Bayesian
networks. I have been developing techniques that use the
theory of sets of probabilities as a tool for the assessment
of sensitivity in graphical statistical models:
- F. G. Cozman.
Sensitivity and Robustness Analysis of Bayesian Networks,
IV Simpósio Brasileiro de Automação Industrial,
pp. 251-255, São Paulo, São Paulo, Brazil, September, 1999.
- M. J. Perazzo, F. G. Cozman.
Derivadas em Redes Bayesianas usando Eliminação de Variáveis,
Congresso Brasileiro de Automática, 6p., Gramado, Rio Grande
do Sul, Brasil, 2004. [Portuguese]
Preprint available.
Robotics: Teleoperation, mobile robots, automated orthosis...
Third, I was involved for a long time, in one way or another,
with robotic devices, mostly with mobile robots.
During 2000-2002, I participated in an effort to develop devices
that can help the disabled walk with less effort and
discomfort. The project started from interactions with
doctors and engineers at the
Associação
de Assistência a Criança Defeituosa and is
supported by FAPESP.
A student involved with this project, Marco Ackermann,
received the prize of Best Master Thesis in Mechanical Engineering
in Brazil 2003, granted by the Brazilian Association for the
Mechanical Sciences (ABCM), for this work.
My involvement with robotics started quite a while ago.
Right after my undergraduate course,
I took a Master of Engineering
in Brazil, and worked in the first Brazilian mobile robot, called Ariel.
We produced a complete system, from the mechanical structure to the
planning software; the result was very impressive and we ended up
showing it off in the Jornal da Globo (Brazil's second most important
TV news source at the time). Unfortunately, that material is not online.
Here are two significant papers, perhaps of historic value:
- F. G. Cozman; P. E. Miyagi. Trajectory Controller for a Mobile
Robot using Optimal Control, XI Congresso Brasileiro de Engenharia
Mecânica, 3:537-540, São Paulo, SP Brasil, 1991.
- J. C. Adamowski; M. G. Simões; F. G. Cozman. Desenvolvimento
de um Robô Móvel, VIII
Congresso Brasileiro de Automática,
Belém, 1990; selected for IV Congreso Latinoamericano de
Control Automatico, Puebla Mexico, 1990; also presented at
IV Congresso Nacional de
Automação
Industrial, pp. 209-212, São Paulo, SP Brasil, 1990.
I worked, for two years, in the Lunar Rover project
during my PhD years at Carnegie Mellon.
My main contribution to the Lunar Rover project was the
Viper
system, a piece of technology
that was used in the Atacama
mission. The Viper system,
estimates position from a stream of images, by matching images
to a previously constructed map of the environment.
The estimator builds an occupancy map for the position
of the robot; the catch is that the occupancy maps actually represents
a full density ratio familiy of distributions which generate both
the estimates and the confidence on the estimates.
The system is described at
- F. G. Cozman, E. Krotkov, C. E. Guestrin.
Outdoor Visual Position Estimation for Planetary Rovers,
Autonomous Robots, vol. 9, pp. 135-150, 2000.
There is also a description of an old version of the
Viper system at
- F. Cozman; E. Krotkov.
Automatic
Mountain Detection
and Pose Estimation for Teleoperation of Lunar Rovers,
Proc. of the International Conference on Robotics
and Automation, pp. 2452-2457, Albuquerque, New Mexico, 1997.
Also published in
Experimental Robotics V,
Lecture Notes in Control and Information Sciences 232,
pp. 207-215,
Alicia Casals e Anibal T. de Almeida (eds.),
Barcelona, Spain, June (15-18) 1997.
The vision algorithms developed for the Viper system
reported in the following papers.
- C. Guestrin; F. G. Cozman; E. Krotkov.
Fast Software Image Stabilization with Color Registration,
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS),
pp. 19-24, Victoria, Canada, October, 1998.
- C. Guestrin; F. G. Cozman; M. G. Simões.
Industrial Applications of Image Mosaicing and Stabilization,
Second International Conference on Knowledge-based Intelligent
Electronic Systems, pp. 174-183, Adelaide, Australia, April 1998.
During a few years at CMU I worked with the
Ratler
robot. We actually had it rolling for some fifty
kilometers in our outdoor tests; you can take a look
at the following paper.
- R. Simmons; E. Krotkov; L. Chrisman; F. Cozman; R. Goodwin;
M. Hebert; L. Katragadda; S. Koenig; G. Krishnaswamy; Y. Shinoda; W.
Whittaker; and P. Klarer.
Experience with Rover Navigation for Lunar-Like Terrains,
Proceedings of the Conference on Intelligent Robots
and Systems (IROS), pages 441-446, 1995.
I also worked on a few other problems.
Some years
ago I produced a line
linker based on the Akaike Information Criterion (AIC),
which was distributed in the net.
Another aspect of my work was the investigation of
celestial data as a source
of position estimates for mobile robots:
- F. Cozman; E. Krotkov. Robot
Localization using a Computer Vision Sextant,
International Conference on Robotics and Automation, pages 106-111,
Nagoya, Japan, May 1995.
And finally, another twist
in this work was the study of atmospheric scattering as a
clue for depth in outdoor environments; as far as I know, the first
study of scattering in the context of image understanding.
- F. Cozman; E. Krotkov. Depth from
Scattering,
Proceedings of the IEEE Conference on Computer Vision
and Pattern Recognition, Puerto Rico, June, 1997.
I was interested for some time in the problem of calculating
bounds for dynamical systems; there is a huge literature
in this area. I have published some work on the specific
topic of manipulating
ellipsoidal models of error in Robotics:
- F. Cozman; E. Krotkov. Truncated
Gaussians as Tolerance Sets,
Fifth Workshop on Artificial Intelligence and Statistics, Fort Lauderdale
Florida, 1995.
fgcozman@usp.br