# Multiview Hessian Regularization for Image Annotation

**Authors:** Weifeng Liu, Dacheng Tao

arXiv: 1904.10100 · 2019-04-24

## TL;DR

This paper introduces multiview Hessian regularization (mHR), a novel semi-supervised learning method that combines multiple views of data to improve image annotation, addressing limitations of Laplacian regularization.

## Contribution

The paper proposes mHR, a new multiview Hessian regularization technique that enhances semi-supervised image annotation by leveraging multiple feature views and linear variation along data manifolds.

## Key findings

- mHR outperforms baseline algorithms like LR and HR on PASCAL VOC'07.
- mHR effectively combines multiple views for improved annotation accuracy.
- Experimental results demonstrate the robustness of mHR across different models.

## Abstract

The rapid development of computer hardware and Internet technology makes large scale data dependent models computationally tractable, and opens a bright avenue for annotating images through innovative machine learning algorithms. Semi-supervised learning (SSL) has consequently received intensive attention in recent years and has been successfully deployed in image annotation. One representative work in SSL is Laplacian regularization (LR), which smoothes the conditional distribution for classification along the manifold encoded in the graph Laplacian, however, it has been observed that LR biases the classification function towards a constant function which possibly results in poor generalization. In addition, LR is developed to handle uniformly distributed data (or single view data), although instances or objects, such as images and videos, are usually represented by multiview features, such as color, shape and texture. In this paper, we present multiview Hessian regularization (mHR) to address the above two problems in LR-based image annotation. In particular, mHR optimally combines multiple Hessian regularizations, each of which is obtained from a particular view of instances, and steers the classification function which varies linearly along the data manifold. We apply mHR to kernel least squares and support vector machines as two examples for image annotation. Extensive experiments on the PASCAL VOC'07 dataset validate the effectiveness of mHR by comparing it with baseline algorithms, including LR and HR.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1904.10100/full.md

## Figures

4 figures with captions in the complete paper: https://tomesphere.com/paper/1904.10100/full.md

## References

39 references — full list in the complete paper: https://tomesphere.com/paper/1904.10100/full.md

---
Source: https://tomesphere.com/paper/1904.10100