Medical Image Analysis of Image Segmentation and Registration Techniques

Abstract:Technology breakthroughs in high-speed, high-capacity, and high performance desk-top computers and workstations make the possibility of integrating multimedia medical data to better support clinical decision making, computer-aided education, and research not only attractive, but feasible. To systematically evaluate results from increasingly automated image segmentation it is necessary to correlate them with the expert judgments of radiologists and other clinical specialists interpreting the images. These are contained in increasingly computerized radiological reports and other related clinical records. But to make automated comparison feasible it is necessary to first ensure compatibility of the knowledge content of images with the descriptions contained in these records. Enough common vocabulary, language, and knowledge representation components must be represented on the computer, followed by automated extraction of image-content descriptions from the text, which can then be matched to the results of automated image segmentation. A knowledge-based approach to image segmentation is essential to obtain the structured image descriptions needed for matching against the expert’s descriptions. We have developed a new approach to medical image analysis which helps generate such descriptions: a knowledge-based object-centered hierarchical planning method for automatically composing the image analysis processes. The problem-solving steps of specialists are represented at the knowledge level in terms of goals, tasks, and domain objects and concepts separately from the implementation level for specific representations of different image types, and generic analysis methods. This system can serve as a major functional component in incrementally building and updating a structured and integrated hybrid information system of patient data. This approach has been tested for magnetic resonance image interpretation, and has achieved promising results.

Download Full-text

Medical Image Segmentation based on U-Net: A Review

Journal of Imaging Science and Technology ◽

10.2352/j.imagingsci.technol.2020.64.2.020508 ◽

2020 ◽

Vol 64 (2) ◽

pp. 20508-1-20508-12 ◽

Cited By ~ 1

Author(s):

Getao Du ◽

Xu Cao ◽

Jimin Liang ◽

Xueli Chen ◽

Yonghua Zhan

Keyword(s):

Neural Network ◽

Image Analysis ◽

Image Segmentation ◽

Deep Learning ◽

Medical Imaging ◽

Medical Image ◽

Medical Images ◽

Medical Image Analysis ◽

Medical Image Segmentation ◽

Imaging Systems

Abstract Medical image analysis is performed by analyzing images obtained by medical imaging systems to solve clinical problems. The purpose is to extract effective information and improve the level of clinical diagnosis. In recent years, automatic segmentation based on deep learning (DL) methods has been widely used, where a neural network can automatically learn image features, which is in sharp contrast with the traditional manual learning method. U-net is one of the most important semantic segmentation frameworks for a convolutional neural network (CNN). It is widely used in the medical image analysis domain for lesion segmentation, anatomical segmentation, and classification. The advantage of this network framework is that it can not only accurately segment the desired feature target and effectively process and objectively evaluate medical images but also help to improve accuracy in the diagnosis by medical images. Therefore, this article presents a literature review of medical image segmentation based on U-net, focusing on the successful segmentation experience of U-net for different lesion regions in six medical imaging systems. Along with the latest advances in DL, this article introduces the method of combining the original U-net architecture with deep learning and a method for improving the U-net network.

Download Full-text

An interactive image segmentation method based on dynamic programming and its application in medical image analysis

Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170) ◽

10.1109/icpr.1998.712007 ◽

2002 ◽

Cited By ~ 1

Author(s):

Zhuge Ying ◽

Tian Jie ◽

Liu NingNing ◽

Hu ZhiGang ◽

Dai RuWei

Keyword(s):

Image Analysis ◽

Dynamic Programming ◽

Image Segmentation ◽

Medical Image ◽

Medical Image Analysis ◽

Segmentation Method ◽

Interactive Image Segmentation

Download Full-text

A Hierarchical Topological Knowledge Based Image Segmentation Approach Optimizing the use of Contextual Regions of Interest : Illustration for Medical Image Analysis

2006 International Conference on Image Processing ◽

10.1109/icip.2006.312517 ◽

2006 ◽

Author(s):

Jean-baptiste Fasquel ◽

Vincent Agnus ◽

Luc Soler ◽

Jacques Marescaux

Keyword(s):

Image Analysis ◽

Image Segmentation ◽

Medical Image ◽

Medical Image Analysis ◽

Regions Of Interest ◽

Knowledge Based ◽

Segmentation Approach

Download Full-text

Visualization and Haptics for Interactive Medical Image Analysis: Image Segmentation in Cranio-Maxillofacial Surgery Planning

Lecture Notes in Computer Science - Visual Informatics: Sustaining Research and Innovations ◽

10.1007/978-3-642-25191-7_1 ◽

2011 ◽

pp. 1-12 ◽

Cited By ~ 7

Author(s):

Ingela Nyström ◽

Johan Nysjö ◽

Filip Malmberg

Keyword(s):

Image Analysis ◽

Image Segmentation ◽

Medical Image ◽

Medical Image Analysis ◽

Maxillofacial Surgery ◽

Surgery Planning

Download Full-text

ITK Tutorial Presentation Slides

The Insight Journal ◽

10.54294/ufyfho ◽

2006 ◽

Author(s):

Luis Ibanez ◽

Lydia Ng ◽

Josh Cates ◽

Stephen Aylward ◽

Bill Lorensen ◽

...

Keyword(s):

Image Processing ◽

Image Analysis ◽

Image Segmentation ◽

Open Source ◽

Medical Image ◽

Medical Image Analysis ◽

Data Representation ◽

Medical Image Segmentation ◽

Object Oriented Programming ◽

Application Development

This course introduces attendees to select open-source efforts in the field of medical image analysis. Opportunities for users and developers are presented. The course particularly focuses on the open-source Insight Toolkit (ITK) for medical image segmentation and registration. The course describes the procedure for downloading and installing the toolkit and covers the use of its data representation and filtering classes. Attendees are shown how ITK can be used in their research, rapid prototyping, and application development.LEARNING OUTCOMES After completing this course, attendees will be able to: contribute to and benefit from open-source software for medical image analysis download and install the ITK toolkit start their own software project based on ITK design and construct an image processing pipeline combine ITK filters for medical image segmentation combine ITK components for medical image registrationINTENDED AUDIENCE This course is intended for anyone involved in medical image analysis. In particular it targets graduate students, researchers and professionals in the areas of computer science and medicine. Attendees should have an intermediate level on object oriented programming with C++ and must be familiar with the basics of medical image processing and analysis.

Download Full-text

Combinatorial Double Auction Based Meta-scheduler for Medical Image Analysis Application in Grid Environment

Recent Advances in Computer Science and Communications ◽

10.2174/2213275911666190320161934 ◽

2020 ◽

Vol 13 (5) ◽

pp. 999-1007

Author(s):

Karthikeyan Periyasami ◽

Arul Xavier Viswanathan Mariammal ◽

Iwin Thanakumar Joseph ◽

Velliangiri Sarveshwaran

Keyword(s):

Image Analysis ◽

Medical Image ◽

Medical Image Analysis ◽

Grid Resource ◽

Resource Broker ◽

Analysis Application ◽

Local Grid ◽

Grid Resource Broker ◽

Global Grid ◽

Grid Site

Background: Medical image analysis application has complex resource requirement. Scheduling Medical image analysis application is the complex task to the grid resources. It is necessary to develop a new model to improve the breast cancer screening process. Proposed novel Meta scheduler algorithm allocate the image analyse applications to the local schedulers and local scheduler submit the job to the grid node which analyses the medical image and generates the result sent back to Meta scheduler. Meta schedulers are distinct from the local scheduler. Meta scheduler and local scheduler have the aim at resource allocation and management. Objective: The main objective of the CDAM meta-scheduler is to maximize the number of jobs accepted. Methods: In the beginning, the user sends jobs with the deadline to the global grid resource broker. Resource providers sent information about the available resources connected in the network at a fixed interval of time to the global grid resource broker, the information such as valuation of the resource and number of an available free resource. CDAM requests the global grid resource broker for available resources details and user jobs. After receiving the information from the global grid resource broker, it matches the job with the resources. CDAM sends jobs to the local scheduler and local scheduler schedule the job to the local grid site. Local grid site executes the jobs and sends the result back to the CDAM. Success full completion of the job status and resource status are updated into the auction history database. CDAM collect the result from all local grid site and return to the grid users. Results: The CDAM was simulated using grid simulator. Number of jobs increases then the percentage of the jobs accepted also decrease due to the scarcity of resources. CDAM is providing 2% to 5% better result than Fair share Meta scheduling algorithm. CDAM algorithm bid density value is generated based on the user requirement and user history and ask value is generated from the resource details. Users who, having the most significant deadline are generated the highest bid value, grid resource which is having the fastest processor are generated lowest ask value. The highest bid is assigned to the lowest Ask it means that the user who is having the most significant deadline is assigned to the grid resource which is having the fastest processor. The deadline represents a time by which the user requires the result. The user can define the deadline by which the results are needed, and the CDAM will try to find the fastest resource available in order to meet the user-defined deadline. If the scheduler detects that the tasks cannot be completed before the deadline, then the scheduler abandons the current resource, tries to select the next fastest resource and tries until the completion of application meets the deadline. CDAM is providing 25% better result than grid way Meta scheduler this is because grid way Meta scheduler allocate jobs to the resource based on the first come first served policy. Conclusion: The proposed CDAM model was validated through simulation and was evaluated based on jobs accepted. The experimental results clearly show that the CDAM model maximizes the number of jobs accepted than conventional Meta scheduler. We conclude that a CDAM is highly effective meta-scheduler systems and can be used for an extraordinary situation where jobs have a combinatorial requirement.

Download Full-text