Super-resolution reconstruction face recognition based on multi-level FFD registration

Super-resolution (SR) reconstruction is an effective method to solve the problem, that the face image resolution is too low to be recognized in video, but the non-rigid change of deformed face and expression changes greatly affect the accuracy of registration and reconstruction. To solve these problems, a method of multi-level model free form deformation (FFD) elastic registration algorithm based on B spline is proposed. It first use low-resolution FFD grid for global registration, to emphasize the contribution of edge information for registration, we introduce edge registration measure into the sum of squared difference (SSD) criterion. Then divide the global registration image and reference image into a series of corresponding sub-image pairs and calculate the correlation coefficient of each pair; at the same time, we do local registration with high-resolution FFD grid to the small value correlation coefficient sub-image pairs. In the registration process of optimization, the paper uses adaptive step length gradient descent method algorithm based on chaotic variables to improve optimization efficiency. After registration, the algorithm of project onto convex sets (POCS) is used to reconstruct SR face image through several low resolution image sequences, and then recognized these SR face images by support vector machines (SVM) classifier. Experimental results from standard video database and self-built video database show that this method can register and reconstruct face image accurately in the condition of great face deformation and expression change, while the face recognition accuracy is also improved.     

Image registration guided,sparsity constrained reconstructions for dynamic MRI

It is generally a challenging task to reconstruct dynamic magnetic resonance (MR) images with high spatial and high temporal resolutions, especially with highly incomplete k-space sampling. In this work, a novel method that combines a non-rigid image registration technique with sparsity-constrained image reconstruction is introduced. Employing a multi-resolution free-form deformation technique with B-spline interpolations, the non-rigid image registration accurately models the complex deformations of the physiological dynamics, and provides artifact-suppressed high spatial-resolution predictions. Based on these prediction images, the sparsity-constrained data fidelity-enforced image reconstruction further improves the reconstruction accuracy. When compared with the k-t FOCUSS with motion estimation/motion compensation (MEMC) technique on volunteer scans, the proposed method consistently outperforms in both the spatial and the temporal accuracy with variously accelerated k-space sampling. High fidelity reconstructions for dynamic systolic phases with reduction factor of 10 and cardiac perfusion series with reduction factor of 3 are presented.     

Analysis of diffusion process in fractured reservoirs using fractional derivative approach

The fractal geometry is used to model of a naturally fractured reservoir and the concept of fractional derivative is applied to the diffusion equation to incorporate the history of fluid flow in naturally fractured reservoirs. The resulting fractally fractional diffusion (FFD) equation is solved analytically in the Laplace space for three outer boundary conditions. The analytical solutions are used to analyze the response of a naturally fractured reservoir considering the anomalous behavior of oil production. Several synthetic examples are provided to illustrate the methodology proposed in this work and to explain the diffusion process in fractally fractured systems.     

Fragment fusion degree based dynamic defragmentation in flexible grid optical networks

Flexible grid optical networks have been attracting much attention for their high spectrum efficiency (SE) and flexibility compared to the rigid grid WDM networks. As well known, the networks suffer from the problem of spectrum fragmentation under dynamic traffic. In this paper, we propose a new concept called ‘fragment fusion degree (FFD)’ to assess the level of spectrum fragmentation in flexible grid optical networks, which is calculated based on the availability of the spectrum fragments among neighboring links. Two FFD based dynamic defragmentation algorithms are presented to fuse the spectrum fragments among neighboring links. Simulation results show that the proposed defragmentation algorithms reduce blocking probability significantly and achieve high profitability.     

FACTORIZATION IN MONOID DOMAINS

In this paper, we determine necessary and sufficient conditions for the group ring D[G] to be a BFD (resp., an FFD, an SFFD). Also we give necessary and sufficient conditions for the monoid domain D[S] to be a BFD (resp., an FFD, an SFFD). In addition, we characterize when themonoid domain D[S] is a UFD in terms of 2-factoriality.     

带服务等级的同速机排序问题Multifit型算法研究

考虑一般情况下带服务等级的同速机排序问题.预先赋予每台机器和每个任务一个服务等级(grade ofservice)标号.每个任务只能被某台服务等级不高于该任务服务等级的机器加工.目标是最小化最大机器完工时间.这个问题最初由HWANG等提出并研究,HWANG等给出了一个最坏情况界为2-1m-1的算法.本文给出了求解这个问题的算法.并证明算法的最坏情况界不超过32+(1/2)k,其中k是算法中预先给定的迭代次数.     

A tighter bound for FFd algorithm

1. IntroductionIn bin packing, a list L of items, i.e. numbers in the range (0, 1], are to be packed illtobins, each of which has a capacity 1, and the goal is to minimize the number of bins used.The minimal number of bins into which L can be packed is denoted by OPT (L) for the listL. The first~fit-decreasing (FFD) algorithm first sorts the list into a non-increasing orderand then processes the pieces in that order by placing each item into the first bin icao whiChit fits. For tlist L, l…     

Spectrum defragmentation in flexgrid optical networks using a genetic algorithm

Flexgrid optical networking is an attractive solution for efficiently matching allocated bandwidth with link demand but suffers from inevitable spectrum fragmentation. Spectrum fragmentation impairs network performance and results in high blocking rate and low spectrum utilization efficiency. Therefore, an optimization mechanism handling spectrum fragmentation is of vital importance in flexgrid optical networks. In this paper, we propose a genetic algorithm for solving the spectrum fragmentation problem with the objective of compacting occupation of the spectrum in flexgrid optical networks. A string of lightpaths are coded as the chromosome. The spectrum fusion degree and fragment fusion degree are introduced as the fitness functions to conduct the evolution in genetic algorithm, which can also be used to assess the degree of spectrum fragmentation in the network. As a result, the genetic algorithm provides a lightpath reconfiguration map, which identifies the candidate lightpaths to be reallocated, their reconfiguration sequence, and new locations. The proposed algorithm is compared with commonly used approaches under different network conditions. Simulation results demonstrate the ability of the proposed algorithm to efficiently solve the problem of spectrum defragmentation in flexgrid optical networks. Copyright © 2013 John Wiley & Sons, Ltd.     

基于MC13193的ZigBee无线传感网络设计

集成了传感技术、计算机技术、通信技术的无线传感网络成为无线通信领域研究的热点,低速率、低功耗的Zig-Bee技术的出现为其发展提供了契机。介绍了ZigBee网络的结构,分析了2.4 GHz的射频收发芯片MC13193的特点和性能,并应用MC13193及相关微控制器、传感器件设计了ZigBee无线传感网络。     

Design and implementation analysis of a public key infrastructure‐enabled security framework for ZigBee sensor networks

ZigBee is a wireless network technology suitable for applications requiring lower bandwidth, low energy consumption and small packet size. Security has been one of the challenges in ZigBee networks. Public Key Infrastructure (PKI) provides a binding of entities with public keys through a Certifying Authority (CA). Public key cryptography using public–private key pairs can be used for ensuring secure transmission in a network. But large size of public and private keys and memory limitations in ZigBee devices pose a problem for using PKI to secure communication in ZigBee networks. In this paper, we propose a PKI enabled secure communication schema for ZigBee networks. Limited memory and power constraints of end devices restrict them from storing public keys of all other devices in the network. Large keys cannot be communicated due to limited power of the nodes and small transmission packet size. The proposed schema addresses these limitations. We propose two algorithms for sending and receiving the messages. The protocols for intercommunication between the network entities are also presented. Minor changes have been introduced in the capabilities of devices used in the ZigBee networks to suit our proposed scheme. Network adaptations depending on different scenarios are discussed. The approach adopted in this paper is to alter the communication flow so as to necessitate minimum memory and computational requirements at the resource starved end points. In the proposed PKI implementation, end devices store the public keys of only the coordinator which in turn holds public keys of all devices in the network. All communication in our scheme is through the coordinator, which in the event of failure is re‐elected through an election mechanism. The performance of the proposed scheme was evaluated using a protocol analyzer in home automation and messenger applications. Results indicate that depending on the type of application, only a marginal increase in latency of 2 to 5 ms is introduced for the added security. Layer wise traffic and packets captured between devices were analyzed. Channel utilization, message length distribution and message types were also evaluated. The proposed protocol's performance was found to be satisfactory on the two tested applications. Copyright © 2014 John Wiley & Sons, Ltd.