| /external/ceres-solver/examples/ |
| circle_fit.cc | 71 // The cost for a single sample. The returned residual is related to the
82 T* residual) const {
92 // residual[0] = r - sqrt(xp*xp + yp*yp);
100 residual[0] = r*r - xp*xp - yp*yp;
|
| curve_fitting.cc | 127 T* residual) const {
128 residual[0] = T(y_) - exp(m[0] * T(x_) + c[0]);
|
| robot_pose_mle.cc | 52 // 1) The OdometryConstraint residual, that accounts for the odometry readings
54 // 2) The RangeConstraint residual, that accounts for the errors in the observed
57 // The OdometryConstraint residual is modeled as an AutoDiffCostFunction with
63 // The RangeConstraint residual is modeled as a DynamicAutoDiffCostFunction
172 bool operator()(const T* const odometry, T* residual) const {
173 *residual = (*odometry - T(odometry_mean)) / T(odometry_stddev);
|
| robust_curve_fitting.cc | 129 T* residual) const {
130 residual[0] = T(y_) - exp(m[0] * T(x_) + c[0]);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| AbstractLeastSquaresOptimizer.java | 228 final double residual = targetValues[i] - objective[i]; local
229 residuals[i] = residual;
230 wresiduals[i]= residual*FastMath.sqrt(residualsWeights[i]);
231 cost += residualsWeights[i] * residual * residual;
|
| GaussNewtonOptimizer.java | 86 final double residual = objective[i] - targetValues[i]; local
89 final double wr = weight * residual;
|
| /external/ceres-solver/internal/ceres/ |
| gradient_checking_cost_function_test.cc | 149 double residual; local
154 // Since residual is one dimensional the jacobians have the same
174 &residual,
176 EXPECT_EQ(original_residual, residual);
205 double residual; local
208 // Since residual is one dimensional the jacobians have the same size as the
233 &residual,
251 &residual,
|
| levenberg_marquardt_strategy_test.cc | 121 double residual = 1.0; local
152 lms.ComputeStep(pso, &dsm, &residual, x);
|
| system_test.cc | 170 // solutions by comparing their residual vectors. We do not
183 << "Not close enough residual:" << j
241 T* residual) const {
243 *residual = *x1 + T(10.0) * *x2;
252 T* residual) const {
254 *residual = T(sqrt(5.0)) * (*x3 - *x4);
263 T* residual) const {
265 residual[0] = (x2[0] - T(2.0) * x4[0]) * (x2[0] - T(2.0) * x4[0]);
274 T* residual) const {
276 residual[0] = T(sqrt(10.0)) * (x1[0] - x4[0]) * (x1[0] - x4[0])
[all...] |
| solver_test.cc | 62 T* residual) const {
63 residual[0] = T(5.0) - *x;
133 T* residual) const {
135 residual[0] = T(10.0) - *x +
|
| /bionic/libc/kernel/uapi/linux/ |
| virtio_blk.h | 92 __virtio32 residual; member in struct:virtio_scsi_inhdr
|
| /external/kernel-headers/original/uapi/linux/ |
| virtio_blk.h | 141 __virtio32 residual; member in struct:virtio_scsi_inhdr
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| vlc_decode.h | 97 PV_STATUS PV_DeScaleMVD(int f_code, int residual, int vlc_code_mag, MOT *vector);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| GaussNewtonEstimator.java | 184 double residual = measurements[i].getResidual(); local
189 bDecrementData[j] = weight * residual * grad[j];
|
| /external/flac/libFLAC/ |
| stream_encoder_framing.c | 44 static FLAC__bool add_residual_partitioned_rice_(FLAC__BitWriter *bw, const FLAC__int32 residual[], const unsigned residual_samples, const unsigned predictor_order, const unsigned rice_parameters[], const unsigned raw_bits[], const unsigned partition_order, const FLAC__bool is_extended);
396 subframe->residual,
442 subframe->residual,
493 FLAC__bool add_residual_partitioned_rice_(FLAC__BitWriter *bw, const FLAC__int32 residual[], const unsigned residual_samples, const unsigned predictor_order, const unsigned rice_parameters[], const unsigned raw_bits[], const unsigned partition_order, const FLAC__bool is_extended)
504 if(!FLAC__bitwriter_write_rice_signed_block(bw, residual, residual_samples, rice_parameters[0]))
514 if(!FLAC__bitwriter_write_raw_int32(bw, residual[i], raw_bits[0]))
532 if(!FLAC__bitwriter_write_rice_signed_block(bw, residual+k_last, k-k_last, rice_parameters[i]))
541 if(!FLAC__bitwriter_write_raw_int32(bw, residual[j], raw_bits[i]))
|
| stream_encoder.c | 68 * (and fast) estimation (of how many bits a residual value will be
151 FLAC__int32 *residual[2],
175 FLAC__int32 residual[],
195 FLAC__int32 residual[],
224 const FLAC__int32 residual[],
240 const FLAC__int32 residual[],
250 const FLAC__int32 residual[],
260 const FLAC__int32 residual[],
313 unsigned input_capacity; /* current size (in samples) of the signal and residual buffers */
324 FLAC__int32 *residual_workspace[FLAC__MAX_CHANNELS][2]; /* each channel has a candidate and best workspace where the subframe residual signals will be stored *
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IterationController.h | 77 double m_resmax; ///< maximum residual
80 double m_res; ///< last computed residual
108 double residual() const { return m_res; } function in class:Eigen::IterationController
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/ |
| h264bsd_image.c | 152 and the residual are given separately and will be combined while
159 residual pointer to residual data, 16 16-element arrays for luma
172 i32 residual[][16])
214 pRes = residual[block];
230 /* Residual is zero => copy prediction block to output */
245 /* Calculate image = prediction + residual
279 pRes = residual[block];
304 /* Residual is zero => copy prediction block to output */
|
| h264bsd_intra_prediction.c | 184 void h264bsdAddResidual(u8 *data, i32 *residual, u32 blockNum);
202 residual into prediction. The resulting luma pixels are
255 Perform intra 4x4 prediction for luma pixels and add residual
368 Perform intra prediction for chroma pixels and add residual
452 (prediction + residual) into the output image (image)
500 tmp = h264bsdIntra16x16Prediction(pMb, data, mbLayer->residual.level,
514 mbLayer->residual.level+16, pelAbove + 21, pelLeft + 16,
617 residual into prediction. The resulting luma pixels are
622 u32 h264bsdIntra16x16Prediction(mbStorage_t *pMb, u8 *data, i32 residual[][16],
634 ASSERT(residual);
[all...] |
| h264bsd_macroblock_layer.h | 158 residual_t residual; member in struct:__anon27904
|
| /external/eigen/test/ |
| jacobisvd.cpp | 91 RealScalar residual = (m*x-rhs).norm(); local
93 if(!test_isMuchSmallerThan(residual,rhs.norm()))
95 // If the residual is very small, then we have an exact solution, so we are already good.
101 VERIFY( test_isApprox(residual_y,residual) || residual < residual_y );
105 VERIFY( test_isApprox(residual_y,residual) || residual < residual_y );
|
| /external/opencv3/modules/cudaimgproc/src/cuda/ |
| clahe.cu | 114 int residual = totalClipped - redistBatch * 256;
115 if (tid < residual)
|
| /external/opencv3/modules/imgproc/src/opencl/ |
| clahe.cl | 203 int residual = totalClipped - redistBatch * 256;
204 if (tid < residual)
|
| /external/flac/include/FLAC/ |
| format.h | 196 /**< Residual is coded by partitioning into contexts, each with it's own
200 /**< Residual is coded by partitioning into contexts, each with it's own
212 /** Contents of a Rice partitioned residual
231 /** Header for a Rice partitioned residual. (c.f. <A HREF="../format.html#partitioned_rice">format specification</A>)
253 /** Header for the entropy coding method. (c.f. <A HREF="../format.html#residual">format specification</A>)
300 /**< The residual coding method. */
308 const FLAC__int32 *residual; member in struct:__anon11182
309 /**< The residual signal, length == (blocksize minus order) samples. */
317 /**< The residual coding method. */
334 const FLAC__int32 *residual; member in struct:__anon11183
[all...] |
| /frameworks/av/media/libstagefright/codecs/avc/enc/ |
| Android.mk | 15 src/residual.cpp \
|
