A simple method for fitting of bounding rectangle to closed regions

D. Chaudhuri, Ashok K Samal

Research output: Contribution to journalArticle

87 Citations (Scopus)

Abstract

In this paper, we introduce a new approach for fitting of a bounding rectangle to closed regions. In this approach the coordinates of the vertices are computed directly using a closed-form solution. This approach is based on simple coordinate geometry and uses the boundary points of regions. Using a least-square approach we determine the directions of major and minor axes of the object, which gives the orientation of the object. The four vertexes of the bounding rectangle are computed by pair wise solving the four straight lines. Examples from synthetic data and some real-life data show that the approach is both accurate and efficient.

Original languageEnglish (US)
Pages (from-to)1981-1989
Number of pages9
JournalPattern Recognition
Volume40
Issue number7
DOIs
StatePublished - Jul 1 2007

Fingerprint

Geometry

Keywords

  • Least-square method
  • Major axis
  • Minimum-bounding box
  • Minor axis
  • Segmentation
  • Shape features

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

A simple method for fitting of bounding rectangle to closed regions. / Chaudhuri, D.; Samal, Ashok K.

In: Pattern Recognition, Vol. 40, No. 7, 01.07.2007, p. 1981-1989.

Research output: Contribution to journalArticle

@article{3118a09a6f954b79929ce18f5fce7f57,
title = "A simple method for fitting of bounding rectangle to closed regions",
abstract = "In this paper, we introduce a new approach for fitting of a bounding rectangle to closed regions. In this approach the coordinates of the vertices are computed directly using a closed-form solution. This approach is based on simple coordinate geometry and uses the boundary points of regions. Using a least-square approach we determine the directions of major and minor axes of the object, which gives the orientation of the object. The four vertexes of the bounding rectangle are computed by pair wise solving the four straight lines. Examples from synthetic data and some real-life data show that the approach is both accurate and efficient.",
keywords = "Least-square method, Major axis, Minimum-bounding box, Minor axis, Segmentation, Shape features",
author = "D. Chaudhuri and Samal, {Ashok K}",
year = "2007",
month = "7",
day = "1",
doi = "10.1016/j.patcog.2006.08.003",
language = "English (US)",
volume = "40",
pages = "1981--1989",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - A simple method for fitting of bounding rectangle to closed regions

AU - Chaudhuri, D.

AU - Samal, Ashok K

PY - 2007/7/1

Y1 - 2007/7/1

N2 - In this paper, we introduce a new approach for fitting of a bounding rectangle to closed regions. In this approach the coordinates of the vertices are computed directly using a closed-form solution. This approach is based on simple coordinate geometry and uses the boundary points of regions. Using a least-square approach we determine the directions of major and minor axes of the object, which gives the orientation of the object. The four vertexes of the bounding rectangle are computed by pair wise solving the four straight lines. Examples from synthetic data and some real-life data show that the approach is both accurate and efficient.

AB - In this paper, we introduce a new approach for fitting of a bounding rectangle to closed regions. In this approach the coordinates of the vertices are computed directly using a closed-form solution. This approach is based on simple coordinate geometry and uses the boundary points of regions. Using a least-square approach we determine the directions of major and minor axes of the object, which gives the orientation of the object. The four vertexes of the bounding rectangle are computed by pair wise solving the four straight lines. Examples from synthetic data and some real-life data show that the approach is both accurate and efficient.

KW - Least-square method

KW - Major axis

KW - Minimum-bounding box

KW - Minor axis

KW - Segmentation

KW - Shape features

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

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

U2 - 10.1016/j.patcog.2006.08.003

DO - 10.1016/j.patcog.2006.08.003

M3 - Article

VL - 40

SP - 1981

EP - 1989

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 7

ER -