Manfred's Page

I am studying to get a Ph.D. In Computer Science at Washington University in St. Louis. My area is Computer Vision. I am currently working with CT scans of human lungs, to construct a model of how parts of the lung move during the breathing cycle.

Classes:

Summer 2007: CSE 573S

Resume (pdf letter, pdf a4)

Publications: (bibtex)

Manfred Georg, Richard Souvenir, Andrew Hope, and Robert Pless,
Manifold Learning for 4D CT Reconstruction of the Lung,
To appear in IEEE Computer Society Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA) at Computer Vision and Pattern Recognition (CVPR), June 2008.

Manfred Georg, Richard Souvenir, Andrew Hope, and Robert Pless,
Simultaneous Data Volume Reconstruction and Pose Estimation from Slice Samples,
To appear In Computer Vision and Pattern Recognition (CVPR), June 2008.

Sergey Gorinsky, Manfred Georg, Maxim Podlesny, and Christoph Jechlitschek,
A Theory of Load Adjustments and its Implications for Congestion Control,
Journal of Internet Engineering, 1(2), pp. 82-93, October 2007

Manfred Georg, Christoph Jechlitschek, and Sergey Gorinsky,
Improving Individual Flow Performance with Multiple Queue Fair Queuing,
International Workshop on Quality of Service, June 22, 2007. (Longer Technical Report)

Andrew J Hope, Manfred Georg, Jonathon J Cannon, J Hubenschmidt, Wei Lu, Daniel A Low, and Robert B Pless,
Applications of Manifold Learning Techniques in 4D-CT reconstruction,
International Conference on the use of Computers in Radiation Therapy, June 4, 2007. (Reviewer's Choice)

Manfred Georg, Jonathon J Cannon, Andrew J Hope, Wei Lu, Daniel A Low, and Robert B Pless,
Automating 4D CT Reconstruction Using Manifold Learning,
American Radium Society Annual Meeting, May 8, 2007.

C. Stringfellow, C.D. Amory, D. Potnurri, M. Georg, and A. Andrews,
Comparison of Software Architecture Reverse Engineering Methods,
Journal of Information and Software Technology, 48(7), July 2006, pp. 484-497.

Manfred Georg and Sergey Gorinsky.
Protecting TFRC from a Selfish Receiver.
In Proceedings of the IEEE International Conference on Networking and Services, October 2005.

C. Stringfellow, C.D. Amory, D. Potnurri, M. Georg, and A. Andrews.
Deriving Change Architectures from RCS History.
In Proceedings of the IASTED International Conference on Software Engineering and Applications, November 2004.

Horst Hahn and Manfred Georg.
"Fractal Aspects of Global and Local Optimization Shemes in Constrained Construction of Three-Dimensional Vascular Systems."
In Proceedings of the Fractals in Biology and Medicine Conference, March 2003.

Talks:

"Constructing Vascular Systems from Optimality Criteria"
To be presented May 11, 2008 at SIAM Conference on Optimization, Minisymposium: Optimization in Biomedical Applications - Part II of II

Technical Program Committee Membership

SOAS (International Conference on Self-Organization and Autonomic Systems in Computing and Communications) 2007, 2006

ICABS (International Conference on Adaptive Business Systems) 2007,

ICAS (International Conference on Autonomic and Autonomous Systems) 2008, 2007, 2006

ICNS (International Conference on Networking and Services) 2008, 2007, 2006

programs I've written (all under GPL):

eet: run a terminal application with which you can interact normally and send input to it as if you had typed it directly at the same time. This is the reverse of tee (and hence the name). This is also a good sample program which uses fork, signal, tcsetattr, setsid, ioctl, ptsname_r, and select.

txtdiff: I was looking for a good diffing utility that can deal with moved text (not just deleted). And that has some ability to parse written text (not line based). I unfortunatly was not successful, so I set out to create such a utility. This is the result. Currently it just outputs two color coded sequences of text (as webpages output0.html and output1.html). However, I want to create a GUI around this program which would act much like meld which in my opinion is currently the best program out there for merging text. This program is basically a hierarchical alignment problem. It parses sentences by looking for periods and blank lines. It completely ignores whitespace except as token and block separators.

unfold: This is a game where the object is to "unfold" the graph so that no edges intersect (it is a planar graph). This was the result of seeing the flash game unfolding with the same objective, and deciding something had been coded badly (since it took a substantial amount of time to check that the level was solved. I had a couple days and decided I wanted to learn to program in GTK. This program is still missing levels, it still contains nodes with only one edge, and there is no ability to change the difficulty (number of nodes, number of edges on any node). Additionally, it hasn't been optimized, and has problems on old hardware at large screen sizes, and at high node numbers (since I used some pretty bad algorithms for collision detection).

Some really old Java applets I wrote.

Quick hacks that make things work:

typesetting a tilda in latex: You'd think that it wouldn't be difficult to get a tilda to appear at the same level as the text in latex, but it's deceptively hard. Or rather, no one else seems to tell you to use \kern and \lower.

Other random interests:

Juggling (contact juggling, poi),
Zen Meditation,
Amtgard (or "hitting people with foam sticks"). I play in the Northern Holdfast of the Iron Mountains when I'm around.

Additional web presence:

photo gallery
facebook
LiveJournal

Links:

Useful academic links.
The CSE Chess Tournament, 2007.
customer service hall of shame

Contact Information:

e-mail: mgeorg (at) cse.wustl.edu

My address is:
Manfred Georg
710 Eastgate Apt 1-S
St. Louis, MO 63130

My office is Lopata 522

My Departmental address is
Manfred Georg
Department of Computer Science and Engineering
Campus Box 1045
Washington University in St. Louis
One Brookings Drive
St. Louis, MO 63130
USA

If you want to send me a secret PGP message or let me ssh into an account, you can use these keys.

Page probably last Modified 2008-01-11.