IDEAS home Printed from https://ideas.repec.org/a/hin/complx/7093011.html
   My bibliography  Save this article

Two-Dimensional Lattice Complexity Features of Abdominal CT Images to Predict Patient Survival After Hepatectomy for Hepatocellular Carcinoma

Author

Listed:
  • Yu Wang
  • Xiaoqiong Jiang
  • Shi Xu
  • Daguan Ke
  • Ruixia Wu
  • Roberto Natella

Abstract

To evaluate the effectiveness of certain complexity features extracted from CT images of the liver for predicting the survival of patients with hepatocellular carcinoma, either exclusively or in conjunction with specific diagnostic indicators, we gathered data from presurgery CT scans of 103 HCC patients with survival period either above (n = 65) or below (n = 38) 42 months after hepatectomy. The two-dimensional Hilbert curve was used to maintain both local and global structural information to calculate the lattice complexity features. In addition, gray-level co-occurrence matrix features and local binary features were incorporated. These features were assessed for performance of support vector machine predictive models through the receiver operator characteristic curve and area under the curve. The top proficiency was achieved by the lattice complexity features resulting in models with an accuracy of 76.47% and an area under the receiver operator characteristic curve of 0.75. The study found that two-dimensional lattice complexity features derived from CT images that covered the entire abdomen have the potential to predict survival patients with in hepatocellular carcinoma using support vector machine models.

Suggested Citation

  • Yu Wang & Xiaoqiong Jiang & Shi Xu & Daguan Ke & Ruixia Wu & Roberto Natella, 2024. "Two-Dimensional Lattice Complexity Features of Abdominal CT Images to Predict Patient Survival After Hepatectomy for Hepatocellular Carcinoma," Complexity, Hindawi, vol. 2024, pages 1-11, August.
  • Handle: RePEc:hin:complx:7093011
    DOI: 10.1155/2024/7093011
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2024/7093011.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2024/7093011.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2024/7093011?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:7093011. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.