@conference {12697,
	title = {View independent human body pose estimation from a single perspective image},
	booktitle = {Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on},
	volume = {2},
	year = {2004},
	month = {2004/07/02/june},
	pages = {II-16 - II-22 Vol.2 - II-16 - II-22 Vol.2},
	abstract = {Recovering the 3D coordinates of various joints of the human body from an image is a critical first step for several model-based human tracking and optical motion capture systems. Unlike previous approaches that have used a restrictive camera model or assumed a calibrated camera, our work deals with the general case of a perspective uncalibrated camera and is thus well suited for archived video. The input to the system is an image of the human body and correspondences of several body landmarks, while the output is the set of 3D coordinates of the landmarks in a body-centric coordinate system. Using ideas from 3D model based invariants, we set up a polynomial system of equations in the unknown head pitch, yaw and roll angles. If we are able to make the often-valid assumption that the torso twist is small, there are finite numbers of solutions to the head-orientation that can be computed readily. Once the head orientation is computed, the epipolar geometry of the camera is recovered, leading to solutions to the 3D joint positions. Results are presented on synthetic and real images.},
	keywords = {3D, analysis;, biomechanics;, body, body-centric, camera;, capture, coordinate, coordinates;, detection;, epipolar, equation, estimation;, geometry;, human, image, image;, images;, model-based, models;, MOTION, object, optical, perspective, physiological, polynomial, polynomials;, pose, real, single, synthetic, system;, systems;, torso, tracking;, twist;, uncalibrated},
	doi = {10.1109/CVPR.2004.1315139},
	author = {Parameswaran, V. and Chellapa, Rama}
}
@conference {15207,
	title = {Efficient minimum cost matching using quadrangle inequality},
	booktitle = {Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on},
	year = {1992},
	month = {1992/10//},
	pages = {583 - 592},
	abstract = {The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array},
	keywords = {algorithm;, array;, bipartite, bitonic, blue, complexity;, computational, cost, distance;, Euclidean, function;, geometry;, graph, graphs;, inequality;, linear, MATCHING, matching;, minimisation;, minimum, Monge, perfect, points;, polynomial, problem;, quadrangle, red, theory;, TIME, transportation, transportation;, weakly},
	doi = {10.1109/SFCS.1992.267793},
	author = {Aggarwal,A. and Bar-Noy,A. and Khuller, Samir and Kravets,D. and Schieber,B.}
}
