Skip to main content
Log in

MedGraph: a graph-based representation and computation to handle large sets of images

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

In order to process and analyze very large volumes of images, efficient representation and structuring techniques are required. Since, current computing machines can provide large memory size, trading off reasonable amount of memory in order to achieve efficient and parallelizable representation of images is preferable. In this paper, we propose a new structure to represent and store images based on in-memory graph concept. Our method of computation provides a faster execution time than the traditional array-based representation. Each pixel of an image is represented as a one node in the graph. In addition, nodes have pointers to other neighboring nodes (pixels). The structure represents an image as a grid of connected linked lists and each grid is connected to other grids. Using our method, an image can be represented in one of three different representations which are: octal linked list, quadratic linked list, and dual linked list representations. We provide experiments and evaluations using the dual linked list representation as it requires less memory space. We apply our methodology for medical images as a proof of the concept to find a region of interest in an image. We have collected and used real medical images to build and process the graph which we call MedGraph. Our experimental results show that the proposed MedGraph technique improves the searching time for finding a region of interest when compared to the traditional representation. It is worth mentioning here that MedGraph is a generic representation strategy that can be applied to any type of images, although this paper uses medical images as a proof of the concept.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Andrews S, Hamarneh G (2015) Multi-region probabilistic dice similarity coefficient using the Aitchison distance and bipartite graph matching. Commun Res Rep (CoRR). arXiv:1509.07244

  2. Apache cassandra (2015) http://cassandra.apache.org/

  3. Beckwith R (2011) Managing big data: cloud computing and co-location centers. J Pet Technol 63:42–45

    Google Scholar 

  4. Bradski G (2000) The opencv library, Dr. Dobbs Journal of Software Tools

  5. Bryant RE, Katz RH, Lazowska ED (2008) Big-data computing: creating revolutionary breakthroughs in commerce, science, and society

  6. Castleman KR (1995) Digital Image Processing, 1st Edition. Prentice Hall

  7. Cheng M, Mitra NJ, Huang X, Torr PH, Hu S (2015) Global contrast based salient region detection. IEEE Trans Pattern Anal Mach Intell 37(3):569–582

    Article  Google Scholar 

  8. Dynamodb: Amazon NOSQL database service (2015) http://goo.gl/4mXuLp

  9. DataStax (2012) Big Data: Beyond the Hype. Why Big Data Matters to You, White paper

  10. Dean J, Ghemawat S (2008) MapReduce: Simplified data processing on large clusters. Commun ACM 51(1):107–113

    Article  Google Scholar 

  11. Douglas CC (2014) An open framework for dynamic big-data-driven application systems (DBDDAS) development. Procedia Computer Science 29:1246–1255

    Article  Google Scholar 

  12. Felzenszwalb PF, Huttenlocher DP (2004) Efficient graph-based image segmentation. Int J Comput Vis 59(2):167–181

    Article  Google Scholar 

  13. Frieze A, Gionis A, Tsourakakis C (2013) Algorithmic techniques for modeling and mining large graphs (amazing). In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’13, ACM, New York, NY, USA, 1523–1523

  14. Gantz J, Reinsel D (2011) Extracting value from chaos, IDC

  15. Girshick R, Donahue J, Darrell T, Malik J (2014) Rich feature hierarchies for accurate object detection and semantic segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp 580–587

  16. Girshick RB (2015) Fast R-CNN. Comput Res Rep (CoRR). arXiv:1504.08083

  17. Global Pulse (2012) Big Data for Development: Challenges and opportunities, White Paper. http://unglobalpulse.org

  18. Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: Distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI’12, USENIX Association, Berkeley, CA, USA, 17–30

  19. Giraph: graph processing system (2015) http://giraph.apache.org

  20. Huang J, Griffith JF, Wang D, Shi L (2015) Graph-cut-based segmentation of proximal femur from computed tomography images with shape prior. Journal of Medical and Biological Engineering 35(5)

  21. Jegou H, Douze M, Schmid C (2008) Hamming embedding and weak geometric consistency for large scale image search. In: Proceedings of the 10th European Conference on Computer Vision: Part I, ECCV ’08, Springer-Verlag, Berlin, Heidelberg, 304–317

  22. Jegou H, Douze M, Schmid C, Perez P (2010) Aggregating local descriptors into a compact image representation. In: Computer Vision and Pattern Recognition (CVPR), IEEE Conference on, 3304–3311

  23. Li J, Liu Y, Gao H (2011) Efficient algorithms for summarizing graph patterns. IEEE Trans Knowl Data Eng 23(9):1388–1405

    Article  Google Scholar 

  24. Liu Y, Li J, Gao H (2008) Summarizing graph patterns. In: Data Engineering, ICDE 2008. IEEE 24th International Conference on, 903–912

  25. Lumpkin G (2015) Integrate for Insight, The Oracle Corporation, White paper

  26. Matti M, Kvernvik T (2012) Applying big-data technologies to network architecture. In: Ericsson Review

  27. Mongodb: cross-platform document-oriented databases (2015) https://www.mongodb.org

  28. Opencv software (2015) http://opencv.org/

  29. Samih A, Wang R, Maciocco C, Kharbutli M, Solihin Y (2014) Collaborative memories in clusters: Opportunities and challenges. In: Transactions on Computational Science XXII, Vol 8360 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, 17–41

  30. Shao B, Wang H, Xiao Y (2012) Managing and mining large graphs: Systems and implementations. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD ’12, ACM, 589–592

  31. Stonebraker M, Madden S, Dubey P (2013) Intel big data science and technology center vision and execution plan. SIGMOD 42(1):44–49

    Article  Google Scholar 

  32. The apache software foundation (2015) http://www.apache.org

  33. The oracle corporation (2015) http://www.oracle.com/index.html

  34. Thomsen JR, Yiu ML, Jensen CS (2012) Effective caching of shortest paths for location-based services. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, ACM, 313–324

  35. Vavilapalli VK, Murthy AC, Douglas C, Agarwal S, Konar M, Evans R, Graves T, Lowe J, Shah H, Seth S, Saha B, Curino C, O’Malley O, Radia S, Reed B, Baldeschwieler E (2013) Apache hadoop yarn: yet another resource negotiator. In: Proceedings of the 4th Annual Symposium on Cloud Computing, SOCC ’13, ACM, New York, NY, USA, 5:1, 5–16

  36. Vertica for big data analytics (2015) http://www.vertica.com/tag/hadoop

  37. Villars RL, Olofson CW, Eastwood M (2011) Big data: what it is and why you should care, White Paper, AMD

  38. Walder R, Burrows A, Ott CD, Livne E, Lichtenstadt I, Jarrah M (2005) Anisotropies in the neutrinos and heating profiles in two-dimensional, time-dependent, multigroup radiation hydrodynamics simulations of rotating core-collapse supernovae. Astron J 626(1)

  39. Xin RS, Gonzalez JE, Franklin MJ, Stoica I (2013) Graphx: A resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems, GRADES ’13, ACM, New York, NY, USA, 2:1–2:6

  40. Young IT, Gerbrands JJ, van Vliet LJ, data Koninklijke Bibliotheek C, Haag D, Theodore YI, Jacob GJ, Vliet V, Jozef L (1995) Fundamentals of image processing

  41. Young IT, Gerbrands JJ, van Vliet f LJ (1995) Fundamentals of image processing, delft: Delft University of Technology

  42. Zhou C, Gao J, Sun B, Yu JX (2014) MOCgraph: Scalable distributed graph processing using message online computing. Proc VLDB Endow 8(4):377–388

    Article  Google Scholar 

  43. Zhou Q, Ma L, Celenk M, Chelberg D (2005) Content-based image retrieval based on ROI detection and relevance feedback. Multimed Tools Appl 27(2):251–281

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the Deanship of Research at the Jordan University of Science and Technology for funding this work, grant number 20150050.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Moath Jarrah.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jarrah, M., Al-Quraan, M., Jararweh, Y. et al. MedGraph: a graph-based representation and computation to handle large sets of images. Multimed Tools Appl 76, 2769–2785 (2017). https://doi.org/10.1007/s11042-016-3262-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-3262-0

Keywords

Navigation