Teleoperation is currently the dominant form of instrument control for surgical robotics. For example, the mechanical masters in the da Vinci surgical system provides a stable, precise interface for teleoperation, allowing execution of delicate tasks in complex surgical procedures. However, conventional teleoperation also adds the complexity of false feedback to the user from the interaction of the master manipulators with each other and other elements of the surgical console. Conventional teleoperation also has other inherent performance and accuracy limitations due to the mechanical devices integrated in such a system. As an alternative, we outline a hands-free system that could be improved without significant hardware redesign, and provide a sterile master workspace. Our ReachIN prototype is implemented by extending the Johns Hopkins University Surgical Assistant Workstation (SAW) framework to include additional vision interfaces and control methods. We present the design of this prototype and results from initial validation experiments.

ReachIN: A Modular Vision Based Interface for Teleoperation

This document describes a project that can compare many images simultaneously in a synchronized manner. Such an application can be used in any ITK/VTK image processing pipelines; the programmer can use it to quickly visualize and compare intermediate results of used filters within the pipeline.The goals of this project are two folds: (i) to be integrated in gdb pretty debuggers (for visual debugging of ITK pipelines), and, (ii) to provide a visual comparison widget for image-to-image plugins (ITK or VTK based filters).
This project is part of the Gofigure2 development effort, an open-source, cross-platform application for visualizing, processing and analyzing of multidimensional microscopy data. 

A simple Qt based comparison program for ITK and VTK images.

Research and development of image guided surgery techniques requires software that provides a high degree of flexibility, with easy access to reliable functionality for common tasks. The goal of this paper is to highlight this claim in the context of image guided cardiac surgery applications. Cardiac surgery traditionally involves very invasive surgical procedures. Minimally invasive surgical techniques can greatly reduce the invasiveness of these procedures, thus reducing patient trauma. Implementing new image guidance systems for cardiac surgery is a complex process, requiring the integration of a wide variety of physical and software systems, involving both research and clinical personnel. Modular software design is essential to accommodate this complexity. Furthermore, software architecture must be highly flexible in order to facilitate both the adaptability necessary in research, and the tested reliability needed for clinical applications. Over the past decade, our laboratory has created a comprehensive system for research and development, testing and implementation of new surgical guidance techniques in the operating room. This paper provides an overview of our approach to the development and implementation of image guided therapy software for cardiovascular surgeries, ranging from the simple (needle guidance for central line access) to highly complex and experimental (intracardiac beating heart mitral valve repair/replacement). 

Flexible architecture and modularity requirements for image guided cardiovascular surgeries

This paper describes implementation of local structure tensor and anisotropic enhancement diffusion filters using the Insight Toolkit. The anisotropic diffusion filters are implemented using ITK's finite difference solver framework. The filters are used to implement the 3D edge-enhancing diffusion ( EED), coherence-enhancing diffusion (CED) and hybrid diffusion with continuous switch(HDCS) noise filtering algorithms described in Mendrik et al[1].

The most up-to-date version of the code presented in this paper is distributed with the TubeTK project:
http://public.kitware.com/Wiki/TubeTK


Implementation of local structure tensor and enhancement anisotropic diffusion filters in ITK

This documents describes the filter itk::HistogramMatchingQuadEdgeMeshFilter. It takes an input (source) mesh and a reference mesh, normalizes the scalar values between two meshes by histogram matching, and generates an output mesh which has a similar histogram as the input mesh. 
This paper is accompanied with the source code, input data, parameters and output data that we used for validating the algorithm described in this paper. This adheres to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.

Histogram Matching Mesh Filter

This documents is about the filter itk::RescaleScalarsQuadEdgeMeshFilter. It
does the point-wise linear transformation to the scalar values of the input
mesh. This paper is accompanied with the source code, input data, parameters and output data that we used for validating the algorithm described in this paper. This adheres to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.

Rescale Scalars Mesh Filter

This article describes the filter itk::AssignScalarValuesQuadEdgeMeshFilter. It takes two meshes, one as an input and the other as a source to assign scalar values of the nodes from the source mesh to the input mesh. Both of the two meshes should have the same number of nodes. This paper is accompanied with the source code, input data, parameters and output data that we used for validating the algorithm described in this paper. This adheres to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.

Assign Scalars Mesh Filter

This documents is about the filter itk::ScalarQuadEdgeMeshToListAdaptor. It takes the input mesh and generates a list of measurement vectors according to the scalars of the mesh. The list can be fed into itk::Statistics::SampleToHistogramFilter [1, 2] to generate a histogram about the scalars on the input mesh.
This paper is accompanied with the source code, input data, parameters and output data that we used for validating the algorithm described in this paper. This adheres to the fundamental principle that scientific publications must facilitate reproducibility of the reported results.

Mesh To List Adaptor

The deconvolution, also called deblurring, tries to revert the optical distortion introduced during the aquisition of the image. It is a family of image processing which can be classed in the larger family of image restoration.
Deconvolution is a very difficult problem, and many algorithms have been proposed to solve it, with different strenght and weakness which may depend on the context where they are used. As a consequence, it is desirable to have several algorithms available when trying to restore some images. The different algorithms are often built on a similar principle, making possible to share a large part of their API in their implementation. Also, the most generic operations related to deconvolution should be reusable in order to avoid code duplication and ease the implementation of new algorithms.

In this contribution, the infrastructure for the implementation of several deconvolution algorithms is proposed. Based on this infrastructure, twelve simple deconvolution algorithms of reference are also provided.


Deconvolution: infrastructure and reference algorithms

The development of segmentation algorithms for liver tumors in CT scans has found growing attention in recent years. The validation of these methods, however, is often treated as a subordinate task. In this article, we review existing approaches and present rst steps towards a new methodology that evaluates the quality of an algorithm in relation to the variability of manual delineations. We obtained three manual segmentations for 50 liver lesions and computed the results of a segmentation algorithm. We compared all four masks with each other and with different ground truth estimates and calculated scores according to the validation framework from the MICCAI challenge 2008. Our results show some cases where this more elaborate evaluation reflects the segmentation quality in a more adequate way than traditional approaches. The concepts can also be extended to other similar segmentation problems.