tesseract::DPPoint Class Reference

#include <dppoint.h>

Public Types
using	CostFunc = int64_t(DPPoint::*)(const DPPoint *)

Public Member Functions
	DPPoint ()
int64_t	CostWithVariance (const DPPoint *prev)
int	total_cost () const
int	Pathlength () const
const DPPoint *	best_prev () const
void	AddLocalCost (int new_cost)

Static Public Member Functions
static DPPoint *	Solve (int min_step, int max_step, bool debug, CostFunc cost_func, int size, DPPoint *points)

Detailed Description

Definition at line 59 of file dppoint.h.

Member Typedef Documentation

CostFunc

using tesseract::DPPoint::CostFunc = int64_t (DPPoint::*)(const DPPoint*)

Definition at line 80 of file dppoint.h.

Constructor & Destructor Documentation

DPPoint()

tesseract::DPPoint::DPPoint ( )

inline

Definition at line 82 of file dppoint.h.

        :
  // Code common to different cost functions.
 
  // Update the other members if the cost is lower.
  void UpdateIfBetter(int64_t cost, int32_t steps, const DPPoint* prev,

Member Function Documentation

AddLocalCost()

void tesseract::DPPoint::AddLocalCost ( int  new_cost )

inline

Definition at line 112 of file dppoint.h.

best_prev()

const DPPoint* tesseract::DPPoint::best_prev ( ) const

inline

Definition at line 109 of file dppoint.h.

CostWithVariance()

int64_t tesseract::DPPoint::CostWithVariance

(

const DPPoint *

prev

)

Definition at line 85 of file dppoint.cpp.

                                                                        {
  if (cost < total_cost_) {
    total_cost_ = cost;
    total_steps_ = steps;
    best_prev_ = prev;
    n_ = n;
    sig_x_ = sig_x;
    sig_xsq_ = sig_xsq;
  }
}
 
}  // namespace tesseract.

Pathlength()

int tesseract::DPPoint::Pathlength ( ) const

inline

Definition at line 106 of file dppoint.h.

Solve()

DPPoint * tesseract::DPPoint::Solve ( int  min_step, int  max_step, bool  debug, CostFunc  cost_func, int  size, DPPoint *  points  )

static

Definition at line 47 of file dppoint.cpp.

               {
      tprintf("At point %d, local cost=%d, total_cost=%d, steps=%d\n",
              i, points[i].local_cost_, points[i].total_cost_,
              points[i].total_steps_);
    }
  }
  // Now find the end of the best path and return it.
  int best_cost = points[size - 1].total_cost_;
  int best_end = size - 1;
  for (int end = best_end - 1; end >= size - min_step; --end) {
    int cost = points[end].total_cost_;
    if (cost < best_cost) {
      best_cost = cost;
      best_end = end;
    }
  }
  return points + best_end;
}
 
// A CostFunc that takes the variance of step into account in the cost.
int64_t DPPoint::CostWithVariance(const DPPoint* prev) {
  if (prev == nullptr || prev == this) {
    UpdateIfBetter(0, 1, nullptr, 0, 0, 0);
    return 0;
  }
 
  int delta = this - prev;
  int32_t n = prev->n_ + 1;
  int32_t sig_x = prev->sig_x_ + delta;
  int64_t sig_xsq = prev->sig_xsq_ + delta * delta;
  int64_t cost = (sig_xsq - sig_x * sig_x / n) / n;
  cost += prev->total_cost_;
  UpdateIfBetter(cost, prev->total_steps_ + 1, prev, n, sig_x, sig_xsq);
  return cost;

total_cost()

int tesseract::DPPoint::total_cost ( ) const

inline

Definition at line 103 of file dppoint.h.

---

The documentation for this class was generated from the following files:

• /tesseract/src/ccstruct/dppoint.h
• /tesseract/src/ccstruct/dppoint.cpp