Jie He
Wuzhou University

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

Found 3 Documents
Search

A Neighbor-finding Algorithm Involving the Application of SNAM in Binary-image Representation Jie He; Hui Guo; Defa Hu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

In view of the low execution efficiency and poor practicability of the existing neighbor-finding method, a fast neighbor-finding algorithm is put forward on the basis of Square Non-symmetry and Anti-packing Model (SNAM) for binary-image. First of all, the improved minor-diagonal scanning way is applied to strengthen SNAM’s adaptability to various textures, thus reducing the total number of nodes after coding; then the storage structures for its sub-patterns are standardized and a grid array is used to recover the spatial-position relationships among sub-patterns, so as to further reduce the complexity of the neighbor-finding algorithm. Experimental result shows that this method’s execution efficiency is significantly higher than that of the classic Linear Quad Tree (LQT)-based neighbor-finding method.
A Fast Fractal Image Compression Algorithm Combined with Graphic Processor Unit Hui Guo; Jie He
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 3: September 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Directed against the characteristics of computational intensity of fractal image compression encoding, a serial-parallel transfer mechanism is built for encoding procedures. By utilizing the properties of single instruction and multithreading execution of compute unified device architecture (CUDA), the parallel computational model of fractal encoding is built on the graphic processor unit(GPU) in order to parallelize the considerably time-consuming serial execution process of searching for the block of best match. The experimental result indicates, the algorithm in this paper shortens the encoding time to the millisecond scale and significantly boosts the execution efficiency of fractal image encoding algorithm while keeping the decoded image in good quality.
A Modified Particle Swarm Optimization Algorithm Jie He; Hui Guo
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 10: October 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

In optimizing the particle swarm optimization (PSO) that inevitable existence problem of prematurity and the local convergence, this paper base on this aspects is put forward a kind of modified particle swarm optimization algorithm, take the gradient descent method (BP algorithm) as a particle swarm operator embedded in particle swarm algorithm, and at the same time use to attenuation wall (Damping) approach to make fly off the search area of the particles of size remain unchanged and avoid the local optimal solution, with three input XOR problem to testing the improvement of the particle swarm optimization algorithm and the results showed that the improved algorithm not only increase global optimization ability, but also avoid the prematurity, convergence problem. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.2947