Finding an Optimal Region in One- and Two-Dimensional Arrays

Naoki KATOH

Finding an Optimal Region in One- and Two-Dimensional Arrays

Naoki KATOH

Full Text Views

0

Cite this

Summary :

Given N real weights w₁, w₂, . . . , w_N stored in one-dimensional array, we consider the problem for finding an optimal interval I [1, N] under certain criteria. We shall review efficient algorithms developed for solving such problems under several optimality criteria. This problem can be naturally extended to two-dimensional case. Namely, given a NN two-dimensional array of N² reals, the problem seeks to find a subregion of the array (e. g. , rectangular subarray R) that optimizes a certain objective function. We shall also review several algorithms for such problems. We shall also mention applications of these problems to region segmentation in image processing and to data mining.

Publication: IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.438-446

Publication Date: 2000/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: INVITED SURVEY PAPER

Category: Algorithms for Geometric Problems

Cite this

Copy

Naoki KATOH, "Finding an Optimal Region in One- and Two-Dimensional Arrays" in IEICE TRANSACTIONS on Information, vol. E83-D, no. 3, pp. 438-446, March 2000, doi: .
Abstract: Given N real weights w₁, w₂, . . . , w_N stored in one-dimensional array, we consider the problem for finding an optimal interval I [1, N] under certain criteria. We shall review efficient algorithms developed for solving such problems under several optimality criteria. This problem can be naturally extended to two-dimensional case. Namely, given a NN two-dimensional array of N² reals, the problem seeks to find a subregion of the array (e. g. , rectangular subarray R) that optimizes a certain objective function. We shall also review several algorithms for such problems. We shall also mention applications of these problems to region segmentation in image processing and to data mining.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_438/_p

Copy

@ARTICLE{e83-d_3_438,
author={Naoki KATOH, },
journal={IEICE TRANSACTIONS on Information},
title={Finding an Optimal Region in One- and Two-Dimensional Arrays},
year={2000},
volume={E83-D},
number={3},
pages={438-446},
abstract={Given N real weights w₁, w₂, . . . , w_N stored in one-dimensional array, we consider the problem for finding an optimal interval I [1, N] under certain criteria. We shall review efficient algorithms developed for solving such problems under several optimality criteria. This problem can be naturally extended to two-dimensional case. Namely, given a NN two-dimensional array of N² reals, the problem seeks to find a subregion of the array (e. g. , rectangular subarray R) that optimizes a certain objective function. We shall also review several algorithms for such problems. We shall also mention applications of these problems to region segmentation in image processing and to data mining.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Finding an Optimal Region in One- and Two-Dimensional Arrays
T2 - IEICE TRANSACTIONS on Information
SP - 438
EP - 446
AU - Naoki KATOH
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - Given N real weights w₁, w₂, . . . , w_N stored in one-dimensional array, we consider the problem for finding an optimal interval I [1, N] under certain criteria. We shall review efficient algorithms developed for solving such problems under several optimality criteria. This problem can be naturally extended to two-dimensional case. Namely, given a NN two-dimensional array of N² reals, the problem seeks to find a subregion of the array (e. g. , rectangular subarray R) that optimizes a certain objective function. We shall also review several algorithms for such problems. We shall also mention applications of these problems to region segmentation in image processing and to data mining.
ER -