Chojnacki, W.van den Hengel, A.Brooks, M.J.Braz, J.Ranchordas, A.Araujo, H.Jorge, J.2018-11-132018-11-132007Communications in Computer and Information Science, 2007 / Braz, J., Ranchordas, A., Araujo, H., Jorge, J. (ed./s), vol.4 CCIS, pp.217-22897835407527211865-09291865-0937http://hdl.handle.net/2440/115997Generalised Principal Component Analysis (GPCA) is a recently devised technique for fitting a multi-component, piecewise-linear structure to data that has found strong utility in computer vision. Unlike other methods which intertwine the processes of estimating structure components and segmenting data points into clusters associated with putative components, GPCA estimates a multi-component structure with no recourse to data clustering. The standard GPCA algorithm searches for an estimate by minimising a simple algebraic misfit function. The underlying constraints on the model parameters are ignored. Here we promote a variant of GPCA that incorporates the parameter constraints and exploits constrained rather than unconstrained minimisation of a statistically motivated error function. The output of any GPCA algorithm hardly ever perfectly satisfies the parameter constraints. Our new version of GPCA greatly facilitates the final correction of the algorithm output to satisfy perfectly the constraints, making this step less prone to error in the presence of noise. The method is applied to the example problem of fitting a pair of lines to noisy image points, but has potential for use in more general multi-component structure fitting in computer vision.en© Springer-Verlag Berlin Heidelberg 2007Generalised principal component analysis; constrained minimisation; multi-line fitting; degenerate conicConference paper003002444410.1007/978-3-540-75274-5_140002526033000142-s2.0-8490488689880910Chojnacki, W. [0000-0001-7782-1956]van den Hengel, A. [0000-0003-3027-8364]Brooks, M.J. [0000-0001-9612-5884]