A Neighbor-finding Algorithm Involving the Application of SNAM in Binary-image Representation

Jie He, Hui Guo, Defa Hu

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.

Full Text:

PDF


DOI: http://dx.doi.org/10.12928/telkomnika.v13i4.1899

Article Metrics

Abstract view : 98 times
PDF - 107 times

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Universitas Ahmad Dahlan

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

View TELKOMNIKA Stats