Search

Background: The intensities (i.e., number of protons in monitor unit [MU]) of deliverable proton spots need to be either zero or meet a minimum‐MU (MMU) threshold, which is a nonconvex problem. Since the dose rate is proportionally associated with the MMU threshold, higher‐dose‐rate proton radiation therapy (RT) (e.g., efficient intensity modulated proton therapy (IMPT) and ARC proton therapy, and high‐dose‐rate‐induced FLASH effect needs to solve the MMU problem with larger MMU threshold, which however makes the nonconvex problem more difficult to solve. Purpose: This work will develop a more effective optimization method based on orthogonal matching pursuit (OMP) for solving the MMU problem with large MMU thresholds, compared to state‐of‐the‐art methods, such as alternating direction method of multipliers (ADMM), proximal gradient descent method (PGD), or stochastic coordinate descent method (SCD). Methods: The new method consists of two essential components. First, the iterative convex relaxation (ICR) method is used to determine the active sets for dose‐volume planning constraints and decouple the MMU constraint from the rest. Second, a modified OMP optimization algorithm is used to handle the MMU constraint: the non‐zero spots are greedily selected via OMP to form the solution set to be optimized, and then a convex constrained subproblem is formed and can be conveniently solved to optimize the spot weights restricted to this solution set via OMP. During this iterative process, the new non‐zero spots localized via OMP will be adaptively added to or removed from the optimization objective. Results: The new method via OMP is validated in comparison with ADMM, PGD and SCD for high‐dose‐rate IMPT, ARC, and FLASH problems of large MMU thresholds, and the results suggest that OMP substantially improved the plan quality from PGD, ADMM and SCD in terms of both target dose conformality (e.g., quantified by max target dose and conformity index) and normal tissue sparing (e.g., mean and max dose). For example, in the brain case, the max target dose for IMPT/ARC/FLASH was 368.0%/358.3%/283.4% respectively for PGD, 154.4%/179.8%/150.0% for ADMM, 134.5%/130.4%/123.0% for SCD, while it was <120% in all scenarios for OMP; compared to PGD/ADMM/SCD, OMP improved the conformity index from 0.42/0.52/0.33 to 0.65 for IMPT and 0.46/0.60/0.61 to 0.83 for ARC. Conclusions: A new OMP‐based optimization algorithm is developed to solve the MMU problems with large MMU thresholds, and validated using examples of IMPT, ARC, and FLASH with substantially improved plan quality from ADMM, PGD, and SCD. [ABSTRACT FROM AUTHOR]

Oil spills have always been a threat to the marine ecological environment; thus, it is important to identify and divide oil spill areas on the ocean surface into segments after an oil spill accident occurs to protect the marine ecological environment. However, oil spill area segmentation using ordinary optical images is greatly interfered with by the absorption of light by the deep sea and the distribution of algal organisms on the ocean surface, and it is difficult to improve segmentation accuracy. To address the above problems, a hyperspectral ocean oil spill image segmentation model with multiscale feature fusion (MFFHOSS-Net) is proposed. Specifically, the oil spill segmentation dataset was created using hyperspectral image data from NASA for the Gulf of Mexico oil spill, small-size images after the waveband filtering of the hyperspectral images were generated and the oil spill images were annotated. The model makes full use of having different layers with different characteristics by fusing feature maps of different scales. In addition, an attention mechanism was used to effectively fuse these features to improve the oil spill region segmentation accuracy. A case study, ablation experiments and model evaluation were also carried out in this work. Compared with other models, our proposed method achieved good results according to various evaluation metrics. [ABSTRACT FROM AUTHOR]

With the increase of large shopping malls, there are many large parking spaces in complex environments, which increases the difficulty of finding vehicles in such environments. To upgrade the consumer's experience, some car manufacturers have proposed detecting parking space numbers in parking spaces. The detection of parking space number in parking spaces in complex environments has problems such as the diversified background of parking space numbers, tilted direction of parking space numbers, and small parking space number scale. Since no scholar has proposed a high‐performance method for such problems, a parking space number detection model based on the multi‐branch convolutional attention is presented. Firstly, using ResNet50 as the backbone network, a multi‐branch convolutional structure is proposed in the backbone network, which aims to process and fuse the feature map through three parallel branches, and enhance the network to represent ability information by convolutional attention, learn global features to selectively strengthen the features containing helpful information, and improve the ability of the model to detect the parking space number area. Secondly, a high‐level feature enhancement unit is designed to adjust the features channel by channel, obtain more spatial correlation, and reduce the loss of information in the process of feature map generation. The data results of the model on the parking space number dataset CCAG show that the precision, recall, and F‐measure are 84.8%, 84.6%, and 84.7%, respectively, which has certain advantages for parking space number detection. [ABSTRACT FROM AUTHOR]