A fast computational method for minimum square error transform

Seongwhan Lee; Jin H. Kim

doi:10.1016/0167-8655(88)90091-8

A fast computational method for minimum square error transform

Seongwhan Lee, Jin H. Kim

Department of Artificial Intelligence

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

In this paper, we describe a basic minimum square error transform for point pattern matching and propose a fast computational method for minimum square error transform. The computational analysis revealed that the proposed method is faster than that of Groen et al. (1985).

Original language	English
Pages (from-to)	143-146
Number of pages	4
Journal	Pattern Recognition Letters
Volume	8
Issue number	3
DOIs	https://doi.org/10.1016/0167-8655(88)90091-8
Publication status	Published - 1988 Oct

Keywords

Minimum square error transform
image matching
point pattern matching

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/0167-8655(88)90091-8

Cite this

@article{89c8099aa9e243d8bdb238f1e6740b25,

title = "A fast computational method for minimum square error transform",

abstract = "In this paper, we describe a basic minimum square error transform for point pattern matching and propose a fast computational method for minimum square error transform. The computational analysis revealed that the proposed method is faster than that of Groen et al. (1985).",

keywords = "Minimum square error transform, image matching, point pattern matching",

author = "Seongwhan Lee and Kim, {Jin H.}",

year = "1988",

month = oct,

doi = "10.1016/0167-8655(88)90091-8",

language = "English",

volume = "8",

pages = "143--146",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A fast computational method for minimum square error transform

AU - Lee, Seongwhan

AU - Kim, Jin H.

PY - 1988/10

Y1 - 1988/10

N2 - In this paper, we describe a basic minimum square error transform for point pattern matching and propose a fast computational method for minimum square error transform. The computational analysis revealed that the proposed method is faster than that of Groen et al. (1985).

AB - In this paper, we describe a basic minimum square error transform for point pattern matching and propose a fast computational method for minimum square error transform. The computational analysis revealed that the proposed method is faster than that of Groen et al. (1985).

KW - Minimum square error transform

KW - image matching

KW - point pattern matching

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

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

U2 - 10.1016/0167-8655(88)90091-8

DO - 10.1016/0167-8655(88)90091-8

M3 - Article

AN - SCOPUS:0024191358

SN - 0167-8655

VL - 8

SP - 143

EP - 146

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 3

ER -

A fast computational method for minimum square error transform

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this