检索结果-内蒙古大学图书馆

Domain generalization for document authentication against practical recapturing attacks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Chen, Changsheng Zhang, Shuzheng Lan, Fengbo Huang, Jiwu The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

Recapturing attack can be employed as a simple but effective anti-forensic tool for digital document images. Inspired by the document inspection process that compares a questioned document against a reference sample, we proposed a document recapture detection scheme by employing Siamese network to compare and extract distinct features in a recapture document image. The proposed algorithm takes advantages of both metric learning and image forensic techniques. Instead of adopting Euclidean distance-based loss function, we integrate the forensic similarity function with a triplet loss and a normalized softmax loss. After training with the proposed triplet selection strategy, the resulting feature embedding clusters the genuine samples near the reference while pushes the recaptured samples apart. In the experiment, we consider practical domain generalization problems, such as the variations in printing/imaging devices, substrates, recapturing channels, and document types. To evaluate the robustness of different approaches, we benchmark some popular off-the-shelf machine learning-based approaches, a state-of-the-art document image detection scheme, and the proposed schemes with different network backbones under various experimental protocols. Experimental results show that the proposed schemes with different network backbones have consistently outperformed the state-of-the-art approaches under different experimental settings. Specifically, under the most challenging scenario in our experiment, i.e., evaluation across different types of documents that produced by different devices, we have achieved less than 5.00% APCER (Attack Presentation Classification Error Rate) and 5.56% BPCER (Bona Fide Presentation Classification Error Rate) by the proposed network with ResNeXt101 backbone at 5% BPCER decision *** Codes 94A08 Copyright © 2021, The Authors. All rights reserved.

关键词： Feature extraction

LCCG: A Locality-Centric Hardware Accelerator for High Throughput of Concurrent Graph Processing

学校读者我要写书评

暂无评论

LCCG: A Locality-Centric Hardware Accelerator for High Throu...

Supercomputing Conference

作者： Jin Zhao Yu Zhang Xiaofei Liao Liaang He Binzsheng He Haikun Liu Hai Jin Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China University of Warwick United Kingdom National University of Singapore Singapore

ISBN: (数字)9781450384421

ISBN: (纸本)9781665483902

In modern data centers, massive concurrent graph processing jobs are being processed on large graphs. However, existing hardware/-software solutions suffer from irregular graph traversal and intense resource contention. In this paper, we propose LCCG, a Locality-entric programmable accelerator that augments the many-core processor for achieving higher throughput of Concurrent Graph processing jobs. Specifically, we develop a novel topology-aware execution approach into the accelerator design to regularize the graph traversals for multiple jobs on-the-fly according to the graph topology, which is able to fully consolidate the graph data accesses from concurrent jobs. By reusing the same graph data among more jobs and coalescing the accesses of the vertices' states for these jobs, LCCG can improve the core utilization. We conduct extensive experiments on a simulated 64-core processor. The results show that LCCG improves the throughput of the cutting-edge software system by 11.3~23.9 times with only 0.5% additional area cost. More-over, LCCG gains the speedups of 4.7~10.3, 5.5~13.2, and 3.8~8.4 times over state-of-the-art hardware graph processing accelerators (namely, HATS, Minnow, and PHI, respectively).

关键词： data centers Costs High performance computing Throughput Software systems Topology Hardware acceleration

Deep learning-based forgery attack on document images

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhao, Lin Chen, Changsheng Huang, Jiwu the Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

With the ongoing popularization of online services, the digital document images have been used in various applications. Meanwhile, there have emerged some deep learning-based text editing algorithms which alter the textual information of an image in an end-to-end fashion. In this work, we present a low-cost document forgery algorithm by the existing deep learning-based technologies to edit practical document images. To achieve this goal, the limitations of existing text editing algorithms towards complicated characters and complex background are addressed by a set of network design strategies. First, the unnecessary confusion in the supervision data is avoided by disentangling the textual and background information in the source images. Second, to capture the structure of some complicated components, the text skeleton is provided as auxiliary information and the continuity in texture is considered explicitly in the loss function. Third, the forgery traces induced by the text editing operation are mitigated by some post-processing operations which consider the distortions from the print-and-scan channel. Quantitative comparisons of the proposed method and the exiting approach have shown the advantages of our design by reducing the about 2/3 reconstruction error measured in MSE, improving reconstruction quality measured in PSNR and in SSIM by 4 dB and 0.21, respectively. Qualitative experiments have confirmed that the reconstruction results of the proposed method are visually better than the existing approach in both complicated characters and complex texture. More importantly, we have demonstrated the performance of the proposed document forgery algorithm under a practical scenario where an attacker is able to alter the textual information in an identity document using only one sample in the target domain. The forged-and-recaptured samples created by the proposed text editing attack and recapturing operation have successfully fooled some existing document authenticat

关键词： Textures

Source-free domain adaptation via avatar prototype generation and adaptation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Qiu, Zhen Zhang, Yifan Lin, Hongbin Niu, Shuaicheng Liu, Yanxia Du, Qing Tan, Mingkui School of Software Engineering South China University of Technology School of Computing National University of Singapore Singapore Key Laboratory of Big Data and Intelligent Robot Ministry of Education Pazhou Laboratory

We study a practical domain adaptation task, called source-free unsupervised domain adaptation (UDA) problem, in which we cannot access source domain data due to data privacy issues but only a pre-trained source model and unlabeled target data are available. This task, however, is very difficult due to one key challenge: the lack of source data and target domain labels makes model adaptation very challenging. To address this, we propose to mine the hidden knowledge in the source model and exploit it to generate source avatar prototypes (i.e., representative features for each source class) as well as target pseudo labels for domain alignment. To this end, we propose a Contrastive Prototype Generation and Adaptation (CPGA) method. Specifically, CPGA consists of two stages: (1) prototype generation: by exploring the classification boundary information of the source model, we train a prototype generator to generate avatar prototypes via contrastive learning. (2) prototype adaptation: based on the generated source prototypes and target pseudo labels, we develop a new robust contrastive prototype adaptation strategy to align each pseudo-labeled target data to the corresponding source prototypes. Extensive experiments on three UDA benchmark datasets demonstrate the effectiveness and superiority of the proposed method. Copyright © 2021, The Authors. All rights reserved.

关键词： data privacy

ScalaBFS: A scalable BFS accelerator on HBM-enhanced FPGAs

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Kexin Liu, Chenhao Shao, Zhiyuan Wang, Zeke Wu, Minkang Chen, Jiajie Liao, Xiaofei Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan30074 China Collaborative Innovation Center of Artificial Intelligence Zhejiang University China

High Bandwidth Memory (HBM) provides massive aggregated memory bandwidth by exposing multiple memory channels to the processing units. To achieve high performance, an accelerator built on top of an FPGA configured with HBM (i.e., FPGA-HBM platform) needs to scale its performance according to the available memory channels. In this paper, we propose an accelerator for BFS (Breadth-First Search) algorithm, named as ScalaBFS, that builds multiple processing elements to sufficiently exploit the high bandwidth of HBM to improve efficiency. We implement the prototype system of ScalaBFS and conduct BFS in both real-world and synthetic scale-free graphs on Xilinx Alveo U280 FPGA card real hardware. The experimental results show that ScalaBFS scales its performance almost linearly according to the available memory pseudo channels (PCs) from the HBM2 subsystem of U280. By fully using the 32 PCs and building 64 processing elements (PEs) on U280, ScalaBFS achieves a performance up to 19.7 GTEPS (Giga Traversed Edges Per Second). When conducting BFS in sparse real-world graphs, ScalaBFS achieves equivalent GTEPS to Gunrock running on the state-of-art Nvidia V100 GPU that features 64-PC HBM2 (twice memory bandwidth than U280). Copyright © 2021, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

Robust Self-Expression Learning with Adaptive Noise Perception

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Wang, Yangbo Zhou, Jie Lu, Jianglin Wan, Jun Gao, Can Lin, Qingshui College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China SMILE Lab Department of ECE College of Engineering Northeastern University Boston02115 United States School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan430073 China Basic Teaching Department Liaoning Technical University Huludao125105 China

Self-expression learning methods often obtain a coefficient matrix to measure the similarity between pairs of samples. However, directly using the raw data to represent each sample under the self-expression framework may not be ideal, as noise points are inevitably involved in the process of representing clean samples. To address this issue, this work proposes a novel self-expression model called robust Self-Expression learning with adaptive Noise Perception (SENP). SENP decomposes each sample into a clean part and a noisy part, and samples with large self-expression losses can be recognized as the noise points. A reliable coefficient matrix can then be learned by using only the clean points to reconstruct the clean part of each sample. By simultaneously detecting the noisy part of each sample and noise points, and adaptively mitigating their negative impacts, the representative ability of the generated coefficient matrix is improved. Moreover, inspired by the solution of non-negative matrix factorization (NMF), an effective algorithm is formed to optimize SENP. Extensive experiments on well-known benchmark datasets demonstrate the superiority of SENP compared to several state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

Unsupervised feature selection via self-paced learning and low-redundant regularization

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Weiyi Chen, Hongmei Li, Tianrui Wan, Jihong Sang, Binbin School of Computing and Artificial Intelligence Southwest Jiaotong University China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University China

Much more attention has been paid to unsupervised feature selection nowadays due to the emergence of massive unlabeled data. The distribution of samples and the latent effect of training a learning method using samples in more effective order need to be considered so as to improve the robustness of the method. Self-paced learning is an effective method considering the training order of samples. In this study, an unsupervised feature selection is proposed by integrating the framework of self-paced learning and subspace learning. Moreover, the local manifold structure is preserved and the redundancy of features is constrained by two regularization terms. L2,1/2-norm is applied to the projection matrix, which aims to retain discriminative features and further alleviate the effect of noise in the data. Then, an iterative method is presented to solve the optimization problem. The convergence of the method is proved theoretically and experimentally. The proposed method is compared with other state of the art algorithms on nine real-world datasets. The experimental results show that the proposed method can improve the performance of clustering methods and outperform other compared algorithms. Copyright © 2021, The Authors. All rights reserved.

关键词： Iterative methods

Understanding the Long-Distance Travel Mobility of Passengers Based on big Railway data: Travel Network and Motif Perspectives

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Xu, Jin Song, Haonan Lu, Zhaoyang Department of Information System & Operation Management School of Economics and Management Southwest Jiaotong University Sichuan Chengdu China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Sichuan Chengdu China Service Science and Innovation Key Laboratory of Sichuan Province Sichuan Chengdu China

With the booming construction of new railway lines and stations in China, the number of railway passengers is increasing. The large railway population shows certain mobility characteristics that we are interested in clarifying. Based on the theory of complex networks, this paper proposes a novel method to identify travel patterns from big railway data, which associates travel motifs with travel networks. This paper derives some meaningful results from the data analysis of more than three million railway travel records of a city in China. These results illustrate that higher motif complexity leads to a narrower travel radius for motif-based subnets. The higher the stability of the travel sequence is, the shorter the average length of the sequence. Four types of travel patterns are identified and classified by analyzing the motif of travel activities, i.e., labor, tourism, surrounding and commuting. The methodology and findings presented in this paper contribute to a better understanding of the long-distance travel mobility of railway passengers. The method designed in this paper can also be used to analyze traffic data from airlines, buses, subways, etc. © 2022, The Authors. All rights reserved.

关键词： Complex networks

CKG: Dynamic Representation Based on Context and Knowledge Graph

学校读者我要写书评

暂无评论

CKG: Dynamic Representation Based on Context and Knowledge G...

International Conference on Pattern Recognition

作者： Xunzhu Tang Tiezhu Sun Rujie Zhu Shi Wang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Momenta Suzhou China University of Central Florida Orlando FL USA Institute of Computing Technology Chinese Academy beijing China

Recently, neural language representation models pre-trained on large corpus can capture rich co-occurrence information and be fine-tuned in downstream tasks to improve the performance. As a result, they have achieved state-of-the-art results in a large range of language tasks. However, there exists other valuable semantic information such as similar, opposite, or other possible meanings in external knowledge graphs (KGs). We argue that entities in KGs could be used to enhance the correct semantic meaning of language sentences. In this paper, we propose a new method CKG: Dynamic Representation Based on Context and Knowledge Graph. On the one side, CKG can extract rich semantic information of large corpus. On the other side, it can make full use of inside information such as co-occurrence in large corpus and outside information such as similar entities in KGs. We conduct extensive experiments on a wide range of tasks, including QQP, MRPC, SST-5, SQuAD, CoNLL 2003, and SNLI. The experiment results show that CKG achieves SOTA 89.2 on SQuAD compared with SAN (84.4), ELMo (85.8), and BERTBase (88.5).

关键词： Semantics data mining Task analysis Context modeling