Radix sort

Radix sort

R

Published in Phillip A. Laplante, Dictionary of Computer Science, Engineering, and Technology, 2017

radix sort a multiple pass sort algorithm that distributes each item to a bucket according to part of the item’s key beginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key. Also called bucket sort.

Keypoint-based passive method for image manipulation detection

View Article

Journal Information

Published in Cogent Engineering, 2018

Choudhary Shyam Prakash, Hari Om, Sushila Maheshkar, Vikas Maheshkar

Lin et al. (Lin, Wang, & Kao, 2009) proposed a method in which 9-Dimensional feature vector is used which contain the information about pixel intensities in some specific regions of the block. Instead of using lexicographical sort they used Radix sort which gives a linear time sorting. Their method is robust to JPEG compression and Gaussian blurring only. Wang et al. (Wang, Liu, Zhang, Dai, & Wang, 2010) initially applied GPD on input image then Hu moment of each block is calculated to extract the features. Their method is robust to JPEG compression, Gaussian blurring and Gaussian noise.

Fast hydrological model calibration based on the heterogeneous parallel computing accelerated shuffled complex evolution method

View Article

Journal Information

Published in Engineering Optimization, 2018

Guangyuan Kan, Xiaoyan He, Liuqian Ding, Jiren Li, Yang Hong, Depeng Zuo, Minglei Ren, Tianjie Lei, Ke Liang

Step 5. Shuffle complexes. Replace into , such that . Sort in order of increasing function value. The sorting process adopts the parallel radix sort algorithm described in Step 2.

Explore chapters and articles related to this topic

R

Keypoint-based passive method for image manipulation detection

Fast hydrological model calibration based on the heterogeneous parallel computing accelerated shuffled complex evolution method