Robust and Efficient Regularized Boosting Using Total Bregman Divergence

CVPR 2011 pp. 2897-2902

doi:10.1109/CVPR.2011.5995686 /cvpr/2011/liu2011cvpr-robust-a/

Cite

Text

Liu and Vemuri. "Robust and Efficient Regularized Boosting Using Total Bregman Divergence." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011. doi:10.1109/CVPR.2011.5995686

Markdown

[Liu and Vemuri. "Robust and Efficient Regularized Boosting Using Total Bregman Divergence." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011.](https://mlanthology.org/cvpr/2011/liu2011cvpr-robust-a/) doi:10.1109/CVPR.2011.5995686

BibTeX

@inproceedings{liu2011cvpr-robust-a,
  title     = {{Robust and Efficient Regularized Boosting Using Total Bregman Divergence}},
  author    = {Liu, Meizhu and Vemuri, Baba C.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2011},
  pages     = {2897-2902},
  doi       = {10.1109/CVPR.2011.5995686},
  url       = {https://mlanthology.org/cvpr/2011/liu2011cvpr-robust-a/}
}