World Journal of Engineering Research and Technology (WJERT) has indexed with various reputed international bodies like : Google Scholar , Index Copernicus , Indian Science Publications , SOCOLAR, China , International Institute of Organized Research (I2OR) , Cosmos Impact Factor , Research Bible, Fuchu, Tokyo. JAPAN , Scientific Indexing Services (SIS) , Jour Informatics (Under Process) , UDLedge Science Citation Index , International Impact Factor Services , International Scientific Indexing, UAE , International Society for Research Activity (ISRA) Journal Impact Factor (JIF) , International Innovative Journal Impact Factor (IIJIF) , Science Library Index, Dubai, United Arab Emirates , Scientific Journal Impact Factor (SJIF) , Science Library Index, Dubai, United Arab Emirates , Eurasian Scientific Journal Index (ESJI) , Global Impact Factor (0.342) , IFSIJ Measure of Journal Quality , 

World Journal of Engineering
Research and Technology

An International Peer Reviewed Journal for Engineering Research and Technology

ISSN 2454-695X

Impact Factor : 5.218

ICV : 79.45

News & Updation

  • Article Invited for Publication

    Article are invited for publication in WJERT Coming Issue

  • New Issue Published

    Its Our pleasure to inform you that, WJERT 1 January 2019 Issue has been Published, Kindly check it on

  • WJERT New Impact Factor

    Its our Pleasure to Inform you that WJERT Impact Factor has been increased from 4.236 to 5.218 due to high quality Publication at International Level

  • ICV

    WJERT Rank with Index Copernicus Value 79.45 due to high reputation at International Level


    JANUARY 2019 Issue has been successfully launched on 1 January 2019




Abubakar Usman Othman*, Boukari Souley, Abdulsalam Ya’u Gital and Iliya Musa Adamu


in the past few years, approximate nearest neighbor (ANN) search has become the core in search field such as machine learning, pattern recognition, and data mining were the applications involves huge data bases. Hashing-based ANN have been known for their low memory requirements and computational cost. For this, many hashing-based approaches have been proposed for efficient similarity search from large-scale image collection for a given query. However, most of these methods generates their projections randomly which increases the cost of storage, they do not also consider the search time, and the data points are not spatially coherently mapped into compacts binary codes. To address these draw back, this paper proposes a scalable algorithm named Geo-cyclical structure-based hashing that can explore and preserve the underlying geometric structure information of the data. Extensive experiment would show that the new scheme will be more robust and more effective in terms of performance compared with state-of-the-art hashing approaches.

[Full Text Article]