• DocumentCode
    420037
  • Title

    Reconstruction of Euclidean planes from voxels

  • Author

    Linh, T.K.

  • Author_Institution
    Sch. of Sci. & Technol., Chiba Univ., Japan
  • fYear
    2004
  • fDate
    6-9 Sept. 2004
  • Firstpage
    781
  • Lastpage
    788
  • Abstract
    We aim to formulate the recognition of a planes from a discrete point set as a nonlinear optimization problem, and we prove a uniqueness theorem for the solution of this problem. We deal with the supercover model in a space for the expression of discrete planes. The algorithm achieves invertible data compression of digital objects, since the algorithm transforms a collection voxels to a collection of plane parameters, which classify the voxels.
  • Keywords
    image recognition; image reconstruction; image resolution; nonlinear programming; object recognition; Euclidean planes; data compression; digital object voxels; discrete point set; image reconstruction; nonlinear optimization problem; polyhedrization algorithm; Character recognition; Data compression; Data processing; Data visualization; Discrete transforms; Geometry; Hypercubes; Linear programming; Noise robustness; Object detection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004. Proceedings. 2nd International Symposium on
  • Print_ISBN
    0-7695-2223-8
  • Type

    conf

  • DOI
    10.1109/TDPVT.2004.1335395
  • Filename
    1335395