Advertisement

Construction of Sandwich Cover of Digital Objects

  • Apurba SarkarEmail author
  • Mousumi Dutt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9448)

Abstract

An algorithm to construct a minimum vertex cover of a digital object from its inner and outer isothetic covers such that it lies within the annular region bounded by its outer and inner isothetic covers is presented here which has \(O(\frac{n}{g}\log (n/g))\) time complexity, where n being the number of pixels on the contour of the digital object and g is the grid size. After constructing inner and outer covers [2, 3], a combinatorial technique is used to construct a sandwich cover. Sandwich cover reduces the storage complexity of the given digital object as it contains less number of vertices compared to inner or outer isothetic cover while preserving the shape of the object. Sandwich cover can be used as shape descriptor by generating several metrics on it.

Keywords

Isothetic covers Sandwich cover Shape analysis Shape descriptor Combinatorial technique 

References

  1. 1.
    Bemporad, A., Filippi, C., Torrisi, F.: Inner and outer approximations of polytopes using boxes. Comput. Geom. Theory Appl. 27, 151–178 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Biswas, A., Bhowmick, P., Bhattacharya, B.B.: TIPS: on finding a tight isothetic polygonal shape covering a 2D object. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 930–939. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  3. 3.
    Biswas, A., Bhowmick, P., Bhattacharya, B.B.: Construction of isothetic covers of a digital object: a combinatorial approach. J. Vis. Comun. Image Represent. 21(4), 295–310 (2010)CrossRefGoogle Scholar
  4. 4.
    Das, B., Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: A combinatorial technique for construction of triangular covers of digital objects. In: Barneva, R.P., Brimkov, V.E., Šlapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 76–90. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  5. 5.
    Kamon, Y., Flash, T., Edelman, S.: Learning to grasp using visual information. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2470–2476 (1995)Google Scholar
  6. 6.
    Khan, J.F., Bhuiyan, S.M.A., Adhami, R.R.: Image segmentation and shape analysis for road-sign detection. IEEE Trans. Intell. Transp. Syst. 12(1), 83–96 (2011)CrossRefGoogle Scholar
  7. 7.
    Morales, A., Sanz, P., del Pobil, A.: Vision-based computation of three-finger grasps on unknown planar objects. In: IEEE International Conference on Intelligent Robots and Systems, pp. 1711–1716 (2002)Google Scholar
  8. 8.
    Nandy, S., Bhattacharya, B., Barrera, A.: Safety zone problem. J. Algorithms 37, 538–569 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Naser, M.A., Hasnat, M., Latif, T., Nizamuddin, S., Islam, T.: Analysis and representation of character images for extracting shape based features towards building an OCR for bangla script. In: International Conference on Digital Image Processing, pp. 330–334 (2009)Google Scholar
  10. 10.
    Sklansky, J.: Minimum-perimeter polygons of digitized silhouettes. IEEE Trans. Comput. 21(3), 1355–1364 (1972)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Sloboda, F., Zatko, B.: On boundary approximation. In: Proceedings of the Sixth International Conference on Computer Analysis of Images and Patterns, CAIP 1995, pp. 488–495 (1995)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyIndian Institute of Engineering Science and TechnologyShibpurIndia
  2. 2.Department of Computer Science and EngineeringInternational Institute of Information TechnologyNaya-RaipurIndia

Personalised recommendations