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

An enhanced AMBTC for color image compression using color palette

Multimedia Tools and Applications 2024年第11期83卷 31783-31803页

作者： Xiong, Lizhi Zhang, Mengtao Yang, Ching-Nung Kim, Cheonshik School of Computer Science Nanjing University of Information Science and Technology Nanjing China Department of Computer Science and Information Engineering National Dong Hwa University Hualien Taiwan Department of Computer Engineering Sejong University Seoul Korea Republic of

Digital image has been used in various fields as an essential carrier. Many color images have been constantly produced since their more realistic description, which takes up much storage space and network bandwidth. Thus, color image compression has become an essential key technology. Absolute Moment Block Truncation Coding (AMBTC) has been widely studied as one of the classical image compression methods. However, in the existing methods, the visual quality of the reconstructed images and the compression rate are all relatively low. Therefore, this paper proposes an enhanced AMBTC for color image compression using a color palette. In the proposed method, the K-means clustering algorithm is utilized for training the image's palette pattern. The color palette obtained by K-mean will be more suitable for reconstructing this image than the standard color palette, and the visual quality will be higher. The six clustered central pixels are matched with the palette through a color difference formula, and the obtained index values are used as the quantization levels. Huffman coding is used to build a bitmap to achieve a higher compression rate, that is, a lower bit rate. At last, a block of a color image can be represented by six index values and a bitmap. Experimental results and theoretical analysis demonstrate that the proposed method has better visual quality and bit rate than similar schemes. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2023.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

A Novel Reliable and Trust Objective Function for RPL-Based IoT Routing Protocol

引用

computers, Materials & Continua 2025年第2期82卷 3467-3497页

作者： Mariam A.Alotaibi Sami S.Alwakeel Aasem N.Alyahya Department of Computer Engineering College of Computer ScienceKing Saud UniversityRiyadh11543Saudi Arabia Department of Computer Science and Information Technology Shaqra UniversityShaqra11961Saudi Arabia

The Internet of Things (IoT) integrates diverse devices into the Internet infrastructure, including sensors, meters, and wearable devices. Designing efficient IoT networks with these heterogeneous devices requires the selection of appropriate routing protocols, which is crucial for maintaining high Quality of Service (QoS). The Internet engineering Task Force’s Routing Over Low Power and Lossy Networks (IETF ROLL) working group developed the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) to meet these needs. While the initial RPL standard focused on single-metric route selection, ongoing research explores enhancing RPL by incorporating multiple routing metrics and developing new Objective Functions (OFs). This paper introduces a novel Objective Function (OF), the Reliable and Secure Objective Function (RSOF), designed to enhance the reliability and trustworthiness of parent selection at both the node and link levels within IoT and RPL routing protocols. The RSOF employs an adaptive parent node selection mechanism that incorporates multiple metrics, including Residual Energy (RE), Expected Transmission Count (ETX), Extended RPL Node Trustworthiness (ERNT), and a novel metric that measures node failure rate (NFR). In this mechanism, nodes with a high NFR are excluded from the parent selection process to improve network reliability and stability. The proposed RSOF was evaluated using random and grid topologies in the Cooja Simulator, with tests conducted across small, medium, and large-scale networks to examine the impact of varying node densities. The simulation results indicate a significant improvement in network performance, particularly in terms of average latency, packet acknowledgment ratio (PAR), packet delivery ratio (PDR), and Control Message Overhead (CMO), compared to the standard Minimum Rank with Hysteresis Objective Function (MRHOF).

关键词： IoT LLNs RPL objective function OF MRHOF OF0 routing metrics reliability trustworthiness

来源：评论

学校读者我要写书评

暂无评论

Leveraging Concise Concepts with Probabilistic Modeling for Interpretable Visual Recognition

引用

IEEE Transactions on Multimedia 2025年 27卷 3117-3131页

作者： Zhang, Yixuan Liu, Chuanbin Liu, Yizhi Gao, Yifan Lu, Zhiying Xie, Hongtao Zhang, Yongdong University of Science and Technology of China School of Information Science and Technology China Hunan University of Science and Technology Department of Computer Science and Engineering China

Interpretable visual recognition is essential for decision-making in high-stakes situations. Recent advancements have automated the construction of interpretable models by leveraging Visual Language Models (VLMs) and Large Language Models (LLMs) with Concept Bottleneck Models (CBMs), which process a bottleneck layer associated with human-understandable concepts. However, existing methods suffer from two main problems: a) the collected concepts from LLMs could be redundant with task-irrelevant descriptions, resulting in an inferior concept space with potential mismatch. b) VLMs directly map the global deterministic image embeddings with fine-grained concepts results in an ambiguous process with imprecise mapping results. To address the above two issues, we propose a novel solution for CBMs with Concise Concept and Probabilistic Modeling (CCPM) that can achieve superior classification performance via high-quality concepts and precise mapping strategy. Fisrt, we leverage in-context examples as category-related clues to guide LLM concept generation process. To mitigate redundancy in the concept space, we propose a Relation-Aware Selection (RAS) module to obtain a concise concept set that is discriminative and relevant based on image-concept and inter-concept relationships. Second, for precise mapping, we employ a Probabilistic Distribution Adapter (PDA) that estimates the inherent ambiguity of the image embeddings of pre-trained VLMs to capture the complex relationships with concepts. Extensive experiments indicate that our model achieves state-of-the-art results with a 5.48% improvement in classification accuracy on eight mainstream recognition benchmarks as well as reliable explainability through interpretable analysis. © 1999-2012 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Visual quality-enhanced reversible data hiding scheme based on interpolation and variant Sudoku matrics

引用

Multimedia Tools and Applications 2024年第18期84卷 1-29页

作者： Yuan, Longfei Lin, Chia-Chen Chang, Chin-Chen Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Computer Science and Information Engineering National Chin-Yi University of Technology Taichung Taiwan Department of Information Engineering and Computer Science Feng Chia University Taichung Taiwan

Utilizing interpolation techniques (IT) within reversible data hiding (RDH) algorithms presents the advantage of a substantial embedding capacity. Nevertheless, prevalent algorithms often straightforwardly embed confidential data into non-reference pixels without accounting for the relationships between neighboring pixels. This practice results in suboptimal visual quality in the stego images. To rectify this issue, we have introduced the augmentation and modification interpolation (AMI). Additionally, we have devised two variant Sudoku matrices to facilitate distinct data-hiding strategies tailored for different types of reference pixels: Single type and Paired type. By incorporating these innovative designs, the interpolation operation now preserves the pattern-level information of the block in the original image, rather than focusing solely on the pixel level. In assessing the effectiveness of our proposed scheme, we performed experiments utilizing two representative image datasets. The outcomes of these experiments validate that our scheme attains an average PSNR of 44.11 dB and an average hiding capacity of 1.63 bpp. Consequently, it is affirmed that the advantage offered by our proposed scheme is well-suited for scenarios demanding high-quality stego images. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving recommendation with coarse-grained spatiotemporal contexts

引用

science China(information sciences) 2025年第4期68卷 66-81页

作者： Lei CHEN Chen GAO Jiahuan LEI Xiaoyi DU Xinlei SHI Hengliang LUO Depeng JIN Yong LI Meng WANG Department of Electronic Engineering BNRist Tsinghua University Meituan Inc. School of Computer Science and Information Engineering Hefei University of Technology

The behavior of users on online life service platforms like Meituan and Yelp often occurs within specific finegrained spatiotemporal contexts(i.e., when and where). Recommender systems, designed to serve millions of users, typically operate in a fully server-based manner, requiring on-device users to upload their behavioral data, including fine-grained spatiotemporal contexts, to the server, which has sparked public concern regarding privacy. Consequently, user devices only upload coarse-grained spatiotemporal contexts for user privacy protection. However, previous research mostly focuses on modeling fine-grained spatiotemporal contexts using knowledge graph convolutional models, which are not applicable to coarse-grained spatiotemporal contexts in privacy-constrained recommender systems. In this paper, we investigate privacy-preserving recommendation by leveraging coarse-grained spatiotemporal contexts. We propose the coarse-grained spatiotemporal knowledge graph for privacy-preserving recommendation(CSKG), which explicitly models spatiotemporal co-occurrences using common-sense knowledge from coarse-grained contexts. Specifically, we begin by constructing a spatiotemporal knowledge graph tailored to coarse-grained spatiotemporal contexts. Then we employ a learnable metagraph network that integrates common-sense information to filter and extract co-occurrences. CSKG evaluates the impact of coarsegrained spatiotemporal contexts on user behavior through the use of a knowledge graph convolutional network. Finally, we introduce joint learning to effectively learn representations. By conducting experiments on two real large-scale datasets,we achieve an average improvement of about 11.0% on two ranking metrics. The results clearly demonstrate that CSKG outperforms state-of-the-art baselines.

关键词： privacy-preserveing coarse-grained spatiotemporal contexts recommender systems

来源：评论

学校读者我要写书评

暂无评论

Coarse-to-fine lightweight meta-embedding for ID-based recommendations

引用

science China(information sciences) 2025年第4期68卷 82-97页

作者： Yang WANG Haipeng LIU Zeqian YI Biao QIAN Meng WANG School of Computer Science and Information Engineering Hefei University of Technology College of Information and Intelligence Hunan Agricultural University

State-of-the-art recommender systems are increasingly focused on optimizing implementation efficiency, such as enabling on-device recommendations under memory constraints. Current methods commonly use lightweight embeddings for users and items or employ compact embeddings to enhance reusability and reduce memory usage. However, these approaches consider only the coarse-grained aspects of embeddings, overlooking subtle semantic nuances. This limitation results in an adversarial degradation of meta-embedding performance, impeding the system's ability to capture intricate relationships between users and items, leading to suboptimal recommendations. To address this, we propose a novel approach to efficiently learn meta-embeddings with varying grained and apply fine-grained meta-embeddings to strengthen the representation of their coarse-grained counterparts. Specifically, we introduce a recommender system based on a graph neural network, where each user and item is represented as a node. These nodes are directly connected to coarse-grained virtual nodes and indirectly linked to fine-grained virtual nodes, facilitating learning of multi-grained semantics. Fine-grained semantics are captured through sparse meta-embeddings, which dynamically balance embedding uniqueness and memory constraints. To ensure their sparseness, we rely on initialization methods such as sparse principal component analysis combined with a soft thresholding activation function. Moreover, we propose a weight-bridging update strategy that aligns coarse-grained meta-embedding with several fine-grained meta-embeddings based on the underlying semantic properties of users and items. Comprehensive experiments demonstrate that our method outperforms existing baselines. The code of our proposal is available at https://***/htyjers/C2F-MetaEmbed.

关键词： lightweight meta-embedding coarse-to-fine learning ID-based recommendations

来源：评论

学校读者我要写书评

暂无评论

DNACDS:Cloud IoE big data security and accessing scheme based on DNA cryptography

引用

Frontiers of computer science 2024年第1期18卷 157-170页

作者： Ashish SINGH Abhinav KUMAR Suyel NAMASUDRA School of Computer Engineering KIIT Deemed to be UniversityBhubaneshwar 751024India Department of Computer Science and Engineering Indian Institute of Information Technology SuratSurat 394190India Department of Computer Science and Engineering National Institute of Technology AgartalaAgartala 799046India

The Internet of Everything(IoE)based cloud computing is one of the most prominent areas in the digital big data *** approach allows efficient infrastructure to store and access big real-time data and smart IoE services from the *** IoE-based cloud computing services are located at remote locations without the control of the data *** data owners mostly depend on the untrusted Cloud Service Provider(CSP)and do not know the implemented security *** lack of knowledge about security capabilities and control over data raises several security *** Acid(DNA)computing is a biological concept that can improve the security of IoE big *** IoE big data security scheme consists of the Station-to-Station Key Agreement Protocol(StS KAP)and Feistel cipher *** paper proposed a DNA-based cryptographic scheme and access control model(DNACDS)to solve IoE big data security and access *** experimental results illustrated that DNACDS performs better than other DNA-based security *** theoretical security analysis of the DNACDS shows better resistance capabilities.

关键词： IoE based cloud computing DNA cryptography IoE big data security StS KAP feistel cipher IoE big data access

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional information-driven many-objective software remodularization approach

引用

Frontiers of computer science 2023年第3期17卷 45-62页

作者： Amarjeet PRAJAPATI Anshu PARASHAR Amit RATHEE Department of Computer Science Engineering&Information Technology Jaypee Istitute of Information TechnologyNoida 201307India Department of Computer Science&Engineering Thapar Institute of Engineering&TechnologyPunjab 147004India Department of Computer Science Government College BarotaHaryana 131301India

Most of the search-based software remodularization(SBSR)approaches designed to address the software remodularization problem(SRP)areutilizing only structural information-based coupling and cohesion quality ***,in practice apart from these quality criteria,there require other aspects of coupling and cohesion quality criteria such as lexical and changed-history in designing the modules of the software ***,consideration of limited aspects of software information in the SBSR may generate a sub-optimal modularization ***,such modularization can be good from the quality metrics perspective but may not be acceptable to the *** produce a remodularization solution acceptable from both quality metrics and developers’perspectives,this paper exploited more dimensions of software information to define the quality criteria as modularization ***,these objectives are simultaneously optimized using a tailored manyobjective artificial bee colony(MaABC)to produce a remodularization *** assess the effectiveness of the proposed approach,we applied it over five software *** obtained remodularization solutions are evaluated with the software quality metrics and developers view of *** demonstrate that the proposed software remodularization is an effective approach for generating good quality modularization solutions.

关键词： software restructuring remodularization multiobjective optimization software coupling and cohesion

来源：评论

学校读者我要写书评

暂无评论

Early Detection of Colletotrichum Kahawae Disease in Coffee Cherry Based on computer Vision Techniques

引用

computer Modeling in engineering & sciences 2024年第4期139卷 759-782页

作者： Raveena Selvanarayanan Surendran Rajendran Youseef Alotaibi Department of Computer Science and Engineering Saveetha School of EngineeringSaveetha Institute of Medical and Technical ScienceChennai602105India Department of Computer Science College of Computer and Information SystemsUmm Al-Qura UniversityMakkah21955Saudi Arabia

Colletotrichum kahawae(Coffee Berry Disease)spreads through spores that can be carried by wind,rain,and insects affecting coffee plantations,and causes 80%yield losses and poor-quality coffee *** deadly disease is hard to control because wind,rain,and insects carry *** researchers utilized a deep learning system to identify CBD in coffee cherries at three growth stages and classify photographs of infected and uninfected cherries with 93%accuracy using a random forest *** the dataset is too small and noisy,the algorithm may not learn data patterns and generate accurate *** overcome the existing challenge,early detection of Colletotrichum Kahawae disease in coffee cherries requires automated processes,prompt recognition,and accurate *** proposed methodology selects CBD image datasets through four different stages for training and *** to train a model on datasets of coffee berries,with each image labeled as healthy or *** themodel is trained,SHAP algorithmto figure out which features were essential formaking predictions with the proposed *** of these characteristics were the cherry’s colour,whether it had spots or other damage,and how big the Lesions *** inception is important for classification to virtualize the relationship between the colour of the berry is correlated with the presence of *** evaluate themodel’s performance andmitigate excess fitting,a 10-fold cross-validation approach is *** involves partitioning the dataset into ten subsets,training the model on each subset,and evaluating its *** comparison to other contemporary methodologies,the model put forth achieved an accuracy of 98.56%.

关键词： computer vision coffee berry disease colletotrichum kahawae XG boost shapley additive explanations

来源：评论

学校读者我要写书评

暂无评论

Robust video question answering via contrastive cross-modality representation learning

引用

science China(information sciences) 2024年第10期67卷 211-226页

作者： Xun YANG Jianming ZENG Dan GUO Shanshan WANG Jianfeng DONG Meng WANG School of Information Science and Technology University of Science and Technology of China Institute of Artificial Intelligence Hefei Comprehensive National Science Center School of Computer Science and Information Engineering Hefei University of Technology Institutes of Physical Science and Information Technology Anhui University School of Computer Science and Technology Zhejiang Gongshang University

Video question answering(VideoQA) is a challenging yet important task that requires a joint understanding of low-level video content and high-level textual semantics. Despite the promising progress of existing efforts, recent studies revealed that current VideoQA models mostly tend to over-rely on the superficial correlations rooted in the dataset bias while overlooking the key video content, thus leading to unreliable results. Effectively understanding and modeling the temporal and semantic characteristics of a given video for robust VideoQA is crucial but, to our knowledge, has not been well investigated. To fill the research gap, we propose a robust VideoQA framework that can effectively model the cross-modality fusion and enforce the model to focus on the temporal and global content of videos when making a QA decision instead of exploiting the shortcuts in datasets. Specifically, we design a self-supervised contrastive learning objective to contrast the positive and negative pairs of multimodal input, where the fused representation of the original multimodal input is enforced to be closer to that of the intervened input based on video perturbation. We expect the fused representation to focus more on the global context of videos rather than some static keyframes. Moreover, we introduce an effective temporal order regularization to enforce the inherent sequential structure of videos for video representation. We also design a Kullback-Leibler divergence-based perturbation invariance regularization of the predicted answer distribution to improve the robustness of the model against temporal content perturbation of videos. Our method is model-agnostic and can be easily compatible with various VideoQA backbones. Extensive experimental results and analyses on several public datasets show the advantage of our method over the state-of-the-art methods in terms of both accuracy and robustness.

关键词： video question answering cross-modality fusion contrastive learning cross-media reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：