Algorithm for computing the Fourier descriptors of a binary outline

被引:0
|
作者
Purcaru, D [1 ]
机构
[1] Univ Craiova, Fac Automat Comp & Elect, Craiova 1100, Romania
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Fourier descriptors A(n),alpha(n))(1)(infinity) are proper for the analysis and synthesis of closed plane curves. Using tactile matrix sensors for the exploration of the 2D-shapes, binary imprints are often generated. In this paper an algorithm for computing the Fourier descriptors of the polygonal curve gamma (Freeman outline) obtained by processing a binary imprint is proposed. First the coordinates of the curve starting point as well as the parameters delta(0), a(p)*, Delta 1(p), Delta phi(p), are determined; then L and the Fourier descriptors are computed. The most important properties of (A,,a,hm are presented and verified using the program that implements this algorithm. Knowing the Fourier descriptors of the shape binary outlines, much useful information for the description and tactile recognition of the shape have been obtained.
引用
收藏
页码:39 / 43
页数:5
相关论文
共 50 条
  • [21] LWDOS: Language for writing descriptors of outline shapes
    Larabi, S
    Bouagar, S
    Trespaderne, FM
    Lopez, ED
    IMAGE ANALYSIS, PROCEEDINGS, 2003, 2749 : 1014 - 1021
  • [22] An FPGA-based accelerator for Fourier Descriptors computing for color object recognition using SVM
    Fethi Smach
    Johel Miteran
    Mohamed Atri
    Julien Dubois
    Mohamed Abid
    Jean-Paul Gauthier
    Journal of Real-Time Image Processing, 2007, 2 : 249 - 258
  • [23] An FPGA-based accelerator for Fourier Descriptors computing for color object recognition using SVM
    Smach, Fethi
    Miteran, Johel
    Atri, Mohamed
    Dubois, Julien
    Abid, Mohamed
    Gauthier, Jean-Paul
    JOURNAL OF REAL-TIME IMAGE PROCESSING, 2007, 2 (04) : 249 - 258
  • [24] Object Recognition with Fourier Descriptors
    Sarfraz, Muhammad
    2020 24TH INTERNATIONAL CONFERENCE INFORMATION VISUALISATION (IV 2020), 2020, : 657 - 662
  • [25] Testing for convexity with Fourier descriptors
    Kakarala, R
    ELECTRONICS LETTERS, 1998, 34 (14) : 1392 - 1393
  • [26] FRI MODELLING OF FOURIER DESCRIPTORS
    Kamath, Abijith Jagannath
    Rudresh, Sunil
    Seelamantula, Chandra Sekhar
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 5092 - 5096
  • [27] FAST ALGORITHM FOR COMPUTING THE FRACTAL DIMENSION OF BINARY IMAGES
    CREUTZBURG, R
    MATHIAS, A
    IVANOV, E
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 1992, 185 (1-4) : 56 - 60
  • [28] A fast Euler number computing algorithm of a binary image
    Yao, Bin
    He, Lifeng
    Kang, Shiying
    Zhao, Xiao
    Chao, Yuyan
    2018 INTERNATIONAL CONFERENCE ON IMAGE AND VIDEO PROCESSING, AND ARTIFICIAL INTELLIGENCE, 2018, 10836
  • [29] Fourier descriptors for broken shapes
    Christoph Dalitz
    Christian Brandt
    Steffen Goebbels
    David Kolanus
    EURASIP Journal on Advances in Signal Processing, 2013
  • [30] Testing for convexity with Fourier descriptors
    Kakarala, R
    FOURTEENTH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1 AND 2, 1998, : 792 - 794