Xiaoyi Jiang

An experimental comparison of range image segmentation algorithms

A methodology for evaluating range image segmentation algorithms is proposed. This methodology involves (1) a common set of 40 laser range finder images and 40 structured light scanner images that have manually specified ground truth and (2) a set of defined performance metrics for instances of correctly segmented, missed, and noise regions, over- and under-segmentation, and accuracy of the recovered geometry. A tool is used to objectively compare a machine generated segmentation against the specified ground truth. Four research groups have contributed to evaluate their own algorithm for segmenting a range image into planar patches.

Adaptive local thresholding by verification-based multithreshold probing with application to vessel detection in retinal images

In this paper, we propose a general framework of adaptive local thresholding based on a verification-based multithreshold probing scheme. Object hypotheses are generated by binarization using hypothetic thresholds and accepted/rejected by a verification procedure. The application-dependent verification procedure can be designed to fully utilize all relevant informations about the objects of interest. In this sense, our approach is regarded as knowledge-guided adaptive thresholding, in contrast to most algorithms known from the literature. We apply our general framework to detect vessels in retinal images. An experimental evaluation demonstrates superior performance over global thresholding and a vessel detection method recently reported in the literature. Due to its simplicity and general nature, our novel approach is expected to be applicable to a variety of other applications.

Edge Detection in Range Images Based on Scan Line Approximation

In this paper we present a novel edge detection algorithm for range images based on a scan line approximation technique. Compared to the known methods in the literature, our algorithm has a number of advantages. It provides edge strength measures that have a straightforward geometric interpretation and supports a classification of edge points into several subtypes. We give a definition of optimal edge detectors and compare our algorithm to this theoretical model. We have carried out extensive tests using real range images acquired by four range scanners with quite different characteristics. Using a simple contour closure technique, we show that our edge detection method is able to achieve a complete range image segmentation into regions. This edge-based segmentation approach turns out to be superior to many region-based methods with regard to both segmentation quality and computational efficiency. The good results that were achieved demonstrate the practical usefulness of our edge detection algorithm.

An median graphs: properties, algorithms, and applications

In object prototype learning and similar tasks, median computation is an important technique for capturing the essential information of a given set of patterns. We extend the median concept to the domain of graphs. In terms of graph distance, we introduce the novel concepts of set median and generalized median of a set of graphs. We study properties of both types of median graphs. For the more complex task of computing generalized median graphs, a genetic search algorithm is developed. Experiments conducted on randomly generated graphs demonstrate the advantage of generalized median graphs compared to set median graphs and the ability of our genetic algorithm to find approximate generalized median graphs in reasonable time. Application examples with both synthetic and nonsynthetic data are shown to illustrate the practical usefulness of the concept of median graphs.

Lung motion correction on respiratory gated 3-D PET/CT images

Motion is a source of degradation in positron emission tomography (PET)/computed tomography (CT) images. As the PET images represent the sum of information over the whole respiratory cycle, attenuation correction with the help of CT images may lead to false staging or quantification of the radioactive uptake especially in the case of small tumors. We present an approach avoiding these difficulties by respiratory-gating the PET data and correcting it for motion with optical flow algorithms. The resulting dataset contains all the PET information and minimal motion and, thus, allows more accurate attenuation correction and quantification.

Respiratory Motion Correction in 3-D PET Data With Advanced Optical Flow Algorithms

The problem of motion is well known in positron emission tomography (PET) studies. The PET images are formed over an elongated period of time. As the patients cannot hold breath during the PET acquisition, spatial blurring and motion artifacts are the natural result. These may lead to wrong quantification of the radioactive uptake. We present a solution to this problem by respiratory-gating the PET data and correcting the PET images for motion with optical flow algorithms. The algorithm is based on the combined local and global optical flow algorithm with modifications to allow for discontinuity preservation across organ boundaries and for application to 3-D volume sets. The superiority of the algorithm over previous work is demonstrated on software phantom and real patient data.

Simple and fast computation of moments

Abstract In this paper we address the problem of efficient computation of moments from the boundary of a digital area. Boundary-based computation is superior to usual region-based approaches as the data dimension of boundary representations is substantially smaller than that of region representations. We investigate the inter-order relationship of moments. One of our results is that moments of higher order can be computed from moments of lower order. Based on this relationship a simple iterative algorithm is proposed for the computation of moments from a polygonal approximation of the boundary. In comparison with a direct computation method, our algorithm is simpler to program. The memory requirement is minimum. Simulation results show that a speed-up of factor 8 can be achieved using our algorithm. A special version of the algorithm can be utilized to compute moments from the run-length chain code of the boundary. Our algorithm can be applied to compute the most popular geometric moments as well as other types of moments like Legendre, Zernike, rotational and complex moments.

Face recognition using range images

A system for face recognition using range images as input data is described. The range data acquisition procedure is based on the coded light approach, merging range images that are recorded by two separate sensors. Two approaches, which are known from face recognition based on grey level images have been extended to dealing with range images. These approaches are based on eigenfaces and hidden Markov models, respectively. Experimental results on a database with various range images from 24 persons show very promising results for both recognition methods.

Motion Correction in Dual Gated Cardiac PET Using Mass-Preserving Image Registration

Respiratory and cardiac motion leads to image degradation in positron emission tomography (PET) studies of the human heart. In this paper we present a novel approach to motion correction based on dual gating and mass-preserving hyperelastic image registration. Thereby, we account for intensity modulations caused by the highly nonrigid cardiac motion. This leads to accurate and realistic motion estimates which are quantitatively validated on software phantom data and carried over to clinically relevant data using a hardware phantom. For patient data, the proposed method is first evaluated in a high statistic (20 min scans) dual gating study of 21 patients. It is shown that the proposed approach properly corrects PET images for dual-cardiac as well as respiratory-motion. In a second study the list mode data of the same patients is cropped to a scan time reasonable for clinical practice (3 min). This low statistic study not only shows the clinical applicability of our method but also demonstrates its robustness against noise obtained by hyperelastic regularization.

Distance measures for image segmentation evaluation

The task considered in this paper is performance evaluation of region segmentation algorithms in the ground-truth-based paradigm. Given a machine segmentation and a ground-truth segmentation, performance measures are needed. We propose to consider the image segmentation problem as one of data clustering and, as a consequence, to use measures for comparing clusterings developed in statistics and machine learning. By doing so, we obtain a variety of performance measures which have not been used before in image processing. In particular, some of these measures have the highly desired property of being a metric. Experimental results are reported on both synthetic and real data to validate the measures and compare them with others.