Texture feature performance for image segmentation
Pattern Recognition
An FPGA-Based Architecture for Real Time Image Feature Extraction
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Analog Integrated Circuits and Signal Processing
FPGA architecture for fast parallel computation of co-occurrence matrices
Microprocessors & Microsystems
FPGA-based System for Real-Time Video Texture Analysis
Journal of Signal Processing Systems
Accelerating Texture Features Extraction Algorithms Using FPGA Architecture
RECONFIG '10 Proceedings of the 2010 International Conference on Reconfigurable Computing and FPGAs
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
The Journal of Supercomputing
Hi-index | 0.00 |
The most popular second-order statistical texture features are derived from the co-occurrence matrix, which has been proposed by Haralick. However, the computation of both matrix and extracting texture features are very time consuming. In order to improve the performance of co-occurrence matrices and texture feature extraction algorithms, we propose an architecture on FPGA platform. In the proposed architecture, first, the co-occurrence matrix is computed then all thirteen texture features are calculated in parallel using computed co-occurrence matrix. We have implemented the proposed architecture on Virtex 5 fx130T-3 FPGA device. Our experimental results show that a speedup of 421[脳 yields over a software implementation on Intel Core i7 2.0 GHz processor. In order to improve much more performance on textures, we have reduced the computation of 13 texture features to 3 texture features using ranking of Haralick's features. The performance improvement is 484脳.