Approximating images using minimum bounding rectangles

In surveillance systems, video cameras record specific scenes for long times. However, by the end of the recording period, such tapes may hold many useless scenes which need to be eliminated. In order to reduce the time in reviewing these worthless scenes while seeking for a specific object, an approximation technique must be considered. In this article, we propose a new technique for finding the minimum bounding rectangle of objects which appear in a specific bitmap image. The minimum bounding rectangle of an image object is the Rectangle containing the object such that the sides of the rectangle touch the object boundaries. The dimensions and locations of the minimum bounding rectangle of an object can be utilized as features to identify the corresponding object.

[1]  Farshad Fotouhi,et al.  Efficient processing of spatial selection and join operations using SB/sup +/-tree , 1997, Proceedings of the 1997 International Database Engineering and Applications Symposium (Cat. No.97TB100166).

[2]  Farshad Fotouhi,et al.  Indexing and retrieving point and region objects , 1996, Electronic Imaging.

[3]  Farshad Fotouhi,et al.  The SB+-Tree: An Efficient Index Structure for Joining Spatial Relations , 1997, Int. J. Geogr. Inf. Sci..

[4]  Hanan Samet,et al.  Hierarchical representations of collections of small rectangles , 1988, CSUR.

[5]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[6]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[7]  Beng Chin Ooi,et al.  B-trees: Bearing Fruits of All Kinds , 2002, Australasian Database Conference.