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

International Conference on Pattern Recognition

作者： Youhan Fang Shiguang Shan Hong Chang Xilin Chen Wen Gao Chinese Academy of Sciences Beijing China Digital Media Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing CAS Beijing China Digital Media Institute Peking University Beijing China

ISBN: (纸本)9781424421749

In this paper, we propose a non-parametric discriminant analysis method (no assumption on the distributions of classes), called Parzen discriminant analysis (PDA). Through a deep investigation on the non-parametric density estimation, we find that minimizing/maximizing the distances between each data sample and its nearby similar/dissimilar samples is equivalent to minimizing an upper bound of the Bayesian error rate. Based on this theoretical analysis, we define our criterion as maximizing the average local dissimilarity scatter with respect to a fixed average local similarity scatter. All local scatters are calculated in fixed size local regions, resembling the idea of Parzen estimation. Experiments in UCI machine learning database show that our method impressively outperforms other related neighbor based non-parametric methods.

关键词： Error analysis Scattering Upper bound Linear discriminant analysis information analysis Bayesian methods Gaussian distribution Personal digital assistants Content addressable storage Performance analysis

来源：评论

学校读者我要写书评

暂无评论

No-Reference Stereoscopic Image Quality Assessment Based on Binocular Collaboration

SSRN

引用

SSRN 2024年

作者： Guo, Wenzhong Wang, Hanling Ke, Xiao Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou University Fuzhou350116 China

Stereoscopic images usually consist of a left view, a right view, and depth information. Stereoscopic/3D image quality assessment (SIQA) is often more challenging compared to 2D-IQA due to the usual scene differences between left and right views and the complexity of the binocular vision fusion process. To address the problem of quality prediction bias of multi-distortion images, we investigated the visual physiology and the processing of visual information by the primary visual cortex of the human brain and proposed a no-reference stereoscopic image quality evaluation method. The method mainly includes an innovative end-to-end NR-SIQA neural network with a picture patch generation algorithm. The algorithm generates a saliency map by fusing the left and right views and then guides the image cropping in the database based on the saliency map. The proposed models are validated and compared based on publicly available databases. The results show that the model and algorithm together outperform the state-of-the-art NR-SIQA metric in the LIVE 3D database and the WIVC 3D database, and have excellent results in the specific noise metric. The model generalization experiments demonstrate a certain degree of generality of our proposed model. © 2024, The Authors. All rights reserved.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive generic learning for face recognition from a single sample per person

Adaptive generic learning for face recognition from a single...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yu Su Shiguang Shan Xilin Chen Wen Gao School of Computer Science and Technology Harbin Institute of Technology China Digital Media Research Center Institute of Computing Technology CAS China Key Laboratory of Intelligent Information Processing Chinese Academy and Sciences China Institute for Digital Media Peking University China

Real-world face recognition systems often have to face the single sample per person (SSPP) problem, that is, only a single training sample for each person is enrolled in the database. In this case, many of the popular face recognition methods fail to work well due to the inability to learn the discriminatory information specific to the persons to be identified. To address this problem, in this paper, we propose an Adaptive Generic Learning (AGL) method, which adapts a generic discriminant model to better distinguish the persons with single face sample. As a specific implementation of the AGL, a Coupled Linear Representation (CLR) algorithm is proposed to infer, based on the generic training set, the within-class scatter matrix and the class mean of each person given its single enrolled sample. Thus, the traditional Fisher's Linear Discriminant (FLD) can be applied to SSPP task. Experiments on the FERET and a challenging passport face database show that the proposed method can achieve better results compared with other common solutions to the SSPP problem.

关键词： Face recognition Principal component analysis Linear discriminant analysis Computer science Content addressable storage Laboratories Deductive databases information processing Scattering Image databases

来源：评论

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for Data Consistency

A Time-Efficient Distributed Constant Conditional Functional...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy Data preprocessing Software algorithms Distributed databases Parallel processing Software Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

research on patent recommendation method based on graph neural network

Research on patent recommendation method based on graph neur...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Enchao Zhang Weidong Liu Shi Liu Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

Intellectual property transactions have shown a strong growth momentum in recent years, but the patent transaction market has been plagued by the matching degree of consumers and sellers, resulting in frequent problems such as low patent transformation efficiency and poor transaction quality. This paper proposes a method of recommending patents to consumers by experts to improve the environment of patent transactions. Through the analysis of the past transaction information of the patent, the effective path information of the target is extracted. The graph neural network is used to describe the characteristics and semantics among experts, patents and consumers, and then capture the potential weight among them through the common attention mechanism, and then dynamically integrate them to predict the occurrence of recommendation behavior. The paper makes reasonable use of social information and expert information in the transaction, which significantly improves the rationality and accuracy of expert recommendation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring Patent Transformation Event: Forecasting Patent Transfer Time

Exploring Patent Transformation Event: Forecasting Patent Tr...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jinchen Huo Weidong Liu Yang Li Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Combining Kernelized Autoencoding and Centroid Prediction for Dynamic Multi-objective Optimization

arXiv

引用

arXiv 2023年

作者： Hou, Zhanglu Zou, Juan Ruan, Gan Liu, Yuan Xia, Yizhang Hunan Engineering Research Center of Intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China CERCIA School of Computer Science University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom

Evolutionary algorithms face significant challenges when dealing with dynamic multi-objective optimization because Pareto optimal solutions and/or Pareto optimal fronts change. This paper proposes a unified paradigm, which combines the kernelized autoncoding evolutionary search and the centriod-based prediction (denoted by KAEP), for solving dynamic multi-objective optimization problems (DMOPs). Specifically, whenever a change is detected, KAEP reacts effectively to it by generating two subpopulations. The first subpoulation is generated by a simple centriod-based prediction strategy. For the second initial subpopulation, the kernel autoencoder is derived to predict the moving of the Pareto-optimal solutions based on the historical elite solutions. In this way, an initial population is predicted by the proposed combination strategies with good convergence and diversity, which can be effective for solving DMOPs. The performance of our proposed method is compared with five state-of-the-art algorithms on a number of complex benchmark problems. Empirical results fully demonstrate the superiority of our proposed method on most test instances. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Robust and discriminative image authentication based on sparse coding

Robust and discriminative image authentication based on spar...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Luntian Mou Tiejun Huang Yonghong Tian Shiguo Lian Xilin Chen Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China Institute of Digital Media Peking University Beijing China France Telecom Research and Development Center (Beijing) Beijing China

Image authentication is usually approached by checking the preservation of some invariant features, which are expected to be both robust and discriminative so that content-preserving operations are accepted while content-altering manipulations are rejected. However, most of existing features have not obtained convincing performance due to insufficiency of experiments and over biasing of robustness. Motivated by the sparse coding strategy discovered in primary visual cortex, we explore the possibility of using sparse coding coefficients for image authentication. Through extensive experiments, we discover that the proposed feature bears great discrimination as well as robustness, which indicates the effectiveness of sparse coding as a new invariant feature for image authentication.

关键词： Authentication Image coding Robustness Feature extraction Discrete cosine transforms Encoding Visualization

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Multi-Cloud Storage Data Consistency Verification Scheme

A Blockchain-Based Multi-Cloud Storage Data Consistency Veri...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Feiyu Wang Jian-tao Zhou Hao Wang Xu Guo College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

Users worldwide widely use cloud storage because of its efficiency, convenience, and high availability. Multi-cloud storage is usually selected to ensure the high availability of data. Unfortunately, when data is migrated and replicated between multi-cloud data centers, it is not easy to guarantee data con-sistency. This paper proposes an efficient, secure, and new data consistency verification scheme using blockchain technology. In order to reduce the computation and communication overhead in the verification process, our scheme uses encrypted tags to build Merkle hash tree to generate unique and lightweight verification proofs and does not use third-party auditors. The final theoretical and experimental analysis shows that our scheme has higher security and a faster verification process in multi-cloud storage.

关键词： Cloud computing Data centers Costs Blockchains Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

Enhanced Second-Harmonic Generation Driven by Dual-Quasi Bound States in the Continuum

Enhanced Second-Harmonic Generation Driven by Dual-Quasi Bou...

引用

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Yuhang Liu Xingang Ren Kaikun Niu Zhixiang Huang School of Electronic and Information Engineer Anhui University Hefei China Engineering Technology Research Center of Specific Power Devices with Novel Semiconductor Materials Chizhou Anhui Province China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China

Bound state in the continuum (BIC) is a dark mode with infinitely high quality factors(Q-factors), it has recently attracted considerable research attention in photonics. Here, we present a metasurface that can support two BICs, which consists of AlGaAs. By breaking the structural symmetry, the two BICs are transformed into quasi-bic modes because they are not protected by the symmetry. Furthermore, it is found that the two quasi-BICs resonate near the fundamental and the second harmonic respectively, which can be used to enhance efficiency of second harmonic generation. By exploiting the high Q characteristics of this structure at both frequencies, we can obtain a second harmonic generation efficiency of nearly 10– 3 with 1GW/cm 2 of pump intensity. Our proposed metasurface will offer good prospects for nonlinear operation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：