OPTIMAL HISTOGRAM PARTITIONING USING A SIMULATED ANNEALING TECHNIQUE

被引：4

作者：

BRUNELLI, R

机构：

[1] Istituto per la Ricerca Scientifica e Tecnologica, I-38050 Povo, Trento

来源：

PATTERN RECOGNITION LETTERS | 1992年 / 13卷 / 08期

关键词：

IMAGE PROCESSING; SIMULATED ANNEALING; AUTOMATIC THRESHOLD SELECTION; IMAGE SEGMENTATION; HISTOGRAM ANALYSIS;

D O I：

10.1016/0167-8655(92)90093-F

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A method for histogram partitioning based on the maximization of a criterium function is proposed. The choice of the criterium can be made using a priori information to mimic human performance as far as possible.

引用

页码：581 / 586

页数：6

共 11 条

[1]

Aarts E., 1987, SIMULATED ANNEALING

[2]

Aarts E., 1989, SIMULATED ANNEALING

[3]

Ballard DH, 1982, COMPUTER VISION

[4]

Gonzalez R. C., 1987, DIGITAL IMAGE PROCES

[5]

HUANG MD, 1986, P IEEE INT C COMPUTE, P381

[6] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[7]

OHTA Y, 1985, KNOWLEDGE BASED INTE

[8] SCALE-SPACE AND EDGE-DETECTION USING ANISOTROPIC DIFFUSION [J].

PERONA, P ;

MALIK, J .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1990, 12 (07) :629-639

[9]

POGGIO T, 1989, AI1140 MIT MEM

[10] SIMULATED ANNEALING ALGORITHMS - AN OVERVIEW [J].

RUTENBAR, RA .

IEEE CIRCUITS & DEVICES, 1989, 5 (01) :19-26

← 1 2 →