Finding best-fitted rectangle for regions using a bisection method

D. Chaudhuri, N. K. Kushwaha, I. Sharif, Ashok K Samal

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In this paper, we have presented a new method for computing the best-fitted rectangle for closed regions using their boundary points. The vertices of the best-fitted rectangle are computed using a bisection method starting with the upper-estimated rectangle and the under-estimated rectangle. The vertices of the upper- and under-estimated rectangles are directly computed using closed-form solutions by solving for pairs of straight lines. Starting with these two rectangles, we solve for the best-fitted rectangle iteratively using a bisection method. The algorithm stops when the areas of the fitted rectangles remain unchanged during consecutive iterations. Extensive evaluation of our algorithm demonstrates its effectiveness.

Original languageEnglish (US)
Pages (from-to)1263-1271
Number of pages9
JournalMachine Vision and Applications
Volume23
Issue number6
DOIs
StatePublished - Nov 1 2012

Keywords

  • Centroid
  • Least square method
  • Major axis
  • Minimum bounding box
  • Minor axis
  • Orientation
  • Rectangular fit
  • Segmentation
  • Shape features

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Computer Science Applications

Cite this

Finding best-fitted rectangle for regions using a bisection method. / Chaudhuri, D.; Kushwaha, N. K.; Sharif, I.; Samal, Ashok K.

In: Machine Vision and Applications, Vol. 23, No. 6, 01.11.2012, p. 1263-1271.

Research output: Contribution to journalArticle

Chaudhuri, D. ; Kushwaha, N. K. ; Sharif, I. ; Samal, Ashok K. / Finding best-fitted rectangle for regions using a bisection method. In: Machine Vision and Applications. 2012 ; Vol. 23, No. 6. pp. 1263-1271.
@article{6c3f4872eb594125be80282bdd2b292b,
title = "Finding best-fitted rectangle for regions using a bisection method",
abstract = "In this paper, we have presented a new method for computing the best-fitted rectangle for closed regions using their boundary points. The vertices of the best-fitted rectangle are computed using a bisection method starting with the upper-estimated rectangle and the under-estimated rectangle. The vertices of the upper- and under-estimated rectangles are directly computed using closed-form solutions by solving for pairs of straight lines. Starting with these two rectangles, we solve for the best-fitted rectangle iteratively using a bisection method. The algorithm stops when the areas of the fitted rectangles remain unchanged during consecutive iterations. Extensive evaluation of our algorithm demonstrates its effectiveness.",
keywords = "Centroid, Least square method, Major axis, Minimum bounding box, Minor axis, Orientation, Rectangular fit, Segmentation, Shape features",
author = "D. Chaudhuri and Kushwaha, {N. K.} and I. Sharif and Samal, {Ashok K}",
year = "2012",
month = "11",
day = "1",
doi = "10.1007/s00138-011-0348-6",
language = "English (US)",
volume = "23",
pages = "1263--1271",
journal = "Machine Vision and Applications",
issn = "0932-8092",
publisher = "Springer Verlag",
number = "6",

}

TY - JOUR

T1 - Finding best-fitted rectangle for regions using a bisection method

AU - Chaudhuri, D.

AU - Kushwaha, N. K.

AU - Sharif, I.

AU - Samal, Ashok K

PY - 2012/11/1

Y1 - 2012/11/1

N2 - In this paper, we have presented a new method for computing the best-fitted rectangle for closed regions using their boundary points. The vertices of the best-fitted rectangle are computed using a bisection method starting with the upper-estimated rectangle and the under-estimated rectangle. The vertices of the upper- and under-estimated rectangles are directly computed using closed-form solutions by solving for pairs of straight lines. Starting with these two rectangles, we solve for the best-fitted rectangle iteratively using a bisection method. The algorithm stops when the areas of the fitted rectangles remain unchanged during consecutive iterations. Extensive evaluation of our algorithm demonstrates its effectiveness.

AB - In this paper, we have presented a new method for computing the best-fitted rectangle for closed regions using their boundary points. The vertices of the best-fitted rectangle are computed using a bisection method starting with the upper-estimated rectangle and the under-estimated rectangle. The vertices of the upper- and under-estimated rectangles are directly computed using closed-form solutions by solving for pairs of straight lines. Starting with these two rectangles, we solve for the best-fitted rectangle iteratively using a bisection method. The algorithm stops when the areas of the fitted rectangles remain unchanged during consecutive iterations. Extensive evaluation of our algorithm demonstrates its effectiveness.

KW - Centroid

KW - Least square method

KW - Major axis

KW - Minimum bounding box

KW - Minor axis

KW - Orientation

KW - Rectangular fit

KW - Segmentation

KW - Shape features

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

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

U2 - 10.1007/s00138-011-0348-6

DO - 10.1007/s00138-011-0348-6

M3 - Article

AN - SCOPUS:84870240175

VL - 23

SP - 1263

EP - 1271

JO - Machine Vision and Applications

JF - Machine Vision and Applications

SN - 0932-8092

IS - 6

ER -