Journal of King Saud University-Computer and Information Sciences最新文献

筛选
英文 中文
Parametrization of generalized triangle groups and construction of substitution-box for medical image encryption 广义三角形组的参数化和医学图像加密替代盒的构建
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-14 DOI: 10.1016/j.jksuci.2024.102159
Aqsa Zafar Abbasi , Ayesha Rafiq , Lioua Kolsi
{"title":"Parametrization of generalized triangle groups and construction of substitution-box for medical image encryption","authors":"Aqsa Zafar Abbasi , Ayesha Rafiq , Lioua Kolsi","doi":"10.1016/j.jksuci.2024.102159","DOIUrl":"10.1016/j.jksuci.2024.102159","url":null,"abstract":"<div><div>The construction of strong encryption techniques is crucial to meet the increasing demand for secure transmission as well as storage of medical images. A substitution box (S-Box) is an important component of block ciphers and nonlinearity is an important attribute to consider while designing secure S-boxes. As a result, it is required to create new approaches for producing S-boxes with high non-linearity scores. We present a method of parametrization of the generalized triangle group <span><math><mrow><mo>〈</mo><mi>x</mi><mo>,</mo><mi>y</mi><mspace></mspace><mo>|</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>=</mo><msup><mrow><mi>y</mi></mrow><mrow><mn>5</mn></mrow></msup><mo>=</mo><msup><mrow><mi>w</mi></mrow><mrow><mi>k</mi></mrow></msup><mo>=</mo><mn>1</mn><mo>〉</mo></mrow></math></span> as linear groups, where <span><math><mrow><mi>w</mi><mo>=</mo><mi>x</mi><mi>y</mi><mi>x</mi><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mi>x</mi><msup><mrow><mi>y</mi></mrow><mrow><mn>4</mn></mrow></msup></mrow></math></span> which is extended by the parametrization for triangle group <span><math><mrow><mo>〈</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>,</mo><mi>t</mi><mspace></mspace><mo>|</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>=</mo><msup><mrow><mi>y</mi></mrow><mrow><mn>5</mn></mrow></msup><mo>=</mo><msup><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>=</mo><msup><mrow><mrow><mo>(</mo><mi>x</mi><mi>t</mi><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></msup><mo>=</mo><msup><mrow><mrow><mo>(</mo><mi>y</mi><mi>t</mi><mo>)</mo></mrow></mrow><mrow><mn>2</mn></mrow></msup><mo>=</mo><msup><mrow><mrow><mo>(</mo><mi>x</mi><mi>y</mi><mo>)</mo></mrow></mrow><mrow><mi>k</mi></mrow></msup><mo>=</mo><mn>1</mn><mo>〉</mo></mrow></math></span>. This parametrization is then used for the construction of a highly nonlinear and secure substitution box designed for <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>8</mn></mrow></msup></math></span> elements, tailored specifically for the finite generalized triangle group case with <span><math><mrow><mi>k</mi><mo>=</mo><mn>2</mn></mrow></math></span> for <span><math><mrow><mi>θ</mi><mo>=</mo><mn>64</mn></mrow></math></span> which is parameter for all homomorphism from <span><math><msub><mrow><mi>H</mi></mrow><mrow><mn>5</mn></mrow></msub></math></span> to <span><math><mrow><mi>P</mi><mi>S</mi><mi>L</mi><mrow><mo>(</mo><mn>2</mn><mo>,</mo><mi>q</mi><mo>)</mo></mrow></mrow></math></span>, possessing an order of 1200. We rigorously evaluate and analyze various common security indicators associated with the proposed substitution box. The proposed S-box is evaluated for picture encryption using various statistical approaches. Comparative analysis and additional scrutiny reveal promising attributes, affirming its suitability, efficacy, and potential applicability in the domain of medical image encryption. Our S-box achieves the necessary conditions for secu","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102159"},"PeriodicalIF":5.2,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Anomalous behavior detection based on optimized graph embedding representation in social networks 基于优化图嵌入表示的社交网络异常行为检测
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-13 DOI: 10.1016/j.jksuci.2024.102158
Ling Xing , Shiyu Li , Qi Zhang , Honghai Wu , Huahong Ma , Xiaohui Zhang
{"title":"Anomalous behavior detection based on optimized graph embedding representation in social networks","authors":"Ling Xing ,&nbsp;Shiyu Li ,&nbsp;Qi Zhang ,&nbsp;Honghai Wu ,&nbsp;Huahong Ma ,&nbsp;Xiaohui Zhang","doi":"10.1016/j.jksuci.2024.102158","DOIUrl":"10.1016/j.jksuci.2024.102158","url":null,"abstract":"<div><p>Anomalous behaviors in social networks can lead to privacy leaks and the spread of false information. In this paper, we propose an anomalous behavior detection method based on optimized graph embedding representation. Specifically, the user behavior logs are first extracted into a social network user behavior temporal knowledge graph, based on which the graph embedding representation method is used to transform the network topology and temporal information in the user behavior knowledge graph into structural embedding vectors and temporal information embedding vectors, and the hybrid attention mechanism is used to merge the two types of vectors to obtain the final entity embedding to complete the prediction and complementation of the temporal knowledge graph of user behavior. We use graph neural networks, which use the temporal information of user behaviors as a time constraint and capture both user behavioral and semantic information. It converts the two parts of information into vectors for concatenation and linear transformation to obtain a comprehensive representation vector of the whole subgraph, as well as joint deep learning models to evaluate abnormal behavior. Finally, we perform experiments on the Yelp dataset to validate that our method achieves a 9.56% improvement in the F1-score.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102158"},"PeriodicalIF":5.2,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002477/pdfft?md5=05d482d90b47cc00a3f0c9a6ac74bdda&pid=1-s2.0-S1319157824002477-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142048668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Wear-Leveling-Aware Data Placement for LSM-Tree based key-value store on ZNS SSDs 基于 LSM 树的键值存储在 ZNS SSD 上的高效损耗平级感知数据放置
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-08 DOI: 10.1016/j.jksuci.2024.102156
Runyu Zhang, Lening Zhou, Mingjie Li, Yunlin Tan, Chaoshu Yang
{"title":"Efficient Wear-Leveling-Aware Data Placement for LSM-Tree based key-value store on ZNS SSDs","authors":"Runyu Zhang,&nbsp;Lening Zhou,&nbsp;Mingjie Li,&nbsp;Yunlin Tan,&nbsp;Chaoshu Yang","doi":"10.1016/j.jksuci.2024.102156","DOIUrl":"10.1016/j.jksuci.2024.102156","url":null,"abstract":"<div><p>Emerging Zoned Namespace (ZNS) is a new-style Solid State Drive (SSD) that manages data in a zoned manner, which can achieve higher performance by strictly obeying the sequential write mode in each zone and alleviating the redundant overhead of garbage collections. Unfortunately, flash memory usually has a serious problem with limited program/erase cycles. Meanwhile, inappropriate data placement strategy of storage systems can lead to imbalanced wear among zones, severely reducing the lifespan of ZNS SSDs. In this paper, we propose a Wear-Leveling-Aware Data Placement (WADP) to solve this problem with negligible performance cost. First, WADP employs a wear-aware empty zone allocation algorithm to quantify the resets of zones and choose the less-worn zone for each allocation. Second, to prevent long-term zone occupation of infrequently written data (namely cold data), we propose a wear-leveling cold zone monitoring mechanism to identify cold zones dynamically. Finally, WADP adopts a real-time I/O pressure-aware data migration mechanism to adaptively migrate cold data for achieving wear-leveling among zones. We implement the proposed WADP in ZenFS and evaluate it with widely used workloads. Compared with state-of-the-art solutions, i.e., LIZA and FAR, the experimental results show that WADP can significantly reduce the standard deviation of zone resets while maintaining decent performance.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102156"},"PeriodicalIF":5.2,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002453/pdfft?md5=b3f5e8288e8205e799d78965f416b571&pid=1-s2.0-S1319157824002453-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142041102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Structure recovery from single omnidirectional image with distortion-aware learning 利用失真感知学习从单幅全向图像中恢复结构
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-08 DOI: 10.1016/j.jksuci.2024.102151
Ming Meng , Yi Zhou , Dongshi Zuo , Zhaoxin Li , Zhong Zhou
{"title":"Structure recovery from single omnidirectional image with distortion-aware learning","authors":"Ming Meng ,&nbsp;Yi Zhou ,&nbsp;Dongshi Zuo ,&nbsp;Zhaoxin Li ,&nbsp;Zhong Zhou","doi":"10.1016/j.jksuci.2024.102151","DOIUrl":"10.1016/j.jksuci.2024.102151","url":null,"abstract":"<div><p>Recovering structures from images with 180<span><math><msup><mrow></mrow><mrow><mo>∘</mo></mrow></msup></math></span> or 360<span><math><msup><mrow></mrow><mrow><mo>∘</mo></mrow></msup></math></span> FoV is pivotal in computer vision and computational photography, particularly for VR/AR/MR and autonomous robotics applications. Due to varying distortions and the complexity of indoor scenes, recovering flexible structures from a single image is challenging. We introduce OmniSRNet, a comprehensive deep learning framework that merges distortion-aware learning with bidirectional LSTM. Utilizing a curated dataset with optimized panorama and expanded fisheye images, our framework features a distortion-aware module (DAM) for extracting features and a horizontal and vertical step module (HVSM) of LSTM for contextual predictions. OmniSRNet excels in applications such as VR-based house viewing and MR-based video surveillance, achieving leading results on cuboid and non-cuboid datasets. The code and dataset can be accessed at <span><span>https://github.com/mmlph/OmniSRNet/</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102151"},"PeriodicalIF":5.2,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002404/pdfft?md5=7e463774b7098668fef54fdff2ad3e21&pid=1-s2.0-S1319157824002404-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142013028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance analysis of cloud resource allocation scheme with virtual machine inter-group asynchronous failure 带有虚拟机组间异步故障的云资源分配方案的性能分析
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-07 DOI: 10.1016/j.jksuci.2024.102155
Yuan Zhao , Kang Chen , Hongmin Gao , Yan Li
{"title":"Performance analysis of cloud resource allocation scheme with virtual machine inter-group asynchronous failure","authors":"Yuan Zhao ,&nbsp;Kang Chen ,&nbsp;Hongmin Gao ,&nbsp;Yan Li","doi":"10.1016/j.jksuci.2024.102155","DOIUrl":"10.1016/j.jksuci.2024.102155","url":null,"abstract":"<div><p>The recent rapid expansion of cloud computing has led to the prominence of Cloud Data Center (CDC) emerging. However, user requests’ waiting time might be greatly increased for a single physical machine (PM) in the CDC. We provide a cloud resource allocation scheme with virtual machine (VM) inter-group asynchronous failure. This method improves requests’ throughput and reduces wait time of requests. In particular, two PMs with different service rates for mapping multiple VMs are deployed in order to equally distribute cloud users’ requests, and we assume that the two PMs will fail and repair at different probabilities. A finite cache is also introduced to reduce the requests’ blocking rate. We model the VMs and user requests and create a 3-dimensional Markov chain (3DMC) to gauge the requests’ performance metrics. Numerical experiments are performed to obtain multiple performance metrics graphs for the requests. By comparing our scheme with the traditional cloud resource allocation scheme that involves synchronization failure in VM, we find that our scheme has an improvement in throughput, and each scheme has advantages and disadvantages in blocking rate of requests.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102155"},"PeriodicalIF":5.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002441/pdfft?md5=d0b96a172006c37607e17d7e394616cf&pid=1-s2.0-S1319157824002441-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141993465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
LDNet: High Accuracy Fish Counting Framework using Limited training samples with Density map generation Network LDNet:利用密度图生成网络的有限训练样本实现高精度鱼类计数框架
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-07 DOI: 10.1016/j.jksuci.2024.102143
Ximing Li , Yitao Zhuang , Baihao You , Zhe Wang , Jiangsan Zhao , Yuefang Gao , Deqin Xiao
{"title":"LDNet: High Accuracy Fish Counting Framework using Limited training samples with Density map generation Network","authors":"Ximing Li ,&nbsp;Yitao Zhuang ,&nbsp;Baihao You ,&nbsp;Zhe Wang ,&nbsp;Jiangsan Zhao ,&nbsp;Yuefang Gao ,&nbsp;Deqin Xiao","doi":"10.1016/j.jksuci.2024.102143","DOIUrl":"10.1016/j.jksuci.2024.102143","url":null,"abstract":"<div><p>Fish counting is crucial in fish farming. Density map-based fish counting methods hold promise for fish counting in high-density scenarios; however, they suffer from ineffective ground truth density map generation. High labeling complexities and disturbance to fish growth during data collection are also challenging to mitigate. To address these issues, LDNet, a versatile network with attention implemented is introduced in this study. An imbalanced Optimal Transport (OT)-based loss function was used to effectively supervise density map generation. Additionally, an Image Manipulation-Based Data Augmentation (IMBDA) strategy was applied to simulate training data from diverse scenarios in fixed viewpoints in order to build a model that is robust to different environmental changes. Leveraging a limited number of training samples, our approach achieved notable performances with an 8.27 MAE, 9.97 RMSE, and 99.01% Accuracy on our self-curated Fish Count-824 dataset. Impressively, our method also demonstrated superior counting performances on both vehicle count datasets CARPK and PURPK+, and Penaeus_1k Penaeus Larvae dataset when only 5%–10% of the training data was used. These outcomes compellingly showcased our proposed approach with a wide applicability potential across various cases. This innovative approach can potentially contribute to aquaculture management and ecological preservation through counting fish accurately.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102143"},"PeriodicalIF":5.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002325/pdfft?md5=ec92694818fa8a8041843f53d8c6b66e&pid=1-s2.0-S1319157824002325-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141979572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Leveraging syntax-aware models and triaffine interactions for nominal compound chain extraction 利用语法感知模型和三石蜡相互作用提取名词化合物链
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-07 DOI: 10.1016/j.jksuci.2024.102153
Yinxia Lou , Xun Zhu , Ming Chen , Donghong Ji , Junxiang Zhou
{"title":"Leveraging syntax-aware models and triaffine interactions for nominal compound chain extraction","authors":"Yinxia Lou ,&nbsp;Xun Zhu ,&nbsp;Ming Chen ,&nbsp;Donghong Ji ,&nbsp;Junxiang Zhou","doi":"10.1016/j.jksuci.2024.102153","DOIUrl":"10.1016/j.jksuci.2024.102153","url":null,"abstract":"<div><p>Recently, Nominal Compound Chain Extraction (NCCE) has been proposed to detect related mentions in a document to improve understanding of the document’s topic. NCCE involves longer span detection and more complicated rules for relation decisions, making it more difficult than previous chain extraction tasks, such as coreference resolution. Current methods achieve certain progress on the NCCE task, but they suffer from insufficient syntax information utilization and incomplete mention relation mining, which are helpful for NCCE. To fill these gaps, we propose a syntax-guided model using a triaffine interaction to improve the performance of the NCCE task. Instead of solely relying on the text information to detect compound mentions, we also utilize the noun-phrase (NP) boundary information in constituency trees to incorporate prior boundary knowledge. In addition, we use biaffine and triaffine operations to mine the mention interactions in the local and global context of a document. To show the effectiveness of our methods, we conduct a series of experiments on a human-annotated NCCE dataset. Experimental results show that our model significantly outperforms the baseline systems. Moreover, in-depth analyses reveal the effect of utilizing syntactic information and mention interactions in the local and global contexts.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102153"},"PeriodicalIF":5.2,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002428/pdfft?md5=68d28a739630245dadca6d14bfb1c2d3&pid=1-s2.0-S1319157824002428-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141984671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Heterogeneous network link prediction based on network schema and cross-neighborhood attention 基于网络模式和交叉邻域关注的异构网络链接预测
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-06 DOI: 10.1016/j.jksuci.2024.102154
Pengtao Wang , Jian Shu , Linlan Liu
{"title":"Heterogeneous network link prediction based on network schema and cross-neighborhood attention","authors":"Pengtao Wang ,&nbsp;Jian Shu ,&nbsp;Linlan Liu","doi":"10.1016/j.jksuci.2024.102154","DOIUrl":"10.1016/j.jksuci.2024.102154","url":null,"abstract":"<div><p>Heterogeneous network link prediction is a hot topic in the analysis of networks. It aims to predict missing links in the network by utilizing the rich semantic information present in the heterogeneous network, thereby enhancing the effectiveness of relevant data mining tasks. Existing heterogeneous network link prediction methods utilize meta-paths or meta-graphs to extract semantic information, heavily relying on the priori knowledge. This paper proposes a heterogeneous network link prediction based on network schema and cross-neighborhood attention method (HNLP-NSCA). The heterogeneous node features are projected into a shared latent vector space using fully connected layers. To resolve the issue of prior knowledge dependence on meta-path, the semantic information is extracted by using network schema structures uniquely in heterogeneous networks. Node features are extracted based on the relevant network schema instances, avoiding the problem of meta-path selection. The neighborhood interaction information of input node pairs is sensed via cross-neighborhood attention, strengthening the nonlinear mapping capability of the link prediction. The resulting cross-neighborhood interaction vectors are combined with the node feature vectors and fed into a multilayer perceptron for link prediction. Experimental results on four real-world datasets demonstrate that the proposed HNLP-NSCA mothed outperforms the baseline models.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102154"},"PeriodicalIF":5.2,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S131915782400243X/pdfft?md5=269ef08ce93e8cf6ae0df3df90173eac&pid=1-s2.0-S131915782400243X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141979570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Spatial relaxation transformer for image super-resolution 用于图像超分辨率的空间松弛变换器
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-06 DOI: 10.1016/j.jksuci.2024.102150
Yinghua Li , Ying Zhang , Hao Zeng , Jinglu He , Jie Guo
{"title":"Spatial relaxation transformer for image super-resolution","authors":"Yinghua Li ,&nbsp;Ying Zhang ,&nbsp;Hao Zeng ,&nbsp;Jinglu He ,&nbsp;Jie Guo","doi":"10.1016/j.jksuci.2024.102150","DOIUrl":"10.1016/j.jksuci.2024.102150","url":null,"abstract":"<div><p>Transformer-based approaches have demonstrated remarkable performance in image processing tasks due to their ability to model long-range dependencies. Current mainstream Transformer-based methods typically confine self-attention computation within windows to reduce computational burden. However, this constraint may lead to grid artifacts in the reconstructed images due to insufficient cross-window information exchange, particularly in image super-resolution tasks. To address this issue, we propose the Multi-Scale Texture Complementation Block based on Spatial Relaxation Transformer (MSRT), which leverages features at multiple scales and augments information exchange through cross windows attention computation. In addition, we introduce a loss function based on the prior of texture smoothness transformation, which utilizes the continuity of textures between patches to constrain the generation of more coherent texture information in the reconstructed images. Specifically, we employ learnable compressive sensing technology to extract shallow features from images, preserving image features while reducing feature dimensions and improving computational efficiency. Extensive experiments conducted on multiple benchmark datasets demonstrate that our method outperforms previous state-of-the-art approaches in both qualitative and quantitative evaluations.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 7","pages":"Article 102150"},"PeriodicalIF":5.2,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002398/pdfft?md5=0a1496797663e5c523b9ebe20a3e23aa&pid=1-s2.0-S1319157824002398-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141963535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RSA-RRT: A path planning algorithm based on restricted sampling area RSA-RRT:基于受限采样区域的路径规划算法
IF 5.2 2区 计算机科学
Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-08-06 DOI: 10.1016/j.jksuci.2024.102152
Lixin Zhang , Hongtao Yin , Ang Li , Longbiao Hu , Lan Duo
{"title":"RSA-RRT: A path planning algorithm based on restricted sampling area","authors":"Lixin Zhang ,&nbsp;Hongtao Yin ,&nbsp;Ang Li ,&nbsp;Longbiao Hu ,&nbsp;Lan Duo","doi":"10.1016/j.jksuci.2024.102152","DOIUrl":"10.1016/j.jksuci.2024.102152","url":null,"abstract":"<div><p>The rapidly-exploring random tree (RRT) algorithm has a wide range of applications in the field of path planning. However, conventional RRT algorithm suffers from low planning efficiency and long path length, making it unable to handle complex environments. In response to the above problems, this paper proposes an improved RRT algorithm based on restricted sampling area (RSA-RRT). Firstly, to address the problem of low efficiency, a restricted sampling area strategy is proposed. By dynamically restricting the sampling area, the number of invalid sampling points is reduced, thus improving planning efficiency. Then, for the path planning problem in narrow areas, a fixed-angle sampling strategy is proposed, which improves the planning efficiency in narrow areas by conducting larger step size sampling with a fixed angle. Finally, a multi-triangle optimization strategy is proposed to address the problem of longer and more tortuous paths. The effectiveness of RSA-RRT algorithm is verified through improved strategy performance verification and ablation experiments. Comparing with other algorithms in different environments, the results show that RSA-RRT algorithm can obtain shorter paths while taking less time, effectively balancing the path quality and planning speed, and it can be applied in complex real-world environments.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 8","pages":"Article 102152"},"PeriodicalIF":5.2,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002416/pdfft?md5=f00e2115fc7ea409ec90daa76b1a079f&pid=1-s2.0-S1319157824002416-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142083683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信