Camouflaged object detection (COD) is a task of identifying and locating target objects that are camouflaged, masked, or confused. Research claims that depth cues can provide effective object location cues. However, depth images often contain noise interference, which may negatively affect object recognition. In addition, depth images also lack edge details, and most of previous works pay more attention to the integrity of the region, rather than the quality of the edge. To solve these two problems, we propose a joint edge and regional depth enhancement network (ERDENet) for Camouflaged Object Detection. The network first introduces the Locate and Generate Depth (LGD) module to locate the target region and generate its depth image. After that, the Feature Interactive Fusion (FIF) module is carried out, complementing the enhanced depth feature with the feature extracted from the original image, and then fuse the edge clues into it. Finally, we design a Muiti-modal Refinement Extraction (MRE) module to refine the feature to improve the detection performance. Extensive experiments show that our method has advantages and effectiveness.

Transformer models have achieved significant success in various complex tasks, but their high computational costs and longer inference latency serve as limiting factors. To effectively reduce these costs, pruning has been widely adopted as an efficient method for Transformer models. Despite the excellent pruning speed demonstrated by existing retraining-free pruning algorithms, these methods often only find local optima when assessing the importance of attention heads and feed-forward networks. This limitation may lead to unstable solutions, thus affecting the overall performance of the model. To address these challenges, we propose DP-Prune (Dynamic Programming-Prune), a retraining-free structured pruning algorithm that employs a global optimization strategy. The algorithm consists of two parts: DPMO (Dynamic Programming Mask Optimization) and GSMT (GCROTMK Solver Mask Tuning), designed to quickly and effectively find global optima. We evaluate this method using BERTBASEand DistilBERT models on the GLUE and SQuAD benchmark tests. Experimental results demonstrate significant accuracy improvements on the SQuAD2.0task test without any further training. Under a 60% FLOPs constraint, DP-Prune achieves an 8.42% increase in F1 score compared with some existing retraining-free pruning algorithms.

Particle imaging velocimetry is a classical method in 2D fluid imaging. While 3D extensions exist, they are limited by practical restrictions of multi-camera systems. Holographic particle imaging velocimetry has emerged as a solution for a simple and compact 3D imaging system. However, with dense particle seeding, scattering effects become apparent, and the reconstruction quality suffers, especially in the axial direction. To address these challenges, we propose a simple in-line HPIV approach with a plane-to-plane propagation model to account for the scattering effect. Instead of independently reconstructing particle volume and flow velocity, we present a joint optimization problem for particle and flow reconstruction. This optimization problem combines the a differentiable formulation of the holographic image formation with physical motion priors (incompressible flow and particle motion consistency) to improve the reconstruction quality. We solve this joint optimization problem using an extendable automatic differentiation and alternating optimization framework, and we evaluate the proposed method in synthetic and real experiments. The results demonstrate improved reconstruction quality for both particle density and flow velocity fields. With the plane-to-plane propagation model and physics prior, we push HPIV a step further regarding particle density, tank depth, and reconstruction accuracy.

Image deblurring aims to restore the detailed texture information or structures from the blurry images, which has become an indispensable step in many computer vision tasks. Although various methods have been proposed to deal with the image deblurring problem, most of them treated the blurry image as a whole and neglected the characteristics of different image frequencies. In this paper, we present a new method called multi-scale frequency separation network (MSFS-Net) for image deblurring. MSFS-Net introduces the frequency separation module (FSM) into an encoder-decoder network architecture to capture the low- and high-frequency information of image at multiple scales. Then, a simple cycle-consistency strategy and a sophisticated contrastive learning module (CLM) are respectively designed to retain the low-frequency information and recover the high-frequency information during deblurring. At last, the features of different scales are fused by a cross-scale feature fusion module (CSFFM). Extensive experiments on benchmark datasets show that the proposed network achieves state-of-the-art performance.

Randomized clinical trial (RCT) studies are the gold standard for scientific evidence on treatment benefits to patients. RCT outcomes may not be generalizable to clinical practice if the trial population is not representative of the patients for which the treatment is intended. Specifically, enrollment plans may not adequately include groups of patients with protected attributes, such as gender, race, or ethnicity. Inequities in RCTs are a major concern for funding agencies such as the National Institutes of Health (NIH) and for policy makers. We address this challenge by proposing a goal-programming approach, explicitly integrating measurable enrollment goals, to design equitable enrollment plans for RCTs. We evaluate our model in both single and multisite settings using the enrollment criteria and study population from the Systolic Blood Pressure Intervention Trial (SPRINT) study. Our model can successfully generate equitable enrollment plans that satisfy multiple goals such as sample representativeness and minimum total financial cost. Our model can detect deviations from a target plan during the enrollment process and update the plan to reduce deviations in the remaining process. Finally, through appropriate site selection in the planning stage, the model can demonstrate the possibility of enrolling a nationally representative study population if geographic constraints exist in multisite recruitment (e.g., clinical centers in a particular region). Our model can be used to prospectively produce and retrospectively evaluate how equitable enrollment plans are based on subjects' protected attributes, and it allows researchers to provide justifications on validity of scientific analysis and evaluation of subgroup disparities.

In this paper, a deep learning network with double closed-loop structure is introduced to tackle the image deblurring problem. The first closed-loop in our model is composed of two networks which learn a pair of opposite mappings between the blurry and sharp images. By this way, the solution spaces of possible functions that map a blurry image to its sharp counterpart can be effectively reduced. Furthermore, the first closed-loop also helps our model to deal with the unpaired samples in the training set. The second closed-loop in the proposed approach employed a self-supervision mechanism to constrain the features of intermedia layers in the network, so that the detailed information of sharp images can be well exploited. Through combining the two closed-loops together, our model can address the limitations of existing methods and improve the deblurring performance. Extensive experiments on both benchmark and real-world datasets show that the proposed network achieves state-of-the-art performance. The code will be released in: https://github.com/LiQiang0307/DCLNet.

Recently, deep learning based image deblurring has been well developed. However, exploiting the detailed image features in a deep learning framework always requires a mass of parameters, which inevitably makes the network suffer from high computational burden. To solve this problem, we propose a lightweight multi-information fusion network (LMFN) for image deblurring. The proposed LMFN is designed as an encoder-decoder architecture. In the encoding stage, the image feature is reduced to various small-scale spaces for multi-scale information extraction and fusion without a large amount of information loss. Then, a distillation network is used in the decoding stage, which allows the network benefit the most from residual learning while remaining sufficiently lightweight. Meanwhile, an information fusion strategy between distillation modules and feature channels is also carried out by attention mechanism. Through fusing different information in the proposed approach, our network can achieve state-of-the-art image deblurring result with smaller number of parameters and outperforms existing methods in model complexity.

Compressive imaging systems with spatial-temporal encoding can be used to capture and reconstruct fast-moving objects. The imaging quality highly depends on the choice of encoding masks and reconstruction methods. In this paper, we present a new network architecture to jointly design the encoding masks and the reconstruction method for compressive high-frame-rate imaging. Unlike previous works, the proposed method takes full advantage of denoising prior to provide a promising frame reconstruction. The network is also flexible enough to optimize full-resolution masks and efficient at reconstructing frames. To this end, we develop a new dense network architecture that embeds Anderson acceleration, known from numerical optimization, directly into the neural network architecture. Our experiments show the optimized masks and the dense accelerated network respectively achieve 1.5 dB and 1 dB improvements in PSNR without adding training parameters. The proposed method outperforms other state-of-the-art methods both in simulations and on real hardware. In addition, we set up a coded two-bucket camera for compressive high-frame-rate imaging, which is robust to imaging noise and provides promising results when recovering nearly 1,000 frames per second.

Recently, the use of information hiding techniques to protect biometric data has been an active topic. This paper proposes a novel image hiding approach based on correlation analysis to protect network-based transmitted biometric image for identification. Firstly, the correlation between the biometric image and the cover image is analyzed using principal component analysis (PCA) and genetic algorithm (GA). The purpose of correlation analysis is to enable the cover image to represent the secret image in content as much as possible, not just as a carrier of hidden information. Then, the unrepresented part of the biometric image, as the secret image, is encrypted and hidden into the middle-significant-bit plane (MSB) of the cover image redundantly. Extensive experimental results demonstrate that the proposed hiding approach not only gains good imperceptibility, but also resists some common attacks validated by the biometric identification accuracy.