Deep Neural Networks have exhibited considerable success in various visual tasks. However, when applied to unseen test datasets, state-of-the-art models often suffer performance degradation due to domain shifts. In th...
Deep Neural Networks have exhibited considerable success in various visual tasks. However, when applied to unseen test datasets, state-of-the-art models often suffer performance degradation due to domain shifts. In this paper, we introduce a novel approach for domain generalization from a novel perspective of enhancing the robustness of channels in feature maps to domain shifts. We observe that models trained on source domains contain a substantial number of channels that exhibit unstable activations across different domains, which are inclined to capture domain-specific features and behave abnormally when exposed to unseen target domains. To address the issue, we propose a DomainDrop framework to continuously enhance the channel robustness to domain shifts, where a domain discriminator is used to identify and drop unstable channels in feature maps of each network layer during forward propagation. We theoretically prove that our framework could effectively lower the generalization bound. Extensive experiments on several benchmarks indicate that our framework achieves state-of-the-art performance compared to other competing methods. Our code is available at https://***/lingeringlight/DomainDrop.
Recently, Liu and Yin (Int. J. Theor. Phys. 60, 2074-2083 (2021)) proposed a two-party private set intersection protocol based on quantum Fourier transform. We find the participant can deduce the other party’s privat...
详细信息
Multi-label image recognition with convolutional neural networks has achieved remarkable progress in the past few years. However, most existing multi-label image recognition methods suffer from the long-tailed data di...
详细信息
Information hiding tends to hide secret information in image area where is rich texture or high frequency,so as to transmit secret information to the recipient without affecting the visual quality of the image and aro...
详细信息
Information hiding tends to hide secret information in image area where is rich texture or high frequency,so as to transmit secret information to the recipient without affecting the visual quality of the image and arousing *** take advantage of the complexity of the object texture and consider that under certain circumstances,the object texture is more complex than the background of the image,so the foreground object is more suitable for steganography than the *** the basis of instance segmentation,such as Mask R-CNN,the proposed method hides secret information into each object's region by using the masks of instance segmentation,thus realizing the information hiding of the foreground object without *** method not only makes it more efficient for the receiver to extract information,but also proves to be more secure and robust by experiments.
How to balance lighting and texture details to achieve the desired visual effect remains the bottleneck of existing low-light image enhancement methods. In this paper, we propose a novel Unpaired Textual-attention Gen...
How to balance lighting and texture details to achieve the desired visual effect remains the bottleneck of existing low-light image enhancement methods. In this paper, we propose a novel Unpaired Textual-attention Generative Adversarial N network (UT-GAN) for low-light text image enhancement task. UT-GAN first uses the Zero-DCE net for initial illumination recovery and our TAM module is proposed to translate text information into a textual attention mechanism for the overall network, emphasizing attention to the details of text regions. Moreover, the method constructs an AGM-Net module to mitigate noise effects and fine-tune the illumination. Experiments show that UT-GAN outperforms existing methods in qualitative and quantitative evaluation on the widely used the low-light datasets LOL and SID.
To deal with the domain shift between training and test samples, current methods have primarily focused on learning generalizable features during training and ignore the specificity of unseen samples that are also cri...
To deal with the domain shift between training and test samples, current methods have primarily focused on learning generalizable features during training and ignore the specificity of unseen samples that are also critical during the test. In this paper, we investigate a more challenging task that aims to adapt a trained CNN model to unseen domains during the test. To maximumly mine the information in the test data, we propose a unified method called DomainAdaptor for the test-time adaptation, which consists of an AdaMixBN module and a Generalized Entropy Minimization (GEM) loss. Specifically, AdaMixBN addresses the domain shift by adaptively fusing training and test statistics in the normalization layer via a dynamic mixture co-efficient and a statistic transformation operation. To further enhance the adaptation ability of AdaMixBN, we design a GEM loss that extends the Entropy Minimization loss to better exploit the information in the test data. Extensive experiments show that DomainAdaptor consistently outperforms the state-of-the-art methods on four benchmarks. Furthermore, our method brings more remarkable improvement against existing methods on the few-data unseen domain. The code is available at https://***/koncle/DomainAdaptor.
In the application of IC design for microprocessors, there are often demands for optimizing the implementation of datapath circuits, on which various arithmetic operations are performed. Combinational equivalence chec...
In the application of IC design for microprocessors, there are often demands for optimizing the implementation of datapath circuits, on which various arithmetic operations are performed. Combinational equivalence checking (CEC) plays an essential role in ensuring the correctness of design optimization. The most prevalent CEC algorithms are based on SAT sweeping, which utilizes SAT to prove the equivalence of the internal node pairs in topological order, and the equivalent nodes are merged. Datapath circuits usually contain equivalent pairs for which the transitive fan-in cones are small but have a high XOR chain density, and proving such node pairs is very difficult for SAT solvers. An exact probability-based simulation (EPS) is suitable for verifying such pairs, while this method is not suitable for pairs with many primary inputs due to the memory cost. We first reduce the memory cost of EPS and integrate it to improve the SAT sweeping method. Considering the complementary abilities of SAT and EPS, we design an engine selection heuristic to dynamically choose SAT or EPS in the sweeping process, according to XOR chain density. Our method is further improved by reducing unnecessary engine calls by detecting regularity. Experiments on a benchmark suite from industrial datapath circuits show that our method is much faster than the state-of-the-art CEC tool namely ABC ‘&cec’ on nearly all instances, and is more than 100× faster on 30% of the instances, 1000× faster on 12% of the instances.
With a steady increase in the adoption of cloud storage systems, the client’s data are at risk of being leaked. There are several methods of encrypting data which are quite useful but they lack some of the features o...
详细信息
ISBN:
(数字)9798350388602
ISBN:
(纸本)9798350388619
With a steady increase in the adoption of cloud storage systems, the client’s data are at risk of being leaked. There are several methods of encrypting data which are quite useful but they lack some of the features of today’s sophisticated threats. The methodology used in this research propose an encryption framework known as Obfuscrypt to improve the issues of data privacy as well as confidentiality of data stored in cloud storage systems. Obfuscrypt uses conventional encryption strategies incorporated with obfuscation and post-quantum cryptographic algorithms to provide a complex security plan immune to classic and quantum approaches. Some of the proposed other innovations include the decentralised key management with multi-factor authentication and RBAC-ABE as the fine-grained access control techniques. These features make it possible for only the authorized personnel to be in a position to be in a position of decrypting and retrieving the stored data thereby minimizing the possibility of the data being accessed by unauthorized people. The work also considers the issue of performance efficiency of the cloud storage systems. Similar to other symmetric encryption programs, Obfuscrypt uses light encryption algorithms and brings in to play the hardware acceleration so that it may infuse lesser computational overhead in the process of encryption and decryption. As can be clearly seen from the results, the actual work proves that the proposed framework not only offers a higher level of security but does not affect the system performance to a great extent. Also, the study addresses the post-quantum cryptographic algorithm for making the system resistant to an attack that can be posed by quantum computing systems. With the help of these improved algorithms, Obfuscrypt guarantees the permanent data security in the world of constantly emerging cyber threats.
In various applications in Internet of Things like industrial monitoring, large amounts of floating-point time series data are generated at an unprecedented rate. Efficient compression algorithms can effectively reduc...
In various applications in Internet of Things like industrial monitoring, large amounts of floating-point time series data are generated at an unprecedented rate. Efficient compression algorithms can effectively reduce the size of data, enhance transmission performance and storage efficiency, and simultaneously lower storage costs. Therefore, there is a need for lightweight and efficient stream compression algorithms. In this paper, we propose a novel lossless floating-point data compression algorithm called Ant. The main idea is to encode double-precision floating-point numbers into integer form, calculate the delta between adjacent values, and then convert the delta into unsigned integers. This encoding method effectively reduces storage costs and improves data compression efficiency. Extensive experiments on real-world datasets demonstrate that our algorithm achieves compression speeds at least as fast as state-of-the-art streaming methods, and a 63% relative improvement in average compression rate.
In numerous research areas, anomaly identification is a major problem. Identifying and properly classifying data as anomalous is a challenging task that is resolved in various manners over the years. Different approac...
详细信息
In numerous research areas, anomaly identification is a major problem. Identifying and properly classifying data as anomalous is a challenging task that is resolved in various manners over the years. Different approaches like traditional, supervised, unsupervised, and semi-supervised are used for anomaly detection. In the literature, various machine learning-based anomaly detection algorithms exist. It is challenging to choose one anomaly detection algorithm from the several available algorithms because each algorithm puts forward its good detection performance. In recent years, generative adversarial networks have shown remarkable results for anomaly classification. This paper aims to represent a systematic literature review of generative adversarial network-based approaches for anomaly detection and highlights their pros.
暂无评论