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

Global-and-Local Collaborative Learning for Co-Salient Object Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cong, Runmin Yang, Ning Li, Chongyi Fu, Huazhu Zhao, Yao Huang, Qingming Kwong, Sam The Institute of Information Science Beijing Jiaotong University Beijing100044 China The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China The Department of Computer Science City University of Hong Kong Hong Kong The School of Computer Science and Engineering Nanyang Technological University Singapore A*STAR Singapore The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China The City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

The goal of co-salient object detection (CoSOD) is to discover salient objects that commonly appear in a query group containing two or more relevant images. Therefore, how to effectively extract inter-image correspondence is crucial for the CoSOD task. In this paper, we propose a global-and-local collaborative learning architecture, which includes a global correspondence modeling (GCM) and a local correspondence modeling (LCM) to capture comprehensive inter-image corresponding relationship among different images from the global and local perspectives. Firstly, we treat different images as different time slices and use 3D convolution to integrate all intra features intuitively, which can more fully extract the global group semantics. Secondly, we design a pairwise correlation transformation (PCT) to explore similarity correspondence between pairwise images and combine the multiple local pairwise correspondences to generate the local inter-image relationship. Thirdly, the inter-image relationships of the GCM and LCM are integrated through a global-and-local correspondence aggregation (GLA) module to explore more comprehensive inter-image collaboration cues. Finally, the intra- and inter-features are adaptively integrated by an intra-and-inter weighting fusion (AEWF) module to learn co-saliency features and predict the co-saliency map. The proposed GLNet is evaluated on three prevailing CoSOD benchmark datasets, demonstrating that our model trained on a small dataset (about 3k images) still outperforms eleven state-of-the-art competitors trained on some large datasets (about 8k̴200k images). © 2022, CC BY-NC-SA.

关键词： Convolution

Nucleation and phase transition of decagonal quasicrystals

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhou, Tiejun Zhang, Lei Zhang, Pingwen Shi, An-Chang Jiang, Kai Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Beijing International Center for Mathematical Research Peking University Beijing100871 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China Department of Physics and Astronomy McMaster University HamiltonL8S 4M1 Canada

In this work, we study the nucleation of quasicrystals from liquid or periodic crystals by developing an efficient order-order phase transition algorithm, namely the nullspace-preserving saddle search method. Specifically, we focus on nucleation and phase transitions of the decagonal quasicrystal (DQC) based on the Lifshitz-Petrich model. We present the nucleation path of DQC from the liquid and demonstrate one- and two-stage transition paths between DQC and periodic crystals. We provide a perspective of the group-subgroup phase transition and nucleation rates to understand the nucleation and phase transition mechanisms involving DQC. These results reveal the one-step and stepwise modes of symmetry breaking or recovery in the phase transition from DQC, where the stepwise modes are more probable. Copyright © 2024, The Authors. All rights reserved.

关键词： Quasicrystals

Logical Relation Modeling and Mining in Hyperbolic Space for Recommendation

学校读者我要写书评

暂无评论

Logical Relation Modeling and Mining in Hyperbolic Space for...

International Conference on Data Engineering

作者： Yanchao Tan Hang Lv Zihao Zhou Wenzhong Guo Bo Xiong Weiming Liu Chaochao Chen Shiping Wang Carl Yang College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Institute for Artificial Intelligence University of Stuttgart Stuttgart Germany College of Computer Science Zhejiang University Hangzhou China Department of Computer Science Emory University Atlanta United States

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

The sparse interactions between users and items have aggravated the difficulty of their representations in recommender systems. Existing methods leverage tags to alleviate the sparsity problem but ignore prevalent logical relations among items and tags (e.g., membership, hierarchy, and exclusion), which can be leveraged to enhance the accuracy of modeling user preferences and conducting recommendations. To this end, we propose to extract logical relations among item tags from existing tag taxonomies and exploit the individual strengths of the Poincaré and the Lorentz models in hyperbolic space for logical relation modeling towards enhanced recommendations. Moreover, we find that the logical relations directly extracted from existing tag taxonomies can be inaccurate and coarse. Therefore, we further devise innovative consistency-based and granularity- based weighting mechanisms based on user behavior patterns for data-driven logical relation mining that can be jointly optimized along with recommendations in an end-to-end fashion. Extensive experiments on four real-world benchmark datasets show drastic performance gains brought by our proposed framework, which constantly achieves an average of 8.25% improvement over state-of-the-art competitors regarding both Recall and NDCG metrics. Insightful case studies further demonstrate that our automatically refined logical relations are highly accurate and interpretable.

关键词： Measurement Accuracy Taxonomy Semantics Predictive models Performance gain Linguistics

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3DAD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

PUGAN: Physical Model-Guided Underwater Image Enhancement Using GAN with Dual-Discriminators

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Cong, Runmin Yang, Wenyu Zhang, Wei Li, Chongyi Guo, Chun-Le Huang, Qingming Kwong, Sam Institute of Information Science Beijing Jiaotong University Beijing100044 China School of Control Science and Engineering Shandong University Jinan250061 China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan250061 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China College of Computer Science Nankai University Tianjin300350 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China Department of Computer Science City University of Hong Kong Hong Kong City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

Due to the light absorption and scattering induced by the water medium, underwater images usually suffer from some degradation problems, such as low contrast, color distortion, and blurring details, which aggravate the difficulty of downstream underwater understanding tasks. Therefore, how to obtain clear and visually pleasant images has become a common concern of people, and the task of underwater image enhancement (UIE) has also emerged as the times require. Among existing UIE methods, Generative Adversarial Networks (GANs) based methods perform well in visual aesthetics, while the physical model-based methods have better scene adaptability. Inheriting the advantages of the above two types of models, we propose a physical model-guided GAN model for UIE in this paper, referred to as PUGAN. The entire network is under the GAN architecture. On the one hand, we design a Parameters Estimation subnetwork (Par-subnet) to learn the parameters for physical model inversion, and use the generated color enhancement image as auxiliary information for the Two-Stream Interaction Enhancement subnetwork (TSIE-subnet). Meanwhile, we design a Degradation Quantization (DQ) module in TSIE-subnet to quantize scene degradation, thereby achieving reinforcing enhancement of key regions. On the other hand, we design the Dual-Discriminators for the style-content adversarial constraint, promoting the authenticity and visual aesthetics of the results. Extensive experiments on three benchmark datasets demonstrate that our PUGAN outperforms state-of-the-art methods in both qualitative and quantitative metrics. The code and results can be found from the link of https://***/proj_***. © 2023, CC BY-NC-SA.

关键词： Discriminators

Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Shengbin Wang, Peng Li, Guihui Zhao, Shubin Zhao, Dongyi Wang, Jing Fang, Yuan Dou, Menghan Gu, Yongjian Wu, Yu-Chun Guo, Guo-Ping Origin Quantum Computing Company Limited Anhui Hefei230026 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Anhui Hefei230026 China Intelligent Information Sensing and Processing Lab College of Electronic Engineering Ocean University of China Shandong Qingdao266000 China College of Physics and Optoelectronic Engineering Ocean University of China Shandong Qingdao266100 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China

Great efforts have been dedicated in recent years to explore practical applications for noisy intermediate-scale quantum (NISQ) computers, which is a fundamental and challenging problem in quantum computing. As one of the most promising methods, the variational quantum eigensolver (VQE) has been extensively studied. In this paper, VQE is applied to solve portfolio optimization problems in finance by designing two hardware-efficient Dicke state ansatze that reach a maximum of 2n two-qubit 2 gate depth and n2/4 parameters, with n being the number of qubits used. Both ansatze are partitioning-friendly, allowing for the proposal of a highly scalable quantum/classical hybrid distributed computing (HDC) scheme. Combining simultaneous sampling, problem-specific measurement error mitigation, and fragment reuse techniques, we successfully implement the HDC experiments on a superconducting quantum computer with up to 55 qubits. The simulation and experimental results illustrate that the restricted expressibility of the ansatze, induced by the small number of parameters and limited entanglement, is advantageous for solving classical optimization problems with the cost function of the conditional value-at-risk (CVaR) for the NISQ era and beyond. Furthermore, the HDC scheme shows great potential for achieving quantum advantage in the NISQ era. We hope that the heuristic idea presented in this paper can motivate fruitful investigations in current and future quantum computing paradigms. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization

THE DATABASE AND BENCHMARK FOR THE SOURCE SPEAKER TRACING CHALLENGE 2024

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Ze Lin, Yuke Yao, Tian Suo, Hongbin Zhang, Pengyuan Ren, Yanzhen Cai, Zexin Nishizaki, Hiromitsu Li, Ming School of Computer Science Wuhan University Wuhan China Suzhou Municipal Key Laboratory of Multimodal Intelligent Systems Duke Kunshan University Kunshan China AI Center OPPO Beijing China Key Laboratory of Speech Acoustics and Content Understanding Institute of Acoustics CAS China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University China Center for Language and Speech Processing Johns Hopkins University United States Integrated Graduate School of Medicine Engineering and Agricultural Sciences University of Yamanashi 4-4-37 Takeda Yamanashi Kofu400-8510 Japan

Voice conversion (VC) systems can transform audio to mimic another speaker’s voice, thereby attacking speaker verification (SV) systems. However, ongoing studies on source speaker verification (SSV) are hindered by limited data availability and methodological constraints. This paper presents the Source Speaker Tracking Challenge (SSTC) on STL 2024, which aims to fill the gap in the database and benchmark for the SSV task. In this study, we generate a large-scale converted speech database with 16 common VC methods and train a batch of baseline systems based on the MFA-Conformer architecture. In addition, we introduced a related task called conversion method recognition, with the aim of assisting the SSV task. We expect SSTC to be a platform for advancing the development of the SSV task and provide further insights into the performance and limitations of current SV systems against VC attacks. Further details about SSTC can be found here 1 Copyright © 2024, The Authors. All rights reserved.

关键词： Database systems

Improving the trainability of VQE on NISQ computers for solving portfolio optimization using convex interpolation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Shengbin Li, Guihui Chen, Zhaoyun Wang, Peng Dou, Menghan Zheng, Haiyong Wang, Zhimin Gu, Yongjian Wu, Yu-Chun Guo, Guo-Ping Origin Quantum Computing Company Limited Anhui Hefei230026 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Anhui Hefei230026 China Intelligent Information Sensing and Processing Lab College of Electronic Engineering Ocean University of China Shandong Qingdao266000 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China College of Physics and Optoelectronic Engineering Ocean University of China Shandong Qingdao266100 China

Solving combinatorial optimization problems using variational quantum algorithms (VQAs) represents one of the most promising applications in the NISQ era. However, the limited trainability of VQAs could hinder their scalability to large problem sizes. In this paper, we improve the trainability of variational quantum eigensolver (VQE) by utilizing convex interpolation to solve portfolio optimization. The idea is inspired by the observation that the Dicke state possesses an inherent clustering property. Consequently, the energy of a state with a larger Hamming distance from the ground state intuitively results in a greater energy gap away from the ground state energy in the overall distribution trend. Based on convex interpolation, the location of the ground state can be evaluated by learning the property of a small subset of basis states in the Hilbert space. This enlightens naturally the proposals of the strategies of close-to-solution initialization, regular cost function landscape, and recursive ansatz equilibrium partition. The successfully implementation of a 40-qubit experiment using only 10 superconducting qubits demonstrates the effectiveness of our proposals. Furthermore, the quantum inspiration has also spurred the development of a prototype greedy algorithm. Extensive numerical simulations indicate that the hybridization of VQE and greedy algorithms achieves a mutual complementarity, combining the advantages of both global and local optimization methods. Our proposals can be extended to improve the trainability for solving other large-scale combinatorial optimization problems that are widely used in real applications, paving the way to unleash quantum advantages of NISQ computers in the near future. Copyright © 2024, The Authors. All rights reserved.

关键词： Ground state

OpenAUC: Towards AUC-Oriented Open-Set Recognition

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Zitai Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming SKLOIS Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China BDKM University of Chinese Academy of Sciences China Peng Cheng Laboratory China

Traditional machine learning follows a close-set assumption that the training and test set share the same label space. While in many practical scenarios, it is inevitable that some test samples belong to unknown classes (open-set). To fix this issue, Open-Set Recognition (OSR), whose goal is to make correct predictions on both close-set samples and open-set samples, has attracted rising attention. In this direction, the vast majority of literature focuses on the pattern of open-set samples. However, how to evaluate model performance in this challenging task is still unsolved. In this paper, a systematic analysis reveals that most existing metrics are essentially inconsistent with the aforementioned goal of OSR: (1) For metrics extended from close-set classification, such as Open-set F-score, Youden’s index, and Normalized Accuracy, a poor open-set prediction can escape from a low performance score with a superior close-set prediction. (2) Novelty detection AUC, which measures the ranking performance between close-set and open-set samples, ignores the close-set performance. To fix these issues, we propose a novel metric named OpenAUC. Compared with existing metrics, OpenAUC enjoys a concise pairwise formulation that evaluates open-set performance and close-set performance in a coupling manner. Further analysis shows that OpenAUC is free from the aforementioned inconsistency properties. Finally, an end-to-end learning method is proposed to minimize the OpenAUC risk, and the experimental results on popular benchmark datasets speak to its effectiveness. Project Page: https://***/wang22ti/OpenAUC. © 2022, CC BY.

关键词： Forecasting