The Successive Next Network as Augmented Regularization for Deformable Brain MR Image Registration.

Deep-learning-based registration methods can not only save time but also automatically extract deep features from images. In order to obtain better registration performance, many scholars use cascade networks to realize a coarse-to-fine registration progress. However, such cascade networks will increase network parameters by an n-times multiplication factor and entail long training and testing stages. In this paper, we only use a cascade network in the training stage. Unlike others, the role of the second network is to improve the registration performance of the first network and function as an augmented regularization term in the whole process. In the training stage, the mean squared error loss function between the dense deformation field (DDF) with which the second network has been trained and the zero field is added to constrain the learned DDF such that it tends to 0 at each position and to compel the first network to conceive of a better deformation field and improve the network's registration performance. In the testing stage, only the first network is used to estimate a better DDF; the second network is not used again. The advantages of this kind of design are reflected in two aspects: (1) it retains the good registration performance of the cascade network; (2) it retains the time efficiency of the single network in the testing stage. The experimental results show that the proposed method effectively improves the network's registration performance compared to other state-of-the-art methods.

A Context-Aware Mobile User Behavior-Based Neighbor Finding Approach for Preference Profile Construction.

In this paper, a new approach is adopted to update the user preference profile by seeking users with similar interests based on the context obtainable for a mobile network instead of from desktop networks. The trust degree between mobile users is calculated by analyzing their behavior based on the context, and then the approximate neighbors are chosen by combining the similarity of the mobile user preference and the trust degree. The approach first considers the communication behaviors between mobile users, the mobile network services they use as well as the corresponding context information. Then a similarity degree of the preference between users is calculated with the evaluation score of a certain mobile web service provided by a mobile user. Finally, based on the time attenuation function, the users with similar preference are found, through which we can dynamically update the target user's preference profile. Experiments are then conducted to test the effect of the context on the credibility among mobile users, the effect of time decay factors and trust degree thresholds. Simulation shows that the proposed approach outperforms two other methods in terms of Recall Ratio, Precision Ratio and Mean Absolute Error, because neither of them consider the context mobile information.

Correction: Gao, Q. et al. A Context-Aware Mobile User Behavior-Based Neighbor Finding Approach for Preference Profile Construction. Sensors 2016, 2, 143.

At first, may I offer my profoundest respects to the previous work obtained by the author Shi, whose work enlarged our view and set a good research direction for us and enlightened the initial idea of our paper.[...].