Entry Wolberg:2000:ODR from jgraphtools.bib

Last update: Sun Oct 15 02:29:44 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Wolberg:2000:ODR,
  author =       "George Wolberg and H. M. Sueyllam and M. A. Ismail and
                 K. M. Ahmed",
  title =        "One-Dimensional Resampling with Inverse and Forward
                 Mapping Functions",
  journal =      j-J-GRAPHICS-TOOLS,
  volume =       "5",
  number =       "3",
  pages =        "11--33",
  year =         "2000",
  CODEN =        "JGTOFD",
  ISSN =         "1086-7651",
  ISSN-L =       "1086-7651",
  bibdate =      "Fri Jul 20 12:38:17 2001",
  bibsource =    "http://www.acm.org/jgt/issues.html;
                 http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib",
  URL =          "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/",
  abstract =     "Separable resampling algorithms significantly reduce
                 the complexity of image warping. Fant presented a
                 separable algorithm that is well suited for hardware
                 implementation. That method, however, is inherently
                 serial and applies only when the inverse mapping is
                 given. Wolberg presented another algorithm that is less
                 suited for hardware implementation and applies only
                 when the forward mapping is given. This paper
                 demonstrates the equivalence of the two algorithms in
                 the sense that they produce identical output scanlines.
                 We derive a variation of Fant's algorithm that applies
                 when the forward mapping is given and a variation of
                 Wolberg's algorithm that applies when the inverse
                 mapping is given. Integrated hardware implementations
                 that perform one-dimensional resampling under either
                 forward or inverse mappings are presented for both
                 algorithms based on their software descriptions. The
                 Fant algorithm has the advantage of being simple when
                 implemented in hardware, while the Wolberg algorithm
                 has the advantage of being parallelizable and
                 facilitates a faster software implementation. The
                 Wolberg algorithm also has the advantage of decoupling
                 the roundoff errors made among intervals since it does
                 not accrue errors through the incremental calculations
                 required by the Fant algorithm.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.tandfonline.com/loi/ujgt20",
}

Related entries