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

A comprehensive survey on shadow removal from document images: datasets, methods, and opportunities

Vicinagearth 2025年第1期2卷 1-18页

作者： Wang, Bingshu Li, Changping Zou, Wenbin Zhang, Yongjun Chen, Xuhang Chen, C.L. Philip School of Software Northwestern Polytechnical University Xi’an China Guangdong Provincial Key Laboratory of Intelligent Information Processing & Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen University Shenzhen China Yongjun Zhang is with the State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China School of Computer Science and Engineering Huizhou University Huizhou China School of Computer Science and Engineering South China University of Technology and Pazhou Lab Guangzhou China

With the rapid development of document digitization, people have become accustomed to capturing and processing documents using electronic devices such as smartphones. However, the captured document images often suffer from issues like shadows and noise due to environmental factors, which can affect their readability. To improve the quality of captured document images, researchers have proposed a series of models or frameworks and applied them in distinct scenarios such as image enhancement, and document information extraction. In this paper, we primarily focus on shadow removal methods and open-source datasets. We concentrate on recent advancements in this area, first organizing and analyzing nine available datasets. Then, the methods are categorized into conventional methods and neural network-based methods. Conventional methods use manually designed features and include shadow map-based approaches and illumination-based approaches. Neural network-based methods automatically generate features from data and are divided into single-stage approaches and multi-stage approaches. We detail representative algorithms and briefly describe some typical techniques. Finally, we analyze and discuss experimental results, identifying the limitations of datasets and methods. Future research directions are discussed, and nine suggestions for shadow removal from document images are proposed. To our knowledge, this is the first survey of shadow removal methods and related datasets from document images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Personalized Privacy-Preserving Routing Mechanism Design in Payment Channel Network

引用

Journal of Computer Science & Technology 2024年第6期39卷 1380-1400页

作者： Peng-Cheng Zhao Li-Jie Xu Jia Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China

Payment Channel Network(PCN)provides the off-chain settlement of *** is one of the most promising solutions to solve the scalability issue of the *** routing techniques in PCN have been ***,both incentive attack and privacy protection have not been considered in existing *** this paper,we present an auction-based system model for PCN routing using the Laplace differential privacy *** formulate the cost optimization problem to minimize the path cost under the constraints of the Hashed Time-Lock Contract(HTLC)tolerance and the channel *** propose an approximation algorithm to find the top K shortest paths constrained by the HTLC tolerance and the channel capacity,i.e.,top K-restricted shortest ***,we design the probability comparison function to find the path with the largest probability of having the lowest path cost among the top K-restricted shortest paths as the final ***,we apply the binary search to calculate the transaction fee of each *** both theoretical analysis and extensive simulations,we demonstrate that the proposed routing mechanism can guarantee the truthfulness and individual rationality with the probabilities of 1/2 and 1/4,*** can also ensure the differential privacy of the *** experiments on the real-world datasets demonstrate that the privacy leakage of the proposed mechanism is 73.21%lower than that of the unified privacy protection mechanism with only 13.2%more path cost compared with the algorithm without privacy protection on average.

关键词： blockchain payment channel network routing mechanism differential privacy personalized privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

Constructing Three-way Decision with Fuzzy Granular-ball Rough Sets Based on Uncertainty Invariance

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Yang, Jie Liu, Zhuangzhuang Wang, Guoyin Zhang, Qinghua Xia, Shuyin Wu, Di Liu, Yanmin Zunyi Normal University School of Physics and Electronic Science Zunyi563002 China Jiangsu University of Science and Technology School of Computer Zhenjiang212100 China Chongqing University of Posts and Telecommunications Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China Zunyi Normal University School of Mathematics Zunyi563002 China

Granular-ball computing (GBC) proposed by Xia adaptively generates a different neighborhood for each object, resulting in greater generality and flexibility. Moreover, GBC greatly improves the efficiency by replacing point input with granular-ball. However, the current GB-based classifiers rigidly assign a specific class label to each data instance and lacks of the necessary strategies to address uncertain instances. These far-fetched certain classification approachs toward uncertain instances may suffer considerable risks. In this paper, we introduce three-way decision (3WD) into GBC to construct a novel three-way decision with fuzzy granular-ball rough sets (3WD-FGBRS) from the perspective of uncertainty. This helps to construct reasonable multi-granularity spaces for handling complex decision problems with uncertainty. Firstly, 3WD-FGBRS is constructed in a data-driven method based on fuzziness, which avoids the subjective definition of certain risk parameters when calculating the threshold pairs. Based on 3WD-FGBRS, we further propose a sequential three-way decision with fuzzy granular-ball rough sets (S3WD-FGBRS) and analyze the fuzziness loss of multilevel decision result in S3WD-FGBRS. Then, the optimal granular-ball space selection mechanism of S3WD-FGBRS is introduced by combining fuzziness and granular-ball space distance. Finally, extensive comparative experiments are conducted with 3 state-of-the-art GB-based classifiers and 3 classical machine learning classifiers on 12 public benchmark datasets. The results show that our models almost outperform other comparison methods in terms of effectiveness, efficiency and robustness. © 1993-2012 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

FDSR-INT: A Flexible On-Demand In-Band Telemetry Approach for Aerial Computing Networks

引用

IEEE Internet of Things Journal 2025年

作者： Xu, Jinghan Xu, Xiaolong Zhao, Juan Gao, Honghao Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing The School of Computer Science Nanjing210023 China Jinling Institute of Technology School of Computer Science Nanjing211169 China Shanghai University School of Computer Engineering and Science Shanghai200444 China Gachon University College of Future Industry Gyeonggi-Do 461-701 Korea Republic of

In-band network telemetry (INT) is a new network measurement technique that provides real-time, fine-grained packet-level network measurements. However, standard INT lacks the flexibility to perform configurable on-demand network measurements. In this work, we propose a flexible on-demand network measurement mechanism (FDSR-INT) based on a dual bitmap by combining the programmability of segment routing based on IPv6 (SRv6) and the telemetry efficiency of the INT to achieve customizable network measurements. By designing the dual bitmap, the telemetry information of personalized probe nodes is supported, and the telemetry efficiency is improved. SRv6 is employed to direct measurement probe packets, ensuring coverage of a specified set of network targets. Its inherent programmability enables INT to conduct customized per-hop network measurements. The designed flexible INT field structure, which appends traceability information along with telemetry information, reduces the information traceability overhead in the control plane and improves the network compatibility of the mechanism. We solve the optimal probing path by solving a traveler problem in an auxiliary graph and design a greedy pathcutting algorithm to maximize the number of nodes for single packet probing while satisfying the packet length constraints to improve the success rate of the probing task. Finally, we implemented FDSR-INT using P4 and verified its performance experimentally in the constructed *** integrated simulation dynamic environment. FDSR-INT saves 30% of the data plane bandwidth and 54% of the data plane bandwidth on *** interfaces compared with SONM-SR-INT, etc. Furthermore, it has low control plane processing overhead and probe path transmission overhead. © 2014 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

EDSep: An Effective Diffusion-Based Method for Speech Source Separation

EDSep: An Effective Diffusion-Based Method for Speech Source...

引用

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

作者： Jinwei Dong Xinsheng Wang Qirong Mao School of Computer Science and Communication Engineering Jiangsu University Audio Speech and Language Processing Group School of Computer Science Northwestern Polytechnical University Xi’an China Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Zhenjiang China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Generative models have attracted considerable attention for speech separation tasks, and among these, diffusion-based methods are being explored. Despite the notable success of diffusion techniques in generation tasks, their adaptation to speech separation has encountered challenges, notably slow convergence and suboptimal separation outcomes. To address these issues and enhance the efficacy of diffusion-based speech separation, we introduce EDSep, a novel single-channel method grounded in score matching via stochastic differential equation (SDE). This method enhances generative modeling for speech source separation by optimizing training and sampling efficiency. Specifically, a novel denoiser function is proposed to approximate data distributions, which obtains ideal denoiser outputs. Additionally, a stochastic sampler is carefully designed to resolve the reverse SDE during the sampling process, gradually separating speech from mixtures. Extensive experiments on databases such as WSJ0-2mix, LRS2-2mix, and VoxCeleb2-2mix demonstrate our proposed method’s superior performance over existing diffusion and discriminative models, validating its efficacy.

关键词： Training Adaptation models Technological innovation Source separation databases Stochastic processes Differential equations Speech enhancement Diffusion models Mathematical models

来源：评论

学校读者我要写书评

暂无评论

EDSep: An Effective Diffusion-Based Method for Speech Source Separation

arXiv

引用

arXiv 2025年

作者： Dong, Jinwei Wang, Xinsheng Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China Audio Speech and Language Processing Group School of Computer Science Northwestern Polytechnical University Xi’an China

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

FIMI： A Constant Frugal Incentive Mechanism for Time WindowCoverage in Mobile Crowdsensing

引用

Journal of Computer Science & Technology 2017年第5期32卷 919-935页

作者： Jia Xu Jian-Ren Fu De-Jun Yang Li-Jie Xu Lei Wang Tao Li School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Department of Computer Science Colorado School of Mines Golden 80401 U.S.A.

Mobile crowdsensing has become an efficient paradigm for performing large-scale sensing tasks. An incentive mechanism is important for a mobile crowdsensing system to stimulate participants and to achieve good service quality. In this paper, we explore truthful incentive mechanisms that focus on minimizing the total payment for a novel scenario, where the platform needs the complete sensing data in a requested time window (RTW). We model this scenario as a reverse auction and design FIMI, a constant frugal incentive mechanism for time window coverage. FIMI consists of two phases, the candidate selection phase and the winner selection phase. In the candidate selection phase, it selects two most competitive disjoint feasible user sets. Afterwards, in the winner selection phase, it finds all the interchangeable user sets through a graph-theoretic approach. For every pair of such user sets, FIMI chooses one of them by the weighted cost. Further, we extend FIMI to the scenario where the RTW needs to be covered more than once. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the proposed mechanisms achieve the properties of RTW feasibility (or RTW multi-coverage), computation efficiency, individual rationality, truthfulness, and constant frugality.

关键词： crowdsensing incentive mechanism constant frugality

来源：评论

学校读者我要写书评

暂无评论

Server load prediction algorithm based on CM-MC for cloud systems

引用

Journal of Systems Engineering and Electronics 2018年第5期29卷 1069-1078页

作者： XU Xiaolong ZHANG Qitong MOU Yiqi LU Xinyuan Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications State Key Laboratory of Information Security Chinese Academy of Sciences Shanghai Stock Exchange Technology Co. LtdShanghai Stock Exchange Institute of Big Data Research at Yancheng Nanjing University of Posts and Telecommunications

Accurate prediction of server load is important to cloud systems for improving the resource utilization, reducing the energy consumption and guaranteeing the quality of service(QoS).This paper analyzes the features of cloud server load and the advantages and disadvantages of typical server load prediction algorithms, integrates the cloud model(CM) and the Markov chain(MC) together to realize a new CM-MC algorithm, and then proposes a new server load prediction algorithm based on CM-MC for cloud systems. The algorithm utilizes the historical data sample training method of the cloud model, and utilizes the Markov prediction theory to obtain the membership degree vector, based on which the weighted sum of the predicted values is used for the cloud model. The experiments show that the proposed prediction algorithm has higher prediction accuracy than other typical server load prediction algorithms, especially if the data has significant volatility. The proposed server load prediction algorithm based on CM-MC is suitable for cloud systems, and can help to reduce the energy consumption of cloud data centers.

关键词： cloud computing load prediction cloud model Markov chain energy saving

来源：评论

学校读者我要写书评

暂无评论

Multi-task regression learning for survival analysis via prior information guided transductive matrix completion

引用

Frontiers of Computer Science 2020年第5期14卷 99-112页

作者： Lei Chen Kai Shao Xianzhong Long Lingsheng Wang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing210023China MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and AstronauticsNanjing211106China

Survival analysis aims to predict the occurrence time of a particular event of interest,which is crucial for the prognosis analysis of ***,due to the limited study period and potential losing tracks,the observed data inevitably involve some censored instances,and thus brings a unique challenge that distinguishes from the general regression *** addition,survival analysis also suffers from other inherent challenges such as the high-dimension and small-sample-size *** address these challenges,we propose a novel multi-task regression learning model,i.e.,prior information guided transductive matrix completion(PigTMC)model,to predict the survival status of the new ***,we use the multi-label transductive matrix completion framework to leverage the censored instances together with the uncensored instances as the training samples,and simultaneously employ the multi-task transductive feature selection scheme to alleviate the overfitting issue caused by high-dimension and small-sample-size *** addition,we employ the prior temporal stability of the survival statuses at adjacent time intervals to guide survival ***,we design an optimization algorithm with guaranteed convergence to solve the proposed PigTMC ***,the extensive experiments performed on the real microarray gene expression datasets demonstrate that our proposed model outperforms the previously widely used competing methods.

关键词： survival analysis matrix completion multi-task regression transductive learning multi-task feature selection

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in cognitive wireless powered communication networks with wirelessly powered secondary users and primary users

引用

Science China(Information Sciences) 2019年第2期62卷 224-229页

作者： Ding XU Qun LI Wireless Communication Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications

Dear editor,Wireless powered communication networks(WPCNs) are popular especially for wireless sensor networks where sensors can be wirelessly powered. For coordinating wireless power and information transfer, Ju and Zhang in their pioneer work [1] proposed a "harvest-then-transmit" protocol for WPCN, where the time for wireless power transfer (WPT) and wireless information transfer(WIT) is divided into two phases:the WPT phase and WIT phase. Meanwhile, cognitive radio (CR)

关键词： WIT Resource allocation in cognitive wireless powered communication networks with wirelessly powered secondary users and primary users

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：