Bin Yan

Prof. Bin Yan

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
8 October 2018 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
BYBin Yan
Bin Yan
YXYong Xiang
Yong Xiang
GHGuang Hua
Guang Hua
In visual cryptography (VC) for grayscale image, size reduction leads to bad perceptual quality to the reconstructed secret image. To improve the quality, the current efforts are limited to the design of VC algorithm for binary image, and measuring the quality with metrics that are not directly related to how the human visual system perceives halftone images. We propose an analysis-by-synthesis (AbS) framework to integrate the halftoning process and the VC encoding: the secret pixel/block is reconstructed from the shares in the encoder and the error between the reconstructed secret and the original secret images is fed back and compensated concurrently by the error diffusion process. In doing so, the error between the reconstructed secret and original secret is pushed to high frequency band, thus producing visually pleasing reconstructed secret image. This framework is simple and flexible in that it can be combined with many existing size-invariant VC algorithms, including probabilistic VC, random grid VC, and vector/block VC. More importantly, it is proved that this AbS framework is as secure as the traditional VC algorithms. Experimental results demonstrate the effectiveness of the proposed AbS framework.

4 June 2020 in Symmetry
Verified
Journal Article
Open access
PDF file
MAMoses Arhinful Acquah
Moses Arhinful Acquah
NCNa Chen
Na Chen
Jeng-Shyang PanJeng-Shyang Pan
Jeng-Shyang Pan
Hongmei YangHongmei Yang
Hongmei Yang
BYBin Yan
Bin Yan
Biometrics, with its uniqueness to every individual, has been adapted as a security authentication feature by many institutions. These biometric data are processed into templates that are saved on databases, and a central authority centralizes and controls these databases. This form of storing biometric data, or in our case fingerprint template, is asymmetric and prone to three main security attacks, such as fake template input, template modification or deletion, and channel interception by a malicious attacker. In this paper, we secure an encrypted fingerprint template by a symmetric peer-to-peer network and symmetric encryption. The fingerprint is encrypted by the symmetric key algorithm: Advanced Encryption Standard (AES) algorithm and then is uploaded to a symmetrically distributed storage system, the InterPlanetary File system (IPFS). The hash of the templated is stored in a decentralized blockchain. The slow transaction speed of the blockchain has limited its use in real-life applications, such as large file storage, hence, the merge with IPFS to store just the hashes of large files. The encrypted template is uploaded to the IPFS, and its returned digest is stored on the Ethereum network. The implementation of IPFS prevents storing the raw state of the fingerprint template on the Ethereum network in order to reduce cost and also prevent identity theft. This procedure is an improvement of previous systems. By adopting the method of template hashing, the proposed system is cost-effective and efficient. The experimental results depict that the proposed system secures the fingerprint template by encryption, hashing, and decentralization.

7 November 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
WYWen-Xin Yuan
Wen-Xin Yuan
BYBin Yan
Bin Yan
WLWen Li
Wen Li
LHLiu-Yao Hao
Liu-Yao Hao
HYHong-Mei Yang
Hong-Mei Yang

1 June 2018 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
QLQi Li
Qi Li
BYBin Yan
Bin Yan
HLHui Li
Hui Li
NCNa Chen
Na Chen

14 January 2023 in Entropy
Verified
Journal Article
Open access
PDF file
Jeng-Shyang PanJeng-Shyang Pan
Jeng-Shyang Pan
SZSi-Qi Zhang
Si-Qi Zhang
Shu-Chuan ChuShu-Chuan Chu
Shu-Chuan Chu
Hongmei YangHongmei Yang
Hongmei Yang
BYBin Yan
Bin Yan
The heuristic optimization algorithm is a popular optimization method for solving optimization problems. A novel meta-heuristic algorithm was proposed in this paper, which is called the Willow Catkin Optimization (WCO) algorithm. It mainly consists of two processes: spreading seeds and aggregating seeds. In the first process, WCO tries to make the seeds explore the solution space to find the local optimal solutions. In the second process, it works to develop each optimal local solution and find the optimal global solution. In the experimental section, the performance of WCO is tested with 30 test functions from CEC 2017. WCO was applied in the Time Difference of Arrival and Frequency Difference of Arrival (TDOA-FDOA) co-localization problem of moving nodes in Wireless Sensor Networks (WSNs). Experimental results show the performance and applicability of the WCO algorithm.

1 September 2018 in Chinese Physics B
Verified
Journal Article
Closed access
NCNa Chen
Na Chen
BYBin Yan
Bin Yan
GCGeng Chen
Geng Chen
MZMan-Jun Zhang
Man-Jun Zhang
CPChang-Xing Pei
Chang-Xing Pei