Abstract
This article deals with the AORTA software system providing support for research activities to find molecular basis for further assessment of individual predisposition to atherosclerosis. These studies are aimed at finding a relationship between somatic mutations of the mitochondrial genome in the aortic wall cells and the extent of atherosclerotic lesions of the aorta. A morphologist selects these areas on an aortic tissue sample and describes them, so that within each area, deviation of the quantitative indicator of atherosclerosis severity (phenotypic marker) from the area average should be sufficiently small. Next, the frequency and severity indicators of somatic mutations of the mitochondrial genome (genetic markers) are measured for each area and then entered into the AORTA system.
Author contributions: All the authors have accepted responsibility for the entire content of this submitted manuscript and approved submission.
Research funding: This study was supported in part of morphological studies by the Russian Scientific Foundation (grant no. 14-14-01038).
Employment or leadership: None declared.
Honorarium: None declared.
Competing interests: The funding organization(s) played no role in the study design; in the collection, analysis, and interpretation of data; in the writing of the report; or in the decision to submit the report for publication.
References
1. Sazonova M, Budnikov E, Khasanova Z, Sobenin I, Postnov A, Orekhov A. Studies of the human aortic intima by a direct quantitative assay of mutant alleles in the mitochondrial genome. Atherosclerosis 2009;204:184–90.10.1016/j.atherosclerosis.2008.09.001Search in Google Scholar
2. Pratt W. Digital image processing. New York: John Wiley & Sons, 1978:750.Search in Google Scholar
3. Shapiro LG, Stockman GC. Computer vision. Upper Saddle River, NJ: Prentice-Hall, 2001:444.Search in Google Scholar
4. Marr DC. Vision: a computational investigation into the human representation and processing of visual information. New York: W.H. Freeman & Company, 1982:397.Search in Google Scholar
5. Gonzalez RC, Woods RE. Digital image processing, 2th ed. Upper Saddle River, NJ: Prentice-Hall, 2008:779.Search in Google Scholar
6. Vezhnevets A, Barinova O. Image segmentation methods: automatic segmentation. computer graphics and multimedia. Network J 2006;4. Available at: http://cgm.computergraphics.ru/content/view/147. Accessed: 1 Feb 2015.Search in Google Scholar
7. Shi J, Malik J. Normalized cuts and image segmentation. Proc IEEE Conf Comput Vis Pattern Recog 1997:731–7.Search in Google Scholar
8. Sharon E, Brandt A, Basri R. Fast multiscale image segmentation. Proc IEEE Conf Comput Vis Pattern Recog 2000;1:70–7.10.1109/CVPR.2000.855801Search in Google Scholar
9. Koker R, Sari Y. Neural network based automatic threshold selection for an industrial vision system. Proc Int Conf Signal Process 2003:523–5.Search in Google Scholar
10. Papamarkos NA. Technique for fuzzy document binarization. Proc ACM Symp Document Eng 2001:152–6.10.1145/502187.502210Search in Google Scholar
11. Wu K, Otoo E, Suzuki K. Optimizing two-pass connected-component labeling algorithms. Pattern Anal Appl 2009;12: 206–20.10.1007/s10044-008-0109-ySearch in Google Scholar
12. Haralick RM. Some neighborhood operations. In: Onoe M, Preston K Jr, Rosenfeld A, editors. Real time-parallel computing: image analysis. New York: Plenum Press, 1981:11–35.Search in Google Scholar
13. Suzuki K, Horiba I, Sugie N. Linear-time connected-component labeling based on sequential local operations. Comput Vis Image Underst 2003:89:1–23.10.1016/S1077-3142(02)00030-9Search in Google Scholar
14. Rosenfeld A, Pfaltz P. Sequential operations in digital picture processing. J Assoc Comput Mach 1966;12:471–94.10.1145/321356.321357Search in Google Scholar
15. Chang F, Chen C-J, Lu C-J. A linear time component-labeling algorithm using contour tracing technique. Comput Vis Image Underst 2004;93:206–20.10.1016/j.cviu.2003.09.002Search in Google Scholar
16. Shapiro L. Connected component labeling and adjacency graph construction. In: Topological algorithms for digital image processing. Amsterdam: Elsevier, 1996:1–31.Search in Google Scholar
17. He L, Chao Y, Suzuki K, Wu K. Fast connected-component labeling. Pattern Recog 2009;42:1977–87.10.1016/j.patcog.2008.10.013Search in Google Scholar
18. Sterzhanov MB. Methodology of selecting connected components in line binary images. Minsk: Belarusian State University of Informatics and Radioelectronics (BSUIR), 2006:18.Search in Google Scholar
19. Ohlander R, Price K, Reddy DR. Picture segmentation using a recursive region splitting method. Comput Graphics Image Process 1978;8:313–33.10.1016/0146-664X(78)90060-6Search in Google Scholar
20. Karypis G, Kumar V. Multilevel k-way partitioning scheme for irregular graphs. J Parallel Distrib Comput 1998;8: 96–129.10.1006/jpdc.1997.1404Search in Google Scholar
21. Sazonova MA, Sinyov VV, Barinova VA, Ryzhkova AI, Zhelankin AV, et al. Mosaicism of mitochondrial genetic variation in atherosclerotic lesions of the human aorta. BioMed Res Int 2014: article ID 825468.10.1155/2015/825468Search in Google Scholar PubMed PubMed Central
©2015 by De Gruyter
