Danmei Niu

Dr. Danmei Niu

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 September 2016 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
DNDanmei Niu
Danmei Niu
LRLanlan Rui
Lanlan Rui
HHHaoqiu Huang
Haoqiu Huang
XQXuesong Qiu
Xuesong Qiu

6 August 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
DNDanmei Niu
Danmei Niu
YLYuxiang Li
Yuxiang Li
ZZZhiyong Zhang
Zhiyong Zhang
BSBin Song
Bin Song

1 August 2012 in Journal of Multimedia
Verified
Journal Article
Closed access
YSYifeng Sun
Yifeng Sun
DNDanmei Niu
Danmei Niu
GTGuangming Tang
Guangming Tang
ZGZhanzhan Gao
Zhanzhan Gao
This paper proposes an optimized LSB matching steganography based on Fisher Information. The embedding algorithm is designed to solve the optimization problem, in which Fisher information is the objective function and embedding transferring probabilities are variables to be optimized. Fisher information is the quadratic function of the embedding transferring probabilities, and the coefficients of quadratic term are determined by the joint probability distribution of cover elements. By modeling the groups of elements in a cover image as Gaussian mixture model, the joint probability distribution of cover elements for each cover image is obtained by estimating the parameters of Gaussian mixture distribution. For each sub-Gaussian distribution in Gaussian mixture distribution, the quadratic term coefficients of Fisher information are calculated, and the optimized embedding transferring probabilities are solved by quadratic programming. By maximum posteriori probability principle, cover pixels are classified as the categories corresponding to sub-Gaussian distributions. At last, in order to embed message bits, pixels chose to add or subtract one according to the optimized transferring probabilities of the category. The experiments show that the security performance of this new algorithm is better than the existing LSB matching.

3 November 2016 in China Communications
Verified
Journal Article
Closed access
HHHaoqiu Huang
Haoqiu Huang
LRLanlan Rui
Lanlan Rui
WZWeiwei Zheng
Weiwei Zheng
DNDanmei Niu
Danmei Niu
XQXuesong Qiu
Xuesong Qiu
The recent evolution of the Internet towards "Information-centric" transfer modes has renewed the interest in exploiting proxies to enhance seamless mobility. In this work, we focus on the case of multiple levels of proxies in ICN architectures, in which content requests from mobile subscribers and the corresponding items are proactively cached to these proxies at different levels. Specifically, we present a multiple-level proactive caching model that selects the appropriate subset of proxies at different levels and supports distributed online decision procedures in terms of the tradeoff between delay and cache cost. We show via extensive simulations the reduction of up to 31.63% in the total cost relative to Full Caching, in which caching in all 1-level neighbor proxies is performed, and up to 84.21% relative to No Caching, in which no caching is used. Moreover, the proposed model outperforms other approaches with a flat cache structure in terms of the total cost.

9 September 2015 in Recent Advances in Electrical & Electronic Engineering (Formerly Recent Patents on Electrical & Electronic Engineering)
Verified
Journal Article
Closed access
PDF file
DNDanmei Niu
Danmei Niu
LRLanlan Rui
Lanlan Rui
HHHaoqiu Huang
Haoqiu Huang
XQXuesong Qiu
Xuesong Qiu
In mobile social network service (MSNS) environment, users can establish a group relying on some relationships and share services within a group or among different groups. When the mobile devices provide services for a user, some service transmission paths will fail because of device movement or failure, and the user cannot receive required services. Recovering the service quickly and efficiently is the main problem of this paper. This paper presents a new service transmission and recovery strategy based on cluster in MSNS. Establishment mechanism of recovery point is adopted in the strategy. The recovery point is able to save and maintain the service data received from the service provider. When the service transmission fails, the upstream recovery point can directly resend the service data to its downstream recovery point. Simulation results show that this strategy can save the transmission time and improve the probability of successful transmission.