Query：
学者姓名：傅明建
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
A fast deblurring network, based on a high-performance convolutional network and pixel volume, is proposed to address the limitations of existing video deblurring algorithms, which often overly emphasize inter-frame information, leading to high algorithmic complexity. First, high-performance convolutional networks are utilized to prune the deblurring network, thereby reducing both the number of model parameters and computational complexity. To address the increased network computational complexity resulting from the extensive use of traditional two-dimensional convolutional layers, depthwise over-parameterized convolutions are employed to replace traditional convolutions. This substitution significantly reduces computational complexity without compromising the network's structure and performance. In addition, the Charbonnier loss function is used to approximate the mean absolute error (MAE) loss function to alleviate the over-smoothing problem. At the same time, the problem of non-differentiability of the MAE loss function at zero is solved by adding a constant, to enhance the visual quality of video images. Experimental results demonstrate that the proposed method delivers superior deblurring performance. Compared with the baseline pixel volume deblurring network framework, our method achieves a significant reduction in model complexity, demonstrating 28.73% fewer parameters and 59.96% lower floating-point operations, underscoring its theoretical significance. (c) 2025 SPIE and IS&T
Keyword ：
algorithmic complexity algorithmic complexity depthwise over-parameterized convolutions depthwise over-parameterized convolutions loss function loss function video deblurring video deblurring
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Xie, Shangxi , Xia, Yiming , Zhong, Wenqi et al. Lightweight pixel volume deblurring network: enhanced video deblurring via efficient architecture optimization [J]. | JOURNAL OF ELECTRONIC IMAGING , 2025 , 34 (2) . |
| MLA | Xie, Shangxi et al. "Lightweight pixel volume deblurring network: enhanced video deblurring via efficient architecture optimization" . | JOURNAL OF ELECTRONIC IMAGING 34 . 2 (2025) . |
| APA | Xie, Shangxi , Xia, Yiming , Zhong, Wenqi , Lin, Liqun , Fu, Mingjian . Lightweight pixel volume deblurring network: enhanced video deblurring via efficient architecture optimization . | JOURNAL OF ELECTRONIC IMAGING , 2025 , 34 (2) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Multi-view semi-supervised learning enables to efficiently leverage multi-view information as well as labeled and unlabeled data to solve practical problems. With graph neural networks, multi-view semi-supervised learning can be smooth and robust to the label propagation process. Hypergraph learning is an approach to hypergraph topology that aims to identify and exploit high-order relations on hypergraphs to uncover data beyond one-to-one in real-world applications. However, traditional hypergraph construction methods usually consider only local correlations between samples and may ignore dependencies that exist in the wider context of the dataset. In this paper, we propose a novel multi-view high-order correlation modeling method, where the connectivity of hyperedges is determined through clustering, and complementary information from each view is integrated via a hypergraph neural network. Inspired by the divisibility of graphs revealed by spectral graph theory, the proposed method works well to capture global high-order correlations within data and uncover potential manifolds. To assess the effectiveness of hypergraph modeling, we conduct a comprehensive evaluation of a multi-view semi-supervised node classification task. The experiments illustrate that the proposed approach achieves superior performance compared to current state-of-the-art algorithms and general hypergraph learning across eight datasets.
Keyword ：
Global graph structure Global graph structure Hypergraph construction Hypergraph construction Hypergraph neural network Hypergraph neural network Multi-view learning Multi-view learning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Yuze , Lan, Shiyang , Cai, Zhiling et al. SCHG: Spectral Clustering-guided Hypergraph Neural Networks for Multi-view Semi-supervised Learning [J]. | EXPERT SYSTEMS WITH APPLICATIONS , 2025 , 277 . |
| MLA | Wu, Yuze et al. "SCHG: Spectral Clustering-guided Hypergraph Neural Networks for Multi-view Semi-supervised Learning" . | EXPERT SYSTEMS WITH APPLICATIONS 277 (2025) . |
| APA | Wu, Yuze , Lan, Shiyang , Cai, Zhiling , Fu, Mingjian , Li, Jinbo , Wang, Shiping . SCHG: Spectral Clustering-guided Hypergraph Neural Networks for Multi-view Semi-supervised Learning . | EXPERT SYSTEMS WITH APPLICATIONS , 2025 , 277 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
There are a lot of multi-objective optimization problems (MOPs) in the real world, and many multi-objective evolutionary algorithms (MOEAs) have been presented to solve MOPs. However, obtaining non-dominated solutions that trade off convergence and diversity remains a major challenge for a MOEA. To solve this problem, this paper designs an efficient multi-objective sine cosine algorithm based on a competitive mechanism (CMOSCA). In the CMOSCA, the ranking relies on non-dominated sorting, and the crowding distance rank is utilized to choose the outstanding agents, which are employed to guide the evolution of the SCA. Furthermore, a competitive mechanism stemming from the shift-based density estimation approach is adopted to devise a new position updating operator for creating offspring agents. In each competition, two agents are randomly selected from the outstanding agents, and the winner of the competition is integrated into the position update scheme of the SCA. The performance of our proposed CMOSCA was first verified on three benchmark suites (i.e., DTLZ, WFG, and ZDT) with diversity characteristics and compared with several MOEAs. The experimental results indicated that the CMOSCA can obtain a Pareto-optimal front with better convergence and diversity. Finally, the CMOSCA was applied to deal with several engineering design problems taken from the literature, and the statistical results demonstrated that the CMOSCA is an efficient and effective approach for engineering design problems.
Keyword ：
competitive mechanism competitive mechanism engineering design problem engineering design problem multi-objective algorithm multi-objective algorithm sine cosine algorithm (SCA) sine cosine algorithm (SCA)
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Nengxian , Pan, Jeng-Shyang , Liu, Genggeng et al. A Multi-Objective Sine Cosine Algorithm Based on a Competitive Mechanism and Its Application in Engineering Design Problems [J]. | BIOMIMETICS , 2024 , 9 (2) . |
| MLA | Liu, Nengxian et al. "A Multi-Objective Sine Cosine Algorithm Based on a Competitive Mechanism and Its Application in Engineering Design Problems" . | BIOMIMETICS 9 . 2 (2024) . |
| APA | Liu, Nengxian , Pan, Jeng-Shyang , Liu, Genggeng , Fu, Mingjian , Kong, Yanyan , Hu, Pei . A Multi-Objective Sine Cosine Algorithm Based on a Competitive Mechanism and Its Application in Engineering Design Problems . | BIOMIMETICS , 2024 , 9 (2) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Radial basis function network-based autoregressive with exogenous input (RBF-ARX) models are useful in nonlinear system modelling and prediction. The identification of RBF-ARX models includes optimization of the (model lags, number of hidden nodes and state vector) and the parameters of the model. Previous works have usually ignored optimizations of the model's architecture. In this paper, the RBF-ARX architecture, which includes the selection of lags, number of nodes of the RBF network, lag orders and state vector, is encoded into a chromosome and is evolved simultaneously by a genetic algorithm (GA). This combines the advantages of the GA and the variable projection (VP) method to automatically generate a parsimonious RBF-ARX model with a high generalization performance. The highly efficient VP algorithm is used as a local search strategy to accelerate the convergence of the optimization. The experimental results demonstrate the effectiveness of the proposed method. (C) 2022 Elsevier B.V. All rights reserved.
Keyword ：
Genetic algorithms Genetic algorithms Model selection Model selection Parameter estimation Parameter estimation RBF-ARX models RBF-ARX models Time series prediction Time series prediction Variable projection Variable projection
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Qiong-Ying , Chen, Long , Su, Jian-Nan et al. Model selection for RBF-ARX models [J]. | APPLIED SOFT COMPUTING , 2022 , 121 . |
| MLA | Chen, Qiong-Ying et al. "Model selection for RBF-ARX models" . | APPLIED SOFT COMPUTING 121 (2022) . |
| APA | Chen, Qiong-Ying , Chen, Long , Su, Jian-Nan , Fu, Ming-Jian , Chen, Guang-Yong . Model selection for RBF-ARX models . | APPLIED SOFT COMPUTING , 2022 , 121 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Memory and reward have been proved as effective mechanisms for maintaining cooperation among selfish individuals. In this article, this study proposes a reward mechanism based on historical loyalty, that is, an individual who adhere to the cooperation strategy for a period of time will get additional reward. Accordingly, the reward for a loyal cooperator is undertaken by neighboring defectors equally. The results on prisoner's dilemma game show that, with appropriate loyalty threshold and reward factors, the cooperation level can be greatly enhanced. In addition, the time evolution of cooperator density and the spatial distribution of cooperators and defectors are also studied. (C) 2020 Published by Elsevier B.V.
Keyword ：
Cooperation Cooperation Memory Memory Reward Reward Spatial prisoner's dilemma game Spatial prisoner's dilemma game
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fu, Mingjian , Wang, Jingbin , Cheng, Linlin et al. Promotion of cooperation with loyalty-based reward in the spatial prisoner's dilemma game [J]. | PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS , 2021 , 580 . |
| MLA | Fu, Mingjian et al. "Promotion of cooperation with loyalty-based reward in the spatial prisoner's dilemma game" . | PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 580 (2021) . |
| APA | Fu, Mingjian , Wang, Jingbin , Cheng, Linlin , Chen, Lijuan . Promotion of cooperation with loyalty-based reward in the spatial prisoner's dilemma game . | PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS , 2021 , 580 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
We propose a punishment mechanism in the spatial public goods game with continuous strategies. The value of strategy denotes the amount that an individual contributes to each group. In a group, the ones who contribute the least will be punished by others and punishers equally share the associated costs. It is found that the punishment fine and the number of individuals being punished in a group play important roles in the evolution of cooperation. Compared with the case of no punishment, the cooperation level increases (decreases) when the number of individuals being punished is less (more) than half of the total number of individuals in a group. For a fixed value of the enhancement factor, the cooperation level increases (decreases) as the punishment fine increases when individuals being punished are the minority (majority) in a group. Copyright (C) 2020 EPLA
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yang, Han-Xin , Fu, Ming-Jian . A punishment mechanism in the spatial public goods game with continuous strategies [J]. | EPL , 2020 , 132 (1) . |
| MLA | Yang, Han-Xin et al. "A punishment mechanism in the spatial public goods game with continuous strategies" . | EPL 132 . 1 (2020) . |
| APA | Yang, Han-Xin , Fu, Ming-Jian . A punishment mechanism in the spatial public goods game with continuous strategies . | EPL , 2020 , 132 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对色彩传递算法,在图像、视频着色过程中,用户人工选择源图像盲目性高、工作量大、自动化程度差的问题,提出一种基于情感语义的色彩传递源图像自动选择算法.利用图像的情感语义,通过提取用户所选情感的颜色特征与图库图像的颜色特征进行相似性比对,自动为用户检索出相应的源图像,为用户选择所需的源图像提供依据.实验结果表明,算法效果良好,提高色彩传递应用过程的自动化水平,减少人工干预的程度.
Keyword ：
Iαβ颜色空间 Iαβ颜色空间 情感语义 情感语义 源图选择 源图选择 色彩传递 色彩传递 颜色特征 颜色特征
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 程琳琳 , 陈昭炯 , 傅明建 . 一种基于情感语义的色彩传递源图选择算法 [J]. | 计算机应用与软件 , 2019 , 36 (1) : 78-82,163 . |
| MLA | 程琳琳 et al. "一种基于情感语义的色彩传递源图选择算法" . | 计算机应用与软件 36 . 1 (2019) : 78-82,163 . |
| APA | 程琳琳 , 陈昭炯 , 傅明建 . 一种基于情感语义的色彩传递源图选择算法 . | 计算机应用与软件 , 2019 , 36 (1) , 78-82,163 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对传统色彩传递算法在实际应用中灵活度不高的问题,提出一种基于感兴趣区域ROI(Regions of Interest)的色彩传递算法.通过提取目标图像的感兴趣区域,将其与用户所选图像进行拼贴,得到新目标图像,并以此进行色彩传递,解决了色彩传递用户对图像色彩处理多样化、个性化需求的问题.同时,针对传统感兴趣区域提取方法容易受纹理噪声干扰、提取尺寸不易控制等问题,提出一种基于变异度的感兴趣区域提取新算法.实验结果表明,该算法效果良好.基于变异度的感兴趣区域提取算法可更准确获取图像的感兴趣区域.基于感兴趣区域的色彩传递算法可在不影响图像主体内容表达的情况下,使得色彩传递的效果更加生动多变,更具个性化,提高了色彩传递应用的灵活度.
Keyword ：
lαβ颜色空间 lαβ颜色空间 变异度 变异度 感兴趣区域 感兴趣区域 熵 熵 色彩传递 色彩传递
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 程琳琳 , 陈昭炯 , 傅明建 . 基于感兴趣区域的色彩传递算法 [J]. | 计算机应用与软件 , 2019 , 36 (2) : 39-43 . |
| MLA | 程琳琳 et al. "基于感兴趣区域的色彩传递算法" . | 计算机应用与软件 36 . 2 (2019) : 39-43 . |
| APA | 程琳琳 , 陈昭炯 , 傅明建 . 基于感兴趣区域的色彩传递算法 . | 计算机应用与软件 , 2019 , 36 (2) , 39-43 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对传统图像水彩风格生成算法时间效率低,且容易出现色彩不协调的问题,提出一种基于奇异值分解SVD(singular value decomposition)的图像水彩风格绘制算法.利用SVD算法提取图像的主成分,再通过mean-shift算法实现图像的水彩风格效果.采用色彩传递算法,改善图像水彩风格的色彩视觉效果.实验结果表明,该算法实现的水彩风格艺术效果良好,可提高时间效率,同时色彩传递技术也使得水彩风格的艺术效果更加灵活多变.
Keyword ：
mean-shift mean-shift SVD) SVD) 分水岭变换 分水岭变换 奇异值分解( 奇异值分解( 水彩风格绘制 水彩风格绘制 色彩传递 色彩传递
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 程琳琳 , 陈昭炯 , 傅明建 . 一种基于SVD的图像水彩风格绘制算法 [J]. | 计算机应用与软件 , 2019 , 36 (5) : 183-186,215 . |
| MLA | 程琳琳 et al. "一种基于SVD的图像水彩风格绘制算法" . | 计算机应用与软件 36 . 5 (2019) : 183-186,215 . |
| APA | 程琳琳 , 陈昭炯 , 傅明建 . 一种基于SVD的图像水彩风格绘制算法 . | 计算机应用与软件 , 2019 , 36 (5) , 183-186,215 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
It is well known that the feedback mechanism or the individual's intuitive response to the epidemic can have a vital effect on the disease's spreading. In this paper, we investigate the bifurcation behavior and the optimal feedback mechanism for an SIS epidemic model on heterogeneous networks. Firstly, we present the bifurcation analysis when the basic reproduction number is equal to unity. The direction of bifurcation is also determined. Secondly, different from the constant coefficient in the existing literature, we incorporate a time-varying feedback mechanism coefficient. This is more reasonable since the initiative response of people is constantly changing during different process of disease prevalence. We analyze the optimal feedback mechanism for the SIS epidemic network model by applying the optimal control theory. The existence and uniqueness of the optimal control strategy are obtained. Finally, a numerical example is presented to verify the efficiency of the obtained results. How the topology of the network affects the optimal feedback mechanism is also discussed.
Keyword ：
Bifurcation Bifurcation Complex networks Complex networks Epidemic dynamics Epidemic dynamics Feedback mechanism Feedback mechanism Optimal control Optimal control
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Lijuan , Huang, Shouying , Chen, Fengde et al. The bifurcation analysis and optimal feedback mechanism for an SIS epidemic model on networks [J]. | ADVANCES IN DIFFERENCE EQUATIONS , 2019 , 2019 (1) . |
| MLA | Chen, Lijuan et al. "The bifurcation analysis and optimal feedback mechanism for an SIS epidemic model on networks" . | ADVANCES IN DIFFERENCE EQUATIONS 2019 . 1 (2019) . |
| APA | Chen, Lijuan , Huang, Shouying , Chen, Fengde , Fu, Mingjian . The bifurcation analysis and optimal feedback mechanism for an SIS epidemic model on networks . | ADVANCES IN DIFFERENCE EQUATIONS , 2019 , 2019 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
