Search

Existing symbolic music generation methods usually utilize discriminator to improve the quality of generated music via global perception of music. However, considering the complexity of information in music, such as rhythm and melody, a single discriminator cannot fully reflect the differences in these two primary dimensions of music. In this work, we propose to decouple the melody and rhythm from music, and design corresponding fine-grained discriminators to tackle the aforementioned issues. Specifically, equipped with a pitch augmentation strategy, the melody discriminator discerns the melody variations presented by the generated samples. By contrast, the rhythm discriminator, enhanced with bar-level relative positional encoding, focuses on the velocity of generated notes. Such a design allows the generator to be more explicitly aware of which aspects should be adjusted in the generated music, making it easier to mimic human-composed music. Experimental results on the POP909 benchmark demonstrate the favorable performance of the proposed method compared to several state-of-the-art methods in terms of both objective and subjective metrics., Comment: Accepted by ICPR2024

Recently, infrared small target detection (IRSTD) has been dominated by deep-learning-based methods. However, these methods mainly focus on the design of complex model structures to extract discriminative features, leaving the loss functions for IRSTD under-explored. For example, the widely used Intersection over Union (IoU) and Dice losses lack sensitivity to the scales and locations of targets, limiting the detection performance of detectors. In this paper, we focus on boosting detection performance with a more effective loss but a simpler model structure. Specifically, we first propose a novel Scale and Location Sensitive (SLS) loss to handle the limitations of existing losses: 1) for scale sensitivity, we compute a weight for the IoU loss based on target scales to help the detector distinguish targets with different scales: 2) for location sensitivity, we introduce a penalty term based on the center points of targets to help the detector localize targets more precisely. Then, we design a simple Multi-Scale Head to the plain U-Net (MSHNet). By applying SLS loss to each scale of the predictions, our MSHNet outperforms existing state-of-the-art methods by a large margin. In addition, the detection performance of existing detectors can be further improved when trained with our SLS loss, demonstrating the effectiveness and generalization of our SLS loss. The code is available at https://github.com/ying-fu/MSHNet., Comment: Accepted by CVPR 2024

This paper reports on the NTIRE 2023 Quality Assessment of Video Enhancement Challenge, which will be held in conjunction with the New Trends in Image Restoration and Enhancement Workshop (NTIRE) at CVPR 2023. This challenge is to address a major challenge in the field of video processing, namely, video quality assessment (VQA) for enhanced videos. The challenge uses the VQA Dataset for Perceptual Video Enhancement (VDPVE), which has a total of 1211 enhanced videos, including 600 videos with color, brightness, and contrast enhancements, 310 videos with deblurring, and 301 deshaked videos. The challenge has a total of 167 registered participants. 61 participating teams submitted their prediction results during the development phase, with a total of 3168 submissions. A total of 176 submissions were submitted by 37 participating teams during the final testing phase. Finally, 19 participating teams submitted their models and fact sheets, and detailed the methods they used. Some methods have achieved better results than baseline methods, and the winning methods have demonstrated superior prediction performance.

Given an irreducible fraction $\frac{c}{d} \in [0,1]$, a pair $(\mathcal{A},\mathcal{B})$ is called a $\frac{c}{d}$-cross-intersecting pair of $2^{[n]}$ if $\mathcal{A}, \mathcal{B}$ are two families of subsets of $[n]$ such that for every pair $A \in\mathcal{A}$ and $B\in\mathcal{B}$, $|A \cap B|= \frac{c}{d}|B|$. Mathew, Ray, and Srivastava [{\it\small Fractional cross intersecting families, Graphs and Comb., 2019}] proved that $|\mathcal{A}||\mathcal{B}|\le 2^n$ if $(\mathcal{A}, \mathcal{B})$ is a $\frac{c}{d}$-cross-intersecting pair of $2^{[n]}$ and characterized all the pairs $(\mathcal{A},\mathcal{B})$ with $|\mathcal{A}||\mathcal{B}|=2^n$, such a pair also is called a maximal $\frac cd$-cross-intersecting pair of $2^{[n]}$, when $\frac cd\in\{0,\frac12, 1\}$. In this note, we characterize all the maximal $\frac cd$-cross-intersecting pairs $(\mathcal{A},\mathcal{B})$ when $0<\frac{c}{d}<1$ and $\frac cd\not=\frac 12$, this result answers a question proposed by Mathew, Ray, and Srivastava (2019)., Comment: 7 pages