Efficient Algorithms for Constructing a Pyramid from a Terrain(Computational Geometry, <Special Section> Foundations of Computer Science)

スポンサーリンク

概要

• 論文の詳細を見る

• In [5], the following pyramid construction problem was proposed: Given nonnegative valued functions ρ and μ in d variables, we consider the optimal pyramid maximizing the total parametric gain of ρ against μ. The pyramid can be considered as the optimal unimodal approximation of ρ relative to μ, and can be applied to hierarchical data segmentation. In this paper, we give efficient algorithms for a couple of two-dimensional pyramid construction problems.

• 社団法人電子情報通信学会の論文
• 2006-02-01

著者

• Tokuyama Takeshi

  The Graduate School Of Information Sciences (gsis) Tohoku University

• CHUN Jinhee

  the Graduate School of Information Sciences (GSIS), Tohoku University

• SADAKANE Kunihiko

  the Graduate School of System Information Science, Kyushu University

• Sadakane Kunihiko

  The Graduate School Of System Information Science Kyushu University

• Sadakane Kunihiko

  The Graduate School If Information Science Tohoku University

• Chun Jinhee

  The Graduate School Of Information Sciences (gsis) Tohoku University

関連論文

• Efficient Algorithms for Constructing a Pyramid from a Terrain(Computational Geometry, Foundations of Computer Science)
• Peak-Reducing Fitting of a Curve under the Lp Metric
• Minimax Parametric Optimization Problems and Multidimensional Parametric Searching
• Fast Algorithms for k-Word Proximity Search

スポンサーリンク