Solving Minimal Problems in Computer Vision

Tomas Pajdla (Czech Technical University in Prague)

DATE: 2009-09-10
TIME: 16:00:00 - 17:00:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU

ABSTRACT:
Minimal problems in computer vision play an important role in computing structure and camera trajectory from image matches. The core of the problem lies in solving systems of polynomial equations. We will give an overview of the state of the art in minimal problem solving and explain the underlying techniques for solving algebraic equations by classical as well as alternative approaches.

BIO:
Tomas Pajdla is an assistant professor at the Czech Technical University Prague. He works in geometry and algebra of computer vision, eye-hand calibration, precise digital optical measurements, photogrammetry, robot navigation using vision, image matching and object recognition. He co-authored works that introduced epipolar geometry of panoramic and non-central cameras, investigated the use of omnidirectional images in structure from motion and camera pose computation, contributed to studies of panoramic mosaics, contributed to solving the image matching and stereo correspondence problem, and to algebraic techniques in computer vision applied to solving minimal problems. He published more than 50 works in scientific journals and refereed conferences and was awarded prizes at OAGM 1998, BMVC 2002 and ICCV camera localization contest in 2005. T. Pajdla served as a Program Chair of the 8th European Conference on Computer Vision 2004 in Prague and is a member of the ECCV Board. He acted as an area chair of ICCV 2005, 2009, CVPR 2006, 2007 ACCV 2006, 2007, and BMVC 2005-2008 and was a coeditor of a special issue of the International Journal on Computer Vision. T. Pajdla received the Outstanding Reviewer Award at the CVPR 2009.

	Skip Navigation CECS Home \| ANU Home \| Search ANU \| HORUS \| Staff Home
	Seminars @ CECS ANU College of Engineering and Computer Science