• DocumentCode
    3184839
  • Title

    A method for multiple image interpolation employing self-organizing map

  • Author

    Kawano, Hideaki ; Orii, Hideaki ; Shiraishi, Katsuaki ; Maeda, Hiroshi

  • Author_Institution
    Fac. of Eng., Kyushu Inst. of Technol., Kitakyusyu, Japan
  • fYear
    2010
  • fDate
    10-13 Oct. 2010
  • Firstpage
    4035
  • Lastpage
    4040
  • Abstract
    Morphing is one of the computer graphics operations that generate the intermediate image between images to express the changing from a shape to another shape in animation. As a typical example of real applications, the morphing operation can be used to produce a continuous sequence of sign languages from a set of sign-language-words. In general, to use morphing operation in such applications, it is needed to prepare all image changing paths that emerges in all possible sequence of states. To avoid such time-consuming preprocessings, we propose a novel method for image interpolation using Self-Organizing Map (SOM). The SOM can interpolate among data using their proximity relationships in data space by the topological mapping property. The proposed SOM-based image interpolation makes it possible to generate ungiven feasible paths from the corresponding points in each image unless any intermediate image among them are given. The effectiveness and possibilities of the proposed method are demonstrated through some toy problems.
  • Keywords
    computer animation; image sequences; interpolation; natural languages; self-organising feature maps; computer graphics operation; image changing path; morphing operation; multiple image interpolation; selforganizing map; sign language sequence; sign language word; time consuming preprocessing; topological mapping property; Image Interpolation; Image Sequence; Manifold; Morphing; Self-Organizing Map (SOM);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    1062-922X
  • Print_ISBN
    978-1-4244-6586-6
  • Type

    conf

  • DOI
    10.1109/ICSMC.2010.5642202
  • Filename
    5642202