Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal TELKOMNIKA (Telecommunication Computing Electronics and Control) Indonesian Journal of Electrical Engineering and Computer Science
Lequan Min
University of Science and Technology Beijing
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Research on 4-dimensional Systems without Equilibria with Application Ruibin Hao; Lequan Min; Hongyan Zang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 16, No 2: April 2018
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v16i2.8507

Abstract

Recently chaos-based encryption has been obtained more and more attention. Chaotic systems without equilibria may be suitable to be used to design pseudorandom number generators (PRNGs) because there does not exist corresponding chaos criterion theorem on such systems. This paper proposes two propositions on 4-dimensional systems without equilibria. Using one of the propositions introduces a chaotic system without equilibria. Using this system and the generalized chaos synchronization (GCS) theorem constructs an 8-dimensional discrete generalized chaos synchronization (8DBDGCS) system. Using the 8DBDGCS system designs a 216-word chaotic PRNG. Simulation results show that there are no significant correlations between the key stream and the perturbed key streams generated via the 216-word chaotic PRNG. The key space of the chaotic PRNG is larger than 21275. As an application, the chaotic PRNG is used with an avalanche-encryption scheme to encrypt an RGB image. The results demonstrate that the chaotic PRNG is able to generate the avalanche effects which are similar to those generated via ideal chaotic PRNGs.
An Optimized Iteration Algorithm based on C-V model and Graph Cuts Hong Lan; Lequan Min
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 8: August 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

C-V model can self-adapt to the changes of curve topology but requires more iterations and needs more computing time. Graph cuts algorithm is good at getting the global optimum in a short time but not suitable for concave object extraction.To overcome the flaws of these two algorithms, an optimized iteration algorithm has been proposed. First the initial contour is deformed with an improved C-V model, which was without re-initialization during iterative process and the iteration stop condition is set by calculating changing area within the contour. Then the active contour is input to graph cuts algorithm. Dilates the contour into its neighborhood and formed an inner and an outer boundary seperatively, changes these two boundaries as source and sink, and obtains the final contour by graph cuts. Experiments show that this optimized algorithm reduces the iteration time, and has better effect and higher efficiency for image segmentation. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3035 
Co-Authors Hong Lan Hongyan Zang Ruibin Hao