HomeSort by relevance Sort by last modified time
    Searched full:e_blocks (Results 1 - 10 of 10) sorted by null

  /external/ceres-solver/internal/ceres/
detect_structure.h 40 // e_blocks, we are interested in detecting if the size of the row
41 // blocks, e_blocks and the f_blocks remain constant. If they do, then
51 // For more details about e_blocks and f_blocks, see
visibility.h 53 // e_blocks "visible" to each f_block. If an e_block co-occurs with an
55 // first num_eliminate_blocks columns blocks are e_blocks and the rest
58 // In a structure from motion problem, e_blocks correspond to 3D
72 // matrix/Schur complement matrix obtained by eliminating the e_blocks
schur_eliminator_impl.h 258 // Compute the outer product of the e_blocks with themselves (ete
259 // = E'E). Compute the product of the e_blocks with the
296 // For rows with no e_blocks, the schur complement update reduces to
550 // For rows with no e_blocks, the schur complement update reduces to S
579 // A row r of A, which has no e_blocks gets added to the Schur
586 // e_blocks. This is becase rows without e_blocks are rare and
589 // rows with e_blocks. Including them in the static structure
591 // dynamic. Since the number of rows without e_blocks is small, the
visibility.cc 81 // Compute the number of e_blocks/point blocks. Since the visibility
82 // set for each e_block/camera contains the set of e_blocks/points
parameter_block_ordering.h 49 // the independent set or the number of e_blocks (see
detect_structure.cc 53 // not contain e_blocks.
visibility_based_preconditioner.cc 165 // edges are the number of 3D points/e_blocks visible in both the
186 // e_blocks/3D points in the scene that are seen by it.
257 // matrix is assumed to be sorted in order of the e_blocks/point
308 // The remaining rows which do not contain any e_blocks.
solver_impl.cc 626 const set<double*>& e_blocks = local
628 if (!IsParameterBlockSetIndependent(e_blocks, residual_blocks)) {
    [all...]
partitioned_matrix_view_impl.h 60 // e_blocks. For a definition of what an e_block is, please see
reorder_program.cc 322 // e_blocks, which we do by computing a maximal independent set.

Completed in 1237 milliseconds