Optimization and regularization of complex task decomposition for blind removal of multi-factor degradation

Most existing image restoration methods based on deep neural networks are developed for images which only degraded by a single degradation mode and imaging under an ideal condition. They cannot be directly used to restore the images degraded by multi-factor coupling. A complex task decomposition regularization optimization strategy (TDROS) is proposed to solve the problem. The restoration of images degraded by multi-factor coupling is a complex task that can be solved by separating these multiple factors, that is, breaking the complex task into numbers of simpler tasks to make the entire complex problem be overcome more easily. Motivated by this idea, the TDROS decomposes the complex task of image restoration into two sub-task: the potential task constrained by regularization and the main task for reconstructing high-definition images. In TDROS, the front of the neural network is focused on the restoration of images degraded by additive noise, while the other part of the network is focused mainly on the restoration of images degraded by blur. We applied the TDROS to an 11-layer convolutional neural network (CNN) and compared it with initial CNNs from the aspects of restoration accuracy and generalization ability. Based on these results, we used TDROS to design a novel network model for the restoration of atmospheric turbulence-degraded images. The experimental results demonstrate that the proposed TDROS can improve the generalization ability of the existing network more effectively than current popular methods, offering a better solution for the problem of severely degraded image restoration. Moreover, the TDROS concept provides a flexible framework for low-level visual complex tasks and can be easily incorporated into existing CNNs.     

WSN低功耗低时延路径式协同计算方法

针对云计算应用于无线传感器网络(Wireless Sensor Network,WSN)时延敏感型业务时存在的高传输时延问题,提出了一种WSN低功耗低时延路径式协同计算方法。该方法基于一种云雾网络架构开展研究,该架构利用汇聚节点组成雾计算层;在数据传输过程中基于雾计算层的计算能力分步骤完成任务计算,降低任务处理时延;由于汇聚节点计算能力较弱,时延降低将导致能耗增加,WSN工作寿命减短,为此提出能耗约束下的任务映射策略,并利用离散二进制粒子群优化(Binary Particle Swarm Optimization,BPSO)算法解决能耗约束下的时延优化问题。仿真结果表明,在相同的能耗约束下,对比其他算法,基于BPSO算法得出的映射方案能有效降低业务处理时延,满足时延敏感型业务的需求。     

Various density light field image coding based on distortion minimization interpolation

In recent years, the light field (LF) as a new imaging modality has attracted wide interest. The large data volume of LF images poses great challenge to LF image coding, and the LF images captured by different devices show significant differences in angular domain. In this paper we propose a view prediction framework to handle LF image coding with various sampling density. All LF images are represented as view arrays. We first partition the views into reference view (RV) set and intermediate view (IV) set. The RVs are rearranged into a pseudo sequence and directly compressed by a video encoder. Other views are then predicted by the RVs. To exploit the four dimensional signal structure, we propose the linear approximation prior (LAP) to reveal the correlation among LF views and efficiently remove the LF data redundancy. Based on the LAP, a distortion minimization interpolation (DMI) method is used to predict IVs. To robustly handle the LF images with different sampling density, we propose an Iteratively Updating depth image based rendering (IU-DIBR) method to extend our DMI. Some auxiliary views are generated to cover the target region and then the DMI calculates reconstruction coefficients for the IVs. Different view partition patterns are also explored. Extensive experiments on different types LF images also valid the efficiency of the proposed method.     

Reconfigurable topology synthesis for application-specific NoC on partially dynamically reconfigurable systems

In this paper, a four-stage method for synthesizing reconfigurable ASNoC topology is proposed for partially dynamically reconfigurable systems, where the topology is reconfigured dynamically at run-time along with the application's execution. Firstly, a simulated annealing based topology-aware integrated optimization framework is proposed to generate the proper schedule and floorplan of task modules. Secondly, based on the schedule and floorplan of task modules, an Integer Linear Programming (ILP)-based method and a heuristic method, are proposed to partition the communication requirements of the application into $T$ time intervals. Thirdly, we explore the proper positions of switches in the floorplan for global communications. Finally, considering the reconfiguration costs between adjacent time intervals, the routing path allocation problem is solved for time intervals in an iterative procedure to generate fine-grained dynamically reconfigurable ASNoC topologies. Experimental results show that, compared to the random partition of communication requirements, the proposed heuristic method and ILP-based method can achieve 5.4% and 10.0% power consumption improvement, respectively. And, the reconfigurable ASNoC can achieve 31.6% power consumption improvement when compared with static ASNoC.     

Revisiting the Parallel Strategy for DOACROSS Loops

Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front...     

ATSP:时态网络可视化的自适应时间片划分方法

现有的时态网络可视化方法大多采用等量时间片来可视化网络的演变，不利于时态模式的快速挖掘和发现。为此，根据时态网络固有的特征提出自适应时间片划分方法（Adaptive Time Slice Partition method，ATSP）。在时态网络的两种表示方式（基于事件的表示方式和基于快照的表示方式）的基础上，构建了ATSP的基础模型，同时提出了一种改进模型用来描述事件间隔时间服从长尾分布的时态网络。为了实现时间片的不等量划分，针对探索任务的不同提出了基于时态模式的ATSP规则和基于中心节点的ATSP规则，并提出了实现算法--层次划分算法（Hierarchical Partition algorithm，HP）和增量划分算法（Incremental Partition algorithm，IP）。实验结果表明，ATSP方法比传统的时间片划分方法更能准确地表示网络的时态特征，且该方法应用于可视化时，能有效归纳并展示网络的特征，明显提高了视觉分析的效率。     

基于分支定界法的相控阵雷达事件调度算法

为解决相控阵雷达事件调度问题中调度成功率、时间偏移率与算法时效性三者之间的矛盾，本文提出一种基于分支定界法的调度算法；该算法首先在现有调度结果上调取所有可执行事件，即获得若干"节点"，多步递推后由多"层"节点形成若干条备选"分支"，扩大解空间范围，提高算法性能；然后通过"删减"操作删减掉收益较低分支，将解空间控制在一适当范围内，减小搜索盲目性，降低算法计算量.仿真实验表明，与基于综合优先级算法的调度结果相比，利用本文算法调度时调度成功率提升了52%；与基于时间指针算法的调度结果相比，本身算法时间偏移率降低了61%；与基于遗传算法的调度结果相比，本文算法调度耗时仅为前者1~2%.     

STL模型特征信息的自适应分层的研究

模型的分层是3D打印前处理的一个重要环节，针对目前分层算法效率低、不能有效保留模型细微特征的问题，提出了一种新的基于STL模型特征信息的思想。首先提取模型的特征边，对特征边内实体表面采用区域增长算法进行表面分割，然后对分割后的表面判断其类型，最后对于不同的表面类型采用不同的分层求交处理算法。利用VC++6.0平台和OpenGL显示技术，依据模型表面几何特征自适应地变动层厚，减小台阶效应，加快分层效率，同样能很好地保留模型局部特征，且该算法可以根据实际模型的成型方向，实现分层方向的改变，保证成型零件的精度。     

地埋管换热器分区运行对土壤热堆积特性影响的研究

为了缓解埋管区域土壤的热量堆积问题,提出了埋管换热器按内中外、块状、间隔三种分区运行的策略,利用CFD软件建立了10×10的井群换热模型,对地源热泵系统在三种分区与不分区运行策略下运行十年进行数值模拟,分析不同分区运行策略对土壤温度分布和土壤热堆积特性的影响。模拟结果可知:不分区、内中外分区、块状分区、间隔分区四种运行策略下埋管区域的平均温度分别为25.23、23.31、23.06、23.28℃,最高温度分别为40.62、32.77、40.65、38.93℃;分区运行较不分区运行可以有效缓解热堆积作用,埋管区域整体温度较不分区运行时降低了2.00℃左右,内中外分区策略可以显著缓解埋管区域热堆积。