2D Reconstruction of Small Intestine's Interior Wall

Examining and interpreting of a large number of wireless endoscopic images from the gastrointestinal tract is a tiresome task for physicians. A practical solution is to automatically construct a two dimensional representation of the gastrointestinal tract for easy inspection. However, little has been done on wireless endoscopic image stitching, let alone systematic investigation. The proposed new wireless endoscopic image stitching method consists of two main steps to improve the accuracy and efficiency of image registration. First, the keypoints are extracted by Principle Component Analysis and Scale Invariant Feature Transform (PCA-SIFT) algorithm and refined with Maximum Likelihood Estimation SAmple Consensus (MLESAC) outlier removal to find the most reliable keypoints. Second, the optimal transformation parameters obtained from first step are fed to the Normalised Mutual Information (NMI) algorithm as an initial solution. With modified Marquardt-Levenberg search strategy in a multiscale framework, the NMI can find the optimal transformation parameters in the shortest time. The proposed methodology has been tested on two different datasets - one with real wireless endoscopic images and another with images obtained from Micro-Ball (a new wireless cubic endoscopy system with six image sensors). The results have demonstrated the accuracy and robustness of the proposed methodology both visually and quantitatively.Comment: Journal draf

Annual Forest Monitoring as part of Indonesia's National Carbon Accounting System

Land use and forest change, in particular deforestation, have contributed the largest proportion of Indonesia’s estimated greenhouse gas emissions. Indonesia’s remaining forests store globally significant carbon stocks, as well as biodiversity values. In 2010, the Government of Indonesia entered into a REDD+ partnership. A spatially detailed monitoring and reporting system for forest change which is national and operating in Indonesia is required for participation in such programs, as well as for national policy reasons including Monitoring, Reporting, and Verification (MRV), carbon accounting, and land-use and policy information. Indonesia’s National Carbon Accounting System (INCAS) has been designed to meet national and international policy requirements. The INCAS remote sensing program is producing spatially-detailed annual wall-to-wall monitoring of forest cover changes from time-series Landsat imagery for the whole of Indonesia from 2000 to the present day. Work on the program commenced in 2009, under the Indonesia-Australia Forest Carbon Partnership. A principal objective was to build an operational system in Indonesia through transfer of knowledge and experience, from Australia’s National Carbon Accounting System, and adaptation of this experience to Indonesia’s requirements and conditions. A semi-automated system of image pre-processing (ortho-rectification, calibration, cloud masking and mosaicing) and forest extent and change mapping (supervised classification of a ‘base’ year, semi-automated single-year classifications and classification within a multi-temporal probabilistic framework) was developed for Landsat 5 TM and Landsat 7 ETM+. Particular attention is paid to the accuracy of each step in the processing. With the advent of Landsat 8 data and parallel development of processing capability, capacity and international collaborations within the LAPAN Data Centre this processing is being increasingly automated. Research is continuing into improved processing methodology and integration of information from other data sources. This paper presents technical elements of the INCAS remote sensing program and some results of the 2000 – 2012 mapping

Two plus one is almost three: a fast approximation for multi-view deconvolution

Multi-view deconvolution is a powerful image-processing tool for light sheet fluorescence microscopy, providing isotropic resolution and enhancing the image content. However, performing these calculations on large datasets is computationally demanding and time-consuming even on high-end workstations. Especially in long-time measurements on developing animals, huge amounts of image data are acquired. To keep them manageable, redundancies should be removed right after image acquisition. To this end, we report a fast approximation to three-dimensional multi-view deconvolution, denoted 2D+1D multi-view deconvolution, which is able to keep up with the data flow. It first operates on the two dimensions perpendicular and subsequently on the one parallel to the rotation axis, exploiting the rotational symmetry of the point spread function along the rotation axis. We validated our algorithm and evaluated it quantitatively against two-dimensional and three-dimensional multi-view deconvolution using simulated and real image data. 2D+1D multi-view deconvolution takes similar computation time but performs markedly better than the two-dimensional approximation only. Therefore, it will be most useful for image processing in time-critical applications, where the full 3D multi-view deconvolution cannot keep up with the data flow

A Low-Complexity Mosaicing Algorithm for Stock Assessment of Seabed-Burrowing Species

Peer-reviewed This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. Manuscript received January 27, 2017; revised August 17, 2017 and December 27, 2017; accepted February 16, 2018. Published in: IEEE Journal of Oceanic Engineering ( Early Access ) DOI: 10.1109/JOE.2018.2808973This paper proposes an algorithm for mosaicing videos generated during stock assessment of seabed-burrowing species. In these surveys, video transects of the seabed are captured and the population is estimated by counting the number of burrows in the video. The mosaicing algorithm is designed to process a large amount of video data and summarize the relevant features for the survey in a single image. Hence, the algorithm is designed to be computationally inexpensive while maintaining a high degree of robustness. We adopt a registration algorithm that employs a simple translational motion model and generates a mapping to the mosaic coordinate system using a concatenation of frame-by-frame homographies. A temporal smoothness prior is used in a maximum a posteriori homography estimation algorithm to reduce noise in the motion parameters in images with small amounts of texture detail. A multiband blending scheme renders the mosaic and is optimized for the application requirements. Tests on a large data set show that the algorithm is robust enough to allow the use of mosaics as a medium for burrow counting. This will increase the verifiability of the stock assessments as well as generate a ground truth data set for the learning of an automated burrow counting algorithm.This work was supported by the Science Foundation Ireland under Award SFI-PI 08/IN.1/I2112

Image registration techniques for medical images

In this research work, approaches for image registration are proposed. The image registration methods can be grouped into two classes. One is intensity based method which is based on gray values of the pair of images and the second one is based on image feature which is done by obtaining some features or landmarks in the images like points, lines or surfaces. Edges in the images can be detected very easily in the images. Thus, using these edges some features can be obtained by which we can accomplish feature based registration. But, feature based registration has some limitations as well as advantages. The proposed method employs feature based registration technique to obtain a coarsely registered image which can be given as input to intensity based registration technique to get a fine registration result. It helps to reduce the limitations of intensity based technique. i.e. it takes less time for registration. To achieve this task, the mutual information is selected as similarity parameter. Mutual information (MI) is used widely as a similarity measure for registration. In order to improve the robustness of this similarity measure, spatial information is combined with normalized mutual information(NMI). MI is multiplied with a gradient term to integrate spatial information to mutual information and this is taken as similarity measure. The registration function is less affected if sampling resolution is low. It contains correct global maxima which are sometimes not found in case of mutual information. For optimization purpose, Fast Convergence Particle Swarm Optimization technique (FCPSO) is used. In this optimization method, the diversity of position of single particle is balanced by adding a new variable, particle mean dimension (pmd) of all particles to the existing position and velocity equation. It reduces the convergence time by reducing the number of iterations for optimization

Spherical mosaic construction using physical analogy for consistent image alignment

The research contained in this thesis is an investigation into mosaic construction. Mosaic techniques are used to obtain images with a large field of view by assembling a sequence of smaller individual overlapping images. In existing methods of mosaic construction only successive images are aligned. Accumulation of small alignment errors occur, and in the case of the image path returning to a previous position in the mosaic, a significant mismatch between nonconsecutive images will result (looping path problem). A new method for consistently aligning all the images in a mosaic is proposed in this thesis. This is achieved by distribution of the small alignment errors. Each image is allowed to modify its position relative to its neighbour images in the mosaic by a small amount with respect to the computed registration. Two images recorded by a rotating ideal camera are related by the same transformation that relates the camera's sensor plane at the time the images were captured. When two images overlap, the intensity values in both images coincide through the intersection line of the sensor planes. This intersection line has the property that the images can be seamlessly joined through that line. An analogy between the images and the physical world is proposed to solve the looping path problem. The images correspond to rigid objects, and these are linked with forces which pull them towards the right positions with respect to their neighbours. That is, every pair of overlapping images are "hinged" through their corresponding intersection line. Aided by another constraint named the spherical constraint, this network of selforganising images has the ability of distributing itself on the surface of a sphere. As a direct result of the new concepts developed in this research work, spherical mosaics (i.e. mosaics with unlimited horizontal and vertical field of view) can be created

Learned Multi-View Texture Super-Resolution

We present a super-resolution method capable of creating a high-resolution texture map for a virtual 3D object from a set of lower-resolution images of that object. Our architecture unifies the concepts of (i) multi-view super-resolution based on the redundancy of overlapping views and (ii) single-view super-resolution based on a learned prior of high-resolution (HR) image structure. The principle of multi-view super-resolution is to invert the image formation process and recover the latent HR texture from multiple lower-resolution projections. We map that inverse problem into a block of suitably designed neural network layers, and combine it with a standard encoder-decoder network for learned single-image super-resolution. Wiring the image formation model into the network avoids having to learn perspective mapping from textures to images, and elegantly handles a varying number of input views. Experiments demonstrate that the combination of multi-view observations and learned prior yields improved texture maps.Comment: 11 pages, 5 figures, 2019 International Conference on 3D Vision (3DV

Multi-Modal Imaging Techniques for Early Cancer Diagnostics

Cancer kills more Americans under the age of 75 than any other disease. Although most cancers occur in epithelial surfaces that can be directly visualized, the majority of cases are detected at an advanced stage. Optical imaging and spectroscopy may provide a solution to the need for non-invasive and effective early detection tools. These technologies are capable of examining tissue over a wide range of spatial scales, with widefield macroscopic imaging typically spanning several square-centimeters, and high resolution in vivo microscopy techniques enabling cellular and subcellular features to be visualized. This work presents novel technologies in two important areas of optical imaging: high resolution imaging and widefield imaging. For subcellular imaging applications, new high resolution endomicroscope techniques are presented with improved lateral resolution, larger field-of-view, increased contrast, decreased background signal, and reduced cost compared to existing devices. A new widefield optical technology called multi-modal spectral imaging is also developed. This technique provides real-time in vivo spectral data over a large field-of-view, which is useful for detecting biochemical alterations associated with neoplasia. The described devices are compared to existing technologies, tested using ex vivo tissue specimens, and evaluated for diagnostic potential in a multi-patient oral cancer clinical trial

Debris Tracking In A Semistable Background

Object Tracking plays a very pivotal role in many computer vision applications such as video surveillance, human gesture recognition and object based video compressions such as MPEG-4. Automatic detection of any moving object and tracking its motion is always an important topic of computer vision and robotic fields. This thesis deals with the problem of detecting the presence of debris or any other unexpected objects in footage obtained during spacecraft launches, and this poses a challenge because of the non-stationary background. When the background is stationary, moving objects can be detected by frame differencing. Therefore there is a need for background stabilization before tracking any moving object in the scene. Here two problems are considered and in both footage from Space shuttle launch is considered with the objective to track any debris falling from the Shuttle. The proposed method registers two consecutive frames using FFT based image registration where the amount of transformation parameters (translation, rotation) is calculated automatically. This information is the next passed to a Kalman filtering stage which produces a mask image that is used to find high intensity areas which are of potential interest