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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jinhee CHUN, Kunihiko SADAKANE, Takeshi TOKUYAMA, "Efficient Algorithms for Constructing a Pyramid from a Terrain" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 2, pp. 783-788, February 2006, doi: 10.1093/ietisy/e89-d.2.783.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.2.783/_p
Copy
@ARTICLE{e89-d_2_783,
author={Jinhee CHUN, Kunihiko SADAKANE, Takeshi TOKUYAMA, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Algorithms for Constructing a Pyramid from a Terrain},
year={2006},
volume={E89-D},
number={2},
pages={783-788},
abstract={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.},
keywords={},
doi={10.1093/ietisy/e89-d.2.783},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Efficient Algorithms for Constructing a Pyramid from a Terrain
T2 - IEICE TRANSACTIONS on Information
SP - 783
EP - 788
AU - Jinhee CHUN
AU - Kunihiko SADAKANE
AU - Takeshi TOKUYAMA
PY - 2006
DO - 10.1093/ietisy/e89-d.2.783
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2006
AB - 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.
ER -