Meta Ordinal Regression Forest for Medical Image Classification with Ordinal Labels

• URL: http://arxiv.org/abs/2203.07725v1
• Date: Tue, 15 Mar 2022 08:43:57 GMT
• Title: Meta Ordinal Regression Forest for Medical Image Classification with Ordinal Labels
• Authors: Yiming Lei, Haiping Zhu, Junping Zhang, Hongming Shan
• Abstract summary: We propose a novel meta ordinal regression forest (MORF) method for medical image classification with ordinal labels. MORF learns the ordinal relationship through the combination of convolutional neural network and differential forest in a meta-learning framework. Experimental results on two medical image classification datasets with ordinal labels demonstrate the superior performances of our MORF method over existing state-of-the-art methods.
• Score: 37.121792169424744
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The performance of medical image classification has been enhanced by deep convolutional neural networks (CNNs), which are typically trained with cross-entropy (CE) loss. However, when the label presents an intrinsic ordinal property in nature, e.g., the development from benign to malignant tumor, CE loss cannot take into account such ordinal information to allow for better generalization. To improve model generalization with ordinal information, we propose a novel meta ordinal regression forest (MORF) method for medical image classification with ordinal labels, which learns the ordinal relationship through the combination of convolutional neural network and differential forest in a meta-learning framework. The merits of the proposed MORF come from the following two components: a tree-wise weighting net (TWW-Net) and a grouped feature selection (GFS) module. First, the TWW-Net assigns each tree in the forest with a specific weight that is mapped from the classification loss of the corresponding tree. Hence, all the trees possess varying weights, which is helpful for alleviating the tree-wise prediction variance. Second, the GFS module enables a dynamic forest rather than a fixed one that was previously used, allowing for random feature perturbation. During training, we alternatively optimize the parameters of the CNN backbone and TWW-Net in the meta-learning framework through calculating the Hessian matrix. Experimental results on two medical image classification datasets with ordinal labels, i.e., LIDC-IDRI and Breast Ultrasound Dataset, demonstrate the superior performances of our MORF method over existing state-of-the-art methods.

Related papers

• Fine-grained Recognition with Learnable Semantic Data Augmentation [68.48892326854494]
  Fine-grained image recognition is a longstanding computer vision challenge. We propose diversifying the training data at the feature-level to alleviate the discriminative region loss problem. Our method significantly improves the generalization performance on several popular classification networks.
  arXiv  Detail & Related papers  (2023-09-01T11:15:50Z)
• Neural Attention Forests: Transformer-Based Forest Improvement [4.129225533930966]
  The main idea behind the proposed NAF model is to introduce the attention mechanism into the random forest. In contrast to the available models like the attention-based random forest, the attention weights and the Nadaraya-Watson regression are represented in the form of neural networks. The combination of the random forest and neural networks implementing the attention mechanism forms a transformer for enhancing the forest predictions.
  arXiv  Detail & Related papers  (2023-04-12T17:01:38Z)
• Do We Really Need a Learnable Classifier at the End of Deep Neural Network? [118.18554882199676]
  We study the potential of learning a neural network for classification with the classifier randomly as an ETF and fixed during training. Our experimental results show that our method is able to achieve similar performances on image classification for balanced datasets.
  arXiv  Detail & Related papers  (2022-03-17T04:34:28Z)
• Making CNNs Interpretable by Building Dynamic Sequential Decision Forests with Top-down Hierarchy Learning [62.82046926149371]
  We propose a generic model transfer scheme to make Convlutional Neural Networks (CNNs) interpretable. We achieve this by building a differentiable decision forest on top of CNNs. We name the transferred model deep Dynamic Sequential Decision Forest (dDSDF)
  arXiv  Detail & Related papers  (2021-06-05T07:41:18Z)
• Meta ordinal weighting net for improving lung nodule classification [19.61244172891081]
  We propose a Meta Ordinal Weighting Network (MOW-Net) to align each training sample with a meta ordinal set (MOS) containing a few samples from all classes. During the training process, the MOW-Net learns a mapping from samples in MOS to the corresponding class-specific weight. The experimental results demonstrate that the MOW-Net achieves better accuracy than the state-of-the-art ordinal regression methods.
  arXiv  Detail & Related papers  (2021-01-31T14:00:20Z)
• Meta Ordinal Regression Forest For Learning with Unsure Lung Nodules [18.597354524446487]
  An unsure data model (UDM) was proposed to incorporate those unsure nodules by formulating this problem as an ordinal regression. This paper proposes a meta ordinal regression forest (MORF) which improves upon the state-of-the-art ordinal regression method. Experimental results on the LIDC-IDRI dataset demonstrate superior performance over existing methods.
  arXiv  Detail & Related papers  (2020-12-07T06:59:43Z)
• Convolutional Ordinal Regression Forest for Image Ordinal Estimation [52.67784321853814]
  We propose a novel ordinal regression approach, termed Convolutional Ordinal Regression Forest or CORF, for image ordinal estimation. The proposed CORF integrates ordinal regression and differentiable decision trees with a convolutional neural network for obtaining precise and stable global ordinal relationships. The effectiveness of the proposed CORF is verified on two image ordinal estimation tasks, showing significant improvements and better stability over the state-of-the-art ordinal regression methods.
  arXiv  Detail & Related papers  (2020-08-07T10:41:17Z)
• Unifying Graph Convolutional Neural Networks and Label Propagation [73.82013612939507]
  We study the relationship between LPA and GCN in terms of two aspects: feature/label smoothing and feature/label influence. Based on our theoretical analysis, we propose an end-to-end model that unifies GCN and LPA for node classification. Our model can also be seen as learning attention weights based on node labels, which is more task-oriented than existing feature-based attention models.
  arXiv  Detail & Related papers  (2020-02-17T03:23:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.