| Literature DB >> 22834569 |
Taras Galkovskyi1, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga Symonova, Charles A Price, Christopher N Topp, Anjali S Iyer-Pascuzzi, Paul R Zurek, Suqin Fang, John Harer, Philip N Benfey, Joshua S Weitz.
Abstract
BACKGROUND: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Entities:
Mesh:
Year: 2012 PMID: 22834569 PMCID: PMC3444351 DOI: 10.1186/1471-2229-12-116
Source DB: PubMed Journal: BMC Plant Biol ISSN: 1471-2229 Impact factor: 4.215
Figure 1Annotated snapshot of the GiA Roots GUI. The GiA Roots GUI is a standalone application that provides a user interface to manage input images, define a processing pipeline and manage output. It features a main window with several task windows that can be accessed through the left sidebar. Sequential access to each window page accomplishes major tasks: managing data; selecting traits to measure; tweaking parameters; performing processing; reviewing the results. This linear design helps users to keep track of progress and proceed intuitively with processing of the data. Main computational steps are described in greater detail in Implementation.
Traits description
| | ||
|---|---|---|
| Bushiness (Bush) | The ratio of the maximum to the median number of roots | |
| Convex area (ConvA) | The area of the convex hull that encompasses the root. | |
| Network depth (Ndepth) | The number of pixels in the vertical direction from the upper-most network pixel to the lower-most network pixel. | |
| Network Length Distribution (Ldist) | The fraction of network pixels found in the lower 2/3 of the network. The lower 2/3 of the network is defined based on the network depth. | |
| Major axis (MajA) | The length of the major axis of the best fitting ellipse to the network | |
| Network Width (Nwidth) | The number of pixels in the horizontal direction from the left-most network pixel to the right-most network pixel. Only pixels lying in the same row are considered. | |
| Maximum number of roots (MaxR) | After sorting the number of roots crossing a horizontal line from smallest to largest, the maximum number is considered to be the 84th-percentile value (one standard deviation). | |
| Average root width (Width) | The mean value of the root width estimation computed for all pixels of the medial axis of the entire root system. This trait corresponds to diameter of a root. | |
| Median number of roots (MedR) | The result of a vertical line sweep in which the number of roots that crossed a horizontal line was estimated, and then the median of all values for the extent of the network was calculated. | |
| Minor axis (MinA) | The length of the minor axis of the best fitting ellipse to the network | |
| Network area (NwA) | The number of network pixels in the image. | |
| Perimeter (Perim) | The total number of network pixels connected to a background pixel (using a 8-nearest neighbor neighborhood). | |
| Aspect ratio (AspR) | The ratio of the minor to the major axis of best fitting ellipse | |
| Network solidity | The total network area divided by the network convex area. | |
| Specific root length (SRL) | Total network length divided by network volume. Volume is estimated as the sum of cross sectional areas for all pixels of the medial axis of the root system. The total root length is the number of pixels in the medial axis of the root system. | |
| Network Surface Area (Nsurf) | The sum of the local surface area at each pixel of the network skeleton, as approximated by a tubular shape whose radius is estimated from the image. | |
| Network length (Nlen) | The total number of pixels in the network skeleton. | |
| Network volume (Nvol) | The sum of the local volume at each pixel of the network skeleton, as approximated by a tubular shape whose radius is estimated from the image. | |
| Network width to depth ratio | The value of network width divided by the value of network depth. |
Segmentation parameters
| | ||
|---|---|---|
| Global thresholding | Threshold value of pixel intensity to be considered as part of the root. | |
| Adaptive thresholding | The size of square regions to measure the average local pixel intensity. | |
| … | Threshold offset that a focal pixel intensity must exceed relative to the pixel intensity averaged over a local region for it to be considered as part of the root. | |
| Double adaptive thresholding | Critical size of a growing square centered on a pixel for which average pixel intensity is calculated. | |
| … | Threshold decrease in average pixel intensity in square neighborhoods of increasing size that must be reached for a pixel to be considered as part of the root. | |
| All methods | All connected components with fewer than this many pixels are removed. | |
Figure 2GiA Roots processing chart. Data types are enclosed in ellipses, interactions are enclosed in rectangles. Interactions are realized by plugins, and have several variants. They can also be configured.
Figure 3Comparison of GiA Roots estimation of trait values against a prior benchmark. The two plots represent a comparison of GiA Roots estimation of trait values compared against a previously validated set of algorithms [21]. Each point represents a trait estimate from one of 2393 images. Note that the median number of roots is defined to be an integer so nearly all comparisons in the left panel exactly coincide, but when plotted they appear to give rise to a ‘gridded’ pattern. The R2values confirm the strong correspondence of the two implementations of the same trait.
Figure 4Comparison of the three available thresholding algorithms in GiA Roots. The three algorithms are global thresholding (GT), adaptive thresholding (AT), and double adaptive thresholding (DAT). Each algorithm is demonstrated on two relevant examples with default parameter settings and manually optimized parameter settings. Annotations 1-11 point at significant differences which are detailed in the text.
Parameters used for comparison of thresholding
| | |||
|---|---|---|---|
| | |||
| | tv: 150 | ms: -1.25 | nh: 15 |
| Default | cs: 4000 | cs: 4000 | cs: 4000 |
| parameters | type: binary | bs: 19 | bd: 5 |
| | | type: binary | |
| | tv: 149/159 | ms: -2.50/-2.32 | nh: 42/36 |
| Optimized | cs: 15/0 | cs: 1024/457 | cs: 306/219 |
| parameters | type: binary | bs: 200/27 | bd: 5/5 |
| type: binary,mean_c | |||
In Figure 4, parameters denote tv = threshold value, cs: minimal connected component size, ms: mean shift, nh: neighborhood size, bs: block size, bd: bound drop value, type: threshold option. The manually optimized parameters correspond to the examples in Figure 4, in top-down order. Extended definitions of the meaning of these parameters are found in Table 2 and the Manual.
Figure 5Schematic of GiA Roots extended with new trait estimation algorithms. A set of new traits is highlighted in the “Features & Algorithms” panel of GiA Roots. Installing new plugins is accomplished by copying the compiled plugin and documentation into the GiA Roots folder.
Comparison of root system analysis software
| | |||
|---|---|---|---|
| License | free, closed-source | free, closed-source | free, closed-source |
| Platform | Mac, Windows | Windows only | cross-platform (an ImageJ plugin) |
| Language | C++ | C++ | Java |
| Root tracing | only automated | manual and automated | manual and semi-automated |
| Batch processing | built-in | no | no |
| Extensibility | C++ Plugin-API | none | none |
| Database support | no, but Excel compliant export | SQL | SQL |
A feature comparison of GiA Roots with two free, recently released alternatives: EZ-Rhizo [24] and SmartRoot [39]. Note that traits available for estimation in GiA Roots are predominantly geometric, whereas EZ-Rhizo and SmartRoot estimate traits that are predominantly related to the connectivity of the root system. Hence, the traits estimated in each software do not necessarily coincide; more details can be found in the original papers.