### Minimization procedure

We now describe the minimization process, making explicit use of the same notation adopted in FSLY99.

Given the model profiles (the selected model profiles if the threshold
**t _{f}** has been used) of each object

**P**the minimization procedure is necessary to obtain the scaling factors

_{i}(m,n)**F**of each object that best reproduce the measure image

_{i}**I**. The best fit solution will be found by minimizing the

**χ**, that reads:

^{2}where

is the sum of all profiles, **B _{i}**
is the background (in the measure image) of each objects,

**σ(m,n)**is the r.m.s. of the measure image and m and n run over the pixels.

The best-fit solution is found by solving the linear system:

whose Hessian matrix is

and right-hand term is:

Since the model profiles are non-zero only within the area provided
by the (dilated) segmentation map, most of the terms are
**A _{i}_{j}**
actually null (non-null terms will correspond to overlapping
objects), such that the matrix

*A*is very sparse. The solution of sparse linear systems can be very efficiently performed with the linear biconjugate gradient method (Press et al. 1992), such that the solution can be obtained even for a large number of free parameters (that is, of detected objects) that typically occurr in deep HST exposures.

Finally, the statistical uncertainties on the fitted parameters
**F _{i}**
are the diagonal terms of the inverse of the Hessian matrix

**A**.

_{i}_{j}