TSCL:Multi-party loss Balancing scheme for deep learning Image steganography based on Curriculum learning

• URL: http://arxiv.org/abs/2504.18348v1
• Date: Fri, 25 Apr 2025 13:36:50 GMT
• Title: TSCL:Multi-party loss Balancing scheme for deep learning Image steganography based on Curriculum learning
• Authors: Fengchun Liu. Tong Zhang, Chunying Zhang,
• Abstract summary: We propose a Two-stage Curriculum Learning loss scheduler (TSCL) for balancing multinomial losses in deep learning image steganography algorithms.<n> Experimental results on three large public datasets, ALASKA2, VOC2012 and ImageNet, show that the proposed TSCL strategy improves the quality of steganography, decoding accuracy and security.
• Score: 0.3683202928838613
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For deep learning-based image steganography frameworks, in order to ensure the invisibility and recoverability of the information embedding, the loss function usually contains several losses such as embedding loss, recovery loss and steganalysis loss. In previous research works, fixed loss weights are usually chosen for training optimization, and this setting is not linked to the importance of the steganography task itself and the training process. In this paper, we propose a Two-stage Curriculum Learning loss scheduler (TSCL) for balancing multinomial losses in deep learning image steganography algorithms. TSCL consists of two phases: a priori curriculum control and loss dynamics control. The first phase firstly focuses the model on learning the information embedding of the original image by controlling the loss weights in the multi-party adversarial training; secondly, it makes the model shift its learning focus to improving the decoding accuracy; and finally, it makes the model learn to generate a steganographic image that is resistant to steganalysis. In the second stage, the learning speed of each training task is evaluated by calculating the loss drop of the before and after iteration rounds to balance the learning of each task. Experimental results on three large public datasets, ALASKA2, VOC2012 and ImageNet, show that the proposed TSCL strategy improves the quality of steganography, decoding accuracy and security.

Related papers

• STCL:Curriculum learning Strategies for deep learning image steganography models [8.251354931895667]
  This paper proposes a Steganography Curriculum Learning training strategy (STCL) for deep learning image steganography models.<n>The strategy includes a difficulty evaluation strategy based on the teacher model and an knee point-based training scheduling strategy.<n> Experimental results on three large public datasets, ALASKA2, VOC2012 and ImageNet, show that the proposed image steganography scheme is able to improve the model performance.
  arXiv  Detail & Related papers  (2025-04-24T14:34:41Z)
• CALLIC: Content Adaptive Learning for Lossless Image Compression [64.47244912937204]
  CALLIC sets a new state-of-the-art (SOTA) for learned lossless image compression.<n>We propose a content-aware autoregressive self-attention mechanism by leveraging convolutional gating operations.<n>During encoding, we decompose pre-trained layers, including depth-wise convolutions, using low-rank matrices and then adapt the incremental weights on testing image by Rate-guided Progressive Fine-Tuning (RPFT)<n>RPFT fine-tunes with gradually increasing patches that are sorted in descending order by estimated entropy, optimizing learning process and reducing adaptation time.
  arXiv  Detail & Related papers  (2024-12-23T10:41:18Z)
• Multi-task Learning for Optical Coherence Tomography Angiography (OCTA) Vessel Segmentation [1.7539061565898157]
  We propose a novel multi-task learning method for OCTA segmentation, called OCTA-MTL. The adaptive loss combination strategy dynamically adjusts the loss weights according to the inverse of the average loss values of each task. We evaluate our method on the ROSE-2 dataset its superiority in terms of segmentation performance against two baseline methods.
  arXiv  Detail & Related papers  (2023-11-03T23:10:56Z)
• Class Anchor Margin Loss for Content-Based Image Retrieval [97.81742911657497]
  We propose a novel repeller-attractor loss that falls in the metric learning paradigm, yet directly optimize for the L2 metric without the need of generating pairs. We evaluate the proposed objective in the context of few-shot and full-set training on the CBIR task, by using both convolutional and transformer architectures.
  arXiv  Detail & Related papers  (2023-06-01T12:53:10Z)
• Train smarter, not harder: learning deep abdominal CT registration on scarce data [0.8179387741893692]
  We explore training strategies to improve convolutional neural network-based image-to-image registration for abdominal imaging. Guiding registration using segmentations in the training step proved beneficial for deep-learning-based image registration. Finetuning the pretrained model from the brain MRI dataset to the abdominal CT dataset further improved performance.
  arXiv  Detail & Related papers  (2022-11-28T19:03:01Z)
• Deep Learning for Material Decomposition in Photon-Counting CT [0.5801044612920815]
  We present a novel deep-learning solution for material decomposition in PCCT, based on an unrolled/unfolded iterative network. Our approach outperforms a maximum likelihood estimation, a variational method, as well as a fully-learned network.
  arXiv  Detail & Related papers  (2022-08-05T19:05:16Z)
• Real-World Image Super-Resolution by Exclusionary Dual-Learning [98.36096041099906]
  Real-world image super-resolution is a practical image restoration problem that aims to obtain high-quality images from in-the-wild input. Deep learning-based methods have achieved promising restoration quality on real-world image super-resolution datasets. We propose Real-World image Super-Resolution by Exclusionary Dual-Learning (RWSR-EDL) to address the feature diversity in perceptual- and L1-based cooperative learning.
  arXiv  Detail & Related papers  (2022-06-06T13:28:15Z)
• Is Deep Image Prior in Need of a Good Education? [57.3399060347311]
  Deep image prior was introduced as an effective prior for image reconstruction. Despite its impressive reconstructive properties, the approach is slow when compared to learned or traditional reconstruction techniques. We develop a two-stage learning paradigm to address the computational challenge.
  arXiv  Detail & Related papers  (2021-11-23T15:08:26Z)
• Shared Prior Learning of Energy-Based Models for Image Reconstruction [69.72364451042922]
  We propose a novel learning-based framework for image reconstruction particularly designed for training without ground truth data. In the absence of ground truth data, we change the loss functional to a patch-based Wasserstein functional. In shared prior learning, both aforementioned optimal control problems are optimized simultaneously with shared learned parameters of the regularizer.
  arXiv  Detail & Related papers  (2020-11-12T17:56:05Z)
• Switching Loss for Generalized Nucleus Detection in Histopathology [1.8251485068161968]
  We propose a switching loss' function that adaptively shifts the emphasis between foreground and background classes. A nucleus detector trained using the proposed loss function on a source dataset outperformed those trained using cross-entropy, Dice, or focal losses.
  arXiv  Detail & Related papers  (2020-08-09T15:42:50Z)
• Data Consistent CT Reconstruction from Insufficient Data with Learned Prior Images [70.13735569016752]
  We investigate the robustness of deep learning in CT image reconstruction by showing false negative and false positive lesion cases. We propose a data consistent reconstruction (DCR) method to improve their image quality, which combines the advantages of compressed sensing and deep learning. The efficacy of the proposed method is demonstrated in cone-beam CT with truncated data, limited-angle data and sparse-view data, respectively.
  arXiv  Detail & Related papers  (2020-05-20T13:30:49Z)

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.