Search for: All records

Example-guided image synthesis has been recently attempted to synthesize an image from a semantic label map and an exemplary image. In the task, the additional exemplary image serves to provide style guidance that controls the appearance of the synthesized output. Despite the controllability advantage, the previous models are designed on datasets with specific and roughly aligned objects. In this paper, we tackle a more challenging and general task, where the exemplar is an arbitrary scene image that is semantically unaligned to the given label map. To this end, we first propose a new Masked Spatial-Channel Attention (MSCA) module which models the correspondence between two unstructured scenes via cross-attention. Next, we propose an end-to-end network for joint global and local feature alignment and synthesis. In addition, we propose a novel patch-based self-supervision scheme to enable training. Experiments on the large-scale CCOO-stuff dataset show significant improvements over existing methods. Moreover, our approach provides interpretability and can be readily extended to other tasks including style and spatial interpolation or extrapolation, as well as other content manipulation.

Abstract The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly suitable for the simulation of a pixelated charge readout for time projection chambers, given the large number of channels that this technology employs. Here we present the first implementation of a full microphysical simulator of a liquid argon time projection chamber (LArTPC) equipped with light readout and pixelated charge readout, developed for the DUNE Near Detector. The software is implemented with an end-to-end set of GPU-optimized algorithms. The algorithms have been written in Python and translated into CUDA kernels using Numba, a just-in-time compiler for a subset of Python and NumPy instructions. The GPU implementation achieves a speed up of four orders of magnitude compared with the equivalent CPU version. The simulation of the current induced on 10^3 pixels takes around 1 ms on the GPU, compared with approximately 10 s on the CPU. The results of the simulation are compared against data from a pixel-readout LArTPC prototype.

Abstract Liquid argon time projection chamber detector technology provides high spatial and calorimetric resolutions on the charged particles traversing liquid argon. As a result, the technology has been used in a number of recent neutrino experiments, and is the technology of choice for the Deep Underground Neutrino Experiment (DUNE). In order to perform high precision measurements of neutrinos in the detector, final state particles need to be effectively identified, and their energy accurately reconstructed. This article proposes an algorithm based on a convolutional neural network to perform the classification of energy deposits and reconstructed particles as track-like or arising from electromagnetic cascades. Results from testing the algorithm on experimental data from ProtoDUNE-SP, a prototype of the DUNE far detector, are presented. The network identifies track- and shower-like particles, as well as Michel electrons, with high efficiency. The performance of the algorithm is consistent between experimental data and simulation.

A bstract A search is presented for a heavy W′ boson resonance decaying to a B or T vector-like quark and a t or a b quark, respectively. The analysis is performed using proton-proton collisions collected with the CMS detector at the LHC. The data correspond to an integrated luminosity of 138 fb − 1 at a center-of-mass energy of 13 TeV. Both decay channels result in a signature with a t quark, a Higgs or Z boson, and a b quark, each produced with a significant Lorentz boost. The all-hadronic decays of the Higgs or Z boson and of the t quark are selected using jet substructure techniques to reduce standard model backgrounds, resulting in a distinct three-jet W′ boson decay signature. No significant deviation in data with respect to the standard model background prediction is observed. Upper limits are set at 95% confidence level on the product of the W′ boson cross section and the final state branching fraction. A W′ boson with a mass below 3.1 TeV is excluded, given the benchmark model assumption of democratic branching fractions. In addition, limits are set based on generalizations of these assumptions. These are the most sensitive limits to datemore »for this final state.« less

Abstract A new algorithm is presented to discriminate reconstructed hadronic decays of tau leptons ( τ h ) that originate from genuine tau leptons in the CMS detector against τ h candidates that originate from quark or gluon jets, electrons, or muons. The algorithm inputs information from all reconstructed particles in the vicinity of a τ h candidate and employs a deep neural network with convolutional layers to efficiently process the inputs. This algorithm leads to a significantly improved performance compared with the previously used one. For example, the efficiency for a genuine τ h to pass the discriminator against jets increases by 10–30% for a given efficiency for quark and gluon jets. Furthermore, a more efficient τ h reconstruction is introduced that incorporates additional hadronic decay modes. The superior performance of the new algorithm to discriminate against jets, electrons, and muons and the improved τ h reconstruction method are validated with LHC proton-proton collision data at √ s = 13 TeV.