
<!DOCTYPE article
  PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD with MathML3 v1.4 20241031//EN" "JATS-archivearticle1-4-mathml3.dtd">
<article article-type="research-article" xml:lang="en" dtd-version="1.4"><processing-meta base-tagset="archiving" mathml-version="3.0" table-model="xhtml" tagset-family="jats"><restricted-by>pmc</restricted-by></processing-meta><front><journal-meta><journal-id journal-id-type="nlm-ta">Plant Phenomics</journal-id><journal-id journal-id-type="iso-abbrev">Plant Phenomics</journal-id><journal-id journal-id-type="pmc-domain-id">3941</journal-id><journal-id journal-id-type="pmc-domain">plantphen</journal-id><journal-id journal-id-type="nlm-id">101769942</journal-id><journal-title-group><journal-title>Plant Phenomics</journal-title></journal-title-group><issn pub-type="epub">2643-6515</issn><?publisher_abbrev nanjing?><publisher><publisher-name>Nanjing Agricultural University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="pmcid">PMC13316521</article-id><article-id pub-id-type="pmcid-ver">PMC13316521.1</article-id><article-id pub-id-type="pmcaid">13316521</article-id><article-id pub-id-type="pmcaiid">13316521</article-id><article-id pub-id-type="pmid">42382247</article-id><article-id pub-id-type="doi">10.1016/j.plaphe.2026.100197</article-id><article-id pub-id-type="pii">S2643-6515(26)00034-8</article-id><article-id pub-id-type="publisher-id">100197</article-id><article-version article-version-type="pmc-version">1</article-version><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title>Quantification of lettuce leaf DUS test traits and phenotypic fingerprint construction for variety identification</article-title></title-group><contrib-group><contrib contrib-type="author" id="au1"><name name-style="western"><surname>Qiu</surname><given-names initials="G">Guangjie</given-names></name><xref rid="aff1" ref-type="aff">a</xref><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref></contrib><contrib contrib-type="author" id="au2"><name name-style="western"><surname>Wen</surname><given-names initials="W">Weiliang</given-names></name><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref></contrib><contrib contrib-type="author" id="au3"><name name-style="western"><surname>Chen</surname><given-names initials="X">Xiaoqian</given-names></name><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref></contrib><contrib contrib-type="author" id="au4"><name name-style="western"><surname>Wang</surname><given-names initials="C">Chuanyu</given-names></name><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref></contrib><contrib contrib-type="author" id="au5"><name name-style="western"><surname>Yang</surname><given-names initials="S">Si</given-names></name><email>yangsi4212@163.com</email><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref><xref rid="cor1" ref-type="corresp">⁎</xref></contrib><contrib contrib-type="author" id="au6"><name name-style="western"><surname>Guo</surname><given-names initials="X">Xinyu</given-names></name><email>guoxy73@163.com</email><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref><xref rid="cor2" ref-type="corresp">⁎⁎</xref></contrib><contrib contrib-type="author" id="au7"><name name-style="western"><surname>Zhao</surname><given-names initials="C">Chunjiang</given-names></name><email>zhaocj@nercita.org.cn</email><xref rid="aff1" ref-type="aff">a</xref><xref rid="aff2" ref-type="aff">b</xref><xref rid="aff3" ref-type="aff">c</xref><xref rid="cor3" ref-type="corresp">⁎⁎⁎</xref></contrib><aff id="aff1"><label>a</label>Institute for the Smart Agriculture, Jilin Agricultural University, Changchun, 130118, China</aff><aff id="aff2"><label>b</label>Beijing Key Laboratory of Digital Plant, National Engineering Research Center for Information Technology in Agriculture, Beijing, 100097, China</aff><aff id="aff3"><label>c</label>Information Technology Research Center, Beijing Academy of Agriculture and Forestry Sciences, Beijing, 100097, China</aff></contrib-group><author-notes><corresp id="cor1"><label>⁎</label>Corresponding author. Beijing Key Laboratory of Digital Plant, National Engineering Research Center for Information Technology in Agriculture, Beijing, 100097, China. <email>yangsi4212@163.com</email></corresp><corresp id="cor2"><label>⁎⁎</label>Corresponding author. Beijing Key Laboratory of Digital Plant, National Engineering Research Center for Information Technology in Agriculture, Beijing, 100097, China. <email>guoxy73@163.com</email></corresp><corresp id="cor3"><label>⁎⁎⁎</label>Corresponding author. Information Technology Research Center, Beijing Academy of Agriculture and Forestry Sciences, Beijing, 100097, China. <email>zhaocj@nercita.org.cn</email></corresp></author-notes><pub-date pub-type="collection"><month>6</month><year>2026</year></pub-date><pub-date pub-type="epub"><day>06</day><month>3</month><year>2026</year></pub-date><volume>8</volume><issue>2</issue><issue-id pub-id-type="pmc-issue-id">512656</issue-id><elocation-id>100197</elocation-id><history><date date-type="received"><day>10</day><month>6</month><year>2025</year></date><date date-type="rev-recd"><day>9</day><month>12</month><year>2025</year></date><date date-type="accepted"><day>18</day><month>2</month><year>2026</year></date></history><pub-history><event event-type="pmc-release"><date><day>06</day><month>03</month><year>2026</year></date></event><event event-type="pmc-live"><date><day>01</day><month>07</month><year>2026</year></date></event><event event-type="pmc-last-change"><date iso-8601-date="2026-07-23 14:25:17.853"><day>23</day><month>07</month><year>2026</year></date></event></pub-history><permissions><copyright-statement>© 2026 The Authors</copyright-statement><copyright-year>2026</copyright-year><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/" specific-use="textmining" content-type="ccbylicense">https://creativecommons.org/licenses/by/4.0/</ali:license_ref><license-p>This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).</license-p></license></permissions><self-uri xmlns:xlink="http://www.w3.org/1999/xlink" content-type="pmc-pdf" xlink:href="main.pdf"><?pdf-name main.pdf?><?pdf-size 11595414?><?pdf-md5 dd5dfaa9b6a2a72fa15aea9e33b627ef?><?pdf-image-server-status NEVER_LOAD?><?pdf-cloudpmc-urn urn:app:3ed9/13316521/dd5dfaa9b6a2/main.pdf?></self-uri><abstract id="abs0010"><p>Rapid and accurate identification of DUS (Distinctness, Uniformity, and Stability) test traits in lettuce leaves is essential for advancing multi-omics-driven intelligent breeding. It also plays a critical role in germplasm protection and enhancing agricultural competitiveness. However, the phenotypic traits of lettuce leaves are highly diverse and complex due to both genotypic variation and environmental influences, posing significant challenges for precise DUS trait quantification. To address these challenges, we propose a high-precision phenotypic trait extraction pipeline and introduce an interpretable phenotypic fingerprinting framework for lettuce subgroup identification. First, a lightweight semantic segmentation network guided by group attention is developed to extract leaf components. Then, shape, color, and texture traits are comprehensively quantified. Following UPOV (International Union for the Protection of New Varieties of Plants) guidelines, we establish quantitative methods for seven DUS test traits: leaf shape, leaf tip shape, leaf margin shape, leaf vein shape, color hue, brightness, and anthocyanin coloration. Finally, PCA (Principal component analysis) was used to select 13 key traits, capturing over 95.82% of the total variance, for constructing “phenotypic ID” of lettuce varieties. Experiments conducted on 709 lettuce leaf image datasets showed that the accuracy of subgroup identification based on phenotypic fingerprints reached 98.59%. This study offers a scalable approach for automated DUS test trait evaluation and intelligent crop variety identification, providing a novel paradigm with strong potential for application in precision breeding and germplasm resource management.</p></abstract><kwd-group id="kwrds0010"><title>Keywords</title><kwd>Lettuce leaf</kwd><kwd>DUS test traits</kwd><kwd>Phenotypic fingerprint</kwd><kwd>High-throughput phenotyping</kwd><kwd>Intelligent breeding</kwd></kwd-group><custom-meta-group><custom-meta><meta-name>pmc-status-qastatus</meta-name><meta-value>0</meta-value></custom-meta><custom-meta><meta-name>pmc-status-live</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-status-embargo</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-status-released</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-open-access</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-olf</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-manuscript</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-legally-suppressed</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-has-pdf</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-has-supplement</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-pdf-only</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-suppress-copyright</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-is-real-version</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-is-scanned-article</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-preprint</meta-name><meta-value>no</meta-value></custom-meta><custom-meta><meta-name>pmc-prop-in-epmc</meta-name><meta-value>yes</meta-value></custom-meta><custom-meta><meta-name>pmc-license-ref</meta-name><meta-value>CC BY</meta-value></custom-meta></custom-meta-group></article-meta></front><body><sec id="sec1"><label>1</label><title>Introduction</title><p id="p0010">Lettuce (<italic toggle="yes">Lactuca sativa L.</italic>) is an annual or biennial herb in the Asteraceae family, widely cultivated across the globe. As a major leafy vegetable, it provides essential nutrients and holds considerable economic value [<xref rid="bib1" ref-type="bibr">1</xref>,<xref rid="bib2" ref-type="bibr">2</xref>]. Accurate evaluation of phenotypic traits is critical for improving yield, quality, and breeding efficiency [<xref rid="bib3" ref-type="bibr">3</xref>,<xref rid="bib4" ref-type="bibr">4</xref>].</p><p id="p0015">The importance of plant phenotypes has been recognized by agronomists and researchers since ancient times. Phenotypic traits have long been selected to enhance crop yield and quality, making them among the oldest traits studied in agricultural science [<xref rid="bib5" ref-type="bibr">[5]</xref>, <xref rid="bib6" ref-type="bibr">[6]</xref>, <xref rid="bib7" ref-type="bibr">[7]</xref>]. Plant phenotypes are shaped by both genetic and environmental factors, and breeders commonly leverage this variation to achieve specific breeding objectives [<xref rid="bib8" ref-type="bibr">8</xref>,<xref rid="bib9" ref-type="bibr">9</xref>]. Quantitative characterization of phenotypic traits is therefore essential for crop improvement and for uncovering the mechanisms underlying key biological traits. A major challenge in plant phenotyping research is the rapid acquisition of sufficient, high-quality phenotypic data [<xref rid="bib10" ref-type="bibr">10</xref>]. Traditional morphology-based approaches can capture observable traits such as leaf color and leaf shape, but these methods are often subjective and limited in scale [<xref rid="bib11" ref-type="bibr">11</xref>]. Chemical analysis methods, though accurate and reliable, are time-consuming, costly, and destructive [<xref rid="bib12" ref-type="bibr">12</xref>]. With recent advances in agricultural informatization, artificial intelligence, and machine learning, new image-based phenotyping strategies have emerged [<xref rid="bib13" ref-type="bibr">13</xref>]. As an integral component of modern plant phenomics, these technologies quantify morphological, physiological, and biochemical responses to environmental stresses, supporting yield improvement, quality enhancement, and resource-efficient crop management [<xref rid="bib14" ref-type="bibr">14</xref>,<xref rid="bib15" ref-type="bibr">15</xref>].</p><p id="p0020">Rapid advances in plant phenomics over the past decade have enabled the analysis of phenotypes using two-dimensional (2D) and three-dimensional (3D) imaging techniques [<xref rid="bib16" ref-type="bibr">[16]</xref>, <xref rid="bib17" ref-type="bibr">[17]</xref>, <xref rid="bib18" ref-type="bibr">[18]</xref>]. These technologies include digital cameras, scanners, magnetic resonance imaging (MRI), computed tomography (CT), spectroscopy, and radar-based point cloud systems. High-throughput plant phenotyping platforms leverage these imaging tools to quantitatively assess genotype–phenotype relationships. 2D and 3D imaging primarily capture external morphology and growth dynamics of plants [<xref rid="bib19" ref-type="bibr">19</xref>,<xref rid="bib20" ref-type="bibr">20</xref>], whereas spectral imaging techniques provide complementary insights into internal physiological status and biochemical properties [<xref rid="bib21" ref-type="bibr">21</xref>,<xref rid="bib22" ref-type="bibr">22</xref>].</p><p id="p0025">To this end, image-based phenotyping provides an automated, non-destructive, and cost-effective approach for quantifying lettuce leaf traits [<xref rid="bib23" ref-type="bibr">23</xref>]. Interpretable and highly distinguishable phenotypic characteristics across large lettuce populations are essential for phenotypic identification and for analyzing phenotype–gene–environment associations. Detailed structural phenotypes of lettuce leaves offer valuable cues for taxonomic characterization and supply an accurate computational basis for functional leaf analysis. Morphologically, lettuce leaves can be divided into distinct functional regions [<xref rid="bib24" ref-type="bibr">24</xref>]. For example, leaf surface area reflects the plant's photosynthetic capacity and can be used to predict plant development and fruit quality. Leaf size also informs cultivation practices, including plant training, pruning, irrigation, and nutrient management, in addition to influencing photosynthesis and transpiration. The petiole reflects the plant's dormancy state, with shorter petioles produced under dormant conditions. Crown diameter and girth are closely related to plant biomass and growth, to some extent.</p><p id="p0030">One of the essential procedures before a crop variety can be accepted for production is the DUS test [<xref rid="bib25" ref-type="bibr">25</xref>]. The purpose of the DUS test is to identify trait variation within species, ensure the stability of traits within varieties, assess the consistency of phenotypic traits, and examine the uniqueness of internal variation. As a phenotype-centered assessment grounded in morphological observation, the DUS test plays a critical role in variety identification and registration, yet it remains a labor-intensive and technically demanding process [<xref rid="bib26" ref-type="bibr">26</xref>]. In current practice, DUS evaluations are conducted manually. This approach faces several limitations: the large number of traits to be assessed increases the risk of human error, subjective judgement can lead to inconsistency among evaluators, and manual measurements require substantial time and labor investment [<xref rid="bib27" ref-type="bibr">27</xref>]. With the advancement of computer vision and digital agriculture, automated morphological measurement has emerged as a promising alternative. Image-based approaches improve trait recognition accuracy, reduce evaluation time, and enhance repeatability and objectivity, thereby addressing many of the challenges inherent to traditional manual DUS testing.</p><p id="p0035">Phenotypic fingerprinting has emerged as a promising strategy for crop variety identification. By quantitatively extracting morphological, color, and texture traits, it generates a unique and stable “identity” for each variety, providing a precise basis for germplasm identification, resource conservation, and breeding applications. However, phenotypic fingerprinting remains in an early developmental stage and lacks a unified, mature analytical framework [<xref rid="bib28" ref-type="bibr">28</xref>]. Existing studies focus mainly on morphological feature extraction and classification [<xref rid="bib29" ref-type="bibr">29</xref>], while issues such as inadequate data standardization, limited high-throughput processing capacity, and insufficient interpretability are yet to be fully resolved. Notably, research in related domains particularly face recognition has achieved substantial advancements in robust feature encoding and identity verification. Deep learning models such as convolutional neural networks (CNNs) and generative adversarial networks (GANs) demonstrate strong capabilities in structured feature extraction under complex imaging conditions [<xref rid="bib30" ref-type="bibr">30</xref>,<xref rid="bib31" ref-type="bibr">31</xref>], and feature-point encoding and matching techniques [<xref rid="bib32" ref-type="bibr">32</xref>] provide methodological inspiration for constructing phenotypic fingerprints for crop variety identification.</p><p id="p0040">Phenotypic characterization is a critical component of DUS testing. Accurately capturing phenotypic trait variation in new varieties under defined environmental conditions provides essential technical support for reliable DUS assessments. In this study, high-throughput phenotyping techniques were employed to construct phenotypic fingerprints from a morphological and histological perspective, thereby enhancing standardization and improving the efficiency of variety identification. Using lettuce as the research subject, this work addresses the pressing need for high-throughput and interpretable phenotypic identification within the DUS testing process. By integrating computer vision methods, we established a streamlined phenotypic analysis pipeline capable of accurately quantifying leaf shape, color, and texture traits under controlled conditions. On this basis, standardized phenotypic fingerprints were generated to support subgroup variety identification. The goal of this study is to promote innovation in lettuce germplasm characterization, provide a scientific foundation for assisted breeding, and offer methodological references for advancing DUS testing. The main contributions of this study are summarized as follows:</p><p id="p0045">A high-throughput pipeline was developed for lettuce leaf phenotypic trait extraction, enabling automatic segmentation of multi-component leaf structures and automated extraction of phenotypic traits. This pipeline provides technical support and a feasible approach for the efficient acquisition and standardized expression of large-scale and diverse lettuce phenotypic information.</p><p id="p0050">A high-precision quantification method for lettuce leaf DUS test traits based on UPOV guidelines was proposed, comprehensively quantifying key traits such as leaf shape, leaf tip shape, leaf margin shape, leaf vein shape, color hue, color brightness, and anthocyanin coloration. This method offers a reliable basis for the objective, consistent, and efficient evaluation of DUS test traits.</p><p id="p0055">A new paradigm for phenotypic fingerprint construction was introduced, integrating phenotypic traits to generate interpretable phenotypic ID that enable the identification of different lettuce subpopulations. This provides a novel form of representation and theoretical foundation for phenotypic analysis, variety identification, and precise classification.</p></sec><sec id="sec2"><label>2</label><title>Materials and methods</title><sec id="sec2.1"><label>2.1</label><title>Experimental materials</title><p id="p0060">A total of 237 lettuce varieties were cultivated in the greenhouse of the Beijing Academy of Agriculture and Forestry Sciences (BAAFS, 39.9438°N, 116.2876°E) between March 5 and May 11, 2023. Each variety was represented by three biological replicates. The plant materials covered seven subgroups: Butter (B), Crisphead (C), Leaf (L), Oakleaf (O), Romaine (R), Stem (S), and Wild relatives (W). All plants were grown under standardized greenhouse management to minimize environmental variation, including uniform irrigation, fertilization, and temperature regimes. At the mature stage, the most fully expanded and structurally representative leaf from each plant was selected for imaging, ensuring comparability of morphological features across subgroups. The lettuce planting scene is shown in <xref rid="fig1" ref-type="fig">Fig. 1</xref>a.<fig id="fig1" position="float" orientation="portrait"><label>Fig. 1</label><caption><p>Experimental design and material acquisition. (a) Lettuce planting scene. (b) Image data acquisition platform.</p></caption><alt-text id="alttext0015">Fig. 1</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr1.jpg"><?image-name gr1.jpg?><?image-size 312734?><?image-md5 40d9f6f686066a4dd3df5c358e8feade?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 998?><?image-original-width 2370?><?image-scaled-height 333?><?image-scaled-width 790?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/40d9f6f68606/gr1.jpg?><?thumb-name gr1.gif?><?thumb-size 79838?><?thumb-md5 e932cb3b6c1b33c75d6544ad8fa50558?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 189?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/e932cb3b6c1b/gr1.gif?></graphic></fig></p></sec><sec id="sec2.2"><label>2.2</label><title>Image data acquisition and pre-processing</title><p id="p0065">Image collection was carried out in a domestically manufactured standard light-source color assessment cabinet positioned adjacent to the greenhouse. The data acquisition platform is shown in <xref rid="fig1" ref-type="fig">Fig. 1</xref>b. A digital camera (77D, Canon Inc., Tokyo, Japan) was mounted on a stable tripod and equipped with a Canon EF-S 18–135 mm f/3.5–5.6 IS USM lens (focal length range 18–135 mm). A D65 international standard artificial daylight source (color temperature 6500 K, 18 W) was installed at the top of the cabinet to provide stable and uniform illumination, ensuring consistent lighting conditions across all samples and minimizing shadows and surface glare. All images were captured using fixed exposure parameters (ISO 100, shutter speed 1/125 s, aperture f/8) and a custom white-balance preset, with a resolution of 5328 × 4000 pixels. A Datacolor Spyder Checkr Photo Mini color calibration card was placed beside each leaf during imaging to facilitate color correction.</p><p id="p0070">A total of 709 high-resolution leaf images were collected. The raw images were then processed through a standardized preprocessing workflow. First, to ensure accurate and comparable color-related trait measurements, color calibration was performed using Adobe Lightroom and the SpyderCheckr color profile. Although illumination conditions were strictly controlled, calibration was still required to correct for subtle chromatic deviations introduced by camera sensor characteristics, exposure metering adjustments, or long-term spectral drift. After color correction, each image was cropped to a fixed size of 2500 × 2500 pixels to remove redundant background and maintain consistent spatial dimensions across samples. The resulting images were used as the basis for multi-component semantic segmentation and subsequent phenotypic trait extraction of lettuce leaves.</p></sec><sec id="sec2.3"><label>2.3</label><title>Data annotation and enhancement</title><p id="p0075">Pixel-level annotation was performed to generate ground-truth masks for the leaf multi-component semantic segmentation task. Manual annotation was conducted using LabelMe (v5.5.0), and three leaf components mesophyll, main vein, and lateral vein were delineated along with the background class. All labels were produced by trained annotators with experience in leaf morphology. Considering the fine-scale structural complexity of lateral veins, a subset of 102 representative images capturing the morphological diversity of the 237 varieties was selected for annotation. Consistency and standardization of the annotations were ensured through a unified annotation protocol that specified boundary definitions, delineation rules, and labeling criteria for all target components, thereby maintaining stable annotation quality across the dataset. To enhance model generalization and reduce overfitting, a comprehensive data augmentation strategy was applied to the annotated samples. The augmentation operations included rotation (±15°), horizontal and vertical flipping, scaling, translation, brightness jittering (±8%), and slight Gaussian blurring. After augmentation, the annotated dataset expanded to 1122 samples, providing a richer and more diverse dataset for model training.</p><p id="p0080">To this end, we developed a high-throughput phenotyping pipeline for lettuce leaves. This integrated workflow provides a robust framework for large-scale phenotypic analysis, enabling automated identification and quantitative evaluation of multiple semantic components. The overall processing steps, including image acquisition, preprocessing, annotation, semantic segmentation, and phenotypic trait extraction, are summarized in <xref rid="fig2" ref-type="fig">Fig. 2</xref>.<fig id="fig2" position="float" orientation="portrait"><label>Fig. 2</label><caption><p>The flow chart of the phenotyping pipeline for lettuce leaves.</p></caption><alt-text id="alttext0020">Fig. 2</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr2.jpg"><?image-name gr2.jpg?><?image-size 338076?><?image-md5 1c36a8d4f14c998a0a24b985bba07be3?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 1721?><?image-original-width 3590?><?image-scaled-height 382?><?image-scaled-width 797?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/1c36a8d4f14c/gr2.jpg?><?thumb-name gr2.gif?><?thumb-size 77295?><?thumb-md5 d157eebaf787e8a252928b227e703598?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 166?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/d157eebaf787/gr2.gif?></graphic></fig></p></sec><sec id="sec2.4"><label>2.4</label><title>Semantic segmentation model</title><p id="p0085">Accurate semantic segmentation of lettuce leaves faces unique challenges due to their complex morphological structure. The leaf contains broad mesophyll regions, dense hierarchical venation networks, and serrated or undulating margins. Lateral veins, in particular, form fine and irregular texture patterns that require precise boundary localization and robust multi-scale feature representation. The large variation in target size and the diversity of image content remain major bottlenecks for existing segmentation algorithms. Although many mainstream methods incorporate multi-branch architectures or multi-scale feature extraction, both strategies present limitations. Multi-branch designs may improve accuracy but significantly increase model parameters and computational cost, limiting their suitability for lightweight applications. Multi-scale schemes enhance cross-resolution feature aggregation, yet often fail to capture subtle micro-structural details such as delicate vein patterns, when relying on a single scaling strategy. These shortcomings can lead to incomplete venation delineation and blurred leaf margins, ultimately affecting the reliability of downstream phenotypic trait extraction.</p><p id="p0090">To address these challenges, we developed LGASSNet, a Lightweight Group Attention semantic segmentation network designed for multi-component lettuce leaf analysis. The network employs Lightweight Group Attention Network (LWGANet) [<xref rid="bib33" ref-type="bibr">33</xref>] as its backbone to extract hierarchical feature representations. Shallow layers focus on local surface textures and fine venation details, enabling accurate delineation of lateral veins and serrated margins, whereas deeper layers capture the global morphological structure of the leaf. In the neck network, deep features are further refined through a Dilated Convolution (DC) blocks combined with skip connections. The DC blocks enlarges the receptive field while preserving spatial resolution, and the skip connections integrate features from all backbone stages, enhancing information flow and maintaining structural consistency across scales. Subsequently, the Efficient Multi-Scale Attention (EMA) [<xref rid="bib34" ref-type="bibr">34</xref>] mechanism enhances contextual perception and strengthens the representation of intricate leaf structures. The fused multi-scale features are then restored to the original resolution through bilinear upsampling, after which the classification head generates pixel-level predictions for each leaf component. The overall architecture of LGASSNet is illustrated in <xref rid="fig3" ref-type="fig">Fig. 3</xref>.<fig id="fig3" position="float" orientation="portrait"><label>Fig. 3</label><caption><p>Architecture of LGASSNet model.</p></caption><alt-text id="alttext0025">Fig. 3</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr3.jpg"><?image-name gr3.jpg?><?image-size 336307?><?image-md5 b1e5a0d53067d29d1a13d47706b4b94d?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 1764?><?image-original-width 2370?><?image-scaled-height 588?><?image-scaled-width 790?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/b1e5a0d53067/gr3.jpg?><?thumb-name gr3.gif?><?thumb-size 75073?><?thumb-md5 678914fe69893740c4f54eb1e2a7d7db?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 107?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/678914fe6989/gr3.gif?></graphic></fig></p><sec id="sec2.4.1"><label>2.4.1</label><title>Backbone netork</title><p id="p0095">The backbone of LGASSNet is built upon LWGANet [<xref rid="bib33" ref-type="bibr">33</xref>], a lightweight architecture designed to balance multi-scale feature extraction with computational efficiency. It consists of four stages, where the spatial resolution is progressively reduced to 1/4, 1/8, 1/16, and 1/32 of the input size. Each stage contains an LWGA Blocks that divides the input feature X into four equal sub-feature maps {X<sub>1</sub>, X<sub>2</sub>, X<sub>3</sub>, X<sub>4</sub>}, which are processed by the GPA, RLA, SMA, and SGA attention modules [<xref rid="bib33" ref-type="bibr">33</xref>], respectively. Through this grouped attention mechanism, the backbone can simultaneously capture fine-grained leaf textures, medium-scale venation structures, and long-range structural dependencies.</p><p id="p0100">The GPA (gate point attention) [<xref rid="bib33" ref-type="bibr">33</xref>] module is designed to process the input feature X<sub>1</sub>. Its primary goal is to capture fine-grained local features and enhance detail information in tiny structures. After channel transformation, BN, and ReLU activation, the feature representation is strengthened. A sigmoid activation function is then applied to generate the attention map, which is combined with the input through a residual connection to produce the output feature R<sub>1</sub>.</p><p id="p0105">The RLA (regular local attention) [<xref rid="bib33" ref-type="bibr">33</xref>] module processes the input feature X<sub>2</sub>. It focuses on extracting information efficiently from local regions. Standard convolution, followed by BN and ReLU activation, is applied to enhance the representation of local features. output feature R<sub>2</sub>.</p><p id="p0110">The SMA (sparse medium-range attention) [<xref rid="bib33" ref-type="bibr">33</xref>] module is applied to the input feature X<sub>3</sub>. It captures medium-range contextual information and is well-suited for extracting large and irregular features. The module first applies the TGFI [<xref rid="bib33" ref-type="bibr">33</xref>] downsampling operation to obtain a reduced feature map. Based on this map, a sparse attention map is constructed and then upsampled through positional interpolation to restore the original spatial resolution. The final attention map is multiplied element-wise with X<sub>3</sub> to produce the output feature R<sub>3</sub>.</p><p id="p0115">The SGA (spare global attention) module [<xref rid="bib33" ref-type="bibr">33</xref>] processes the input feature X<sub>4</sub>, aiming to capture long-range contextual information across the entire image. To maintain computational efficiency, the module adopts stage-specific processing strategies. In the first and second stages, where feature maps have large spatial dimensions, SGA employs a sparse global attention strategy. The TGFI module first downsamples X<sub>4</sub> to obtain a reduced representation X<sub>4</sub>′. Standard convolution is then used to extract intermediate features, and dilated convolution is applied to generate a sparse global attention map. After element-wise multiplication, the result is upsampled using preserved coordinate information and combined with the original input through residual addition and BN normalization to form the output R<sub>4</sub>. In the third and fourth stages, the spatial resolution is much smaller, making full global processing unnecessary. Thus, SGA switches to a lightweight visual attention strategy, generating attention maps directly on the original feature map. These maps are multiplied element-wise with X<sub>4</sub> and fused through residual connections to produce the final output feature R<sub>4</sub>.</p><p id="p0120">To integrate the multi-scale information captured by the four attention branches, their output features are concatenated along the channel dimension to form the fused feature map. This fused representation then undergoes channel transformation, BN and ReLU to enhance feature expressiveness. Finally, a residual connection with the input X produces the output of the LWGA Blocks.</p><p id="p0125">In the downsampling stages, the DRFD module [<xref rid="bib35" ref-type="bibr">35</xref>] is introduced, which integrates three complementary strategies convolutional downsampling (ConD), cut-slice downsampling (CutD), and maxpooling downsampling (MaxD) [<xref rid="bib35" ref-type="bibr">35</xref>]. This multi-path fusion preserves richer semantic and structural information while reducing computational complexity, thereby enhancing multi-scale feature learning and improving the extraction of key leaf components.</p></sec><sec id="sec2.4.2"><label>2.4.2</label><title>Neck network</title><p id="p0130">The neck network of LGASSNet refines the deep features generated by the backbone through a combination of DC Blocks and progressive stage-wise skip connections. The high-level features from stage 4 are first processed by a DC blocks, enabling the network to capture information from a larger receptive field while preserving spatial resolution. The resulting feature map is then upsampled and fused with the feature map from stage 3. This fused representation is further refined through another DC blocks, upsampled again, and sequentially merged with the feature maps from stage 2 and stage 1. Through this progressive fusion strategy, multi-scale information is continuously propagated and enhanced across hierarchical stages. Following the DC-based multi-stage refinement, an EMA [<xref rid="bib34" ref-type="bibr">34</xref>] mechanism is applied. EMA uses parallel multi-scale convolutional paths and cross-space feature fusion to generate pixel-level attention maps that emphasize structurally informative regions such as lateral veins and serrated leaf margins. The resulting output of the neck network provides rich multi-scale feature representations for subsequent segmentation tasks.</p></sec><sec id="sec2.4.3"><label>2.4.3</label><title>Loss function</title><p id="p0135">In the multi-component segmentation of lettuce leaves, the vein regions are fine-grained and occupy only a small proportion of the image, which easily leads to class imbalance during training. To alleviate this issue, Focal Loss is employed to reduce the dominance of easily classified pixels and encourage the model to focus on hard-to-segment structures such as lateral veins. The Focal Loss is formulated as:<disp-formula id="fd1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" display="block" altimg="si1.svg" alttext="Equation 1."><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mrow><mml:mi>F</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:mo linebreak="goodbreak">−</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mi>γ</mml:mi></mml:msup><mml:mspace width="0.25em"/><mml:mi mathvariant="italic">log</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" altimg="si2.svg"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the predicted probability, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" altimg="si3.svg"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the class-balancing factor, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" altimg="si4.svg"><mml:mrow><mml:mi>γ</mml:mi></mml:mrow></mml:math></inline-formula> is the focusing parameter (set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" altimg="si5.svg"><mml:mrow><mml:mi>γ</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math></inline-formula> in this study).</p><p id="p0140">To further preserve structural completeness and reduce boundary blurring, Dice Loss is introduced to emphasize region-level overlap between the predictions and ground truth:<disp-formula id="fd2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" display="block" altimg="si6.svg" alttext="Equation 2."><mml:mrow><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn><mml:mo linebreak="goodbreak">−</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>∑</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>∑</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">+</mml:mo><mml:mo>∑</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7" altimg="si7.svg"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8" altimg="si8.svg"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represent the ground truth and predicted values, respectively.</p><p id="p0145">The final optimization objective is a weighted combination of the two losses:<disp-formula id="fd3"><label>(3)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M9" display="block" altimg="si9.svg" alttext="Equation 3."><mml:mrow><mml:mi mathvariant="script">L</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:msub><mml:mi>λ</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mrow><mml:mi>F</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="goodbreak">+</mml:mo><mml:msub><mml:mi>λ</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mi mathvariant="script">L</mml:mi><mml:mrow><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10" altimg="si10.svg"><mml:mrow><mml:msub><mml:mi>λ</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M11" altimg="si11.svg"><mml:mrow><mml:msub><mml:mi>λ</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> both set to 1 in this study. This joint loss encourages balanced learning across components while improving the segmentation accuracy of fine venation structures.</p></sec></sec><sec id="sec2.5"><label>2.5</label><title>Phenotypic traits analysis</title><p id="p0150">Based on the semantic segmentation results, phenotypic traits of lettuce leaves were automatically extracted from multiple dimensions, including shape, color, and texture. Lettuce leaves contain both size-related and size-free traits. To eliminate the influence of leaf size variation and improve the consistency of phenotypic analysis, we adopted the normalization approach proposed by Du et al. [<xref rid="bib23" ref-type="bibr">23</xref>]. This method standardizes leaf geometry through rotation and scaling, enabling the generation of comparable “size-free” representations across different varieties. Following normalization, each leaf image was represented at a resolution of 1080 × 1080 pixels to balance analytical precision and computational efficiency. The extracted phenotypic traits and their definitions are summarized in <xref rid="appsec1" ref-type="sec">Table S1</xref>, which encompasses leaf shape, color characteristics, and texture features.</p><sec id="sec2.5.1"><label>2.5.1</label><title>Shape traits analysis</title><sec id="sec2.5.1.1"><label>2.5.1.1</label><title>Multiscale triangle descriptor</title><p id="p0155">The multiscale triangle descriptor (MTD) is a shape descriptor based on leaf contours. It is designed to capture geometric characteristics of leaves, such as curvature, symmetry, and local shape variation, while ensuring invariance to translation, rotation, and scale [<xref rid="bib36" ref-type="bibr">36</xref>]. First, multiscale triangles are constructed based on the segmented leaf contours. The outermost contour is extracted and uniformly sampled into N points, resulting in a point sequence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12" altimg="si12.svg"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mrow><mml:mo stretchy="true">{</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="true">}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. The number of scales is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M13" altimg="si13.svg"><mml:mrow><mml:msub><mml:mi mathvariant="normal">T</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">=</mml:mo><mml:mo>⌊</mml:mo><mml:msub><mml:mi>log</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo linebreak="badbreak">/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>⌋</mml:mo></mml:mrow></mml:math></inline-formula>. At each scale <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M14" altimg="si14.svg"><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math></inline-formula>, the sampling interval is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M15" altimg="si15.svg"><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>k</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>. For each point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M16" altimg="si16.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, a triangle is formed with its two neighboring points <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M17" altimg="si17.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>−</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M18" altimg="si18.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. The signed triangle area (TSA) at scale <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M19" altimg="si14.svg"><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math></inline-formula> is calculated as:<disp-formula id="fd4"><label>(4)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M20" display="block" altimg="si19.svg" alttext="Equation 4."><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mtd><mml:mtd><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula></p><p id="p0160">The degree of bend at point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M21" altimg="si16.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M22" altimg="si20.svg"><mml:mrow><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="true">|</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:math></inline-formula> and the convex or concave is represented by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M23" altimg="si21.svg"><mml:mrow><mml:msub><mml:mi>β</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mi>s</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p><p id="p0165">Next, the center distance of the triangle is computed as:<disp-formula id="fd5"><label>(5)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M24" display="block" altimg="si22.svg" alttext="Equation 5."><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo linebreak="badbreak">+</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M25" altimg="si23.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> is the centroid of the triangle:<disp-formula id="fd6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M26" display="block" altimg="si24.svg" alttext="Equation 6."><mml:mrow><mml:mo stretchy="true">{</mml:mo><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo linebreak="badbreak">+</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">+</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">/</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mo linebreak="badbreak">+</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">+</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">/</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula></p><p id="p0170">Each point is then described by a triangle feature vector <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M27" altimg="si25.svg"><mml:mrow><mml:mtext>MTD</mml:mtext><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mrow><mml:mo stretchy="true">{</mml:mo><mml:mrow><mml:mi>α</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>β</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>γ</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="true">}</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. The full multiscale triangle descriptor for the leaf contour is:<disp-formula id="fd7"><label>(7)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M28" display="block" altimg="si26.svg" alttext="Equation 7."><mml:mi>M</mml:mi><mml:mi>T</mml:mi><mml:mi>D</mml:mi><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:msup><mml:mfenced><mml:mrow><mml:mi>M</mml:mi><mml:mi>T</mml:mi><mml:mi>D</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mfenced><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>M</mml:mi><mml:mi>T</mml:mi><mml:mi>D</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mfenced></mml:mrow></mml:mfenced><mml:mi>T</mml:mi></mml:msup><mml:mspace linebreak="newline"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mspace width="0.25em"/><mml:mo>=</mml:mo><mml:mfenced><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mi>α</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mfenced></mml:mtd><mml:mtd><mml:mi>β</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mfenced></mml:mtd><mml:mtd><mml:mi>γ</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mfenced></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>⋮</mml:mo></mml:mtd><mml:mtd><mml:mo>⋱</mml:mo></mml:mtd><mml:mtd><mml:mo>⋮</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>α</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mfenced></mml:mtd><mml:mtd><mml:mi>β</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mfenced></mml:mtd><mml:mtd><mml:mi>γ</mml:mi><mml:mfenced><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mspace linebreak="newline"/><mml:mspace width="0.25em"/><mml:mo>=</mml:mo><mml:mfenced><mml:mrow><mml:mi>α</mml:mi><mml:mo>,</mml:mo><mml:mi>β</mml:mi><mml:mo>,</mml:mo><mml:mi>γ</mml:mi></mml:mrow></mml:mfenced></mml:math></disp-formula></p><p id="p0175">To ensure scale invariance, the local normalization of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M29" altimg="si27.svg"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M30" altimg="si28.svg"><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> [<xref rid="bib37" ref-type="bibr">37</xref>]:<disp-formula id="fd8"><label>(8)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M31" display="block" altimg="si29.svg" alttext="Equation 8."><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mi mathvariant="italic">max</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula><disp-formula id="fd9"><label>(9)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M32" display="block" altimg="si30.svg" alttext="Equation 9."><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mi mathvariant="italic">max</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula></p><p id="p0180">To eliminate variations due to different starting points, a discrete Fourier transform (DFT) is applied to the sequences of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M33" altimg="si31.svg"><mml:mrow><mml:mi>α</mml:mi><mml:mo>,</mml:mo><mml:mi>β</mml:mi><mml:mo>,</mml:mo><mml:mi>γ</mml:mi></mml:mrow></mml:math></inline-formula> at each scale. Only the first M low-frequency components are retained to reduce noise and enhance rotation invariance. The final MTD is defined as:<disp-formula id="fd10"><label>(10)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M34" display="block" altimg="si32.svg" alttext="Equation 10."><mml:mtext>MTD</mml:mtext><mml:mfenced><mml:mi>S</mml:mi></mml:mfenced><mml:mo>=</mml:mo><mml:mfenced open="{" close="}"><mml:mrow><mml:mfenced><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mfenced><mml:mi>v</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:msub><mml:mi>β</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mfenced><mml:mi>v</mml:mi></mml:mfenced><mml:mo>,</mml:mo><mml:msub><mml:mi>γ</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mfenced><mml:mi>v</mml:mi></mml:mfenced></mml:mrow></mml:mfenced><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo></mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:mfenced><mml:mspace linebreak="newline"/><mml:mspace width="0.25em"/><mml:mo>=</mml:mo><mml:mfenced><mml:mrow><mml:msup><mml:mi>α</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>β</mml:mi><mml:mo>'</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>γ</mml:mi><mml:mo>'</mml:mo></mml:msup></mml:mrow></mml:mfenced></mml:math></disp-formula></p></sec><sec id="sec2.5.1.2"><label>2.5.1.2</label><title>Leaf shape estimation</title><p id="p0185">Leaf shape is a critical trait that directly reflects photosynthetic efficiency and water management capabilities. However, the diverse morphologies and varying sizes of lettuce leaves present challenges for quantitative extraction. To address this, we propose a radial distance-based method that assumes an ideal lettuce leaf shape to be circular, where the Euclidean distances from the leaf center to its boundary points are approximately equal. Specifically, the leaf is divided into <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M35" altimg="si33.svg"><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula> equal segments <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M36" altimg="si34.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>8</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula>, and the euclidean distances from the leaf center to each segmentation point are computed. These distances are then used to quantify the degree of similarity between the actual leaf shape and the ideal circular form. The detailed steps of this method are as follows:</p><p id="p0190">First, we perform a circular check. Based on the concept of leaf-class, we calculate the ratio of leaf length to leaf width, denoted as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M37" altimg="si35.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mi>L</mml:mi><mml:mi>L</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">/</mml:mo><mml:mi>L</mml:mi><mml:mi>W</mml:mi></mml:mrow></mml:math></inline-formula>. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M38" altimg="si36.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1.2</mml:mn></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>, the center point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M39" altimg="si37.svg"><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:math></inline-formula> of the leaf is located, and the radial distance <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M40" altimg="si38.svg"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are calculated by measuring the distance from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M41" altimg="si37.svg"><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:math></inline-formula> to various segmentation points <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M42" altimg="si16.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> along the leaf's edge. The resulting radial distances are as follows:<disp-formula id="fd11"><label>(11)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M43" display="block" altimg="si39.svg" alttext="Equation 11."><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo linebreak="badbreak">+</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M44" altimg="si40.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the coordinates of the leaf center <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M45" altimg="si37.svg"><mml:mrow><mml:mi>O</mml:mi></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M46" altimg="si41.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> represents the coordinates of the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M47" altimg="si42.svg"><mml:mrow><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> segmentation point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M48" altimg="si16.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M49" altimg="si43.svg"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the Euclidean distance from the leaf center to the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M50" altimg="si44.svg"><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">−</mml:mo><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> segmentation point. The standard deviation of the radial distance <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M51" altimg="si45.svg"><mml:mrow><mml:msub><mml:mi>σ</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, is then calculated to quantify the leaf's approximation to a circular shape, as given by the following equation:<disp-formula id="fd12"><label>(12)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M52" display="block" altimg="si46.svg" alttext="Equation 12."><mml:mrow><mml:msub><mml:mi>σ</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo>¯</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt></mml:mrow></mml:math></disp-formula><disp-formula id="fd13"><label>(13)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M53" display="block" altimg="si47.svg" alttext="Equation 13."><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo>¯</mml:mo></mml:mover><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M54" altimg="si48.svg"><mml:mrow><mml:mover accent="true"><mml:mi>d</mml:mi><mml:mo>¯</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> represents the mean value of the radial distances. The closer the value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M55" altimg="si45.svg"><mml:mrow><mml:msub><mml:mi>σ</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is to 1, the more circular the shape of the leaf. Based on the thresholds, leaves are classified as follows: narrow oblate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M56" altimg="si49.svg"><mml:mrow><mml:msub><mml:mi>σ</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>0.8</mml:mn></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>, circular <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M57" altimg="si50.svg"><mml:mrow><mml:mrow><mml:msub><mml:mi>σ</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo linebreak="badbreak">∈</mml:mo><mml:mo stretchy="true">[</mml:mo><mml:mrow><mml:mn>0.8</mml:mn><mml:mo>,</mml:mo><mml:mn>1.5</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> and medium oblate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M58" altimg="si51.svg"><mml:mrow><mml:mrow><mml:msub><mml:mi>σ</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo linebreak="badbreak">∈</mml:mo><mml:mo stretchy="true">[</mml:mo><mml:mrow><mml:mn>1.5</mml:mn><mml:mo>,</mml:mo><mml:mo linebreak="badbreak">+</mml:mo></mml:mrow><mml:mi>∞</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p><p id="p0195">Next, the elliptic shape is assessed. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M59" altimg="si52.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1.2</mml:mn><mml:mo>,</mml:mo><mml:mn>3.0</mml:mn></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>, the classification is based on the following thresholds: broad elliptic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M60" altimg="si53.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1.2</mml:mn><mml:mo>,</mml:mo><mml:mn>1.8</mml:mn></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>, medium elliptic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M61" altimg="si54.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1.8</mml:mn><mml:mo>,</mml:mo><mml:mn>2.4</mml:mn></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>, narrow elliptic <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M62" altimg="si55.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>2.4</mml:mn><mml:mo>,</mml:mo><mml:mn>3.0</mml:mn></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>.</p><p id="p0200">Thirdly, the linear and lanceolate are assessed. If <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M63" altimg="si56.svg"><mml:mrow><mml:mtext>LWr</mml:mtext><mml:mo linebreak="goodbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>3.0</mml:mn><mml:mo>,</mml:mo><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>∞</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, the leaf apex and the 50th points on both the left and right sides are selected to form the pinch angle. The pinch angle <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M64" altimg="si57.svg"><mml:mrow><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula> is then calculated. Based on the thresholds, lanceolate is classified for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M65" altimg="si58.svg"><mml:mrow><mml:mi>θ</mml:mi><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>90</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>, and linear for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M66" altimg="si59.svg"><mml:mrow><mml:mi>θ</mml:mi><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>90</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>180</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula>.</p><p id="p0205">Additionally, at each step, broad obtrullate and triangular classifications were made based on the side relationship theorem. Finally, leaf shapes were categorized as narrow oblate, circular, medium oblate, broad elliptic, medium elliptic, narrow elliptic, linear, lanceolate, broad obtrullate and triangular, following the UPOV guidelines.</p></sec><sec id="sec2.5.1.3"><label>2.5.1.3</label><title>Leaf tip shape estimation</title><p id="p0210">The leaf tip shape primarily refers to the morphological characteristics of the leaf's apex, which reflect the plant's growing environment and physiological state. It is also a crucial trait for plant classification. To analyze the leaf tip shape, the top 1/5 portion of the leaf is extracted as the region of interest. The concave and convex contour angles are then calculated by approximating the polygonal contour. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M67" altimg="si60.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denote the coordinates of the tip of the leaf, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M68" altimg="si61.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represent the coordinates of the 50th point adjacent to the left, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M69" altimg="si62.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denote the coordinates of the 50th point adjacent to the right. The pinch angle <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M70" altimg="si57.svg"><mml:mrow><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula> is computed using the following equation:<disp-formula id="fd14"><label>(14)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M71" display="block" altimg="si63.svg" alttext="Equation 14."><mml:mrow><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:mi>θ</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mi>α</mml:mi><mml:mspace width="0.25em"/><mml:mi mathvariant="italic">tan</mml:mi><mml:mspace width="0.25em"/><mml:mn>2</mml:mn><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">−</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mtext>,</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">+</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>l</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo stretchy="true">)</mml:mo><mml:mo linebreak="badbreak">·</mml:mo><mml:mfrac><mml:mn>180</mml:mn><mml:mi>π</mml:mi></mml:mfrac></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M72" altimg="si64.svg"><mml:mrow><mml:mi>θ</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">[</mml:mo><mml:mrow><mml:mo>−</mml:mo><mml:mn>180</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>180</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. To more intuitively represent the degree of concavity and convexity of the leaf, the angle is converted to the range <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M73" altimg="si65.svg"><mml:mrow><mml:mo stretchy="true">[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>360</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo></mml:mrow></mml:math></inline-formula> using the following formula:<disp-formula id="fd15"><label>(15)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M74" display="block" altimg="si66.svg" alttext="Equation 15."><mml:mrow><mml:msub><mml:mi>θ</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>j</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>θ</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mn>360</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mspace width="0.25em"/><mml:mi mathvariant="italic">mod</mml:mi><mml:mspace width="0.25em"/><mml:mn>360</mml:mn></mml:mrow></mml:math></disp-formula></p><p id="p0215">Leaf tip shapes are classified into acute <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M75" altimg="si67.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>j</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>120</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, obtuse <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M76" altimg="si68.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>j</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>120</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>150</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, rounded <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M77" altimg="si69.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>j</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>150</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>200</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and obcordate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M78" altimg="si70.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>θ</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>j</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>200</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>360</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> based on angular differences.</p></sec><sec id="sec2.5.1.4"><label>2.5.1.4</label><title>Leaf margin shape estimation</title><p id="p0220">Leaf margins reflect a plant's ability to adapt to wind, light, or arid environments. First, we extracted the edge contour coordinate points and applied an interval sampling method to calculate the angles between neighboring points (i.e., the 10th coordinate point on the left and right) cyclically, as described in Eqs. <xref rid="fd14" ref-type="disp-formula">(14)</xref>, <xref rid="fd15" ref-type="disp-formula">(15)</xref>. Using the flat angle as the critical for division, if the angle is less than 180°, the margin is concave, with greater distances indicating a more intense concavity. Conversely, if the angle exceeds 180°, the margin is convex, with larger distances signifying more pronounced convexity. Based on the degree of intensity (with 15° as the classification threshold in the experiment) and the proportion of the leaf margins, the leaf margins were classified as crenate, dentate, bidentate, and tridentate.</p></sec><sec id="sec2.5.1.5"><label>2.5.1.5</label><title>Leaf veins shape estimation</title><p id="p0225">Leaf vein distribution reflects the physiological health of lettuce. It not only supports plant growth and nutrient transport but also provides valuable insights into nutritional status and environmental adaptation. The complex structure of leaf veins in mature plants presents challenges for accurate extraction. Moreover, determining the angles between leaf veins is a significant difficulty. The Hough line Transform is a widely used method for detecting straight lines in images. It is particularly effective for detecting leaf vein lines and can efficiently extract and analyze the angular information of these veins. The principle of angle extraction is based on the polar coordinate representation of a straight line. In a Cartesian coordinate system, the equation of a straight line is given by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M79" altimg="si71.svg"><mml:mrow><mml:mi>y</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mi mathvariant="normal">k</mml:mi><mml:mi>x</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M80" altimg="si72.svg"><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:math></inline-formula> represents the slope and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M81" altimg="si73.svg"><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M82" altimg="si74.svg"><mml:mrow><mml:mi mathvariant="normal">y</mml:mi></mml:mrow></mml:math></inline-formula>-intercept. To apply the Hough Transform, we convert this equation to its polar form: <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M83" altimg="si75.svg"><mml:mrow><mml:mi mathvariant="normal">ρ</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mi>x</mml:mi><mml:mspace width="0.25em"/><mml:mi>cos</mml:mi><mml:mspace width="0.25em"/><mml:mi>θ</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>y</mml:mi><mml:mspace width="0.25em"/><mml:mi>sin</mml:mi><mml:mspace width="0.25em"/><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M84" altimg="si76.svg"><mml:mrow><mml:mi mathvariant="normal">ρ</mml:mi></mml:mrow></mml:math></inline-formula> is the distance from the origin to the line, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M85" altimg="si57.svg"><mml:mrow><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula> is the angle of the line's normal. For each point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M86" altimg="si77.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> in the image, we can compute all possible combinations of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M87" altimg="si76.svg"><mml:mrow><mml:mi mathvariant="normal">ρ</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M88" altimg="si57.svg"><mml:mrow><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula> based on the above polar equation. This allows each point in the image to be mapped to a series of linear parameters in polar coordinate space.</p><p id="p0230">The steps are as follows: First, for each edge point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M89" altimg="si77.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula>, different values of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M90" altimg="si57.svg"><mml:mrow><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula> are selected to compute the corresponding <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M91" altimg="si75.svg"><mml:mrow><mml:mi mathvariant="normal">ρ</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">=</mml:mo><mml:mi>x</mml:mi><mml:mspace width="0.25em"/><mml:mi>cos</mml:mi><mml:mspace width="0.25em"/><mml:mi>θ</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>y</mml:mi><mml:mspace width="0.25em"/><mml:mi>sin</mml:mi><mml:mspace width="0.25em"/><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula>. Then, the number of votes for each pair <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M92" altimg="si78.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">ρ</mml:mi><mml:mo>,</mml:mo><mml:mi>θ</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> in the parameter space <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M93" altimg="si78.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">ρ</mml:mi><mml:mo>,</mml:mo><mml:mi>θ</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula> is recorded. The angle <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M94" altimg="si57.svg"><mml:mrow><mml:mi>θ</mml:mi></mml:mrow></mml:math></inline-formula> corresponding to the maximum vote is used to determine the angular <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M95" altimg="si79.svg"><mml:mrow><mml:mi mathvariant="normal">α</mml:mi></mml:mrow></mml:math></inline-formula>-transformation of a straight line, as shown in Eq. <xref rid="fd16" ref-type="disp-formula">(16)</xref>. Finally, by performing mean normalization, the leaf vein shapes are classified into the following categories based on threshold values: flabellate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M96" altimg="si80.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mn>0</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>100</mml:mn><mml:mo>°</mml:mo><mml:mo stretchy="true">]</mml:mo><mml:mo>&amp;</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>90</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, semi_flabellate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M97" altimg="si81.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mo stretchy="true">(</mml:mo><mml:mn>0</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>100</mml:mn><mml:mo>°</mml:mo><mml:mo stretchy="true">]</mml:mo><mml:mo>&amp;</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak" linebreakstyle="after">∈</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>90</mml:mn><mml:mo>°</mml:mo><mml:mo>,</mml:mo><mml:mn>100</mml:mn><mml:mo>°</mml:mo></mml:mrow><mml:mo stretchy="true">]</mml:mo><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and not_flabellate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M98" altimg="si82.svg"><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula>. Here, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M99" altimg="si83.svg"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the leaf vein shape standard deviation (LVSs), and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M100" altimg="si84.svg"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the leaf vein shape mean (LVSm).<disp-formula id="fd16"><label>(16)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M101" display="block" altimg="si85.svg" alttext="Equation 16."><mml:mrow><mml:mi mathvariant="normal">α</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mi mathvariant="normal">θ</mml:mi><mml:mo linebreak="goodbreak">×</mml:mo><mml:mfrac><mml:mn>180</mml:mn><mml:mi>π</mml:mi></mml:mfrac></mml:mrow></mml:math></disp-formula></p></sec></sec><sec id="sec2.5.2"><label>2.5.2</label><title>Color traits analysis</title><p id="p0235">Leaf color directly reflects key physiological traits such as chlorophyll content, anthocyanin content, photosynthetic efficiency, and environmental adaptability. To more intuitively capture the hue and brightness of the leaf, the RGB image was converted to the HSV color space, where the H, S, and V components were averaged. Based on predefined threshold values, leaf color was categorized into yellowish green, green, and greyish green. Color brightness was classified into five levels: very dark, dark, medium, light, and very light. Additionally, the degree of anthocyanin pigmentation was assessed.</p></sec><sec id="sec2.5.3"><label>2.5.3</label><title>Texture traits analysis</title><p id="p0240">LBP-HF is a rotation-invariant texture descriptor designed to capture microstructural features of leaf surfaces, including veins, spots, and surface roughness [<xref rid="bib38" ref-type="bibr">38</xref>]. The method begins with the extraction of standard Local Binary Patterns (LBP) features. For each central pixel <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M102" altimg="si86.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, P neighboring pixels are sampled on a circular path with radius R, denoted as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M103" altimg="si87.svg"><mml:mrow><mml:msubsup><mml:mrow><mml:mo stretchy="true">{</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="true">}</mml:mo></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>. The LBP code for each pixel is calculated as follows:<disp-formula id="fd17"><label>(17)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M104" display="block" altimg="si88.svg" alttext="Equation 17."><mml:mrow><mml:msub><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">−</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>∗</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mi>P</mml:mi></mml:msup></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M105" altimg="si89.svg"><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the thresholding function:<disp-formula id="fd18"><label>(18)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M106" display="block" altimg="si90.svg" alttext="Equation 18."><mml:mrow><mml:mi>s</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mrow><mml:mo stretchy="true">{</mml:mo><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mspace width="0.25em"/><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="0.25em"/><mml:mi>u</mml:mi><mml:mo linebreak="badbreak">≥</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mspace width="0.25em"/><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="0.25em"/><mml:mi>u</mml:mi><mml:mo linebreak="badbreak">&lt;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:math></disp-formula></p><p id="p0245">When the LBP pattern exhibits at most two transitions between 0 and 1, it is classified as a uniform pattern. A histogram is then constructed by counting the occurrences of these uniform patterns, denoted as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M107" altimg="si91.svg"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>I</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>P</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M108" altimg="si33.svg"><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula> indexes the type of pattern and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M109" altimg="si92.svg"><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:math></inline-formula> refers to the radial location. To enhance rotation invariance, a DFT is applied along the histogram rows:<disp-formula id="fd19"><label>(19)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M110" display="block" altimg="si93.svg" alttext="Equation 19."><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:msub><mml:mi>h</mml:mi><mml:mi>I</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>P</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>−</mml:mo><mml:mi>i</mml:mi><mml:mn>2</mml:mn><mml:mi>π</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mo linebreak="badbreak">/</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></disp-formula></p><p id="p0250">The rotation-invariant LBP feature is then obtained by extracting the magnitude of the DFT coefficients <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M111" altimg="si94.svg"><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:math></inline-formula>. The final LBP-HF descriptor includes both the DFT-based frequency features and the original LBP histogram values. The complete feature vector is expressed as:<disp-formula id="fd20"><label>(20)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M112" display="block" altimg="si95.svg" alttext="Equation 20."><mml:mrow><mml:mtable columnalign="center"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mi>f</mml:mi><mml:mi>v</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mi>H</mml:mi><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:mo linebreak="badbreak">=</mml:mo><mml:mo>⌊</mml:mo><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow><mml:mtext>,</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>…</mml:mo><mml:mtext>,</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">−</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">|</mml:mo></mml:mrow><mml:mtext>,</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>⌋</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula></p></sec></sec><sec id="sec2.6"><label>2.6</label><title>Phenotypic fingerprint construction</title><p id="p0255">In recent years, phenotypic fingerprinting has emerged as a powerful complement to molecular marker technologies, demonstrating broad potential in crop variety identification, particularly in scenarios where molecular detection is unavailable [<xref rid="bib39" ref-type="bibr">[39]</xref>, <xref rid="bib40" ref-type="bibr">[40]</xref>, <xref rid="bib41" ref-type="bibr">[41]</xref>]. We propose a phenotypic fingerprinting framework based on leaf morphological traits, aiming to develop an efficient, robust, and highly discriminative method for lettuce variety identification. As illustrated in <xref rid="fig4" ref-type="fig">Fig. 4</xref>A, the method consists of four key steps: phenotypic data integration, data standardization, feature selection, and fingerprint construction and validation. First, phenotypic traits from multiple semantic components were integrated to establish a multidimensional comprehensive trait profile. The dataset was then standardized by calculating the mean and standard deviation of each trait, and outliers were removed using an improved Z-score method (with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M113" altimg="si96.svg"><mml:mrow><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mi>Z</mml:mi><mml:mo stretchy="true">|</mml:mo></mml:mrow><mml:mo linebreak="goodbreak" linebreakstyle="after">&gt;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math></inline-formula> as the threshold), enhancing data quality and robustness. To eliminate the influence of dimensional inconsistencies among traits, Min-Max normalization was applied, linearly mapping all values to the range [−1,1], thereby ensuring comparability across traits. PCA (Principal component analysis) was then employed to reduce data dimensionality and select representative traits. Based on the ranking of principal component eigenvalues and scree plot analysis, core traits that preserve the most phenotypic information while maximizing variety differentiation were selected to construct phenotypic fingerprints for each variety. Furthermore, we introduce a novel visualization approach for encoding these phenotypic ID, as shown in <xref rid="fig4" ref-type="fig">Fig. 4</xref>B. This method converts the normalized trait into unique vectors or heatmap coding sequence, preserving the biological significance of each trait while enhancing interpretability and usability in variety identification.<fig id="fig4" position="float" orientation="portrait"><label>Fig. 4</label><caption><p>Phenotypic fingerprint construction. (A) The flow chart of the phenotypic fingerprint construction. (B) Phenotypic ID code based on chinese identity number.</p></caption><alt-text id="alttext0030">Fig. 4</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr4.jpg"><?image-name gr4.jpg?><?image-size 743863?><?image-md5 bcb9a6a0302b899e9253880a1c900aba?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 3322?><?image-original-width 2369?><?image-scaled-height 1106?><?image-scaled-width 789?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/bcb9a6a0302b/gr4.jpg?><?thumb-name gr4.gif?><?thumb-size 78654?><?thumb-md5 679c44e88a05908a3b61305085da0d1c?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 139?><?thumb-scaled-width 99?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/679c44e88a05/gr4.gif?></graphic></fig></p></sec><sec id="sec2.7"><label>2.7</label><title>Subgroup variety identification</title><p id="p0260">Phenotypic ID features were used as input variables to develop classification models for subpopulation variety identification. Six machine learning algorithms were employed: Decision Tree (DT), K-Nearest Neighbors (KNN), Naive Bayes (NB), Random Forest (RF), Logistic Regression (LR), and Support Vector Machine (SVM). However, uncertainty arising from model structure and parameter settings may cause the predictions to poorly reflect the actual relationships between variables. To improve model automation and classification accuracy, we adopted Optuna [<xref rid="bib42" ref-type="bibr">42</xref>], a Bayesian optimization framework for hyperparameter tuning. Optuna optimizes model performance by maximizing validation accuracy and F1-score during training and evaluation. Compared to traditional manual tuning, this method increases optimization efficiency, reduces variability caused by subjective parameter choices, and enhances model generalization.</p></sec><sec id="sec2.8"><label>2.8</label><title>Evaluation metrics</title><p id="p0265">In this study, multiple evaluation metrics were adopted according to the characteristics of different tasks. For semantic segmentation, DUS test trait verification, and subgroup classification, all of which are category discrimination tasks. Accuracy, Precision, Recall, and F1-score were used as the primary metrics. Their definitions are:<disp-formula id="fd21"><label>(21)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M114" display="block" altimg="si97.svg" alttext="Equation 21."><mml:mrow><mml:mtext>Accuracy</mml:mtext><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi mathvariant="normal">A</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula><disp-formula id="fd22"><label>(22)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M115" display="block" altimg="si98.svg" alttext="Equation 22."><mml:mrow><mml:mtext>Precision</mml:mtext><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi mathvariant="normal">P</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac><mml:mo linebreak="goodbreak">×</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math></disp-formula><disp-formula id="fd23"><label>(23)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M116" display="block" altimg="si99.svg" alttext="Equation 23."><mml:mrow><mml:mtext>Recall</mml:mtext><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mi mathvariant="normal">R</mml:mi><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo linebreak="goodbreak">×</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math></disp-formula><disp-formula id="fd24"><label>(24)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M117" display="block" altimg="si100.svg" alttext="Equation 24."><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mn>1</mml:mn><mml:mo linebreak="badbreak">−</mml:mo><mml:mtext>score</mml:mtext><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">F</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo linebreak="goodbreak">=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mi mathvariant="italic">PR</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo linebreak="badbreak">+</mml:mo><mml:mi>R</mml:mi></mml:mrow></mml:mfrac><mml:mo linebreak="goodbreak">×</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math></disp-formula>where TP (True Positive) refers to the number of positive samples correctly predicted as positive, TN (True Negative) refers to the number of negative samples correctly predicted as negative, FP (False Positive) refers to the number of negative samples incorrectly predicted as positive, and FN (False Negative) refers to the number of positive samples incorrectly predicted as negative. To further assess spatial overlap and structural consistency in semantic segmentation, the Mean Intersection over Union (MIoU) metric was introduced.<disp-formula id="fd25"><label>(25)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M118" display="block" altimg="si101.svg" alttext="Equation 25."><mml:mrow><mml:mtext>MIoU</mml:mtext><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi mathvariant="normal">N</mml:mi></mml:mfrac><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:msubsup><mml:mfrac><mml:mtext>TP</mml:mtext><mml:mrow><mml:mtext>TP</mml:mtext><mml:mo linebreak="badbreak">+</mml:mo><mml:mtext>FP</mml:mtext><mml:mo linebreak="badbreak">+</mml:mo><mml:mtext>FN</mml:mtext></mml:mrow></mml:mfrac><mml:mo linebreak="goodbreak">×</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math></disp-formula></p><p id="p0270">For geometric trait validation, extraction accuracy was evaluated using the coefficient of determination (R<sup>2</sup>), Root Mean Square Error (RMSE), and Mean Absolute Percentage Error (MAPE):<disp-formula id="fd26"><label>(26)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M119" display="block" altimg="si102.svg" alttext="Equation 26."><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo linebreak="badbreak">=</mml:mo><mml:mn>1</mml:mn><mml:mo linebreak="goodbreak">−</mml:mo><mml:mfrac><mml:mrow><mml:mo>∑</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mo>∑</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo>¯</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula><disp-formula id="fd27"><label>(27)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M120" display="block" altimg="si103.svg" alttext="Equation 27."><mml:mrow><mml:mtext>RMSE</mml:mtext><mml:mo linebreak="badbreak">=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:mo>∑</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt></mml:mrow></mml:math></disp-formula><disp-formula id="fd28"><label>(28)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M121" display="block" altimg="si104.svg" alttext="Equation 28."><mml:mrow><mml:mtext>MAPE</mml:mtext><mml:mo linebreak="badbreak">=</mml:mo><mml:mfrac><mml:mn>100</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:mo>∑</mml:mo><mml:mrow><mml:mo stretchy="true">|</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo linebreak="badbreak">−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mfrac><mml:mo stretchy="true">|</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M122" altimg="si105.svg"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents manual measurements and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M123" altimg="si106.svg"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>y</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes predicted values. R<sup>2</sup> measures goodness of fit, while RMSE and MAPE quantify the magnitude of extraction errors.</p></sec><sec id="sec2.9"><label>2.9</label><title>Experimental setup</title><p id="p0275">The training platform used in this study was a Windows 11 (64-bit) operating system. Hardware parameter settings:CPU Intel(R) Core(TM) i7-12700 @ 2.10 GHz operating memory, 32 GB of RAM, 1 TB of SSD, and 8 GB of NVIDIA GeForce RTX 3070 Ti GPU. Anaconda 3.5.0 (Anaconda Inc., USA), CUDA 11.1 (Nvidia, USA), and cuDNN 8.0.4 (Nvidia, USA) libraries were used. In addition, the open-source deep learning framework Pytorch was used as the development environment, and the programming language used was Python 3.8.5 (Python Software Foundation, USA). The software used to train the model was PyCharm 2022.01. To ensure reliable model evaluation, the dataset was randomly divided into 80% training and 20% validation sets using a fixed random seed to guarantee reproducibility. In addition, a 5-fold cross-validation strategy was employed during hyperparameter tuning to assess model stability under different data partitions. The final model was trained using the optimal hyperparameters obtained from cross-validation, as summarized in <xref rid="appsec1" ref-type="sec">Table S2</xref>.</p></sec></sec><sec id="sec3"><label>3</label><title>Results</title><sec id="sec3.1"><label>3.1</label><title>Semantic segmentation performance analysis</title><p id="p0280">To comprehensively assess the effectiveness of LGASSNet in multi-component lettuce leaf segmentation, we performed a series of quantitative and qualitative experiments. The evaluation included comparisons with mainstream semantic segmentation models, analysis of lightweight efficiency, examination of convergence behavior, and visualization of multi-component segmentation results.</p><p id="p0285">As shown in <xref rid="tbl1" ref-type="table">Table 1</xref>, LGASSNet achieves the best overall segmentation performance among all evaluated models, with an Accuracy of 96.78%, Precision of 91.24%, Recall of 89.13%, and an F1-score of 90.08%. Compared with CNN-based architectures such as PSPNet, DeepLabv3+, HRNet, and UNet, LGASSNet provides notable improvements across both pixel-level and structure-aware metrics. In particular, it surpasses UNet and HRNet by 3.71% and 5.18% in F1-score, respectively, reflecting stronger adaptability to complex leaf textures and intricate edge structures. Variants adopting different backbone designs, including VGG-DC-EMA and Resnet-DC-EMA, also perform competitively. However, LGASSNet achieves an additional 0.71–2.45% increase in Recall, indicating enhanced capability in covering fine structural regions and maintaining boundary continuity.<table-wrap position="float" id="tbl1" orientation="portrait"><label>Table 1</label><caption><p>Performance comparisons of different backbone and other models.</p></caption><alt-text id="alttext0055">Table 1</alt-text><table frame="hsides" rules="groups"><thead><tr><th colspan="1" rowspan="1">Model</th><th colspan="1" rowspan="1">Accuracy↑</th><th colspan="1" rowspan="1">Precision↑</th><th colspan="1" rowspan="1">Recall↑</th><th colspan="1" rowspan="1">F1-score↑</th></tr></thead><tbody><tr><td align="left" colspan="1" rowspan="1">PSPNet</td><td align="char" colspan="1" rowspan="1">94.35</td><td align="char" colspan="1" rowspan="1">70.65</td><td align="char" colspan="1" rowspan="1">73.47</td><td align="char" colspan="1" rowspan="1">72.19</td></tr><tr><td align="left" colspan="1" rowspan="1">DeepLabv3+</td><td align="char" colspan="1" rowspan="1">95.53</td><td align="char" colspan="1" rowspan="1">87.82</td><td align="char" colspan="1" rowspan="1">81.84</td><td align="char" colspan="1" rowspan="1">83.64</td></tr><tr><td align="left" colspan="1" rowspan="1">HRNet</td><td align="char" colspan="1" rowspan="1">95.66</td><td align="char" colspan="1" rowspan="1">87.81</td><td align="char" colspan="1" rowspan="1">83.32</td><td align="char" colspan="1" rowspan="1">84.90</td></tr><tr><td align="left" colspan="1" rowspan="1">UNet</td><td align="char" colspan="1" rowspan="1">95.88</td><td align="char" colspan="1" rowspan="1">87.84</td><td align="char" colspan="1" rowspan="1">85.29</td><td align="char" colspan="1" rowspan="1">86.37</td></tr><tr><td align="left" colspan="1" rowspan="1">VGG-DC-EMA</td><td align="char" colspan="1" rowspan="1">96.14</td><td align="char" colspan="1" rowspan="1">88.36</td><td align="char" colspan="1" rowspan="1">87.10</td><td align="char" colspan="1" rowspan="1">87.63</td></tr><tr><td align="left" colspan="1" rowspan="1">Resnet-DC-EMA</td><td align="char" colspan="1" rowspan="1">96.46</td><td align="char" colspan="1" rowspan="1">89.79</td><td align="char" colspan="1" rowspan="1">88.42</td><td align="char" colspan="1" rowspan="1">89.03</td></tr><tr><td align="left" colspan="1" rowspan="1">LGASSNet(ours)</td><td align="char" colspan="1" rowspan="1"><bold>96.78</bold></td><td align="char" colspan="1" rowspan="1"><bold>91.24</bold></td><td align="char" colspan="1" rowspan="1"><bold>89.13</bold></td><td align="char" colspan="1" rowspan="1"><bold>90.08</bold></td></tr></tbody></table></table-wrap></p><p id="p0290">As shown in <xref rid="tbl2" ref-type="table">Table 2</xref>, LGASSNet exhibits excellent lightweight efficiency, containing only 4.58M parameters with a computational cost of 22.27G FLOPs. While maintaining an inference speed of 63.35 FPS, it still achieves the highest MIoU of 84.08%, demonstrating a well-balanced trade-off between accuracy and computational cost. Although Resnet-DC-EMA attains the highest frame rate of 64.46 FPS, its configuration requires 51.06M parameters and 51.25G FLOPs, resulting in substantially increased model complexity. In contrast, LGASSNet provides a more reliable balance for phenotyping applications, maintaining fine-grained segmentation quality while supporting real-time processing. Compared with models such as DeepLabv3+ (54.71M parameters, 167.24G FLOPs) and UNet (450.89G FLOPs), LGASSNet reduces computational cost by approximately 87% to 95% and lowers parameter count by 82% to 92%. This reduction underscores its suitability for deployment in resource-limited or embedded phenotyping systems.<table-wrap position="float" id="tbl2" orientation="portrait"><label>Table 2</label><caption><p>Lightweight performance comparisons of different models.</p></caption><alt-text id="alttext0060">Table 2</alt-text><table frame="hsides" rules="groups"><thead><tr><th colspan="1" rowspan="1">Model</th><th colspan="1" rowspan="1">MIoU↑</th><th colspan="1" rowspan="1">Parameters(M)↓</th><th colspan="1" rowspan="1">FLOPs(G)↓</th><th colspan="1" rowspan="1">FPS↑</th></tr></thead><tbody><tr><td align="left" colspan="1" rowspan="1">PSPNet</td><td align="char" colspan="1" rowspan="1">68.21</td><td align="char" colspan="1" rowspan="1">49.07</td><td align="char" colspan="1" rowspan="1">123.46</td><td align="char" colspan="1" rowspan="1">63.83</td></tr><tr><td align="left" colspan="1" rowspan="1">DeepLabv3+</td><td align="char" colspan="1" rowspan="1">76.46</td><td align="char" colspan="1" rowspan="1">54.71</td><td align="char" colspan="1" rowspan="1">167.24</td><td align="char" colspan="1" rowspan="1">47.38</td></tr><tr><td align="left" colspan="1" rowspan="1">HRNet</td><td align="char" colspan="1" rowspan="1">77.64</td><td align="char" colspan="1" rowspan="1">29.54</td><td align="char" colspan="1" rowspan="1">91.35</td><td align="char" colspan="1" rowspan="1">29.76</td></tr><tr><td align="left" colspan="1" rowspan="1">UNet</td><td align="char" colspan="1" rowspan="1">79.02</td><td align="char" colspan="1" rowspan="1">24.89</td><td align="char" colspan="1" rowspan="1">450.89</td><td align="char" colspan="1" rowspan="1">26.72</td></tr><tr><td align="left" colspan="1" rowspan="1">VGG-DC-EMA</td><td align="char" colspan="1" rowspan="1">80.55</td><td align="char" colspan="1" rowspan="1">30.28</td><td align="char" colspan="1" rowspan="1">190.70</td><td align="char" colspan="1" rowspan="1">32.40</td></tr><tr><td align="left" colspan="1" rowspan="1">Resnet-DC-EMA</td><td align="char" colspan="1" rowspan="1">82.58</td><td align="char" colspan="1" rowspan="1">51.06</td><td align="char" colspan="1" rowspan="1">51.25</td><td align="char" colspan="1" rowspan="1"><bold>64.46</bold></td></tr><tr><td align="left" colspan="1" rowspan="1">LGASSNet(ours)</td><td align="char" colspan="1" rowspan="1"><bold>84.08</bold></td><td align="char" colspan="1" rowspan="1"><bold>4.58</bold></td><td align="char" colspan="1" rowspan="1"><bold>22.27</bold></td><td align="char" colspan="1" rowspan="1">63.35</td></tr></tbody></table></table-wrap></p><p id="p0295"><xref rid="fig5" ref-type="fig">Fig. 5</xref>A illustrates the training loss and MIoU curves. LGASSNet exhibits fast and stable convergence, with the training loss decreasing smoothly and eventually reaching a steady plateau without oscillation. The MIoU curve increases consistently throughout training and stabilizes at a value higher than those of the other models, demonstrating the strong generalization capability of the network. This rapid convergence benefits from the synergy among LWGANet's group attention mechanism, the receptive-field expansion provided by the DC blocks, and the cross-scale feature refinement introduced by the EMA module, which together enable effective optimization of fine structural regions.<fig id="fig5" position="float" orientation="portrait"><label>Fig. 5</label><caption><p>Performance comparison of segmentation model. (A) Training loss and MIoU curves. (B) Qualitative segmentation results. (a) input image, (b) ground truth, (c) DeepLabv3+, (d) HRNet, (e) UNet, (f) VGG-DC-EMA, (g) Resnet-DC-EMA, (h) LGASSNet (ours).</p></caption><alt-text id="alttext0035">Fig. 5</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr5.jpg"><?image-name gr5.jpg?><?image-size 520104?><?image-md5 a7a018bee14c19f6d5814fe3b5eea14e?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 2540?><?image-original-width 3599?><?image-scaled-height 564?><?image-scaled-width 799?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/a7a018bee14c/gr5.jpg?><?thumb-name gr5.gif?><?thumb-size 78510?><?thumb-md5 ccb3208b44f705ee40d8e3115e0936fc?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 80?><?thumb-scaled-width 113?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/ccb3208b44f7/gr5.gif?></graphic></fig></p><p id="p0300"><xref rid="fig5" ref-type="fig">Fig. 5</xref>B illustrates the qualitative segmentation results. Although most models correctly capture the overall leaf contour, noticeable differences emerge in structurally complex regions such as serrated margins and lateral veins. CNN-based architectures (e.g., DeepLabv3+, HRNet, and UNet) often exhibit incomplete vein segmentation or discontinuous boundaries. In contrast, models incorporating both DC and EMA modules (VGG-DC-EMA and Resnet-DC-EMA) show marked improvements in edge continuity and structural consistency, reflecting stronger sensitivity to fine-scale details. LGASSNet delivers the most stable performance across all components, including mesophyll, main veins, and lateral veins. It accurately delineates primary and secondary venation while preserving margin features, achieving close alignment with manual annotations. This visual advantage supports downstream phenotypic trait extraction, particularly for traits dependent on venation topology and leaf-margin morphology.</p><p id="p0305">Overall, the results demonstrate that LGASSNet achieves top-level performance in accuracy, structural completeness, computational efficiency, and real-time capability, highlighting its strong potential for large-scale automated lettuce phenotyping.</p></sec><sec id="sec3.2"><label>3.2</label><title>Analysis results of phenotypic traits</title><p id="p0310">The basic phenotypic traits of 709 lettuce leaves were analyzed in <xref rid="fig6" ref-type="fig">Fig. 6</xref>A. The phenotypic characteristics varied significantly among different varieties. Leaf length ranged from 105.4 mm to 470.32 mm, with an average leaf length of 251.81 mm. The shortest one was the Butter B-165-3, collected in 1963 from Warszawa Poland. The longest one was the Stem S-1193-2, collected in 2009 from China. Leaf width ranged from 53.73 mm to 316.17 mm, with an average leaf width of 173.52 mm. The narrowest one was the Wild relatives W-1264-2, collected in 1961 from England United Kingdom. The widest one was the Oakleaf O-901-2, collected in 1989 from United States. Leaf perimeter ranged from 337.91 mm to 2222.09 mm, with an average leaf perimeter of 817.67 mm. The shortest one was the Butter B-165-3, collected in 1963 from Warszawa Poland. The longest one was the Oakleaf O-901-2, collected in 1989 from United States. Leaf area ranged from 5961.42 mm<sup>2</sup> to 59172.82 mm<sup>2</sup>, with an average leaf area of 26449.94 mm<sup>2</sup>. The smallest leaf area was the Crisphead C-384-2, collected in 1989 from California United States. The largest leaf area was the Roman R-1054-1, collected in 1948, from India. The leaf length, leaf width, leaf perimeter and leaf area were all normally distributed.<fig id="fig6" position="float" orientation="portrait"><label>Fig. 6</label><caption><p>Analysis results of phenotypic traits. (A) Analysis results of basic phenotypic traits. (B) Analysis results of DUS test traits about morphological. (C) Analysis results of DUS test traits about color. (D) Validation of geometric measurements. (E) Validation of DUS test trait classification.</p></caption><alt-text id="alttext0040">Fig. 6</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr6.jpg"><?image-name gr6.jpg?><?image-size 402708?><?image-md5 219aa09e9bc2bbf913c9d109090d006c?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 4032?><?image-original-width 3599?><?image-scaled-height 895?><?image-scaled-width 799?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/219aa09e9bc2/gr6.jpg?><?thumb-name gr6.gif?><?thumb-size 79874?><?thumb-md5 c22b840d29b71232f70d9154eeba22b1?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 112?><?thumb-scaled-width 100?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/c22b840d29b7/gr6.gif?></graphic></fig></p><p id="p0315">The results of the 709 lettuce leaf shape (circular, medium oblate, narrow oblate, broad elliptic, medium elliptic, narrow elliptic, linear, lanceolate), leaf tip shape (acute, obtuse, rounded), leaf margin shape (bidentate, crenate, dentate, tridentate), and leaf vein shape (semi_flabellate, flabellate, not_flabellate) DUS test trait analysis (In this study, only the morphology present in the experimental material is analyzed). as shown in <xref rid="fig6" ref-type="fig">Fig. 6</xref>B. In terms of leaf shape, B varieties were mainly circular, medium oblate, narrow oblate, broad elliptic, and medium elliptic. R varieties were primarily broad elliptic, medium elliptic, and narrow elliptic. S varieties mostly exhibited linear shapes, while W varieties tended to be lanceolate. For leaf tip shape, B, L, and R varieties were dominated by obtuse and rounded tips. C varieties mainly showed acute and obtuse tips, whereas other varieties were predominantly acute. Regarding leaf margin shape, B and R varieties were primarily crenate and dentate. L varieties mostly exhibited dentate margins. C varieties frequently showed bidentate margins. Other varieties were mostly crenate. In terms of leaf vein shape, the majority of varieties exhibited a flabellate pattern.</p><p id="p0320">The DUS test traits of hue, brightness, and anthocyanin content were analyzed for 709 lettuce varieties, as shown in <xref rid="fig6" ref-type="fig">Fig. 6</xref>C. The overall hue (H) ranged from 40° to 50°, and the brightness (V) ranged from 80° to 120°, indicating a predominant yellowish green hue and medium brightness. Among the varieties, Butter exhibited the lowest overall hue (H) value, displaying a yellowish green color, while Wild Relatives had the highest hue (H) value, resulting in a green color. In terms of brightness, Leaf displayed the lowest overall brightness (V) value, appearing dark, while Wild Relatives had the highest brightness (V) value, showing medium brightness. Regarding anthocyanin content, Leaf, Oakleaf, and Roman varieties exhibited clear anthocyanin distributions, while the remaining varieties contained either trace amounts or no detectable anthocyanin.</p><p id="p0325">To validate the reliability of the extracted phenotypic traits, we performed both geometric and DUS test trait verification. For geometric traits (LL, LW, LP, LA), manual measurements of 120 leaves were obtained using ImageJ and compared with the pipeline-derived values, as illustrated in <xref rid="fig6" ref-type="fig">Fig. 6</xref>D. The results showed strong consistency (R<sup>2</sup> &gt; 0.99, MAPE &lt; 8.65%), confirming the accuracy of quantitative extraction. For DUS test traits (LS, LTS, LMS, LVS), annotations from two domain experts were used as reference labels, and the corresponding confusion matrix is shown in <xref rid="fig6" ref-type="fig">Fig. 6</xref>E. The evaluation achieved an overall accuracy of 95.77%, with F1-scores above 0.96 for all classes, indicating that the proposed pipeline reliably captures morphological categories. These results collectively demonstrate the robustness and biological validity of both geometric and DUS trait extraction.</p><p id="p0330">To quantitatively verify whether the extracted phenotypic traits differed significantly among lettuce subgroups, we performed a comprehensive one-way ANOVA followed by Tukey's HSD post-hoc test across all 17 traits, as shown in <xref rid="appsec1" ref-type="sec">Table S3</xref>. The standardized mean values of each trait for the seven subgroups are visualized in <xref rid="appsec1" ref-type="sec">Fig. S1A</xref>. The heatmap reveals clear subgroup-specific phenotypic patterns, particularly in morphological traits such as LTS, LVSs, LVSm, LMS, LL, LW, and LA. ANOVA results indicated that 16 of the 17 traits exhibited significant differences among subgroups (p &lt; 0.05), including 11 traits with highly significant variation (p &lt; 0.001). These results confirm that phenotypic divergence across subgroups is statistically meaningful rather than arising from sampling variation. To further evaluate which subgroup pairs differed significantly, we performed Tukey's HSD multiple-comparison test, which revealed extensive pairwise separation patterns. Subgroups such as R and C exhibited consistent and highly significant differences across multiple traits, forming well-defined phenotypic clusters. In contrast, the W subgroup showed the greatest within-group variation and broader overlap with other groups, reflecting its higher level of genetic heterogeneity. The Tukey significance matrix in <xref rid="appsec1" ref-type="sec">Fig. S1B</xref> demonstrates that most subgroup pairs differ significantly across a wide range of traits, indicating that the phenotypic divergence described in this study is strongly supported by statistical evidence. Together, the ANOVA and Tukey HSD analyses validate the robustness of phenotype-based differentiation among lettuce subgroups.</p><p id="p0335">After confirming that phenotypic traits exhibited significant subgroup-level divergence, we further examined the internal relationships among the 17 traits through Pearson correlation analysis. As shown in <xref rid="appsec1" ref-type="sec">Fig. S1C</xref>. Significant positive and negative correlations were observed among different traits. MTDs showed a significant positive correlation with LS, indicating that local structural variations directly influence the development of overall leaf morphology. LBPHF exhibited strong positive correlations with several geometric traits, including LL, LW, LP, and LA. Notably, its correlation with LA reached as high as <italic toggle="yes">r</italic> = 0.99. This suggests that texture complexity increases with leaf size, indicating a close association between leaf surface texture and linear dimensions. Conversely, LBPHF showed a significant negative correlation with LV, implying that increased structural complexity may hinder the even distribution of pigments, resulting in lower brightness. This indicates a potential antagonistic relationship between texture richness and pigment accumulation. Strong positive correlations were also observed among fundamental geometric traits such as LL, LW, LP, and LA. For instance, LL and LA showed a correlation of <italic toggle="yes">r</italic> = 0.64, and LW and LA showed <italic toggle="yes">r</italic> = 0.71. These results reflect coordinated expansion among linear dimensions during leaf growth.Among ratio-based traits. LWr was negatively correlated with LW (<italic toggle="yes">r</italic> = −0.63), indicating that as leaf width increases, the length-to-width ratio decreases. This trend suggests a morphological shift towards a rounder leaf shape. PLr exhibited a significant negative correlation with RN (<italic toggle="yes">r</italic> = −0.60), suggesting that rounder leaves tend to have a more compact contour, with a lower perimeter-to-diameter ratio. Moderate positive correlations were identified among structural traits such as LS, LTS, and LMS. These relationships imply a coordinated change across the overall leaf shape, leaf tip shape, and leaf margin shape. A significant negative correlation was also found between LV and AH (<italic toggle="yes">r</italic> = −0.58), indicating that leaves with lower brightness typically contain higher levels of anthocyanins. This is consistent with the known light-absorbing and color-deepening properties of anthocyanins. The diagonal density plots illustrated the distribution of each phenotypic trait. Most traits followed an approximately normal distribution, supporting the reliability and consistency of the data. In summary, the correlation analysis reveals multiple synergistic patterns among leaf traits. Interactions between shape, color, texture, and pigment accumulation suggest complex regulatory relationships. These relationships were distinguished by constructing phenotypic fingerprints.</p></sec><sec id="sec3.3"><label>3.3</label><title>Construction and visualization of phenotypic fingerprint</title><p id="p0340">The identified phenotypic traits exhibit substantial physiological and ecological significance, as revealed by the correlation analysis. They play a crucial role in determining lettuce quality and yield. Moreover, these traits demonstrate strong discriminatory potential for varietal classification, particularly in the rapid identification of genetic subgroups. To improve the efficiency and discriminative power of phenotypic feature representation, PCA (Principal Component Analysis) was employed to perform dimensionality reduction on the 17 extracted traits. As shown in <xref rid="fig7" ref-type="fig">Fig. 7</xref>A(a), the first 10 principal components accounted for a cumulative contribution of 95.82%. The importance ranking of the features is presented in <xref rid="fig7" ref-type="fig">Fig. 7</xref>A(b), and based on this, the top 13 features were selected as the core traits for phenotypic fingerprint construction. These selected features were further standardized and sequentially encoded to form a unique and highly discriminative phenotypic ID, as illustrated in <xref rid="fig7" ref-type="fig">Fig. 7</xref>B. This phenotypic ID integrates three dimensions of information shape, color, and texture, and provides an intuitive visualization of the phenotypic diversity among different lettuce varieties in a multidimensional feature space. This greatly enhances the interpretability and visualization of phenotypic data, and provides an innovative technical route and theoretical basis for the precise identification of varieties, germplasm resource management and standardized expression of phenotypic big data.<fig id="fig7" position="float" orientation="portrait"><label>Fig. 7</label><caption><p>Construction and visualization of phenotypic fingerprint. (A) The principal component analysis and feature importance selection. (a) Screen plot of the PCA model and the curves of cumulative explained variance. (b) Sorting about feature importance. (B) Phenotype ID visualization.</p></caption><alt-text id="alttext0045">Fig. 7</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr7.jpg"><?image-name gr7.jpg?><?image-size 524881?><?image-md5 fcda5a5b25a6073381eca79e0932c60d?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 3786?><?image-original-width 3591?><?image-scaled-height 841?><?image-scaled-width 798?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/fcda5a5b25a6/gr7.jpg?><?thumb-name gr7.gif?><?thumb-size 75422?><?thumb-md5 c2afa62c53d31c98c7fde642c4d2ffc1?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 105?><?thumb-scaled-width 100?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/c2afa62c53d3/gr7.gif?></graphic></fig></p></sec><sec id="sec3.4"><label>3.4</label><title>Subgroup variety identification results</title><p id="p0345">The classification performance of subpopulation varieties was comprehensively evaluated using the constructed phenotypic ID. To benchmark their effectiveness, we also conducted comparative experiments using three types of unidimensional features: shape, color, and texture. The dataset was split into training and testing sets in an 8:2 ratio. <xref rid="fig8" ref-type="fig">Fig. 8</xref>A presents the confusion matrices generated from different feature dimensions, highlighting the differences in classification accuracy and misclassification among subgroups. <xref rid="fig8" ref-type="fig">Fig. 8</xref>B compares the prediction performance across classifiers. Although unidimensional features perform well in certain models, the phenotypic ID substantially improves accuracy, precision, recall, and F1-score across all algorithms. Among these, the SVM model achieved the best performance, reaching 98.59% accuracy, 98.61% precision, 98.59% recall, and 98.57% F1-score. The multidimensional phenotypic ID integrates shape, color, and texture information, offering a more comprehensive representation of varietal phenotypic variation. Classification models built on this phenotypic ID demonstrate strong discriminative ability and generalization performance, providing a stable and scalable solution for subgroup identification and precise variety classification.<fig id="fig8" position="float" orientation="portrait"><label>Fig. 8</label><caption><p>Subgroup variety identification performance. (A) Confusion matrix of subgroup variety identification. (B) Comparison of subgroup variety identification performance. (a) Shape, (b) Color, (c) Texture, (d) Phenotypic ID.</p></caption><alt-text id="alttext0050">Fig. 8</alt-text><graphic xmlns:xlink="http://www.w3.org/1999/xlink" position="float" orientation="portrait" xlink:href="gr8.jpg"><?image-name gr8.jpg?><?image-size 636925?><?image-md5 db026ee8e980c48b0d319d7facc0d3b4?><?image-image-server-status LOAD_COMPLETED?><?image-original-height 4534?><?image-original-width 2818?><?image-scaled-height 1133?><?image-scaled-width 704?><?image-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/db026ee8e980/gr8.jpg?><?thumb-name gr8.gif?><?thumb-size 79001?><?thumb-md5 b0c2c816463ff0c90acc3b2e17ae1420?><?thumb-image-server-status NEVER_LOAD?><?thumb-scaled-height 161?><?thumb-scaled-width 100?><?thumb-cloudpmc-urn urn:cdn:blobs/3ed9/13316521/b0c2c816463f/gr8.gif?></graphic></fig></p><p id="p0350">To further examine the effect of hyperparameter optimization, <xref rid="appsec1" ref-type="sec">Fig. S2</xref> compares the performance of all classifiers before and after Optuna tuning. The results show that hyperparameter optimization yields clear and consistent improvements across all models in terms of Accuracy, Precision, Recall, and F1-score. Among the classifiers, SVM exhibits the most substantial performance gain and ultimately achieves the highest accuracy. These findings indicate that integrating Optuna-based hyperparameter optimization with the multidimensional phenotypic ID provides a highly reliable and robust framework for lettuce subgroup identification.</p></sec></sec><sec id="sec4"><label>4</label><title>Discussion</title><sec id="sec4.1"><label>4.1</label><title>Model performance and robustness considerations</title><p id="p0355">Previous semantic segmentation studies have often relied on multi-branch architectures or multi-scale feature fusion schemes to enhance feature representation [<xref rid="bib43" ref-type="bibr">43</xref>,<xref rid="bib44" ref-type="bibr">44</xref>], but both strategies tend to struggle with balancing accuracy and computational efficiency. In contrast, LGASSNet adopts a lightweight group attention mechanism that captures multi-scale information within a streamlined backbone. This design avoids the computational redundancy typically seen in multi-branch models and improves fine-detail representation compared with multi-scale fusion approaches. It achieves a favorable balance between accuracy and efficiency and shows particularly strong performance in complex regions such as the main vein, lateral veins, and serrated margins, providing a reliable foundation for precise downstream phenotypic extraction. When combined with the multidimensional phenotypic ID, the framework also achieves high accuracy and stability in subgroup classification, showing reliable discriminative ability even under challenging class boundaries. Although all samples were collected in a controlled greenhouse environment, the group attention mechanisms allow LGASSNet to capture both local details and global structural patterns. This design theoretically provides some potential for inference adaptability across different environments. Meanwhile, controlled illumination was adopted to ensure stable light intensity and spectral composition. Although natural-light acquisition is more accessible in practice, it introduces substantial fluctuations with time and environmental changes, resulting in non-uniform color responses that cannot be fully corrected even through calibration. In contrast, controlled lighting provides a uniform radiometric environment that enhances reproducibility and supports standardized extraction of color-related DUS traits. Consistently, the application of standardized color calibration further improves the comparability of color-related traits across imaging batches and ensures consistency in color-dependent analyses.</p><p id="p0360">Importantly, the relevance of multi-scale structural perception is not limited to leaf phenotyping. Similar observations have been made in root phenotyping tasks, where segmentation continuity and structural integrity directly influence trait extraction quality. Recent work applying an integrated SegFormer-based root phenotyping toolbox demonstrated that preserving fine branching and topological detail significantly improved trait quantification and QTL mining efficiency [<xref rid="bib45" ref-type="bibr">45</xref>]. Likewise, imaging-based root architecture analysis further showed that multi-scale structural recognition improves phenotype integrity and downstream biological interpretation, reinforcing the importance of fine structural perception in plant image segmentation [<xref rid="bib46" ref-type="bibr">46</xref>]. These parallels highlight that leaf venation and root architecture share similar branching-like morphological patterns, and that methods capable of capturing multi-scale structural continuity such as LGASSNet hold promise for broader plant phenotyping applications.</p><p id="p0365">Future work will extend evaluations to field environments, and multiple developmental stages. These assessments will help determine the model's robustness under real-world variability and its ability to consistently capture phenotypic variation under genotype × environment (G × E) interactions.</p></sec><sec id="sec4.2"><label>4.2</label><title>The interpretability and applied potential of the phenotypic fingerprint</title><p id="p0370">The proposed phenotypic fingerprint provides a structured and interpretable representation of lettuce leaf phenotype. Rather than functioning as a simple stacked feature set [<xref rid="bib47" ref-type="bibr">47</xref>,<xref rid="bib48" ref-type="bibr">48</xref>], the fingerprint encodes shape, color, and texture traits into a standardized and dimensionless phenotypic code. This representation does not rely on absolute morphological values, but instead reflects relative, biologically grounded trait descriptors. Each trait corresponds to an explicit biological structure, such as LL, LWr, RN, LS, LTS, LVS, LH, and LV, which makes the fingerprint inherently interpretable and aligned with the observability and stability requirements of DUS testing [<xref rid="bib27" ref-type="bibr">27</xref>,<xref rid="bib49" ref-type="bibr">49</xref>]. Correlation analysis among traits further reveals coordinated patterns across morphological, textural, and color dimensions, offering insights into biological differentiation among lettuce subgroups. In practical applications, the phenotypic fingerprint supports not only variety identification but also germplasm evaluation, trait pattern analysis, and elite material screening. Its interpretability and scalability enable reliable characterization of phenotypic diversity within breeding resources and provide a solid foundation for intelligent selection and decision-making in modern breeding programs.</p></sec><sec id="sec4.3"><label>4.3</label><title>Role of the phenotypic fingerprint in genetic differentiation and DUS standardization</title><p id="p0375">The phenotypic fingerprint carries biological significance that extends beyond variety classification. Key traits in the fingerprint, such as LS, LVS, LH, LV, and AH, are jointly influenced by genetic background, photosynthetic efficiency and physiological responses. Their coordinated variation across lettuce subgroups reveals intrinsic patterns of genetic differentiation and provides a phenotypic perspective that aligns with established evolutionary relationships and ecological adaptation strategies. The fingerprint also integrates the quantitative expression of DUS testing traits for lettuce leaves based on UPOV guidelines. These descriptors, which have traditionally relied on subjective visual scoring, are transformed into objective and repeatable phenotypic ID codes. This conversion improves evaluation consistency and reduces assessor-dependent variation. By standardizing the representation of key morphological traits, the phenotypic fingerprint establishes a practical foundation for automating DUS evaluations and supports faster variety testing with higher reproducibility across institutions. Furthermore, integrating the phenotypic fingerprint with genomic, transcriptomic and metabolomic data would enable the construction of more complete genotype–phenotype interaction networks [<xref rid="bib50" ref-type="bibr">50</xref>,<xref rid="bib51" ref-type="bibr">51</xref>]. Such multi-omics integration will facilitate intelligent breeding, variety traceability and precision germplasm selection, and it highlights the broad applicability of phenotypic fingerprints.</p></sec><sec id="sec4.4"><label>4.4</label><title>Limitations and future perspectives</title><p id="p0380">Although the proposed method exhibits robust performance, several limitations remain. First, the present study focuses on constructing phenotypic fingerprints from detached leaves, and the temporal dynamics of trait expression across developmental stages warrant more comprehensive investigation. Second, although the fingerprint-based approach enables accurate subgroup identification, achieving fine-grained, one-to-one variety-level discrimination remains an important direction for future research.</p><p id="p0385">Future work will therefore focus on multi-environment, multi-stage, and multi-sensor in-situ field measurements. Moreover, integrating genomic and transcriptomic multi-omics information will enable the construction of more comprehensive fingerprints that incorporate morphological, color, texture, physiological, and biochemical traits. These advances will support accurate variety-level identification and further strengthen high-throughput phenotyping for intelligent breeding applications.</p></sec></sec><sec id="sec5"><label>5</label><title>Conclusion</title><p id="p0390">This study proposes a high-throughput phenotypic trait analysis pipeline capable of accurately quantifying key leaf-level phenotypic features of lettuce such as shape, color, and texture from 2D images across multiple dimensions. The quantification results revealed significant inter-varietal differences in multidimensional phenotypic traits, which can be effectively captured and distinguished through the construction of phenotypic fingerprints. Using the derived Phenotypic ID, the identification accuracy for lettuce subpopulation varieties reached 98.59%, offering a viable technological pathway for the rapid identification, precise management, and intelligent breeding of lettuce germplasm resources.</p><p id="p0395">Moving forward, the study will further refine phenotypic fingerprints at both the single plant and population scales. The goal is to develop a high-resolution, multi-scale, and multi-temporal digital phenotypic fingerprint map at the variety level. In addition, the transferability of this approach to major staple crops such as maize, wheat, and soybean will be explored. This will promote the integration of high-throughput phenotyping technologies into germplasm discovery, key trait analysis, and molecular design breeding, accelerating the transformation of modern crop breeding toward digitalization and intelligent decision-making.</p></sec><sec id="sec6"><title>Author contributions</title><p id="p0400">Guangjie Qiu: Writing – review &amp; editing, Writing – original draft, Visualization, Methodology, Conceptualization. Weiliang Wen: Writing – review &amp; editing, Methodology. Xiaoqian Chen: Resources, Formal analysis, Data curation. Chuanyu Wang: Investigation, Data curation. Si Yang: Resources, Conceptualization. Xinyu Guo: Supervision, Funding acquisition. Chunjiang Zhao: Validation, Project administration, Funding acquisition.</p></sec><sec id="sec8"><title>Funding</title><p id="p0410">This research is supported by the National Key R&amp;D Program (2022YFD2002300), Collaborative Innovation Center of Beijing Academy of Agricultural and Forestry Sciences (KJCX20240406), and Postdoctoral fund of Beijing Academy of Agriculture and Forestry Sciences.</p></sec><sec sec-type="data-availability" id="da0010"><title>Data availability</title><p id="p0405">The data used to support the findings of this study are available upon request from the corresponding author, and the source code is accessible at <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://github.com/qiuguangjie87/PP_Phenotypic_Fingerprint" id="intref0010">https://github.com/qiuguangjie87/PP_Phenotypic_Fingerprint</ext-link>.</p></sec><sec sec-type="COI-statement" id="coi0010"><title>Declaration of competing interest</title><p id="p0415">The authors declare the following financial interests/personal relationships which may be considered as potential competing interests: Given their respective roles as Advisory Board member and Associate Editor, Chunjiang Zhao and Weiliang Wen had no involvement in the peer review of this article and had no access to information regarding its peer review. Full responsibility for the editorial process for this article was delegated to another journal editor.</p></sec></body><back><ref-list id="cebib0010"><title>References</title><ref id="bib1"><label>1</label><element-citation publication-type="journal" id="sref1"><person-group person-group-type="author"><name name-style="western"><surname>Dyląg</surname><given-names>A.</given-names></name><name name-style="western"><surname>Smoleń</surname><given-names>S.</given-names></name><name name-style="western"><surname>Wisła-Świder</surname><given-names>A.</given-names></name><etal/></person-group><article-title>Evaluation of the chemical composition and nutritional value of lettuce (Lactuca sativa L.) biofortified in hydroponics with iodine in the form of iodoquinolines</article-title><source>Front. Plant Sci.</source><volume>14</volume><year>2023</year><object-id pub-id-type="publisher-id">1288773</object-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.3389/fpls.2023.1288773</pub-id><pub-id pub-id-type="pmcid">PMC10701912</pub-id><pub-id pub-id-type="pmid">38078108</pub-id></element-citation></ref><ref id="bib2"><label>2</label><element-citation publication-type="journal" id="sref2"><person-group person-group-type="author"><name name-style="western"><surname>Adhikari</surname><given-names>B.</given-names></name><name name-style="western"><surname>Olorunwa</surname><given-names>O.J.</given-names></name><name name-style="western"><surname>Wilson</surname><given-names>J.</given-names></name><etal/></person-group><article-title>Morpho-physiological, leaf hyperspectral, and nutritional responses of lettuce to salt stress</article-title><source>Plant Physiology Reports</source><volume>30</volume><issue>4</issue><year>2025</year><fpage>721</fpage><lpage>735</lpage></element-citation></ref><ref id="bib3"><label>3</label><element-citation publication-type="journal" id="sref3"><person-group person-group-type="author"><name name-style="western"><surname>Eshkabilov</surname><given-names>S.</given-names></name><name name-style="western"><surname>Simko</surname><given-names>I.</given-names></name></person-group><article-title>Assessing contents of sugars, vitamins, and nutrients in baby leaf lettuce from hyperspectral data with machine learning models</article-title><source>Agriculture</source><volume>14</volume><issue>6</issue><year>2024</year><fpage>834</fpage></element-citation></ref><ref id="bib4"><label>4</label><element-citation publication-type="journal" id="sref4"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>G.</given-names></name><name name-style="western"><surname>Zhu</surname><given-names>W.</given-names></name><name name-style="western"><surname>Ma</surname><given-names>S.</given-names></name><etal/></person-group><article-title>Extracting leaf morphological traits within occluded lettuce canopies using instance segmentation and supervised conditional GAN</article-title><source>J. Agric. Food Res.</source><year>2025</year><object-id pub-id-type="publisher-id">102518</object-id></element-citation></ref><ref id="bib5"><label>5</label><element-citation publication-type="journal" id="sref5"><person-group person-group-type="author"><name name-style="western"><surname>Bhuiyan</surname><given-names>M.M.R.</given-names></name><name name-style="western"><surname>Noman</surname><given-names>I.R.</given-names></name><name name-style="western"><surname>Aziz</surname><given-names>M.M.</given-names></name><etal/></person-group><article-title>Transformation of plant breeding using data analytics and information technology: innovations, applications, and prospective directions</article-title><source>Frontiers in Bioscience-Elite</source><volume>17</volume><issue>1</issue><year>2025</year><object-id pub-id-type="publisher-id">27936</object-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.31083/FBE27936</pub-id><pub-id pub-id-type="pmid">40150987</pub-id></element-citation></ref><ref id="bib6"><label>6</label><element-citation publication-type="book" id="sref6"><person-group person-group-type="author"><name name-style="western"><surname>Manoj</surname><given-names>C.S.</given-names></name><name name-style="western"><surname>Vipul</surname><given-names>P.P.</given-names></name><name name-style="western"><surname>Chirag</surname><given-names>P.C.</given-names></name><etal/></person-group><part-title>Molecular Characterization and Phenotypic Selection for Blast Resistance and Yield Enhancement in Rice (Oryza sativa L.)</part-title><year>2025</year></element-citation></ref><ref id="bib7"><label>7</label><element-citation publication-type="journal" id="sref7"><person-group person-group-type="author"><name name-style="western"><surname>Crossa</surname><given-names>J.</given-names></name><name name-style="western"><surname>Montesinos-Lopez</surname><given-names>O.A.</given-names></name><name name-style="western"><surname>Costa-Neto</surname><given-names>G.</given-names></name><etal/></person-group><article-title>Machine learning algorithms translate big data into predictive breeding accuracy</article-title><source>Trends Plant Sci.</source><volume>30</volume><issue>2</issue><year>2025</year><fpage>167</fpage><lpage>184</lpage><pub-id pub-id-type="pmid">39462718</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.tplants.2024.09.011</pub-id></element-citation></ref><ref id="bib8"><label>8</label><element-citation publication-type="journal" id="sref8"><person-group person-group-type="author"><name name-style="western"><surname>Hoyos-Villegas</surname><given-names>V.</given-names></name><name name-style="western"><surname>Jackson</surname><given-names>M.</given-names></name><name name-style="western"><surname>Vargas-Cedeño</surname><given-names>M.</given-names></name><etal/></person-group><article-title>Affordable phenomics: expanding access to enhancing genetic gain in plant breeding</article-title><source>The Plant Phenome Journal</source><volume>8</volume><issue>1</issue><year>2025</year><object-id pub-id-type="publisher-id">e70034</object-id></element-citation></ref><ref id="bib9"><label>9</label><element-citation publication-type="journal" id="sref9"><person-group person-group-type="author"><name name-style="western"><surname>Wen</surname><given-names>W.</given-names></name><name name-style="western"><surname>Wang</surname><given-names>J.</given-names></name><name name-style="western"><surname>Zhao</surname><given-names>Y.</given-names></name><etal/></person-group><article-title>3D morphological feature quantification and analysis of corn leaves</article-title><source>Plant Phenomics</source><volume>6</volume><year>2024</year><fpage>225</fpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.34133/plantphenomics.0225</pub-id><pub-id pub-id-type="pmcid">PMC11301035</pub-id><pub-id pub-id-type="pmid">39108845</pub-id></element-citation></ref><ref id="bib10"><label>10</label><element-citation publication-type="journal" id="sref10"><person-group person-group-type="author"><name name-style="western"><surname>Wen</surname><given-names>W.</given-names></name><name name-style="western"><surname>Gu</surname><given-names>S.</given-names></name><name name-style="western"><surname>Zhang</surname><given-names>Y.</given-names></name><etal/></person-group><article-title>Standard framework construction of technology and equipment for big data in crop phenomics</article-title><source>Engineering</source><volume>42</volume><year>2024</year><fpage>175</fpage><lpage>184</lpage></element-citation></ref><ref id="bib11"><label>11</label><element-citation publication-type="journal" id="sref11"><person-group person-group-type="author"><name name-style="western"><surname>Han</surname><given-names>G.D.</given-names></name><name name-style="western"><surname>Kim</surname><given-names>B.H.</given-names></name><name name-style="western"><surname>Kim</surname><given-names>W.</given-names></name><etal/></person-group><article-title>High-Throughput imaging for precision breeding and orphan crop</article-title><source>Journal of Agricultural, Life and Environmental Sciences</source><volume>37</volume><issue>3</issue><year>2025</year><fpage>167</fpage><lpage>175</lpage></element-citation></ref><ref id="bib12"><label>12</label><element-citation publication-type="journal" id="sref12"><person-group person-group-type="author"><name name-style="western"><surname>Amitrano</surname><given-names>C.</given-names></name><name name-style="western"><surname>Junker</surname><given-names>A.</given-names></name><name name-style="western"><surname>D'Agostino</surname><given-names>N.</given-names></name><etal/></person-group><article-title>Integration of high-throughput phenotyping with anatomical traits of leaves to help understanding lettuce acclimation to a changing environment</article-title><source>Planta</source><volume>256</volume><issue>4</issue><year>2022</year><fpage>68</fpage><pub-id pub-id-type="pmid">36053378</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1007/s00425-022-03984-2</pub-id><pub-id pub-id-type="pmcid">PMC9439985</pub-id></element-citation></ref><ref id="bib13"><label>13</label><element-citation publication-type="journal" id="sref13"><person-group person-group-type="author"><name name-style="western"><surname>Wang</surname><given-names>R.F.</given-names></name><name name-style="western"><surname>Qu</surname><given-names>H.R.</given-names></name><name name-style="western"><surname>Su</surname><given-names>W.H.</given-names></name></person-group><article-title>From sensors to insights: technological trends in image-based high-throughput plant phenotyping</article-title><source>Smart Agric. Technol.</source><year>2025</year><object-id pub-id-type="publisher-id">101257</object-id></element-citation></ref><ref id="bib14"><label>14</label><element-citation publication-type="journal" id="sref14"><person-group person-group-type="author"><name name-style="western"><surname>Angidi</surname><given-names>S.</given-names></name><name name-style="western"><surname>Madankar</surname><given-names>K.</given-names></name><name name-style="western"><surname>Tehseen</surname><given-names>M.M.</given-names></name><etal/></person-group><article-title>Advanced high-throughput phenotyping techniques for managing abiotic stress in agricultural Crops—A comprehensive review</article-title><source>Crops</source><volume>5</volume><issue>2</issue><year>2025</year><fpage>8</fpage></element-citation></ref><ref id="bib15"><label>15</label><element-citation publication-type="journal" id="sref15"><person-group person-group-type="author"><name name-style="western"><surname>Abebe</surname><given-names>A.M.</given-names></name><name name-style="western"><surname>Kim</surname><given-names>Y.</given-names></name><name name-style="western"><surname>Kim</surname><given-names>J.</given-names></name><etal/></person-group><article-title>Image-based high-throughput phenotyping in horticultural crops</article-title><source>Plants</source><volume>12</volume><issue>10</issue><year>2023</year><fpage>2061</fpage><pub-id pub-id-type="pmid">37653978</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.3390/plants12102061</pub-id><pub-id pub-id-type="pmcid">PMC10222289</pub-id></element-citation></ref><ref id="bib16"><label>16</label><element-citation publication-type="journal" id="sref16"><person-group person-group-type="author"><name name-style="western"><surname>Cho</surname><given-names>W.J.</given-names></name><name name-style="western"><surname>Yang</surname><given-names>M.</given-names></name></person-group><article-title>High-throughput plant phenotyping system using a low-cost camera network for plant factory</article-title><source>Agriculture</source><volume>13</volume><issue>10</issue><year>2023</year><fpage>1874</fpage></element-citation></ref><ref id="bib17"><label>17</label><element-citation publication-type="journal" id="sref17"><person-group person-group-type="author"><name name-style="western"><surname>Cai</surname><given-names>S.</given-names></name><name name-style="western"><surname>Gou</surname><given-names>W.</given-names></name><name name-style="western"><surname>Wen</surname><given-names>W.</given-names></name><etal/></person-group><article-title>Design and development of a low-cost UGV 3D phenotyping platform with integrated LiDAR and electric slide rail</article-title><source>Plants</source><volume>12</volume><issue>3</issue><year>2023</year><fpage>483</fpage><pub-id pub-id-type="pmid">36771568</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.3390/plants12030483</pub-id><pub-id pub-id-type="pmcid">PMC9919849</pub-id></element-citation></ref><ref id="bib18"><label>18</label><element-citation publication-type="journal" id="sref18"><person-group person-group-type="author"><name name-style="western"><surname>Ma</surname><given-names>H.</given-names></name><name name-style="western"><surname>Wen</surname><given-names>W.</given-names></name><name name-style="western"><surname>Gou</surname><given-names>W.</given-names></name><etal/></person-group><article-title>3D time-series phenotyping of lettuce in greenhouses</article-title><source>Biosyst. Eng.</source><volume>250</volume><year>2025</year><fpage>250</fpage><lpage>269</lpage></element-citation></ref><ref id="bib19"><label>19</label><element-citation publication-type="journal" id="sref19"><person-group person-group-type="author"><name name-style="western"><surname>Wei</surname><given-names>X.</given-names></name><name name-style="western"><surname>Zhao</surname><given-names>Y.</given-names></name><name name-style="western"><surname>Lu</surname><given-names>X.</given-names></name><etal/></person-group><article-title>A high-throughput method for monitoring growth of lettuce seedlings in greenhouses based on enhanced Mask2Former</article-title><source>Comput. Electron. Agric.</source><volume>227</volume><year>2024</year><object-id pub-id-type="publisher-id">109681</object-id></element-citation></ref><ref id="bib20"><label>20</label><element-citation publication-type="journal" id="sref20"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>Y.</given-names></name><name name-style="western"><surname>Li</surname><given-names>M.</given-names></name><name name-style="western"><surname>Li</surname><given-names>G.X.</given-names></name><etal/></person-group><article-title>Multi-phenotypic parameters extraction and biomass estimation for lettuce based on point clouds</article-title><source>Measurement</source><volume>204</volume><year>2022</year><object-id pub-id-type="publisher-id">112094</object-id></element-citation></ref><ref id="bib21"><label>21</label><element-citation publication-type="journal" id="sref21"><person-group person-group-type="author"><name name-style="western"><surname>Yu</surname><given-names>S.</given-names></name><name name-style="western"><surname>Fan</surname><given-names>J.</given-names></name><name name-style="western"><surname>Lu</surname><given-names>X.</given-names></name><etal/></person-group><article-title>Deep learning models based on hyperspectral data and time-series phenotypes for predicting quality attributes in lettuces under water stress</article-title><source>Comput. Electron. Agric.</source><volume>211</volume><year>2023</year><object-id pub-id-type="publisher-id">108034</object-id></element-citation></ref><ref id="bib22"><label>22</label><element-citation publication-type="journal" id="sref22"><person-group person-group-type="author"><name name-style="western"><surname>Zhao</surname><given-names>Y.</given-names></name><name name-style="western"><surname>Fan</surname><given-names>J.</given-names></name><name name-style="western"><surname>Lu</surname><given-names>X.</given-names></name><etal/></person-group><article-title>From leaf to canopy: Inversion of lettuce pigment distribution using hyperspectral imaging technology combined with deep learning algorithms</article-title><source>Plant Phenomics</source><volume>7</volume><year>2025</year><fpage>100104</fpage><pub-id pub-id-type="pmid">42041018</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1016/j.plaphe.2025.100104</pub-id><pub-id pub-id-type="pmcid">PMC13109311</pub-id></element-citation></ref><ref id="bib23"><label>23</label><element-citation publication-type="journal" id="sref23"><person-group person-group-type="author"><name name-style="western"><surname>Du</surname><given-names>J.</given-names></name><name name-style="western"><surname>Li</surname><given-names>B.</given-names></name><name name-style="western"><surname>Lu</surname><given-names>X.</given-names></name><etal/></person-group><article-title>Quantitative phenotyping and evaluation for lettuce leaves of multiple semantic components</article-title><source>Plant Methods</source><volume>18</volume><issue>1</issue><year>2022</year><fpage>54</fpage><pub-id pub-id-type="pmid">35468831</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1186/s13007-022-00890-2</pub-id><pub-id pub-id-type="pmcid">PMC9036747</pub-id></element-citation></ref><ref id="bib24"><label>24</label><element-citation publication-type="journal" id="sref24"><person-group person-group-type="author"><name name-style="western"><surname>Salehinia</surname><given-names>S.</given-names></name><name name-style="western"><surname>Didaran</surname><given-names>F.</given-names></name><name name-style="western"><surname>Aliniaeifard</surname><given-names>S.</given-names></name><etal/></person-group><article-title>Effects of different light spectra and intensities on stomatal function in lettuce and basil</article-title><source>J. Hortic. Res.</source><volume>33</volume><issue>1</issue><year>2025</year></element-citation></ref><ref id="bib25"><label>25</label><element-citation publication-type="other" id="sref25"><article-title>UPOV</article-title><ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://www.upov.int/edocs/mdocs/upov/en/tc_53/tg_13_11_proj_5.pdf" id="intref0020">https://www.upov.int/edocs/mdocs/upov/en/tc_53/tg_13_11_proj_5.pdf</ext-link></element-citation></ref><ref id="bib26"><label>26</label><element-citation publication-type="journal" id="sref26"><person-group person-group-type="author"><name name-style="western"><surname>Park</surname><given-names>J.S.</given-names></name><name name-style="western"><surname>Kang</surname><given-names>M.Y.</given-names></name><name name-style="western"><surname>Shim</surname><given-names>E.J.</given-names></name><etal/></person-group><article-title>Genome-wide core sets of SNP markers and Fluidigm assays for rapid and effective genotypic identification of Korean cultivars of lettuce (Lactuca sativa L.)</article-title><source>Horticulture Research</source><volume>9</volume><year>2022</year><fpage>uhac119</fpage><pub-id pub-id-type="pmid">35928401</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1093/hr/uhac119</pub-id><pub-id pub-id-type="pmcid">PMC9343917</pub-id></element-citation></ref><ref id="bib27"><label>27</label><element-citation publication-type="journal" id="sref27"><person-group person-group-type="author"><name name-style="western"><surname>Akbari</surname><given-names>A.</given-names></name><name name-style="western"><surname>Bahmani</surname><given-names>K.</given-names></name><name name-style="western"><surname>Kazan</surname><given-names>M.</given-names></name><etal/></person-group><article-title>Analysis of fennel breeding populations based on distinctness, uniformity, and stability (DUS) testing via morphological descriptors and DNA molecular markers</article-title><source>Genet. Resour. Crop Evol.</source><volume>72</volume><issue>1</issue><year>2025</year><fpage>325</fpage><lpage>342</lpage></element-citation></ref><ref id="bib28"><label>28</label><element-citation publication-type="journal" id="sref28"><person-group person-group-type="author"><name name-style="western"><surname>Song</surname><given-names>H.</given-names></name><name name-style="western"><surname>Wen</surname><given-names>W.</given-names></name><name name-style="western"><surname>Zhang</surname><given-names>Y.</given-names></name><etal/></person-group><article-title>Two-dimensional semantic morphological feature extraction and atlas construction of maize ear leaves</article-title><source>Front. Plant Sci.</source><volume>16</volume><year>2025</year><object-id pub-id-type="publisher-id">1520297</object-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.3389/fpls.2025.1520297</pub-id><pub-id pub-id-type="pmcid">PMC11861206</pub-id><pub-id pub-id-type="pmid">40012729</pub-id></element-citation></ref><ref id="bib29"><label>29</label><element-citation publication-type="journal" id="sref29"><person-group person-group-type="author"><name name-style="western"><surname>Feng</surname><given-names>H.</given-names></name><name name-style="western"><surname>Chen</surname><given-names>Y.</given-names></name><name name-style="western"><surname>Song</surname><given-names>J.</given-names></name><etal/></person-group><article-title>Maturity classification of rapeseed using hyperspectral image combined with machine learning</article-title><source>Plant Phenomics</source><volume>6</volume><year>2024</year><fpage>139</fpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.34133/plantphenomics.0139</pub-id><pub-id pub-id-type="pmcid">PMC10976948</pub-id><pub-id pub-id-type="pmid">38550661</pub-id></element-citation></ref><ref id="bib30"><label>30</label><element-citation publication-type="journal" id="sref30"><person-group person-group-type="author"><name name-style="western"><surname>He</surname><given-names>L.</given-names></name><name name-style="western"><surname>He</surname><given-names>L.</given-names></name><name name-style="western"><surname>Peng</surname><given-names>L.</given-names></name></person-group><article-title>CFormerFaceNet: efficient lightweight network merging a CNN and transformer for face recognition</article-title><source>Applied Sciences</source><volume>13</volume><issue>11</issue><year>2023</year><fpage>6506</fpage></element-citation></ref><ref id="bib31"><label>31</label><element-citation publication-type="journal" id="sref31"><person-group person-group-type="author"><name name-style="western"><surname>Ghani</surname><given-names>M.A.N.U.</given-names></name><name name-style="western"><surname>She</surname><given-names>K.</given-names></name><name name-style="western"><surname>Rauf</surname><given-names>M.A.</given-names></name><etal/></person-group><article-title>Enhancing security and privacy in distributed face recognition systems through blockchain and GAN technologies</article-title><source>Comput. Mater. Continua (CMC)</source><volume>79</volume><issue>2</issue><year>2024</year><fpage>2609</fpage><lpage>2623</lpage></element-citation></ref><ref id="bib32"><label>32</label><element-citation publication-type="journal" id="sref32"><person-group person-group-type="author"><name name-style="western"><surname>Gururaj</surname><given-names>H.L.</given-names></name><name name-style="western"><surname>Soundarya</surname><given-names>B.C.</given-names></name><name name-style="western"><surname>Priya</surname><given-names>S.</given-names></name><etal/></person-group><article-title>A comprehensive review of face recognition techniques, trends and challenges</article-title><source>IEEE Access</source><volume>12</volume><year>2024</year><fpage>107903</fpage><lpage>107926</lpage></element-citation></ref><ref id="bib33"><label>33</label><element-citation publication-type="journal" id="sref33"><person-group person-group-type="author"><name name-style="western"><surname>Lu</surname><given-names>W.</given-names></name><name name-style="western"><surname>Chen</surname><given-names>S.B.</given-names></name><name name-style="western"><surname>Ding</surname><given-names>C.H.Q.</given-names></name><etal/></person-group><article-title>Lwganet: a lightweight group attention backbone for remote sensing visual tasks</article-title><source>arxiv preprint arxiv:2501.10040</source><year>2025</year></element-citation></ref><ref id="bib34"><label>34</label><element-citation publication-type="book" id="sref34"><person-group person-group-type="author"><name name-style="western"><surname>Ouyang</surname><given-names>D.</given-names></name><name name-style="western"><surname>He</surname><given-names>S.</given-names></name><name name-style="western"><surname>Zhang</surname><given-names>G.</given-names></name><etal/></person-group><part-title>Efficient multi-scale Attention Module with cross-spatial learning[C]//ICASSP 2023-2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</part-title><year>2023</year><publisher-name>IEEE</publisher-name><fpage>1</fpage><lpage>5</lpage></element-citation></ref><ref id="bib35"><label>35</label><element-citation publication-type="journal" id="sref35"><person-group person-group-type="author"><name name-style="western"><surname>Lu</surname><given-names>W.</given-names></name><name name-style="western"><surname>Chen</surname><given-names>S.B.</given-names></name><name name-style="western"><surname>Tang</surname><given-names>J.</given-names></name><etal/></person-group><article-title>A robust feature downsampling module for remote-sensing visual tasks</article-title><source>IEEE Trans. Geosci. Rem. Sens.</source><volume>61</volume><year>2023</year><fpage>1</fpage><lpage>12</lpage></element-citation></ref><ref id="bib36"><label>36</label><element-citation publication-type="journal" id="sref36"><person-group person-group-type="author"><name name-style="western"><surname>Yang</surname><given-names>C.</given-names></name></person-group><article-title>Plant leaf recognition by integrating shape and texture features</article-title><source>Pattern Recogn.</source><volume>112</volume><year>2021</year><object-id pub-id-type="publisher-id">107809</object-id></element-citation></ref><ref id="bib37"><label>37</label><element-citation publication-type="journal" id="sref37"><person-group person-group-type="author"><name name-style="western"><surname>Alajlan</surname><given-names>N.</given-names></name><name name-style="western"><surname>El Rube</surname><given-names>I.</given-names></name><name name-style="western"><surname>Kamel</surname><given-names>M.S.</given-names></name><etal/></person-group><article-title>Shape retrieval using triangle-area representation and dynamic space warping</article-title><source>Pattern Recogn.</source><volume>40</volume><issue>7</issue><year>2007</year><fpage>1911</fpage><lpage>1920</lpage></element-citation></ref><ref id="bib38"><label>38</label><element-citation publication-type="book" id="sref38"><person-group person-group-type="author"><name name-style="western"><surname>Ahonen</surname><given-names>T.</given-names></name><name name-style="western"><surname>Matas</surname><given-names>J.</given-names></name><name name-style="western"><surname>He</surname><given-names>C.</given-names></name><etal/></person-group><part-title>Rotation invariant image description with local binary pattern histogram fourier features</part-title><source>Scandinavian Conference on Image Analysis</source><year>2009</year><publisher-name>Springer Berlin Heidelberg</publisher-name><publisher-loc>Berlin, Heidelberg</publisher-loc><fpage>61</fpage><lpage>70</lpage></element-citation></ref><ref id="bib39"><label>39</label><element-citation publication-type="journal" id="sref39"><person-group person-group-type="author"><name name-style="western"><surname>Zhao</surname><given-names>Y.</given-names></name><name name-style="western"><surname>Fan</surname><given-names>J.</given-names></name><name name-style="western"><surname>Yang</surname><given-names>S.</given-names></name><etal/></person-group><article-title>Exploring phenotypic differences and dynamic associations among lettuce types based on high-throughput phenotyping platform</article-title><source>Comput. Electron. Agric.</source><volume>236</volume><year>2025</year><object-id pub-id-type="publisher-id">110454</object-id></element-citation></ref><ref id="bib40"><label>40</label><element-citation publication-type="journal" id="sref40"><person-group person-group-type="author"><name name-style="western"><surname>Yuan</surname><given-names>H.</given-names></name><name name-style="western"><surname>Zhao</surname><given-names>T.</given-names></name><name name-style="western"><surname>Liu</surname><given-names>X.</given-names></name><etal/></person-group><article-title>Comprehensive evaluation and DNA fingerprints of liriodendron germplasm accessions based on phenotypic traits and SNP markers</article-title><source>Plants</source><volume>14</volume><issue>17</issue><year>2025</year><fpage>2626</fpage><pub-id pub-id-type="pmid">40941795</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.3390/plants14172626</pub-id><pub-id pub-id-type="pmcid">PMC12430399</pub-id></element-citation></ref><ref id="bib41"><label>41</label><element-citation publication-type="journal" id="sref41"><person-group person-group-type="author"><name name-style="western"><surname>Montanaro</surname><given-names>G.</given-names></name><name name-style="western"><surname>Carlomagno</surname><given-names>A.</given-names></name><name name-style="western"><surname>Giorio</surname><given-names>P.</given-names></name><etal/></person-group><article-title>Are leaf chlorophyll fluorescence and Dark Green stressor-specific fingerprints in grapevine under drought or salt stress? A reanalysis study</article-title><source>Plant Stress</source><year>2025</year><object-id pub-id-type="publisher-id">100948</object-id></element-citation></ref><ref id="bib42"><label>42</label><element-citation publication-type="book" id="sref42"><person-group person-group-type="author"><name name-style="western"><surname>Akiba</surname><given-names>T.</given-names></name><name name-style="western"><surname>Sano</surname><given-names>S.</given-names></name><name name-style="western"><surname>Yanase</surname><given-names>T.</given-names></name><etal/></person-group><part-title>Optuna: a next-generation hyperparameter optimization framework</part-title><source>Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</source><year>2019</year><fpage>2623</fpage><lpage>2631</lpage></element-citation></ref><ref id="bib43"><label>43</label><element-citation publication-type="journal" id="sref43"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>L.</given-names></name><name name-style="western"><surname>Wang</surname><given-names>M.</given-names></name><name name-style="western"><surname>Jiang</surname><given-names>Y.</given-names></name><etal/></person-group><article-title>SSRDet: small object detection based on feature pyramid network</article-title><source>IEEE Access</source><volume>11</volume><year>2023</year><fpage>96743</fpage><lpage>96752</lpage></element-citation></ref><ref id="bib44"><label>44</label><element-citation publication-type="journal" id="sref44"><person-group person-group-type="author"><name name-style="western"><surname>Yang</surname><given-names>J.</given-names></name><name name-style="western"><surname>Du</surname><given-names>B.</given-names></name><name name-style="western"><surname>Xu</surname><given-names>Y.</given-names></name><etal/></person-group><article-title>Can spectral information work while extracting spatial distribution?—An online spectral information compensation network for HSI classification</article-title><source>IEEE Trans. Image Process.</source><volume>32</volume><year>2023</year><fpage>2360</fpage><lpage>2373</lpage><pub-id pub-id-type="pmid">37027546</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1109/TIP.2023.3244414</pub-id></element-citation></ref><ref id="bib45"><label>45</label><element-citation publication-type="journal" id="sref45"><person-group person-group-type="author"><name name-style="western"><surname>Shi</surname><given-names>J.</given-names></name></person-group><article-title>RPT: an integrated root phenotyping toolbox for segmenting and quantifying root system architecture</article-title><source>Plant Biotechnol. J.</source><volume>23</volume><issue>6</issue><year>2025</year><fpage>2095</fpage><lpage>2109</lpage><pub-id pub-id-type="pmid">40074292</pub-id><pub-id pub-id-type="doi" assigning-authority="pmc">10.1111/pbi.70040</pub-id><pub-id pub-id-type="pmcid">PMC12120892</pub-id></element-citation></ref><ref id="bib46"><label>46</label><element-citation publication-type="journal" id="sref46"><person-group person-group-type="author"><name name-style="western"><surname>Khoroshevsky</surname><given-names>F.</given-names></name><name name-style="western"><surname>Zhou</surname><given-names>K.</given-names></name><name name-style="western"><surname>Chemweno</surname><given-names>S.</given-names></name><etal/></person-group><article-title>Automatic root length estimation from images acquired in situ without segmentation</article-title><source>Plant Phenomics</source><volume>6</volume><year>2024</year><fpage>132</fpage><pub-id pub-id-type="doi" assigning-authority="pmc">10.34133/plantphenomics.0132</pub-id><pub-id pub-id-type="pmcid">PMC10790720</pub-id><pub-id pub-id-type="pmid">38230354</pub-id></element-citation></ref><ref id="bib47"><label>47</label><element-citation publication-type="journal" id="sref47"><person-group person-group-type="author"><name name-style="western"><surname>Qin</surname><given-names>Y.M.</given-names></name><name name-style="western"><surname>Tu</surname><given-names>Y.H.</given-names></name><name name-style="western"><surname>Li</surname><given-names>T.</given-names></name><etal/></person-group><article-title>Deep Learning for sustainable agriculture: a systematic review on applications in lettuce cultivation</article-title><source>Sustainability</source><volume>17</volume><issue>7</issue><year>2025</year><fpage>3190</fpage></element-citation></ref><ref id="bib48"><label>48</label><element-citation publication-type="journal" id="sref48"><person-group person-group-type="author"><name name-style="western"><surname>Dilillo</surname><given-names>N.</given-names></name><name name-style="western"><surname>Sanna</surname><given-names>A.</given-names></name><name name-style="western"><surname>Belcore</surname><given-names>E.</given-names></name><etal/></person-group><article-title>Enhancing lettuce classification: optimizing spectral wavelength selection via CCARS and PLS-DA</article-title><source>Smart Agric. Technol.</source><year>2025</year><object-id pub-id-type="publisher-id">100962</object-id></element-citation></ref><ref id="bib49"><label>49</label><element-citation publication-type="journal" id="sref49"><person-group person-group-type="author"><name name-style="western"><surname>Ge</surname><given-names>X.</given-names></name><name name-style="western"><surname>Wu</surname><given-names>S.</given-names></name><name name-style="western"><surname>Wen</surname><given-names>W.</given-names></name><etal/></person-group><article-title>LettuceP3D: a tool for analysing 3D phenotypes of individual lettuce plants</article-title><source>Biosyst. Eng.</source><volume>251</volume><year>2025</year><fpage>73</fpage><lpage>88</lpage></element-citation></ref><ref id="bib50"><label>50</label><element-citation publication-type="journal" id="sref50"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>J.</given-names></name><name name-style="western"><surname>Yang</surname><given-names>J.</given-names></name><name name-style="western"><surname>Fu</surname><given-names>S.</given-names></name><etal/></person-group><article-title>Comparison of DUS testing and SNP fingerprinting for variety identification in cucumber</article-title><source>Hortic. Plant J.</source><volume>8</volume><issue>5</issue><year>2022</year><fpage>575</fpage><lpage>582</lpage></element-citation></ref><ref id="bib51"><label>51</label><element-citation publication-type="journal" id="sref51"><person-group person-group-type="author"><name name-style="western"><surname>Zhang</surname><given-names>J.</given-names></name><name name-style="western"><surname>Ren</surname><given-names>J.</given-names></name><name name-style="western"><surname>Yang</surname><given-names>J.</given-names></name><etal/></person-group><article-title>Evaluation of SNP fingerprinting for variety identification of tomato by DUS testing</article-title><source>Agriculture Communications</source><volume>1</volume><issue>1</issue><year>2023</year><object-id pub-id-type="publisher-id">100006</object-id></element-citation></ref></ref-list><sec id="appsec1" sec-type="supplementary-material"><label>Appendix A</label><title>Supplementary data</title><p id="p0420">The following is the Supplementary data to this article:<supplementary-material content-type="local-data" id="mmc1" position="float" orientation="portrait"><caption><title>Multimedia component 1</title></caption><media xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="mmc1.docx" position="float" orientation="portrait"><?suppdata-name mmc1.docx?><?suppdata-size 5610701?><?suppdata-md5 e37ae83110b85d1895baa242f023c0d3?><?suppdata-image-server-status NEVER_LOAD?><?suppdata-mime-type application?><?suppdata-mime-sub-type vnd.openxmlformats-officedocument.wordprocessingml.document?><?suppdata-cloudpmc-urn urn:app:3ed9/13316521/e37ae83110b8/mmc1.docx?><alt-text>Multimedia component 1</alt-text></media></supplementary-material></p></sec><fn-group><fn id="appsec2" fn-type="supplementary-material"><label>Appendix A</label><p id="p0425">Supplementary data to this article can be found online at <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.plaphe.2026.100197" id="intref0015">https://doi.org/10.1016/j.plaphe.2026.100197</ext-link>.</p></fn></fn-group></back></article>