The existence of shadow leads to the degradation of the image qualities and the defect of ground object information.Shadow removal is therefore an essential research topic in image processing filed.The biggest challen...The existence of shadow leads to the degradation of the image qualities and the defect of ground object information.Shadow removal is therefore an essential research topic in image processing filed.The biggest challenge of shadow removal is how to restore the content of shadow areas correctly while removing the shadow in the image.Paired regions for shadow removal approach based on multi-features is proposed, in which shadow removal is only performed on related sunlit areas.Feature distance between regions is calculated to find the optimal paired regions with considering of multi-features(texture, gradient feature, etc.) comprehensively.Images in different scenes with peak signal-to-noise ratio(PSNR) and structural similarity(SSIM) evaluation indexes are chosen for experiments.The results are shown with six existing comparison methods by visual and quantitative assessments, which verified that the proposed method shows excellent shadow removal effect, the brightness, color of the removed shadow area, and the surrounding non-shadow area can be naturally fused.展开更多
Parallel vector buffer analysis approaches can be classified into 2 types:algorithm-oriented parallel strategy and the data-oriented parallel strategy.These methods do not take its applicability on the existing geogra...Parallel vector buffer analysis approaches can be classified into 2 types:algorithm-oriented parallel strategy and the data-oriented parallel strategy.These methods do not take its applicability on the existing geographic information systems(GIS)platforms into consideration.In order to address the problem,a spatial decomposition approach for accelerating buffer analysis of vector data is proposed.The relationship between the number of vertices of each feature and the buffer analysis computing time is analyzed to generate computational intensity transformation functions(CITFs).Then,computational intensity grids(CIGs)of polyline and polygon are constructed based on the relative CITFs.Using the corresponding CIGs,a spatial decomposition method for parallel buffer analysis is developed.Based on the computational intensity of the features and the sub-domains generated in the decomposition,the features are averagely assigned within the sub-domains into parallel buffer analysis tasks for load balance.Compared with typical regular domain decomposition methods,the new approach accomplishes greater balanced decomposition of computational intensity for parallel buffer analysis and achieves near-linear speedups.展开更多
Synthetic aperture radar(SAR) image despeckling has been an attractive problem in remote sensing.The main challenge is to suppress speckle while preserving edges and preventing unnatural artifacts(such as annoying art...Synthetic aperture radar(SAR) image despeckling has been an attractive problem in remote sensing.The main challenge is to suppress speckle while preserving edges and preventing unnatural artifacts(such as annoying artifacts in homogeneous regions and over-smoothed edges).To address these problems,this paper proposes a new variational model with a nonconvex nonsmooth Lp(0 <p<1) norm regularization.It incorporates Lp(0<p<1) norm regularization and I-divergence fidelity term.Due to the nonconvex nonsmooth property,the regularization can better recover neat edges and homogeneous regions.The Ⅰ-divergence fidelity term is used to suppress the multiplicative noise effectively.Moreover,based on variable-splitting and alternating direction method of multipliers(ADMM) method,an efficient algorithm is proposed for solving this model.Intensive experimental results demonstrate that nonconvex nonsmooth model is superior to other state-of-the-art approaches qualitatively and quantitatively.展开更多
With the complexity of the composition process and the rapid growth of candidate services,realizing optimal or near-optimal service composition is an urgent problem.Currently,the static service composition chain is ri...With the complexity of the composition process and the rapid growth of candidate services,realizing optimal or near-optimal service composition is an urgent problem.Currently,the static service composition chain is rigid and cannot be easily adapted to the dynamic Web environment.To address these challenges,the geographic information service composition(GISC) problem as a sequential decision-making task is modeled.In addition,the Markov decision process(MDP),as a universal model for the planning problem of agents,is used to describe the GISC problem.Then,to achieve self-adaptivity and optimization in a dynamic environment,a novel approach that integrates Monte Carlo tree search(MCTS) and a temporal-difference(TD) learning algorithm is proposed.The concrete services of abstract services are determined with optimal policies and adaptive capability at runtime,based on the environment and the status of component services.The simulation experiment is performed to demonstrate the effectiveness and efficiency through learning quality and performance.展开更多
基金Supported by the National Natural Science Foundation of China (No. 41971356, 41701446)the Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation,Ministry of Natural Resources (No. KF-2022-07-001)。
文摘The existence of shadow leads to the degradation of the image qualities and the defect of ground object information.Shadow removal is therefore an essential research topic in image processing filed.The biggest challenge of shadow removal is how to restore the content of shadow areas correctly while removing the shadow in the image.Paired regions for shadow removal approach based on multi-features is proposed, in which shadow removal is only performed on related sunlit areas.Feature distance between regions is calculated to find the optimal paired regions with considering of multi-features(texture, gradient feature, etc.) comprehensively.Images in different scenes with peak signal-to-noise ratio(PSNR) and structural similarity(SSIM) evaluation indexes are chosen for experiments.The results are shown with six existing comparison methods by visual and quantitative assessments, which verified that the proposed method shows excellent shadow removal effect, the brightness, color of the removed shadow area, and the surrounding non-shadow area can be naturally fused.
基金the National Natural Science Foundation of China(No.41971356,41701446)National Key Research and Development Program of China(No.2017YFB0503600,2018YFB0505500,2017YFC0602204).
文摘Parallel vector buffer analysis approaches can be classified into 2 types:algorithm-oriented parallel strategy and the data-oriented parallel strategy.These methods do not take its applicability on the existing geographic information systems(GIS)platforms into consideration.In order to address the problem,a spatial decomposition approach for accelerating buffer analysis of vector data is proposed.The relationship between the number of vertices of each feature and the buffer analysis computing time is analyzed to generate computational intensity transformation functions(CITFs).Then,computational intensity grids(CIGs)of polyline and polygon are constructed based on the relative CITFs.Using the corresponding CIGs,a spatial decomposition method for parallel buffer analysis is developed.Based on the computational intensity of the features and the sub-domains generated in the decomposition,the features are averagely assigned within the sub-domains into parallel buffer analysis tasks for load balance.Compared with typical regular domain decomposition methods,the new approach accomplishes greater balanced decomposition of computational intensity for parallel buffer analysis and achieves near-linear speedups.
基金Supported by the National Natural Science Foundation of China(No.41971356,41701446)the National Key Research and Development Program of China(No.2018YFB0505500)the Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation,Ministry of Natural Resources(No.KF-2020-05-011)。
文摘Synthetic aperture radar(SAR) image despeckling has been an attractive problem in remote sensing.The main challenge is to suppress speckle while preserving edges and preventing unnatural artifacts(such as annoying artifacts in homogeneous regions and over-smoothed edges).To address these problems,this paper proposes a new variational model with a nonconvex nonsmooth Lp(0 <p<1) norm regularization.It incorporates Lp(0<p<1) norm regularization and I-divergence fidelity term.Due to the nonconvex nonsmooth property,the regularization can better recover neat edges and homogeneous regions.The Ⅰ-divergence fidelity term is used to suppress the multiplicative noise effectively.Moreover,based on variable-splitting and alternating direction method of multipliers(ADMM) method,an efficient algorithm is proposed for solving this model.Intensive experimental results demonstrate that nonconvex nonsmooth model is superior to other state-of-the-art approaches qualitatively and quantitatively.
基金Supported by the National Natural Science Foundation of China(No.41971356,41671400,41701446)National Key Research and Development Program of China(No.2017YFB0503600,2018YFB0505500)Hubei Province Natural Science Foundation of China(No.2017CFB277)。
文摘With the complexity of the composition process and the rapid growth of candidate services,realizing optimal or near-optimal service composition is an urgent problem.Currently,the static service composition chain is rigid and cannot be easily adapted to the dynamic Web environment.To address these challenges,the geographic information service composition(GISC) problem as a sequential decision-making task is modeled.In addition,the Markov decision process(MDP),as a universal model for the planning problem of agents,is used to describe the GISC problem.Then,to achieve self-adaptivity and optimization in a dynamic environment,a novel approach that integrates Monte Carlo tree search(MCTS) and a temporal-difference(TD) learning algorithm is proposed.The concrete services of abstract services are determined with optimal policies and adaptive capability at runtime,based on the environment and the status of component services.The simulation experiment is performed to demonstrate the effectiveness and efficiency through learning quality and performance.
