Complexity of the MIP map algorithm for perspective texture warping

Jian Jun Fang, Karthik Ramaswamy, Kathy Moseler, Sami Levi, Sethuraman Panchanathan

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The MPEG4-based visual presentation is a scene presentation, which is composed of multiple visual objects. The MPEG-4 standard allows viewers to interactively change their viewing positions relative to a scene. Therefore, an MPEG4-compliant graphical rendering device should be able to transform a decoded video object in 3D space according to viewer's viewing position. This type of texture transformation is known as perspective texture warping. In order to assure high quality images during perspective texture warping, the warping algorithm needs to be incorporated with anti-aliasing functions. One of the popular anti-aliasing methods is known as the MIP mapping, which stands for `multum in parvo', a Latin phrase meaning `many things in a small place.' The advantage of the MIP mapping method is that the number of operations and memory accesses is constant. Compared to other anti-aliasing methods, the MIP mapping method requires fewer memory accesses. We studied the complexity of the MIP mapping method and estimated the number of basic arithmetic operations needed in order to implement the algorithm in hardware. We believe that the result of the complexity analysis can provide useful information in terms of algorithm selection for hardware implementation as well as actual hardware design.

Original languageEnglish (US)
Pages (from-to)118-126
Number of pages9
JournalUnknown Journal
Volume3970
StatePublished - 2000
Externally publishedYes

Fingerprint

Anti-aliasing
textures
Textures
hardware
Hardware
Motion Picture Experts Group standards
Data storage equipment
Image quality
Systems Analysis
Equipment and Supplies

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Fang, J. J., Ramaswamy, K., Moseler, K., Levi, S., & Panchanathan, S. (2000). Complexity of the MIP map algorithm for perspective texture warping. Unknown Journal, 3970, 118-126.

Complexity of the MIP map algorithm for perspective texture warping. / Fang, Jian Jun; Ramaswamy, Karthik; Moseler, Kathy; Levi, Sami; Panchanathan, Sethuraman.

In: Unknown Journal, Vol. 3970, 2000, p. 118-126.

Research output: Contribution to journalArticle

Fang, JJ, Ramaswamy, K, Moseler, K, Levi, S & Panchanathan, S 2000, 'Complexity of the MIP map algorithm for perspective texture warping', Unknown Journal, vol. 3970, pp. 118-126.
Fang, Jian Jun ; Ramaswamy, Karthik ; Moseler, Kathy ; Levi, Sami ; Panchanathan, Sethuraman. / Complexity of the MIP map algorithm for perspective texture warping. In: Unknown Journal. 2000 ; Vol. 3970. pp. 118-126.
@article{37abebdca1a14bd6a3165a8861299635,
title = "Complexity of the MIP map algorithm for perspective texture warping",
abstract = "The MPEG4-based visual presentation is a scene presentation, which is composed of multiple visual objects. The MPEG-4 standard allows viewers to interactively change their viewing positions relative to a scene. Therefore, an MPEG4-compliant graphical rendering device should be able to transform a decoded video object in 3D space according to viewer's viewing position. This type of texture transformation is known as perspective texture warping. In order to assure high quality images during perspective texture warping, the warping algorithm needs to be incorporated with anti-aliasing functions. One of the popular anti-aliasing methods is known as the MIP mapping, which stands for `multum in parvo', a Latin phrase meaning `many things in a small place.' The advantage of the MIP mapping method is that the number of operations and memory accesses is constant. Compared to other anti-aliasing methods, the MIP mapping method requires fewer memory accesses. We studied the complexity of the MIP mapping method and estimated the number of basic arithmetic operations needed in order to implement the algorithm in hardware. We believe that the result of the complexity analysis can provide useful information in terms of algorithm selection for hardware implementation as well as actual hardware design.",
author = "Fang, {Jian Jun} and Karthik Ramaswamy and Kathy Moseler and Sami Levi and Sethuraman Panchanathan",
year = "2000",
language = "English (US)",
volume = "3970",
pages = "118--126",
journal = "Scanning Electron Microscopy",
issn = "0586-5581",
publisher = "Scanning Microscopy International",

}

TY - JOUR

T1 - Complexity of the MIP map algorithm for perspective texture warping

AU - Fang, Jian Jun

AU - Ramaswamy, Karthik

AU - Moseler, Kathy

AU - Levi, Sami

AU - Panchanathan, Sethuraman

PY - 2000

Y1 - 2000

N2 - The MPEG4-based visual presentation is a scene presentation, which is composed of multiple visual objects. The MPEG-4 standard allows viewers to interactively change their viewing positions relative to a scene. Therefore, an MPEG4-compliant graphical rendering device should be able to transform a decoded video object in 3D space according to viewer's viewing position. This type of texture transformation is known as perspective texture warping. In order to assure high quality images during perspective texture warping, the warping algorithm needs to be incorporated with anti-aliasing functions. One of the popular anti-aliasing methods is known as the MIP mapping, which stands for `multum in parvo', a Latin phrase meaning `many things in a small place.' The advantage of the MIP mapping method is that the number of operations and memory accesses is constant. Compared to other anti-aliasing methods, the MIP mapping method requires fewer memory accesses. We studied the complexity of the MIP mapping method and estimated the number of basic arithmetic operations needed in order to implement the algorithm in hardware. We believe that the result of the complexity analysis can provide useful information in terms of algorithm selection for hardware implementation as well as actual hardware design.

AB - The MPEG4-based visual presentation is a scene presentation, which is composed of multiple visual objects. The MPEG-4 standard allows viewers to interactively change their viewing positions relative to a scene. Therefore, an MPEG4-compliant graphical rendering device should be able to transform a decoded video object in 3D space according to viewer's viewing position. This type of texture transformation is known as perspective texture warping. In order to assure high quality images during perspective texture warping, the warping algorithm needs to be incorporated with anti-aliasing functions. One of the popular anti-aliasing methods is known as the MIP mapping, which stands for `multum in parvo', a Latin phrase meaning `many things in a small place.' The advantage of the MIP mapping method is that the number of operations and memory accesses is constant. Compared to other anti-aliasing methods, the MIP mapping method requires fewer memory accesses. We studied the complexity of the MIP mapping method and estimated the number of basic arithmetic operations needed in order to implement the algorithm in hardware. We believe that the result of the complexity analysis can provide useful information in terms of algorithm selection for hardware implementation as well as actual hardware design.

UR - http://www.scopus.com/inward/record.url?scp=0033905808&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033905808&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033905808

VL - 3970

SP - 118

EP - 126

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

ER -