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

Personalized Multimedia Recommendation Systems Using Higher-Order Tensor Singular-Value-Decomposition

IEEE Transactions on Broadcasting 2024年第1期70卷 148-160页

作者： Chang, Shih Yu Wu, Hsiao-Chun Yan, Kun Chen, Xinjia Huang, Scott Chih-Hao Wu, Yiyan San Jose State University Department of Applied Data Science San JoseCA95192 United States Louisiana State University School of Electrical Engineering and Computer Science Baton RougeLA70803 United States Yuan Ze University Innovation Center for AI Applications Chungli32003 Taiwan Guilin University of Electronic Technology Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing Department of Information and Telecommunication Guilin541004 China Northwestern State University Department of Engineering Technology NatchitochesLA71497 United States National Tsing Hua University Department of Electrical Engineering Hsinchu300 Taiwan Communications Research Centre Canada OttawaK2H 8S2 Canada

Because of rapid growth of multimedia data over the Internet, the infobesity has been emerging in recent years. Many recommender systems (RSs) have been proposed using a variety of techniques, including artificial intelligence, machine learning, statistical analysis, and data mining. Nowadays, E-commerce companies such as Amazon, eBay, Netflix, etc. have applied RSs conveniently to provide better customer services than before by enabling customized multimedia-content recommendations. It is well known that classical RSs are almost all based on the user-item attribute matrices. However, this two-fold user-item relationship should be extended to the emerging many-fold relationship among an arbitrary number of attribute groups so that the corresponding new RSs may lead to better performances. Therefore, in this paper, we introduce a novel personalized multimedia recommender system (PMRS) according to our proposed new parallel higher-order tensor singular-value-decomposition (PHOTSVD) algorithm. This PHOTSVD algorithm is capable of accommodating an arbitrary number of entities such as social-media channels, users, queries, webpages, etc. in a robust RS. Furthermore, we also investigate the cold start and data bias problems critical to RSs. Finally, we compare the performances of our proposed new PMRS and three other existing tensor-based RSs over realworld data with respect to the well-adopted metric, namely normalized root-mean-square error (NRMSE). Our proposed new PMRS greatly outperforms the other three existing tensor-based RSs in terms of NRMSE. © 1963-12012 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Protect Before Generate: Error Correcting Codes within Discrete Deep Generative Models

arXiv

引用

arXiv 2024年

作者： Martínez-García, María Villacrés, Grace Mitchell, David Olmos, Pablo M. Department of Signal Theory and Communications Universidad Carlos III de Madrid Spain Department of Signal Processing and Communications Universidad Rey Juan Carlos Spain Klipsch School of Electrical and Computer Engineering New Mexico State University United States

Despite significant advancements in deep probabilistic models, learning low-dimensional discrete latent representations remains a challenging task. In this paper, we introduce a novel method that enhances variational inference in discrete latent variable models by leveraging Error-Correcting Codes (ECCs) to introduce redundancy in the latent representations. This redundancy is then exploited by the variational posterior to yield more accurate estimates, thereby narrowing the variational gap. Inspired by ECCs commonly used in digital communications and data storage, we demonstrate proof-of-concept using a Discrete Variational Autoencoder (DVAE) with binary latent variables and block repetition codes. We further extend this idea to a hierarchical structure based on polar codes, where certain latent bits are more robustly protected. Our method improves generation quality, data reconstruction, and uncertainty calibration compared to the uncoded DVAE, even when trained with tighter bounds such as the Importance Weighted Autoencoder (IWAE) objective. In particular, we demonstrate superior performance on MNIST, FMNIST, CIFAR10, and Tiny ImageNet datasets. The general approach of integrating ECCs into variational inference is compatible with existing techniques to boost variational inference, such as importance sampling or Hamiltonian Monte Carlo. We also outline the key properties ECCs must have to effectively enhance discrete variational inference. Copyright © 2024, The Authors. All rights reserved.

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

Adaptive IMM Algorithm Based on Variational Inference for Multiple Maneuvering Extended Targets Tracking

引用

Advances in Astronautics 2025年 1-15页

作者： Wang, Shenghua Li, Renxian Men, Chenkai Cao, Yunhe Yeo, Tat-Soon School of Communications and Information Engineering and School of Artificial Intelligence Xi’an University of Posts and Telecommunications Xi’an China National Lab of Radar Signal Processing Xidian University Xi’an China The Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore

In order to track multiple maneuvering extended targets accurately, an adaptive interacting multiple model algorithm based on variational inference (AIMM-VI) is proposed. An augmented state is constructed to cater for time-varying orientation angle and track realistic shape changes, resulting in better elliptical shape estimation and tracking accuracy. Multiple measurements from multiple extended targets are effectively assigned to corresponding targets through the marginal association probability distribution criterion, and the variational inference is used to accurately estimate the augmented state and shape information, which greatly improves the parameters estimation performance. The residual and likelihood functions are updated in real-time according to the results of variational inference, allowing for the updating of the model probability in real-time. The Markov probability transfer matrix is subsequently adaptively updated by the compression ratio, which makes the algorithm more adaptable to maneuvering target and significantly improves the adaptability and robustness of the algorithm. The final simulation and experiment results show that the proposed algorithm can effectively improve the tracking performance of multiple maneuvering extended targets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recursive Subproduct Codes with Reed-Muller-like Structure

Recursive Subproduct Codes with Reed-Muller-like Structure

引用

IEEE International Symposium on Information Theory

作者： Aditya Siddheshwar Lakshmi Prasad Natarajan Prasad Krishnan Signal Processing and Communications Research Center International Institute of Information Technology Hyderabad India Department of Electrical Engineering Indian Institute of Technology Hyderabad Sangareddy India

ISBN: (数字)9798350382846

ISBN: (纸本)9798350382853

We study a family of subcodes of the $m-\mathbf{dimensional}$ product code $\mathcal{C}^{\otimes m}$ (‘subproduct codes’) that have a recursive Plotkin-like structure, and which include Reed-Muller (RM) codes and Dual Berman codes as special cases. We denote the codes in this family as $\mathcal{C}^{\otimes[r,m]}$ , where $r\in\{0,1,\ \ldots,\ m\}$ is the ‘order’ of the code. These codes allow a ‘projection’ operation that can be exploited in iterative decoding, viz., the sum of two carefully chosen subvectors of any codeword in $\mathcal{C}^{\otimes[r,m]}$ belongs to $\mathcal{C}^{\otimes[r-1,m-1]}$ . Recursive subproduct codes provide a wider range of rates and block lengths compared to RM codes while possessing several of their structural properties, such as the Plotkin-like design, the projection property, and fast ML decoding of first-order codes. Our simulation results for first-order and second-order codes, that are based on a belief propagation decoder and a local graph search algorithm, show instances of subproduct codes that perform either better than or within 0.5 dB of comparable RM codes and CRC-aided Polar codes.

关键词： Codes Product codes Simulation Decoding Polar codes Iterative decoding Belief propagation

来源：评论

学校读者我要写书评

暂无评论

Overview of Variable Rate Coding in JPEG AI

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Jia, Panqi Brand, Fabian Yu, Dequan Karabutov, Alexander Alshina, Elena Kaup, Andre Friedrich-Alexander University Erlangen-Nürnberg Department of Electrical-Electronic-Communication Engineering Chair of Multimedia Communications and Signal Processing Erlangen91058 Germany Huawei Munich Research Center Munich80992 Germany

Empirical evidence has demonstrated that learning-based image compression can outperform classical compression frameworks. This has led to the ongoing standardization of learned-based image codecs, namely Joint Photographic Experts Group (JPEG) AI. The objective of JPEG AI is to enhance compression efficiency and provide a software and hardware-friendly solution. Based on our research, JPEG AI represents the first standardization that can facilitate the implementation of a learned image codec on a mobile device. This article presents an overview of the variable rate coding functionality in JPEG AI, which includes three variable rate adaptations: a three-dimensional quality map, a fast bit rate matching algorithm, and a training strategy. The variable rate adaptations offer a continuous rate function up to 2.0 bpp, exhibiting a high level of performance, a flexible bit allocation between different color components, and a region of interest function for the specified use case. The evaluation of performance encompasses both objective and subjective results. With regard to the objective bit rate matching, the main profile with low complexity yielded a 13.1% BD-rate gain over VVC intra, while the high profile with high complexity achieved a 19.2% BD-rate gain over VVC intra. The BD-rate result is calculated as the mean of the seven perceptual metrics defined in the JPEG AI common test conditions. With respect to subjective results, the example of improving the quality of the region of interest is illustrated. © 1991-2012 IEEE.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation for Improved Lossless Screen Content Compression

Image Segmentation for Improved Lossless Screen Content Comp...

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Shabhrish Reddy Uddehal Tilo Strutz Hannah Och André Kaup Department of Electrical Engineering and Computer Science Coburg University Coburg Germany Multimedia Communications and Signal Processing Friedrich-Alexander University Erlangen Germany

In recent years, it has been found that screen content images (SCI) can be effectively compressed based on appropriate probability modelling and suitable entropy coding methods such as arithmetic coding. The key objective is determining the best probability distribution for each pixel position. This strategy works particularly well for images with synthetic (textual) content. However, usually screen content images not only consist of synthetic but also pictorial (natural) regions. These images require diverse models of probability distributions to be optimally compressed. One way to achieve this goal is to separate synthetic and natural regions. This paper proposes a segmentation method that identifies natural regions enabling better adaptive treatment. It supplements a compression method known as Soft Context Formation (SCF) and operates as a pre-processing step. If at least one natural segment is found within the SCI, it is split into two subimages (natural and synthetic parts) and the process of modelling and coding is performed separately for both. For SCIs with natural regions, the proposed method achieves a bit-rate reduction of up to 11.6% and 1.52% with respect to HEVC and the previous version of the SCF.

关键词： Image segmentation Adaptation models Image coding signal processing Probability distribution Entropy coding Acoustics

来源：评论

学校读者我要写书评

暂无评论

IMAGE SEGMENTATION FOR IMPROVED LOSSLESS SCREEN CONTENT COMPRESSION

arXiv

引用

arXiv 2023年

作者： Uddehal, Shabhrish Reddy Strutz, Tilo Och, Hannah Kaup, André Department of Electrical Engineering and Computer Science Coburg University Coburg Germany Multimedia Communications and Signal Processing Friedrich-Alexander University Erlangen Germany

In recent years, it has been found that screen content images (SCI) can be effectively compressed based on appropriate probability modelling and suitable entropy coding methods such as arithmetic coding. The key objective is determining the best probability distribution for each pixel position. This strategy works particularly well for images with synthetic (textual) content. However, usually screen content images not only consist of synthetic but also pictorial (natural) regions. These images require diverse models of probability distributions to be optimally compressed. One way to achieve this goal is to separate synthetic and natural regions. This paper proposes a segmentation method that identifies natural regions enabling better adaptive treatment. It supplements a compression method known as Soft Context Formation (SCF) and operates as a pre-processing step. If at least one natural segment is found within the SCI, it is split into two sub-images (natural and synthetic parts) and the process of modelling and coding is performed separately for both. For SCIs with natural regions, the proposed method achieves a bit-rate reduction of up to 11.6% and 1.52% with respect to HEVC and the previous version of the SCF. Copyright © 2023, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

MCFTNet: Multimodal Cross-Layer Fusion Transformer Network for Hyperspectral and LiDAR Data Classification

引用

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2025年 18卷 12803-12818页

作者： Huang, Wei Wu, Tianren Zhang, Xueyu Li, Liangliang Lv, Ming Jia, Zhenhong Zhao, Xiaobin Ma, Hongbing Vivone, Gemine Xinjiang University School of Computer Science and Technology Urumqi830017 China Xinjiang University Key Laboratory of Signal Detection and Processing Urumqi830017 China Guangxi University School of Computer and Electronic Information Nanning530004 China Guangxi University Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning530004 China Beijing Institute of Technology School of Information and Electronics Beijing100081 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Tsinghua University Department of Electronic Engineering Beijing100084 China National Research Council Tito85050 Italy National Biodiversity Future Center NBFC Palermo90133 Italy

Remote sensing image classification is a popular yet challenging field. Many researchers have combined convolutional neural networks (CNNs) and Transformers for hyperspectral imaging (HSI) classification tasks. However, in traditional Transformers, shallow-level information does not propagate well to deeper layers, which can lead to spatial variations and overfitting. Moreover, traditional Transformer models use an external classification token (CLS token) that is randomly initialized and often struggles to generalize effectively. In this article, we combine the strengths of HSI and light detection and ranging (LiDAR) data, using LiDAR as an external CLS token, which significantly enhances classification accuracy and reliability. We propose a new multimodal cross-layer fusion transformer network (MCFTNet), integrating CNNs with the latest Transformer networks. It includes a CNN for extracting spatial features and a hybrid cross-patch attention mechanism for land cover classification, leveraging LiDAR data to generate CLS and HSI patch tokens. More importantly, to reduce the loss of valuable information during the layer-by-layer propagation, we designed cross-layer skip connections. Through adaptive learning, these cross-layer fusions help address the gradient vanishing problem in deep networks while preserving early-layer features. This enables the model to better integrate information from different layers, enhancing both its stability and performance. We carried out in-depth experiments on commonly used benchmark datasets, specifically, the University of Houston dataset, the Trento dataset, and the University of Southern Mississippi Gulf Park dataset. We compared the results of the proposed MCFTNet model with those obtained from state-of-the-art Transformer models, classical CNNs, and traditional classifiers. As a result, the MCFTNet model outshones them all in terms of performance. © 2008-2012 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Recursive Subproduct Codes with Reed-Muller-like Structure

arXiv

引用

arXiv 2024年

作者： Siddheshwar, Aditya Natarajan, Lakshmi Prasad Krishnan, Prasad The Signal Processing and Communications Research Center International Institute of Information Technology Hyderabad500032 India The Department of Electrical Engineering Indian Institute of Technology Hyderabad Sangareddy502284 India

We study a family of subcodes of the m-dimensional product code C⊗m (‘subproduct codes’) that have a recursive Plotkin-like structure, and which include Reed-Muller (RM) codes and Dual Berman codes as special cases. We denote the codes in this family as C⊗[r,m], where 0 ≤ r ≤ m is the ‘order’ of the code. These codes allow a ‘projection’ operation that can be exploited in iterative decoding, viz., the sum of two carefully chosen subvectors of any codeword in C⊗[r,m] belongs to C⊗[r−1,m−1]. Recursive subproduct codes provide a wide range of rates and block lengths compared to RM codes while possessing several of their structural properties, such as the Plotkin-like design, the projection property, and fast ML decoding of first-order codes. Our simulation results for first-order and second-order codes, that are based on a belief propagation decoder and a local graph search algorithm, show instances of subproduct codes that perform either better than or within 0.5 dB of comparable RM codes and CRC-aided Polar codes. Copyright © 2024, The Authors. All rights reserved.

关键词： Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Sparse signal Recovery with Dirichlet Process Priors Based on Expectation Propagation Technique 7

Multi-Task Sparse Signal Recovery with Dirichlet Process Pri...

引用

7th International Conference on signal and Image processing, ICSIP 2022

作者： Fu, Yin Wu, Qisong Zhang, Yimin D. Amin, Moeness G. Southeast University Key Laboratory of Underwater Acoustic Signal Processing of Ministry of Education Nanjing210096 China Temple University Department of Electrical and Computer Engineering PhiladelphiaPA19122 United States Villanova University Center for Advanced Communications VillanovaPA19085 United States

ISBN: (数字)9781665495639

ISBN: (纸本)9781665495639

Exploiting the shared information among tasks to significantly improve the sparse reconstruction performance lays the essence of multi-task compressive sensing. In this paper, a novel generative model of multi-task compressive sensing with Dirichlet process (DP) priors is proposed and the sharing mechanisms among tasks are revealed, yielding a principled means of inferring the clusters as well as performing compressive sensing inversion simultaneously. The spike-and-slab priors are first used to model the group sparsity among tasks within the identical cluster, and the DP priors are then introduced to automatically perform clustering for the tasks. The expectation propagation method is finally carried out to take the inference for posterior distribution approximation. The superiority of the proposed method over state-of-the-art algorithms is demonstrated by using experimental results on both numerical data and real data sets. © 2022 IEEE.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：