BACKGROUND Compressed sensing(CS) has been well applied to speed up imaging by exploring image sparsity over predefined basis functions or learnt dictionary. Firstly, the sparse representation is generally obtained in a single transform domain by using wavelet-like methods, which cannot produce optimal sparsity considering sparsity, data adaptivity and computational complexity. Secondly, most s...

We investigate the combinatorics of a topological space that is generated by the set of edgeweighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial orde...

While most diffusion-weighted imaging (DWI) is acquired using single-shot diffusion-weighted spin-echo echo-planar imaging, steady-state DWI is an alternative method with the potential to achieve higher-resolution images with less distortion. Steady-state DWI is, however, best suited to a segmented three-dimensional acquisition and thus requires three-dimensional navigation to fully correct for...

Most objects deform gradually over time, without abrupt changes in geometry or topology, such as changes in genus. Correct space-time reconstruction of such objects should satisfy this gradual change prior. This requirement necessitates a globally consistent interpretation of spatial adjacency. Consider the capture of a surface that comes in contact with itself during the deformation process, s...

O10: Real-time magnetic resonance cine imaging with compressed sensing and iterative reconstruction for ventricular measures: comparison with gold-standard segmented steady-state free precession Gabriel Camargo, Leticia R Sabioni, Thomas Doring, Ralph Strecker, Maria Eduarda Derenne, Vania M Naue, Tamara Rothstein, Michaela Schmidt, Michael O Zenge, Mariappan S Nadar, Ronaldo S Lima, Ilan Gottlieb

This paper is concerned with surface reconstruction from stereo image data. We do not explicitly match left and right image points, but use a new formulation of Disparity Space geometry to recover the object surface in terms of very dense Intensity and Disparity maps. We introduce Disparity Space, and develop an approach using multiple matching primitives to form Local cost functionsfor which a...

Is the real problem in resolving correspondence using current stereo algorithms the lack of the “right” matching criterion? In studying the related task of reconstructing threedimensional space curves from their projections in multiple views, we suggest that the problem is more basic: matching and reconstruction are coupled, and so reconstruction algorithms should exploit this rather than assum...

Image-space reconstruction of continuous surfaces from scattered one-pixel projections of points is known to potentially offer an advantageous time complexity compared to surface splatting techniques. We propose a new algorithm for hardware-accelerated image-space reconstruction using pull-push interpolation and present an efficient GPU implementation. Compared to published image-space reconstr...

This article presents an image reconstruction approach for a buried homogeneous cylinder with arbitrary cross-section in half space. The computational method combines the finite difference time domain (FDTD) method and non-uniform steady state genetic algorithm (NU-SSGA) to determine the shape and location of the subsurface scatterer with arbitrary shape. The FDTD-subgirdding technique is imple...