Robust least-square-baseline finding using a branch and bound algorithm

Thomas M. Breuel. Robust least-square-baseline finding using a branch and bound algorithm. In Paul B. Kantor, Tapas Kanungo, Jiangying Zhou, editors, Document Recognition and Retrieval IX, San Jose, CA, USA, January 19, 2002. Volume 4670 of SPIE Proceedings, pages 20-27, SPIE, 2002. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.