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

arXiv 2025年

作者： Liu, Jian Sun, Wei Yang, Hui Deng, Pengchao Liu, Chongpei Sebe, Nicu Rahmani, Hossein Mian, Ajmal National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering School of Robotics State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Hunan University Changsha410082 China Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Xi’an710049 China Department of Information Engineering and Computer Science University of Trento Trento38123 Italy School of Computing and Communications Lancaster University LA1 4YW United Kingdom Department of Computer Science The University of Western Australia WA6009 Australia

Nine-degrees-of-freedom (9-DoF) object pose and size estimation is crucial for enabling augmented reality and robotic manipulation. Category-level methods have received extensive research attention due to their potential for generalization to intra-class unknown objects. However, these methods require manual collection and labeling of large-scale real-world training data. To address this problem, we introduce a diffusion-based paradigm for domain-generalized category-level 9-DoF object pose estimation. Our motivation is to leverage the latent generalization ability of the diffusion model to address the domain generalization challenge in object pose estimation. This entails training the model exclusively on rendered synthetic data to achieve generalization to real-world scenes. We propose an effective diffusion model to redefine 9-DoF object pose estimation from a generative perspective. Our model does not require any 3D shape priors during training or inference. By employing the Denoising Diffusion Implicit Model, we demonstrate that the reverse diffusion process can be executed in as few as 3 steps, achieving near real-time performance. Finally, we design a robotic grasping system comprising both hardware and software components. Through comprehensive experiments on two benchmark datasets and the real-world robotic system, we show that our method achieves state-of-the-art domain generalization performance. Our code will be made public at https://***/CNJianLiu/Diff9D. Copyright © 2025, The Authors. All rights reserved.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Flatbands from Bound states in the Continuum for Orbital Angular Momentum Localization

arXiv

引用

arXiv 2024年

作者： Zhu, Weiwei Zou, Hongyu Ge, Yong Wang, Yin Cheng, Zheyu Wang, Bing-Bing Yuan, Shou-Qi Sun, Hong-Xiang Xue, Haoran Zhang, Baile College of Physics and Optoelectronic Engineering Ocean University of China Qingdao266100 China Research Center of Fluid Machinery Engineering and Technology School of Physics and Electronic Engineering Jiangsu University Zhenjiang212013 China Key Laboratory for Optics Photoelectronics Qingdao266100 China Engineering Research Center of Advanced Marine Physical Instruments and Equipment of MOE Qingdao266100 China Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University Singapore637371 Singapore State Key Laboratory of Acoustics Institute of Acoustics Chinese Academy of Sciences Beijing100190 China Department of Physics The Chinese University of Hong Kong Shatin Hong Kong Centre for Disruptive Photonic Technologies Nanyang Technological University Singapore637371 Singapore

A flatband material is a system characterized by energy bands with zero dispersion, allowing for the compact localization of wavefunctions in real space. This compact localization significantly enhances inter-particle correlations and light-matter interactions, leading to notable advancements such as fractional Chern insulators in condensed matter systems and flat-band lasers in photonics. Previous flatband platforms, including twisted bilayer graphene and artificial kagome/Lieb lattices, typically focused on nondegenerate flatbands, lacking access to the high degeneracy that can facilitate the localization of orbital angular momentum (OAM). Here, we propose a general framework to construct highly degenerate flatbands from bound states in the continuum (BICs)–a concept originating from quantum theory but significantly developed in photonics and acoustics in recent years. The degeneracy of flatbands is determined by the number of BICs within each unit cell in a lattice. We experimentally validate this approach in two-dimensional (2D) and three-dimensional (3D) acoustic crystals, demonstrating flatbands with 4-fold and 12-fold degeneracies, respectively. The high degeneracy provides sufficient internal degrees of freedom, enabling the selective excitation of localized OAM at any position in any direction. Our results pave the way for exploring BIC-constructed flatbands and their localization properties. Copyright © 2024, The Authors. All rights reserved.

关键词： Continuum mechanics

来源：评论

学校读者我要写书评

暂无评论

Tightness and equivalence of semidefinite relaxations for mimo detection

arXiv

引用

arXiv 2021年

作者： Jiang, Ruichen Liu, Ya-Feng Bao, Chenglong Jiang, Bo Department of Electronic Engineering Tsinghua University Beijing100084 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Yau Mathematical Sciences Center Tsinghua University Beijing100084 China School of Mathematical Sciences Key Laboratory for NSLSCS of Jiangsu Province Nanjing Normal University Nanjing210023 China

The multiple-input multiple-output (MIMO) detection problem, a fundamental problem in modern digital communications, is to detect a vector of transmitted symbols from the noisy outputs of a fading MIMO channel. The maximum likelihood detector can be formulated as a complex least-squares problem with discrete variables, which is NP-hard in general. Various semidefinite relaxation (SDR) methods have been proposed in the literature to solve the problem due to their polynomial-time worst-case complexity and good detection error rate performance. In this paper, we consider two popular classes of SDR-based detectors and study the conditions under which the SDRs are tight and the relationship between different SDR models. For the enhanced complex and real SDRs proposed recently by Lu et al., we refine their analysis and derive the necessary and sufficient condition for the complex SDR to be tight, as well as a necessary condition for the real SDR to be tight. In contrast, we also show that another SDR proposed by Mobasher et al. is not tight with high probability under mild conditions. Moreover, we establish a general theorem that shows the equivalence between two subsets of positive semidefinite matrices in different dimensions by exploiting a special "separable" structure in the constraints. Our theorem recovers two existing equivalence results of SDRs defined in different settings and has the potential to find other applications due to its *** Codes 90C22, 90C20, 90C46, 90C27 Copyright © 2021, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Efficient CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems with PSK Modulation

arXiv

引用

arXiv 2021年

作者： Wu, Zheyu Jiang, Bo Liu, Ya-Feng Shao, Mingjie Dai, Yu-Hong The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Ministry of Education Key Laboratory for NSLSCS School of Mathematical Sciences Nanjing Normal University Nanjing210023 China The School of Information Science and Engineering Shandong University Qingdao China

In this paper, we consider the one-bit precoding problem for the multiuser downlink massive multiple-input multiple-output (MIMO) system with phase shift keying (PSK) modulation. We focus on the celebrated constructive interference (CI)-based problem formulation. We first establish the NP-hardness of the problem (even in the single-user case), which reveals the intrinsic difficulty of globally solving the problem. Then, we propose a novel negative 1 penalty model for the considered problem, which penalizes the one-bit constraint into the objective by a negative 1-norm term, and show the equivalence between (global and local) solutions of the original problem and the penalty problem when the penalty parameter is sufficiently large. We further transform the penalty model into an equivalent min-max problem and propose an efficient alternating proximal/projection gradient descent ascent (APGDA) algorithm for solving it, which performs a proximal gradient decent over one block of variables and a projection gradient ascent over the other block of variables alternately. The APGDA algorithm enjoys a low per-iteration complexity and is guaranteed to converge to a stationary point of the min-max problem and a local minimizer of the penalty problem. To further reduce the computational cost, we also propose a low-complexity implementation of the APGDA algorithm, where the values of the variables will be fixed in later iterations once they satisfy the one-bit constraint. Numerical results show that, compared to the state-of-the-art CI-based algorithms, both of the proposed algorithms generally achieve better bit-error-rate (BER) performance with lower computational cost. Copyright © 2021, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Malware homology identification based on a gene perspective

引用

Frontiers of Information Technology & Electronic engineering 2019年第6期20卷 801-815页

作者： Bing-lin ZHAO Zheng SHAN Fu-dong LIU Bo ZHAO Yi-hang CHEN Wen-jie SUN State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001 China Georg-August-University of Goettingen Goettingen 37077 Germany

Malware homology identification is important in attacking event tracing, emergency response scheme generation, and event trend prediction. Current malware homology identification methods still rely on manual analysis, which is inefficient and cannot respond quickly to the outbreak of attack events. In response to these problems, we propose a new malware homology identification method from a gene perspective. A malware gene is represented by the subgraph, which can describe the homology of malware families. We extract the key subgraph from the function dependency graph as the malware gene by selecting the key application programming interface(API) and using the community partition algorithm. Then, we encode the gene and design a frequent subgraph mining algorithm to find the common genes between malware families. Finally, we use the family genes to guide the identification of malware based on homology. We evaluate our method with a public dataset, and the experiment results show that the accuracy of malware classification reaches 97% with high efficiency.

关键词： Malware classification Gene perspective Dependency graph Homology analysis

来源：评论

学校读者我要写书评

暂无评论

Defense Against Adversarial Faces at the Source: Strengthened Faces Based on Hidden Disturbances

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Li, Shuangliang Wang, Jinwei Wu, Hao Zhang, Jiawei Cheng, Xin Luo, Xiangyang Ma, Bin School of Software Nanjing Universityof Information Science and Technology Nanjing210044 China College of Cryptology and Cyber Science Nankai University Tianjing300073 China State Key Laboratory of Mathemat-ical Engineering and Advanced Computing Zhengzhou450002 China School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing400065 China School of Computer Science Nanjing University of Information Science and Technology Nanjing210044 China School of Cyber Security Qilu University of Technology Shandong Academy of Sciences Shandong250353 China

Face Recognition (FR) systems, while widely used across various sectors, are vulnerable to adversarial attacks, particularly those based on deep neural networks. Despite existing efforts to enhance the robustness of FR models, they still face the risk of secondary adversarial attacks. To address this, we propose a novel approach employing "strengthened face" with preemptive defensive perturbations. Strengthened face ensures original recognition accuracy while safeguarding FR systems against secondary attacks. In the white-box scenario, the strengthened face utilizes gradient-based and optimization-based methods to minimize feature representation differences between face pairs. For the black-box scenario, we propose Shielded Gradient Sign Descent (SGSD) to optimize the gradient update direction of strengthened faces, ensuring the transferability and effectiveness against unknown adversarial attacks. Experimental results demonstrate the efficacy of strengthened faces in defending against adversarial faces without compromising the performance of FR models or face image visual quality. Moreover, SGSD outperforms conventional methods, achieving an average performance improvement of 4% in transferability across different attack intensities. © 2020 IEEE.

关键词： adversarial attacks face recognition facial protection

来源：评论

学校读者我要写书评

暂无评论

Event detection and evolution in multi-lingual social streams

引用

Frontiers of Computer Science 2020年第5期14卷 213-227页

作者： Yaopeng Liu Hao Peng Jianxin Li Yangqiu Song Xiong Li Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityBeijing100083China State Key Laboratory of Software Development Environment Beihang UniversityBeijing100083China Department of Computer Science and Engineering HKUSTHong Kong99907China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing100029China

Real-life events are emerging and evolving in social and news *** methods have succeeded in capturing designed features of monolingual events,but lack of interpretability and multi-lingual *** this end,we propose a multi-lingual event mining model,namely MLEM,to automatically detect events and generate evolution graph in multilingual hybrid-length text streams including English,Chinese,French,German,Russian and ***,we merge the same entities and similar phrases and present multiple similarity measures by incremental word2vec *** propose an 8-tuple to describe event for correlation analysis and evolution graph *** evaluate the MLEM model using a massive human-generated dataset containing real world *** results show that our new model MLEM outperforms the baseline method both in efficiency and effectiveness.

关键词： event detection event evolution stream processing multi-lingual anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Potential Indicator for Continuous Emotion Arousal by Dynamic Neural Synchrony 4th

Potential Indicator for Continuous Emotion Arousal by Dyna...

引用

4th International Workshop on Human Brain and Artificial Intelligence, HBAI 2024

作者： Pan, Guandong Wu, Zhaobang Yang, Yaqian Wang, Xin Liu, Longzhao Zheng, Zhiming Tang, Shaoting School of Computer Science and Engineering Beihang University Beijing100191 China Institute of Artificial Intelligence Beihang University Beijing100191 China Key Laboratory of Mathematics Informatics and Behavioral Semantics Beihang University Beijing100191 China Institute of Medical Artificial Intelligence Binzhou Medical University Yantai264003 China Zhongguancun Laboratory Beijing100094 China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang University Beijing100191 China PengCheng Laboratory Shenzhen518055 China State Key Lab of Software Development Environment Beihang University Beijing100191 China

ISBN: (纸本)9789819640003

The need for automatic and high-quality emotion annotation is paramount in applications such as continuous emotion recognition and video highlight detection, yet achieving this through manual human annotations is challenging. Inspired by inter-subject correlation (ISC) utilized in neuroscience, this study introduces a novel Electroencephalography (EEG) based ISC methodology that leverages a single-electrode and feature-based dynamic approach. Our contributions are three folds: Firstly, we reidentify two potent emotion features suitable for classifying emotions-first-order difference (FD) an differential entropy (DE). Secondly, through the use of overall correlation analysis, we demonstrate the heterogeneous synchronized performance of electrodes. This performance aligns with neural emotion patterns established in prior studies, thus validating the effectiveness of our approach. Thirdly, by employing a sliding window correlation technique, we showcase the significant consistency of dynamic ISCs across various features or key electrodes in each analyzed film clip. Our findings indicate the method’s reliability in capturing consistent, dynamic shared neural synchrony among individuals, triggered by evocative film stimuli. This underscores the potential of our approach to serve as an indicator of continuous human emotion arousal. The implications of this research are significant for advancements in affective computing and the broader neuroscience field, suggesting a streamlined and effective tool for emotion analysis in real-world applications. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Electroencephalography (EEG) Emotion Annotation Inter-subject Correlation

来源：评论

学校读者我要写书评

暂无评论

Non-aligned double JPEG compression detection based on refined Markov features in QDCT domain

Non-aligned double JPEG compression detection based on refin...

引用

作者： Wang, Jinwei Huang, Wei Luo, Xiangyang Shi, Yun-Qing Jha, Sunil Kr. School of Computer and Software Nanjing University of Information Science and Technology NanjingJiangsu China Nanjing University of Information Science and Technology Nanjing China Shanxi Key Laboratory of Network and System Security Xidian University Shanxi China State Key Laboratory of Mathematical Engineering and Advanced Computing ZhengzhouHenan China New Jersey Institute of Technology NewarkNJ United States

Due to the widespread use of the JPEG format, non-aligned double JPEG (NA-DJPEG) compression is very common in image tampering. Therefore, non-aligned double JPEG compression detection has attracted significant attention in digital forensics in recent years. In most of the previous detection algorithms, grayscale images are used directly, or color images are first converted into grayscale images and then processed. However, it is worth noting that most tampered images are color images. To make full use of the color information in images, a detection algorithm, which uses color images directly, is put forward in this paper. The algorithm based on refined Markov in quaternion discrete cosine transform (QDCT) domain is proposed for NA-DJPEG compression detection. Firstly, color information of a given JPEG image is extracted from blocked images to construct quaternion, and then block image QDCT coefficient matrices, including amplitude and three angles (ψ, , and θ) can be obtained. Secondly, the refined Markov features are generated from the transition probability matrix in the corresponding refinement process. Our proposed refinement method not only reduces redundant features but also makes the acquired features more efficient in detection. Therefore, the refined Markov features can not only capture the intra-block correlation between block QDCT coefficients but also improve computing efficiency in real-time. Finally, support vector machine (SVM) method is employed for NA-DJPEG compression detection. The experiment results demonstrate that the proposed algorithm not only make use of color information of images, but also can achieve better detection performance with small size images (i.e., 64 × 64) outperforming state-of-the-art detection methods tested on the same dataset. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

A global optimization approach for multi-marginal optimal transport problems with Coulomb cost

arXiv

引用

arXiv 2021年

作者： Hu, Yukuan Chen, Huajie Liu, Xin State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences China School of Mathematical Sciences Beijing Normal University China

In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding the strongly correlated quantum systems. With a Monge-like ansatz, the orginal high-dimensional problems are transferred into mathematical programmings with generalized complementarity constraints, and thus the curse of dimensionality is surmounted. However, the latter ones are themselves hard to deal with from both theoretical and practical perspective. Moreover in the presence of nonconvexity, brute-force searching for global solutions becomes prohibitive as the problem size grows large. To this end, we propose a global optimization approach for solving the nonconvex optimization problems, by exploiting an efficient proximal block coordinate descent local solver and an initialization subroutine based on hierarchical grid refinements. We provide numerical simulations on some typical physical systems to show the efficiency of our approach. The results match well with both theoretical predictions and physical intuitions, and give the first visualization of optimal transport maps for some two dimensional *** Codes 81V05 (Primary) 49M37, 65K05, 90C26, 90C30 (Secondary) Copyright © 2021, The Authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：