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

More observation leads to more clarity: Multi-view collaboration network for camouflaged object detection

学校读者我要写书评

暂无评论

Neurocomputing 2025年 645卷

作者： Wang, Fangyan Jiao, Ge Yue, Guowen College of Computer Science and Technology Hengyang Normal University Hengyang Hunan421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang Normal University Hengyang Hunan421002 China Hunan Engineering Research Center of Cyberspace Security Technology and Applications Hengyang Normal University Hengyang Hunan421002 China

Currently, Camouflaged Object Detection (COD) methods often rely on single-view feature perception, which struggles to fully capture camouflaged objects due to environmental interference such as background clutter, lighting variations, and viewpoint changes. To address this, we propose the multi-view collaboration network (MCNet), inspired by human visual strategies for complex scene analysis. MCNet incorporates multiple perspectives for enhanced feature extraction. The global perception module takes the original, far, and near views, using different large-kernel convolutions and multi-head attention mechanisms for global feature embedding. In parallel, the local perception module processes the tilted, projected, and color-jittered views, extracting fine-grained local features through multi-branch deep convolutions and dilated convolutions. To facilitate deep interaction between global and local features, we introduce the hybrid interactive module, which explores the correlation of multi-view feature information and adaptively fuses features. For feature decoding, the dynamic pyramid shrinkage module integrates dynamic gated convolutions with a pyramid shrinkage mechanism, progressively aggregating semantic features through a hierarchical shrinking strategy and group fusion strategy. Experimental results on popular COD benchmark datasets show that MCNet outperforms 18 state-of-the-art methods. © 2025

关键词： Object detection

Quantum Circuits for the heat equation with physical boundary conditions via Schrödingerization

学校读者我要写书评

暂无评论

Journal of Computational Physics 2025年

作者： Shi Jin Nana Liu Yue Yu School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai 200240 China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai 200240 China School of Mathematics and Computational Science Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan 411105 Hunan China

This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. These equations and/or their discretized forms usually do not evolve via unitary dynamics, thus are not directly suitable for quantum simulation. Boundary conditions (either time-dependent or independent) make the problem more difficult. To tackle this challenge, the Schrödingerization method can be employed, which converts linear partial and ordinary differential equations with non-unitary dynamics into systems of Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into one higher dimension. Despite advancements in Schrödingerization techniques, the explicit implementation of quantum circuits for solving general PDEs, especially with physical boundary conditions, remains underdeveloped. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. One approach utilizes Duhamel’s principle to express the solution in integral form and employs linear combination of unitaries (LCU) for coherent state preparation. Another method applies an augmentation to transform the inhomogeneous problem into a homogeneous one. We then apply the quantum simulation technique from [1] to transform the resulting non-autonomous system to an autonomous system in one higher dimension. We provide detailed implementations of these two methods and conduct a comprehensive complexity analysis in terms of queries to the time evolution input oracle.

关键词：

NONMONOTONE LOCAL MINIMAX METHODS FOR FINDING MULTIPLE SADDLE POINTS

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Wei Xie, Ziqing Yi, Wenfan South China Research Center for Applied Mathematics and Interdisciplinary Studies South China Normal University Guangzhou510631 China Hunan Normal University Hunan Changsha410081 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics School of Mathematics Hunan University Hunan Changsha410082 China

In this paper, by designing a normalized nonmonotone search strategy with the Barzilai-Borwein-type step-size, a novel local minimax method (LMM), which is a globally convergent iterative method, is proposed and analyzed to find multiple (unstable) saddle points of nonconvex functionals in Hilbert spaces. Compared to traditional LMMs with monotone search strategies, this approach, which does not require strict decrease of the objective functional value at each iterative step, is observed to converge faster with less computations. Firstly, based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold, by generalizing the Zhang-Hager (ZH) search strategy in the optimization theory to the LMM framework, a kind of normalized ZH-type nonmonotone step-size search strategy is introduced, and then a novel nonmonotone LMM is constructed. Its feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative sequences. Secondly, in order to speed up the convergence of the nonmonotone LMM, a globally convergent Barzilai-Borwein-type LMM (GBBLMM) is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each iteration. Finally, the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures: one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary conditions. Extensive numerical results indicate that our approach is very effective and speeds up the LMMs *** Codes 65K10, 58E05, 49M37, 35J20 Copyright © 2021, The Authors. All rights reserved.

关键词： Site selection

Dynamically Mitigating Data Discrepancy with Balanced Focal Loss for Replay Attack Detection

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Dou, Yongqiang Yang, Haocheng Yang, Maolin Xu, Yanyan Ke, Dengfeng School of Information Science and Technology Beijing Forestry University Beijing100083 China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China Engineering Research Center for Forestry-oriented Intelligent Information Processing National Forestry and Grassland Administration China

It becomes urgent to design effective anti-spoofing algorithms for vulnerable automatic speaker verification systems due to the advancement of high-quality playback devices. Current studies mainly treat anti-spoofing as a binary classification problem between bonafide and spoofed utterances, while lack of indistinguishable samples makes it difficult to train a robust spoofing detector. In this paper, we argue that for anti-spoofing, it needs more attention for indistinguishable samples over easily-classified ones in the modeling process, to make correct discrimination a top priority. Therefore, to mitigate the data discrepancy between training and inference, we propose D3M, to leverage a balanced focal loss function as the training objective to dynamically scale the loss based on the traits of the sample itself. Besides, in the experiments, we select three kinds of features that contain both magnitude-based and phase-based information to form complementary and informative features. Experimental results on the ASVspoof2019 dataset demonstrate the superiority of the proposed methods by comparison between our systems and top-performing ones. Systems trained with the balanced focal loss perform significantly better than conventional cross-entropy loss. With complementary features, our fusion system with only three kinds of features outperforms other systems containing five or more complex single models by 22.5% for min-tDCF and 7% for EER, achieving a min-tDCF and an EER of 0.0124 and 0.55% respectively. Furthermore, we present and discuss the evaluation results on real replay data apart from the simulated ASVspoof2019 data, indicating that research for anti-spoofing still has a long way to go. Source code, analysis data, and other details are publicly available at https://***/asvspoof/D3M. © 2020, CC BY.

关键词： Speech recognition

Vibration fatigue analysis and research of URV shunt reactor 14

学校读者我要写书评

暂无评论

Vibration fatigue analysis and research of URV shunt reactor

14th IEEE Conference on Industrial Electronics and Applications, ICIEA 2019

作者： Li, Shengmin Zheng, Zhicong Liang, Jining Xiao, Yamin Faculty of Automation and Information Engineering Xi'an University Ot Technology Xi'an710048 China Intelligent Information Processing Shaanxi Key Laboratory of Complex System Control Xi' an710048 China

ISBN: (纸本)9781538694909

Problems of vibration fatigue in UHV reactor is mentioned, comparative analysis of several commonly used fatigue analysis methods, finally, the modal superposition method is used to calculate the structural fatigue caused by vibration. Through analysis of reactor vibration data, the reason for using frequency domain signals as fatigue frequency domain load spectrum to calculate the service life of reactors. In order to perform reactor fatigue analysis, a finite element model of the reactor was first built using ANSYS Workbench finite element integration software, the frequency response function FRF is obtained by harmonic response analysis, and then the vibration time domain signal are transformed into frequency signal as load spectrum input with the power density spectrum, finally, nCode fatigue analysis software is used to estimate the service life of the reactor. © 2019 IEEE.

关键词： Finite element method

Projection methods with linesearch technique for pseudomonotone equilibrium problems and fixed point problems

学校读者我要写书评

暂无评论

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2021年第1期83卷 3-14页

作者： Zhu, Li-Jun Yao, Yonghong Postolache, Mihai The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province North Minzu University Yinchuan750021 China Health Big Data Research Institute of North Minzu University Yinchuan750021 China The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province North Minzu University Yinchuan750021 China Health Big Data Research Institute of North Minzu University Yinchuan750021 China School of Mathematical Sciences Tiangong Uni-versity Tianjin300387 China Center for General Education China Medical University Taichung40402 Taiwan Department of Interior Design Asia University Taichung Taiwan Romanian Academy Gh. Mihoc-C. Iacob Institute of Mathematical Statistics and Applied Mathematics Bucharest050711 Romania University "Politehnica" of Bucharest Department of Mathematics and Informatics Bucharest060042 Romania

In this paper, we discuss pseudomonotone equilibrium problems and fixed point problems in real Hilbert spaces. With the help of linesearch technique, we propose a projection algorithm without any Lipschitz-type condition for solving equilibrium problems and fixed point problems. We show that the constructed algorithm converges strongly to a common element of the investigated problems. © 2021, Politechnica university of Bucharest. All rights reserved.

关键词： Computers

General Greedy De-bias Learning

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Han, Xinzhe Wang, Shuhui Su, Chi Huang, Qingming Tian, Qi The School of Computer Science and Technology 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 Shenzhen518066 China SmartMore Beijing100085 China Huawei Cloud & AI Shenzhen518129 China

Neural networks often make predictions relying on the spurious correlations from the datasets rather than the intrinsic properties of the task of interest, facing with sharp degradation on out-of-distribution (OOD) test data. Existing de-bias learning frameworks try to capture specific dataset bias by annotations but they fail to handle complicated OOD scenarios. Others implicitly identify the dataset bias by special design low capability biased models or losses, but they degrade when the training and testing data are from the same distribution. In this paper, we propose a General Greedy De-bias learning framework (GGD), which greedily trains the biased models and base model. The base model is encouraged to focus on examples that are hard to solve with biased models, thus remaining robust against spurious correlations in the test stage. GGD largely improves models' OOD generalization ability on various tasks, but sometimes over-estimates the bias level and degrades on the in-distribution test. We further re-analyze the ensemble process of GGD and introduce the Curriculum Regularization inspired by curriculum learning, which achieves a good trade-off between in-distribution (ID) and out-of-distribution performance. Extensive experiments on image classification, adversarial question answering, and visual question answering demonstrate the effectiveness of our method. GGD can learn a more robust base model under the settings of both task-specific biased models with prior knowledge and self-ensemble biased model without prior knowledge. Codes are available at https://***/GeraldHan/GGD. Copyright © 2021, The Authors. All rights reserved.

关键词： Curricula

Interference-assisted kaleidoscopic meta-plexer for arbitrary spin-wavefront manipulation

学校读者我要写书评

暂无评论

Light(Science & Applications) 2019年第1期8卷 1141-1150页

作者： He-Xiu Xu Guangwei Hu Ying Li Lei Han Jianlin Zhao Yunming Sun Fang Yuan Guang-Ming Wang Zhi Hao Jiang Xiaohui Ling Tie Jun Cui Cheng-Wei Qiu Department of Electrical and Computer Engineering National University of SingaporeSingapore 117583Singapore Air and Missile Defense College Air force Engineering University710051 Xi’anChina Hunan Provincial Key Laboratory of Intelligent Information Processing and Applications College of Physics and Electronics EngineeringHengyang Normal University421008 HengyangChina School of Natural and Applied Sciences Northwestern Polytechnical University710072 Xi’anChina Advanced Technique Department Key Lab of Aeronautics Computing Technique710075 Xi’anChina State Key Laboratory of Millimeter Waves Southeast University210096 NanjingChina

Achieving simultaneous polarization and wavefront control,especially circular polarization with the auxiliary degree of freedom of light and spin angular momentum,is of fundamental importance in many optical *** are typically undesirable in highly integrated photonic circuits and ***,we propose an interference-assisted metasurface-multiplexer(meta-plexer)that counterintuitively exploits constructive and destructive interferences between hybrid meta-atoms and realizes independent spin-selective wavefront *** kaleidoscopic meta-plexers are experimentally demonstrated via two types of single-layer spinwavefront multiplexers that are composed of spatially rotated anisotropic *** type generates a spinselective Bessel-beam wavefront for spin-down light and a low scattering cross-section for stealth for spin-up *** other type demonstrates versatile control of the vortex wavefront,which is also characterized by the orbital angular momentum of light,with frequency-switchable numbers of beams under linearly polarized wave *** findings offer a distinct interference-assisted concept for realizing advanced multifunctional photonics with arbitrary and independent spin-wavefront features.A variety of applications can be readily anticipated in optical diodes,isolators,and spin-Hall meta-devices without cascading bulky optical elements.

关键词： arbitrary momentum versatile

Private and Robust Distributed Nonconvex Optimization via Polynomial Approximation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： He, Zhiyu He, Jianping Chen, Cailian Guan, Xinping Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China Automatic Control Laboratory ETH Zürich Zürich8092 Switzerland

There has been work that exploits polynomial approximation to solve distributed nonconvex optimization problems involving univariate objectives. This idea facilitates arbitrarily precise global optimization without requiring local evaluations of gradients at every iteration. Nonetheless, there remains a gap between existing guarantees and practical requirements, e.g., privacy preservation and robustness to network imperfections. To fill this gap and keep the above strengths, we propose a Private and Robust Chebyshev-Proxy-based distributed Optimization Algorithm (PR-CPOA). Specifically, to ensure both the accuracy of solutions and the privacy of local objectives, we design a new privacy-preserving mechanism. This mechanism leverages the randomness in blockwise insertions of perturbed vector states and hence provides a stronger privacy guarantee in the scope of (α, β)-data-privacy. Furthermore, to gain robustness against network imperfections, we use the push-sum consensus protocol as a backbone and discuss its specific enhancements. Thanks to the purely consensus-type iterations, we avoid the privacy-accuracy trade-off and the bother of selecting proper step sizes in different settings. We rigorously analyze the accuracy, privacy, and complexity of the proposed algorithm. We show that the advantages brought by introducing polynomial approximation are maintained when all the above requirements exist. © 2021, CC BY-NC-SA.

关键词： Polynomial approximation