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

{"title":"A secure, privacy-preserving, and cost-efficient decentralized cloud storage framework using blockchain","authors":"Swatisipra Das ,&nbsp;Minati Mishra ,&nbsp;Rojalina Priyadarshini ,&nbsp;Rabindra Kumar Barik ,&nbsp;Manob Jyoti Saikia","doi":"10.1016/j.jksuci.2024.102260","DOIUrl":"10.1016/j.jksuci.2024.102260","url":null,"abstract":"<div><div>Cloud services benefit countless users worldwide due to notable features, such as on-demand self-service, scalability, easy maintenance, etc. Secure storage and access to data in the cloud is critical. Cloud Identity and Access Management (IAM) service, which acts in a centralized way to provide access requests to the authenticated users. Controlled access sometimes fails to preserve the privacy of the sensitive information stored in the cloud due to several reasons, such as insider attacks, breaches of data security, or any other types of unauthorized access. This paper suggests a blockchain-assisted secure storage and access mechanism to secure sensitive data. Here blockchain is used as a trust management entity that verifies the identity of the user. Along with this it issues the Access Control Lists (ACLs) and identity token, and at the same time, it records all the interactions between the users and service providers. Data transmission is transparent since transactions are recorded. Importance is given to user privacy and decryption keys security. Linear(t,n) secret sharing scheme is used for key share generation and distribution. For experimentation, in MetaMask cryptocurrency wallet Goerli test network is used. Results reveal that our model consumes less cost to execute than other existing works. The total execution cost to upload and download a data file is 0.00281392 and 0.02455307 GoerliETH. Where the all verification operations such as identity token, ACL, access_log, and data integrity are executed in Zero gas value. The proposed model maintains a constant gas cost regardless of transaction volume, with costs of 33.04 ETH and 32.24 ETH for data upload and download. Moreover, we present a comparison of execution time performance in three different system configurations.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102260"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180403","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}

{"title":"Knowledge-embedded multi-layer collaborative adaptive fusion network: Addressing challenges in foggy conditions and complex imaging","authors":"Zhu Chen,&nbsp;Fan Li,&nbsp;Yueqin Diao,&nbsp;Wanlong Zhao,&nbsp;Puyin Fan","doi":"10.1016/j.jksuci.2024.102230","DOIUrl":"10.1016/j.jksuci.2024.102230","url":null,"abstract":"<div><div>Infrared and visible image fusion aims at generating high-quality images that serve both human and machine visual perception under extreme imaging conditions. However, current fusion methods primarily rely on datasets comprising infrared and visible images captured under clear weather conditions. When applied to real-world scenarios, image fusion tasks inevitably encounter challenges posed by adverse weather conditions such as heavy fog, resulting in difficulties in obtaining effective information and inferior visual perception. To address these challenges, this paper proposes a Mean Teacher-based Self-supervised Image Restoration and multimodal Image Fusion joint learning network (SIRIFN), which enhances the robustness of the fusion network in adverse weather conditions by employing deep supervision from a guiding network to the learning network. Furthermore, to enhance the network’s information extraction and integration capabilities, our Multi-level Feature Collaborative adaptive Reconstruction Network (MFCRNet) is introduced, which adopts a multi-branch, multi-scale design, with differentiated processing strategies for different features. This approach preserves rich texture information while maintaining semantic consistency from the source images. Extensive experiments demonstrate that SIRIFN outperforms current state-of-the-art algorithms in both visual quality and quantitative evaluation. Specifically, the joint implementation of image restoration and multimodal fusion provides more effective information for visual tasks under extreme weather conditions, thereby facilitating downstream visual tasks.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102230"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657772","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}

{"title":"Feature-fused residual network for time series classification","authors":"Yanxuan Wei ,&nbsp;Mingsen Du ,&nbsp;Teng Li ,&nbsp;Xiangwei Zheng ,&nbsp;Cun Ji","doi":"10.1016/j.jksuci.2024.102227","DOIUrl":"10.1016/j.jksuci.2024.102227","url":null,"abstract":"<div><div>In various fields such as healthcare and transportation, accurately classifying time series data can provide important support for decision-making. To further improve the accuracy of time series classification, we propose a Feature-fused Residual Network based on Multi-scale Signed Recurrence Plot (MSRP-FFRN). This method transforms one-dimensional time series into two-dimensional images, representing the temporal correlation of time series in a two-dimensional space and revealing hidden details within the data. To enhance these details further, we extract multi-scale features by setting receptive fields of different sizes and using adaptive network depths, which improves image quality. To evaluate the performance of this method, we conducted experiments on 43 UCR datasets and compared it with nine state-of-the-art baseline methods. The experimental results show that MSRP-FFRN ranks first on critical difference diagram, achieving the highest accuracy on 18 datasets with an average accuracy of 89.9%, making it the best-performing method overall. Additionally, the effectiveness of this method is further validated through metrics such as Precision, Recall, and F1 score. Results from ablation experiments also highlight the efficacy of the improvements made by MSRP-FFRN.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102227"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657771","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}

{"title":"Deep indoor illumination estimation based on spherical gaussian representation with scene prior knowledge","authors":"Chao Xu ,&nbsp;Cheng Han ,&nbsp;Huamin Yang ,&nbsp;Chao Zhang ,&nbsp;Shiyu Lu","doi":"10.1016/j.jksuci.2024.102222","DOIUrl":"10.1016/j.jksuci.2024.102222","url":null,"abstract":"<div><div>High dynamic range (HDR) illumination estimation from a single low dynamic range image is a critical task in the fields of computer vision, graphics and augmented reality. However, directly learning the full HDR environment map or parametric lighting information from a single image is extremely difficult and inaccurate. As a result, we propose a two-stage network approach for illumination estimation that integrates spherical gaussian (SG) representation with scene prior knowledge. In the first stage, a convolutional neural network is utilized to generate material and geometric information about the scene, which serves as prior knowledge for lighting prediction. In the second stage, we model indoor environment illumination using 128 SG functions with fixed center direction and bandwidth, allowing only the amplitude to vary. Subsequently, a Transformer-based lighting parameter regressor is employed to capture the complex relationship between the input images with scene prior information and its SG illumination. Additionally, we introduce a hybrid loss function, which combines a masked loss for high-frequency illumination with a rendering loss for improving the visual quality. By training and evaluating the lighting model on the created SG illumination dataset, the proposed method achieves competitive results in both quantitative metrics and visual quality, outperforming state-of-the-art methods.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102222"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657924","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}

{"title":"Image stitching algorithm based on two-stage optimal seam line search","authors":"Guijin Han ,&nbsp;Yuanzheng Zhang ,&nbsp;Mengchun Zhou","doi":"10.1016/j.jksuci.2024.102256","DOIUrl":"10.1016/j.jksuci.2024.102256","url":null,"abstract":"<div><div>Traditional feature matching algorithms often struggle with poor performance in scenarios involving local detail deformations under varying perspectives. Additionally, traditional optimal seamline search-based image stitching algorithms tend to overlook structural and texture information, resulting in ghosting and visible seams. To address these issues, this paper proposes an image stitching algorithm based on a two-stage optimal seamline search. The algorithm leverages a Homography Network as the foundation, incorporating a homography detail-aware network (HDAN) for feature point matching. By introducing a cost volume in the feature matching layer, the algorithm enhances the description of local detail deformation relationships, thereby improving feature matching performance under different perspectives. The two-stage optimal seamline search algorithm designed for image fusion introduces gradient and structural similarity features on top of traditional color-based optimal seamline search algorithms. The algorithm steps include: (1) Searching for structurally similar regions, i.e., high-frequency regions in high-gradient images, and using a color-based graph cut algorithm to search for seamlines within all high-frequency regions, excluding horizontal seamlines; (2) Using a dynamic programming algorithm to complete each vertical seamline, where the pixel energy is comprehensively calculated based on its differences in color and gradient with the surrounding area. The complete seamline energies are then calculated using color, gradient, and structural similarity differences within the seamline neighborhood, and the seamline with the minimum energy is selected as the optimal seamline. A simulation experiment was conducted using 30 image pairs from the UDIS-D dataset (Unsupervised Deep Image Stitching Dataset). The results demonstrate significant improvements in PSNR and SSIM metrics compared to other image stitching algorithms, with PSNR improvements ranging from 5.63% to 11.25% and SSIM improvements ranging from 11.09% to 24.54%, confirming the superiority of this algorithm in image stitching tasks. The proposed image stitching algorithm based on two-stage optimal seamline search, whether evaluated through subjective visual perception or objective data comparison, outperforms other algorithms by enhancing the natural transition of seamlines in terms of structure and texture, reducing ghosting and visible seams in stitched images.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102256"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142723733","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}

{"title":"ACTF: An efficient lossless compression algorithm for time series floating point data","authors":"Weijie Wang ,&nbsp;Wenhui Chen ,&nbsp;Qinhon Lei ,&nbsp;Zhe Li ,&nbsp;Huihuang Zhao","doi":"10.1016/j.jksuci.2024.102246","DOIUrl":"10.1016/j.jksuci.2024.102246","url":null,"abstract":"<div><div>The volume of time series data across various fields is steadily increasing. However, this unprocessed massive data challenges transmission efficiency, computational arithmetic, and storage capacity. Therefore, the compression of time series data is essential for improving transmission, computation, and storage. Currently, improving time series floating-point coding rules is the primary method for enhancing compression algorithms efficiency and ratio. This paper presents an efficient lossless compression algorithm for time series floating point data, designed based on existing compression algorithms. We employ three optimization strategies data preprocessing, coding category expansion, and feature refinement representation to enhance the compression ratio and efficiency of compressing time-series floating-point numbers. Through experimental comparisons and validations, we demonstrate that our algorithm outperforms Chimp, Chimp₁₂₈, Gorilla, and other compression algorithms across multiple datasets. The experimental results on 30 datasets show that our algorithm improves the compression ratio of time series algorithms by an average of 12.25% and compression and decompression efficiencies by an average of 27.21%. Notably, it achieves a 24.06% compression ratio improvement on the IOT1 dataset and a 42.96% compression and decompression efficiency improvement on the IOT4 dataset.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102246"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705934","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}

{"title":"Enhancing stock market predictions via hybrid external trend and internal components analysis and long short term memory model","authors":"Fatene Dioubi ,&nbsp;Negalign Wake Hundera ,&nbsp;Huiying Xu ,&nbsp;Xinzhong Zhu","doi":"10.1016/j.jksuci.2024.102252","DOIUrl":"10.1016/j.jksuci.2024.102252","url":null,"abstract":"<div><div>When it comes to financial decision-making, stock market predictability is extremely important since it offers valuable information that may guide investment strategies, risk management, and portfolio allocation overall. Traditional methods often fail to accurately predict stock prices due to their complexity and inability to handle non-linear and non-stationary patterns in market data. To address these issues, this study introduces an innovative model that combines the External Trend and Internal Components Analysis decomposition method (ETICA) with the Long Short-Term Memory (LSTM) model, aiming to enhance stock market predictions for S&amp;P 500, NASDAQ, Dow Jones, SSE and SZSE indices. Through rigorous testing across various training data proportions and epoch settings, our findings reveal that the proposed hybrid model outperforms the single LSTM model, delivering significantly lower Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) values. This enhanced precision reduces prediction errors, underscoring the model’s robustness and reliability. The superior performance of the ETICA-LSTM model highlights its potential as a powerful financial forecasting tool, promising to transform investment strategies, optimize risk management, and enhance portfolio performance.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102252"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180023","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}

{"title":"CRNet: Cascaded Refinement Network for polyp segmentation","authors":"Xiaolan Wen ,&nbsp;Anwen Zhang ,&nbsp;Chuan Lin ,&nbsp;Xintao Pang","doi":"10.1016/j.jksuci.2024.102250","DOIUrl":"10.1016/j.jksuci.2024.102250","url":null,"abstract":"<div><div>Technology for automatic segmentation plays a crucial role in the early diagnosis and treatment of ColoRectal Cancer (CRC). Existing polyp segmentation methods often focus on advanced feature extraction while neglecting detailed low-level features, This somewhat limits the enhancement of segmentation performance. This paper proposes a new technique called the Cascaded Refinement Network (CRNet), designed to improve polyp segmentation performance by combining low-level and high-level features through a cascaded contextual network structure. To accurately capture the morphological variations of polyps and enhance the clarity of segmentation boundaries, we have designed the Multi-Scale Feature Optimization (MFO) module and the Contextual Edge Guidance (CEG) module. Additionally, to further enhance feature fusion and utilization, we introduced the Cascaded Local Feature Fusion (CLFF) module, which effectively integrates cross-layer correlations, allowing the network to understand complex polyp structures better. By conducting a large number of experiments, our model achieved a 0.3% and 3.1% higher mDice score than the latest MMFIL-Net in the two main datasets of Kvasir-SEG and CVC-ClinicDB, respectively. Ablation studies show that MFO improves the baseline score by 4%, and the network without CLFF and CEG results in a reduction of 2.4% and 1.7% in mDice scores, respectively. This further validates the contribution of each module to the polyp segmentation performance. CRNet enhances model performance through the introduction of multiple modules but also increases model complexity. Future work will explore how to reduce computational complexity and improve inference speed while maintaining high performance. The source code for this paper can be found at <span><span>https://github.com/l1986036/CRNet</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102250"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142723734","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}

{"title":"The multi-objective task assignment scheme for software crowdsourcing platforms involving new workers","authors":"Minglan Fu,&nbsp;Zhijie Zhang,&nbsp;ZouXi Wang,&nbsp;Debao Chen","doi":"10.1016/j.jksuci.2024.102237","DOIUrl":"10.1016/j.jksuci.2024.102237","url":null,"abstract":"<div><div>Software crowdsourcing has become a cornerstone of the Internet economy because of its unique capacity for selecting optimal workers to complete specific tasks. However, new workers face limited task opportunities compared to experienced workers, which negatively impacts their motivation and decreases overall activity on crowdsourcing platforms. This reduced activity can harm platform reputation. To encourage the active participation of new workers, this study introduces a novel method to identify and match worker–task preferences. Our approach categorizes preferred tasks based on golden tasks, historical data, and worker interests. We then present the Multi-Objective Worker–Task Recommendation (MOWTR) algorithm, built upon the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). The MOWTR algorithm allocates tasks by considering worker preferences, salaries, and capabilities, aiming to optimize collective team performance while minimizing team costs, especially for new workers. New crossover and two-stage mutation operators are incorporated to increase algorithm efficiency. Experimental evaluations on four real and synthetic datasets demonstrate that MOWTR outperforms four advanced baseline methods, confirming its effectiveness.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102237"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705874","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}

{"title":"Correlation analysis of multifractal stock price fluctuations based on partition function","authors":"Huan Wang,&nbsp;Wei Song","doi":"10.1016/j.jksuci.2024.102233","DOIUrl":"10.1016/j.jksuci.2024.102233","url":null,"abstract":"<div><div>Studying the correlation analysis of stock price fluctuations helps to understand market dynamics better and improve the scientific nature of investment decisions and risk management capabilities. Most existing methods use multifractals to explore the correlation between different economic entities. However, the study of multifractals fails to fully consider the weight of each entity’s impact on the market, resulting in an inaccurate description of the overall market dynamics. To address this problem, this paper creatively proposes a weighted multifractal analysis method (WMA). The correlation analysis of government regulation, market supply and demand, and stock price index is performed using the data of A-share listed companies in Shenzhen and Shanghai as samples. First, we consider the amplitude fluctuation information the signal carries and weigh the partition function according to the proportion of variance in the segment for different amplitude changes. Secondly, we derive the theoretical analytical form of the classical multifractal model (SMA) of the scaling indicator under WMA. Finally, through numerical simulation experiments, it is confirmed that WMA is equally effective as SMA. In addition, the re-fractal correlation analysis of real financial time series also confirms that WMA can effectively utilize the amplitude fluctuation information in the series and outperforms the classical SMA method in distinguishing different signals.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102233"},"PeriodicalIF":5.2,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142705875","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}