* @brief Start iteration through element of list in reverse order. * * @return start iterator */

* @brief End of iteration through elements of list in reverse order. * * @return end iterator */

* @brief Resets algorithm in order to be applied to the next graph. * * This will delete most of the information obtained in the last run.

Multiply by power of two. \param arg number to modify \param exp power of two to multiply with \return \a arg multplied by 2 raised to \a exp template

* @brief Enables or disables scanning of the whole %graph. * * If enabled and the DFS started at the given start-%node * stops withou

clean up the temporary component buffers

combined JPEG 'receive' and JPEG 'extend', since baseline always extends everything it receives.

returns 0..31 for the highest set bit

mallocs with size overflow checking

returns STBI_rgb or whatever, 0 on error

\brief MotionDetector::CalcMotionMap \param frame

\brief DrawFilledRect

\brief GetTrajectory \return

\brief CTrack::GetID \return

\brief TKalmanFilter::GetVelocity \return

\brief SetMinObjectSize \param minObjectSize

\brief CTracker::Update \param regions \param currFrame \param fps

https://github.com/digantamisra98/Mish

https://github.com/Zzh-tju/DIoU-darknet https://arxiv.org/abs/1911.08287

Converts output of the network to detection boxes w,h: image width,height netw,neth: network width,height relative: 1 (all callers seems to pass TRUE)

Error function. \param arg function argument \return error function value of \a arg template<typename T> typename enable<expr,T>::type erf(T arg) { re

fh_insert() - creates and inserts new a node representing vertex_no with key * k into the heap h. */

fh_meld() - melds the linked list of trees pointed to by *tree_list into * the heap pointed to by h. */

compute FHOG features