Features extraction based on the Discrete Hartley Transform for closed contour

被引:0
|
作者
Marti-Puig, Pere [1 ]
Reig-Bolano, Ramon [1 ]
Danes, Jaume [1 ]
机构
[1] Univ Vic, Dept Digital Informat Technol, Barcelona, Spain
关键词
Silhouette descriptors; contour descriptors; Discrete Hartley Transform; Elliptic Fourier Descriptor; shape analysis; feature extraction; QUANTITATIVE-EVALUATION; SHAPE DESCRIPTORS; FOURIER-ANALYSIS; REPRESENTATION; RECOGNITION;
D O I
10.3233/AIC-140620
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper the authors propose a new closed contour descriptor that could be seen as a Feature Extractor of closed contours based on the Discrete Hartley Transform (DHT), its main characteristic is that uses only half of the coefficients required by Elliptical Fourier Descriptors (EFD) to obtain a contour approximation with similar error measure. The proposed closed contour descriptor provides an excellent capability of information compression useful for a great number of AI applications. Moreover it can provide scale, position and rotation invariance, and last but not least it has the advantage that both the parameterization and the reconstructed shape from the compressed set can be computed very efficiently by the fast Discrete Hartley Transform (DHT) algorithm. This Feature Extractor could be useful when the application claims for reversible features and when the user needs and easy measure of the quality for a given level of compression, scalable from low to very high quality.
引用
收藏
页码:103 / 112
页数:10
相关论文
共 50 条
  • [41] A novel approach to fast discrete Hartley transform
    Liu, JG
    Chan, FHY
    Lam, FK
    Li, HF
    FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, : 178 - 183
  • [42] NEW FAST DISCRETE HARTLEY TRANSFORM ALGORITHM
    CHAN, YH
    SIU, WC
    ELECTRONICS LETTERS, 1991, 27 (04) : 347 - 349
  • [43] DISCRETE HARTLEY TRANSFORM IN ERROR CONTROL CODING
    WU, JL
    SHIU, J
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1991, 39 (10) : 2356 - 2359
  • [44] QUANTIZATION ERRORS IN THE COMPUTATION OF THE DISCRETE HARTLEY TRANSFORM
    ZAKHOR, A
    OPPENHEIM, AV
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1987, 35 (11): : 1592 - 1602
  • [45] SPLIT RADIX ALGORITHM FOR THE DISCRETE HARTLEY TRANSFORM
    BI, G
    ELECTRONICS LETTERS, 1994, 30 (22) : 1833 - 1835
  • [46] Novel approach to fast discrete Hartley transform
    Liu, J.G.
    Chan, F.H.Y.
    Lam, F.K.
    Li, H.F.
    Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, 1999, : 178 - 183
  • [47] Position-Based Method for Computing the Elements of The Discrete Hartley Transform Matrix
    Shah, Gautam A.
    Rathore, Tejmal S.
    2008 IEEE REGION 10 CONFERENCE: TENCON 2008, VOLS 1-4, 2008, : 619 - +
  • [48] Fiber Hartley Transform and Optical Indirect Computation of Discrete Cosine Transform
    Svaluto Moreolo, Michela
    Cincotti, Gabriella
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (05) : 1338 - 1343
  • [49] Novel Structures for Discrete Hartley Transform based on First-Order Moments
    Xiong, Jun
    Zheng, Wenjuan
    Wang, Hao
    Liu, Jianguo
    MIPPR 2017: PARALLEL PROCESSING OF IMAGES AND OPTIMIZATION TECHNIQUES; AND MEDICAL IMAGING, 2018, 10610
  • [50] FAST MULTIDIMENSIONAL DISCRETE HARTLEY TRANSFORM USING FERMAT NUMBER TRANSFORM
    BOUSSAKTA, S
    HOLT, AGJ
    IEE PROCEEDINGS-G CIRCUITS DEVICES AND SYSTEMS, 1988, 135 (06): : 253 - 257