Fast Alternative to Gradient Computation in the DCT Block Domain for Local Binary Patterns Computation

被引:0
|
作者
Stoian, I. [1 ]
Capatana, D. [1 ]
Ghiran, O. [1 ]
Gordan, M. [2 ]
Florea, C. [2 ]
机构
[1] SC IPA SA, Cluj Subsidiary, Cluj Napoca, Romania
[2] UTCN, Commun Dept, Cluj Napoca, Romania
关键词
compressed DCT block domain; local image gradient; local texture descriptors; dam surveillance;
D O I
10.1109/AQTR.2018.8402777
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Computationally efficient implementation of different image processing and analysis algorithms is very important when implementing such tasks on mobile devices. Such a case can be the visual surveillance of the critical infrastructures (like hydro-dams), where images can be acquired on-site by an operator using a mobile device and an objective result of their analysis may be desired. Texture features (edge density, local binary patterns) derived from local gradient information can be efficient to assess the degradation of the concrete hydro-dam walls (in terms of crack characterization and surface degradation), and their numerically efficient implementation in the compressed image data domain allow to be implemented on any device. We propose here an efficient solution to compute local binary patterns in the compressed DCT block domain, which is the basis of JPEG image encoding, via local omnidirectional gradients. Results are illustrated on an image acquired from the downstream face of a concrete hydro-dam, compared to the decompressed image implementation, and discussed in terms of numerical efficiency.
引用
收藏
页数:4
相关论文
共 50 条
  • [21] The fast DCT-IV/DST-IV computation via the MDCT
    Britanak, V
    SIGNAL PROCESSING, 2003, 83 (08) : 1803 - 1813
  • [22] Comments on "Fast Radix-9 Algorithm for the DCT-IV Computation"
    Britanak, Vladimir
    IEEE SIGNAL PROCESSING LETTERS, 2009, 16 (11) : 1005 - 1006
  • [23] FAST COMPUTATION OF FOCUSED TRANSDUCER RADIATION-PATTERNS
    OSULLIVAN, JD
    OSTRY, D
    BUI, T
    ULTRASONIC IMAGING, 1986, 8 (01) : 58 - 59
  • [24] AN AUGMENTED LAGRANGIAN METHOD FOR FAST GRADIENT VECTOR FLOW COMPUTATION
    Li, Jianfeng
    Zuo, Wangmeng
    Zhao, Xiaofei
    Zhang, David
    2011 18TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2011, : 1525 - 1528
  • [25] Parallel computation of the Fast Fourier Transform on a binary tree multiprocessor
    Niki, Noboru
    Takahashi, Yoshizou
    Systems and Computers in Japan, 1990, 21 (04): : 65 - 75
  • [26] Fast computation of maximum time interval error by binary decomposition
    Bregni, S
    Maccabruni, S
    IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2000, 49 (06) : 1240 - 1244
  • [27] Iterative Basic Block Pipelining Implementation as Fast Computation Technique
    Shikha, Parul
    Sharma, Manish
    Rajput, Sachin
    INTELLIGENT COMMUNICATION, CONTROL AND DEVICES, ICICCD 2017, 2018, 624 : 1595 - 1601
  • [28] FAST COMPUTATION OF TRANSFORM COEFFICIENTS FOR A SUBADJACENT BLOCK FOR A TRANSFORM FAMILY
    KOU, WD
    FJALLBRANT, T
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1991, 39 (07) : 1695 - 1699
  • [29] Leveraging transcript quantification for fast computation of alternative splicing profiles
    Alamancos, Gael P.
    Pages, Amadis
    Trincado, Juan L.
    Bellora, Nicolas
    Eyras, Eduardo
    RNA, 2015, 21 (09) : 1521 - 1531
  • [30] Gradient Local Binary Patterns for Human Detection
    Jiang, Ning
    Xu, Jiu
    Yu, Wenxin
    Goto, Satoshi
    2013 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2013, : 978 - 981