Lines Matching full:blocks
251 the way the parameter blocks interact that it is beneficial to modify
493 respectively. Further, let the camera blocks be of size :math:`c` and
494 the point blocks be of size :math:`s` (for most problems :math:`c` =
500 no term :math:`f_{i}` that includes two or more point blocks. This in
507 with :math:`p` blocks of size :math:`c\times c` and :math:`C \in
508 \mathbb{R}^{qs\times qs}` is a block diagonal matrix with :math:`q` blocks
522 a block diagonal matrix, with small diagonal blocks of size
524 inverting each of these blocks is cheap. This allows us to eliminate
539 symmetric positive definite matrix, with blocks of size :math:`c\times
724 blocks. Each parameter block belongs to exactly one group, and each
728 Given such an ordering, Ceres ensures that the parameter blocks in the
730 parameter blocks in the next lowest numbered elimination group and so
732 parameter blocks as it chooses. e.g. Consider the linear system
760 blocks in in the first elimination group should co-occur in the same
765 parameter blocks.
1192 desired order in which parameter blocks should be eliminated by the
1290 1. Let the solver heuristically decide which parameter blocks to
1297 independent set. Not all parameter blocks need to be included in
1450 specified in this vector. By default, parameter blocks are updated
1454 wishes to have access to the update parameter blocks when his/her
1464 Normally the parameter blocks are only updated when the solver
1649 blocks (unless ``Solver::Options::update_state_every_iteration`` is
1784 // The part of the total cost that comes from residual blocks that
1786 // blocks that they depend on were fixed.
1939 blocks. The computation assumes that the cost functions compute
1963 blocks that are constant. This class correctly handles structural rank
2162 Even though the residual blocks in the problem may contain loss
2180 matrix block-wise using pairs of parameter blocks. This allows the
2182 blocks.
