Spinal deformity is a disease that causes a three-dimensional deformation of the spinal column. When it worsens, surgery is required to screw correction rods to the spinal column. However, the surgery requires intraoperative rod bending... more
Spinal deformity is a disease that causes a three-dimensional deformation of the spinal column. When it worsens, surgery is required to screw correction rods to the spinal column. However, the surgery requires intraoperative rod bending work, which burdens the patients and causes unexpected rod breakage inside the body. Therefore, "pre-bent" rods comprising several rods with standardized shapes have been proposed to solve these problems. When designing pre-bent rods, knowing the number of rods to be prepared and the kinds of shapes required is essential. In this paper, we propose a geometric processing technique to identify an optimal set of these standardized pre-bent rod shapes for surgeries on adult spinal deformity and describe the similarity evaluation among existing rod shapes using CT scan, medial axis extraction, and iterative closest point algorithm. Moreover, we present the derivation of standardized rod shapes using hierarchical cluster analysis and the best fit of the B-spline curve to each cluster. Finally, we discuss the effectiveness of prebent rod shapes derived from CT scans of 26 existing rods of 13 patients.
Phase unwrapping has been and still is a cumbersome concern that involves the resolution of several different problems. When dealing with two-dimensional phase unwrapping in fringe analysis, the final objective is, in many cases, the... more
Phase unwrapping has been and still is a cumbersome concern that involves the resolution of several different problems. When dealing with two-dimensional phase unwrapping in fringe analysis, the final objective is, in many cases, the realization of that analysis in real time. Many algorithms have been developed to carry out the unwrapping process, with some giving satisfactory results even when high levels of noise are present in the image. However, these algorithms are often time consuming and far removed from the goal of real-time fringe analysis. A new approach to the construction of a simple and fast algorithm for two-dimensional unwrapping that has considerable potential for parallel implementation is presented.
What we believe to be a novel technique of branch-cut placement in the phase unwrapping is proposed. This approach is based on what we named residue vector, which is generated by a residue in a wrapped phase map and has an orientation... more
What we believe to be a novel technique of branch-cut placement in the phase unwrapping is proposed. This approach is based on what we named residue vector, which is generated by a residue in a wrapped phase map and has an orientation that points out toward the balancing residue of opposite polarity. The residue vector can be used to guide the manner in which branch cuts are placed in phase unwrapping. Also, residue vector can be used for the determination of the weighting values used in different existing phase unwrapping methods such as minimum cost flow and least squares. The theoretical foundations of the residue-vector method are presented, and a branch-cut method using its information is developed and implemented. A general comparison is made between the residue-vector map and other existing quality maps.
We present a new method for improving the measurement of three-dimensional ͑3-D͒ shapes by using color information of the measured scene as an additional parameter. The widest used algorithms for 3-D surface measurement by use of... more
We present a new method for improving the measurement of three-dimensional ͑3-D͒ shapes by using color information of the measured scene as an additional parameter. The widest used algorithms for 3-D surface measurement by use of structured fringe patterns are phase stepping and Fourier fringe analysis. There are a number of problems and limitations inherent in these algorithms that include: that the phase maps produced are wrapped modulo 2, that in some cases the acquired fringe pattern does not fill the field of view, that there may be spatially isolated areas, and that there is often invalid and͞or noisy data. The new method presented to our knowledge for the first time here uses multiple colored fringe patterns, which are projected at different angles onto the measured scene. These patterns are analyzed with a specially adapted multicolor version of the standard Fourier fringe analysis method. In this way a number of the standard difficulties outlined above are addressed.
We describe a novel algorithm for two-dimensional phase unwrapping. The technique combines the principles of agglomerative clustering and use of heuristics to construct a discontinuous quality-guided path. Unlike other quality-guided... more
We describe a novel algorithm for two-dimensional phase unwrapping. The technique combines the principles of agglomerative clustering and use of heuristics to construct a discontinuous quality-guided path. Unlike other quality-guided algorithms, which establish the path at the start of the unwrapping process, our technique constructs the path as the unwrapping process evolves. This makes the technique less prone to error propagation, although it presents higher execution times than other existing algorithms. The algorithm reacts satisfactorily to random noise and breaks in the phase distribution. A variation of the algorithm is also presented that considerably reduces the execution time without affecting the results significantly.
This paper proposes a new strategy for surface roughness analysis and characterisation based on the wavelet transform. After a short review of wavelet-based methods used in the field of surface roughness analysis, results obtained using a... more
This paper proposes a new strategy for surface roughness analysis and characterisation based on the wavelet transform. After a short review of wavelet-based methods used in the field of surface roughness analysis, results obtained using a new tool of analysis called the frequency normalised wavelet transform (FNWT) are presented.
In this paper, we propose a simple method for processing a 2D wrapped phase map that contains a spatial carrier signal in order to completely eliminate, or greatly reduce, the number of phase wraps in the image. The 2D Fourier transform... more
In this paper, we propose a simple method for processing a 2D wrapped phase map that contains a spatial carrier signal in order to completely eliminate, or greatly reduce, the number of phase wraps in the image. The 2D Fourier transform of the wrapped phase map is calculated. Then the spectrum is shifted to the origin in frequency space. After that, the inverse 2D Fourier transform is computed. Finally, a four-quadrant arctangent function is used to calculate the angle of the complex array that was produced by the inverse 2D Fourier transform. This produces a phase map with a smaller number of 2π phase jumps than the original phase map. In some cases, all of the phase wraps are eliminated and there is therefore no need to unwrap the resultant phase map. The reduction of the number of 2π phase jumps can reduce the execution time and improve the noise performance of some phase unwrapping algorithms such as the Flynn method. The validation of the proposed algorithm is demonstrated experimentally and also via computer-simulation.
In lensless digital holography, the comparatively low resolution of the CCD devices that are used to record the digital holograms has to date limited both the maximum linear dimensions of the measurement object and also the minimum... more
In lensless digital holography, the comparatively low resolution of the CCD devices that are used to record the digital holograms has to date limited both the maximum linear dimensions of the measurement object and also the minimum possible stand-off distance between the object and the CCD detector. A signal-processing-based technique known as superresolution (SR) image reconstruction can provide an alternative approach that reduces these restrictions. We report on an SR image reconstruction technique that has been introduced by employing a camera with a "microscanning" function to capture SR digital holograms via multiple subpixel movements of the CCD sensor. A detailed description of the approach is given, along with experimental results, which are discussed and evaluated, showing the advantages of using this method. An approach using three-dimensional holographic contouring is also described that may be adopted as a strategy for benchmarking newly developed algorithms at any stage of the lensless digital holographic process.
This paper presents a thorough discussion on the application of the one-dimensional continuous wavelet transform (1D-CWT) in order to retrieve phase information in temporally and spatially tilted fringe patterns and highlights recent... more
This paper presents a thorough discussion on the application of the one-dimensional continuous wavelet transform (1D-CWT) in order to retrieve phase information in temporally and spatially tilted fringe patterns and highlights recent progress and challenges. The paper also suggests some possible future developments for this method. The advantages and drawbacks of the one-dimensional continuous wavelet transform technique are discussed here and in this context are compared to the widely used methods of Fourier fringe analysis, phase stepping and the windowed Fourier transform. A description is given of the manner in which the CWT phase gradient and phase estimation methods may be used to extract the phase of fringe patterns, and these two methods are compared and contrasted. Five different ridge extraction algorithms are explained and the performance of three of these is evaluated. To alleviate the distortions that may occur at the image borders and at regions close to holes in fringe patterns, two methods are described and evaluated for extending the image edges and for filling in holes within fringe patterns. A novel mother wavelet is presented which has been designed to improve the ability of the continuous wavelet transform to analyse fringe patterns that contain sudden phase variations. The sampling and structural conditions that are required to obtain ‘correct’ phase are also discussed.
- by David Burton and +2
- •
- Algorithms, Image Analysis, Phase Retrieval, Sampling
A novel technique called a two-dimensional digital phase-locked loop ͑DPLL͒ for fringe pattern demodulation is presented. This algorithm is more suitable for demodulation of fringe patterns with varying phase in two directions than the... more
A novel technique called a two-dimensional digital phase-locked loop ͑DPLL͒ for fringe pattern demodulation is presented. This algorithm is more suitable for demodulation of fringe patterns with varying phase in two directions than the existing DPLL techniques that assume that the phase of the fringe patterns varies only in one direction. The two-dimensional DPLL technique assumes that the phase of a fringe pattern is continuous in both directions and takes advantage of the phase continuity; consequently, the algorithm has better noise performance than the existing DPLL schemes. The twodimensional DPLL algorithm is also suitable for demodulation of fringe patterns with low sampling rates, and it outperforms the Fourier fringe analysis technique in this aspect.
A spatiotemporal phase-unwrapping method is presented that combines the dynamic fringe-projection method and the phase-shifting technique and extends the phase-unwrapping method, which measures two phase maps at different sensitivities.... more
A spatiotemporal phase-unwrapping method is presented that combines the dynamic fringe-projection method and the phase-shifting technique and extends the phase-unwrapping method, which measures two phase maps at different sensitivities. The most important feature of the method is that it makes possible the automatic three-dimensional shape measurement of discontinuous objects with large dynamic range limits and high precision because the effective wavelength of the fringe-projection profilometry can be continuously varied over several orders of magnitude by rotation of the projection grating in its own plane. Only one grating and several steps of rotating the grating are required; therefore the method is inherently simple, fast, and robust. In the experiment, choosing the rotation angle was crucial for optimizing the measurement speed and the measurement accuracy. A criterion is presented for the choice of the minimum number of rotational steps for a given accuracy. The experimental results demonstrate the validity of the proposed method.
We present an investigation into the phase errors that occur in fringe pattern analysis that are caused by quantization effects. When acquisition devices with a limited value of camera bit depth are used, there are a limited number of... more
We present an investigation into the phase errors that occur in fringe pattern analysis that are caused by quantization effects. When acquisition devices with a limited value of camera bit depth are used, there are a limited number of quantization levels available to record the signal. This may adversely affect the recorded signal and adds a potential source of instrumental error to the measurement system. Quantization effects also determine the accuracy that may be achieved by acquisition devices in a measurement system. We used the Fourier fringe analysis measurement technique. However, the principles can be applied equally well for other phase measuring techniques to yield a phase error distribution that is caused by the camera bit depth.
In this paper we propose a novel hybrid three-dimensional phase-unwrapping algorithm, which we refer to here as the three-dimensional best-path avoiding singularity loops (3DBPASL) algorithm. This algorithm combines the advantages and... more
In this paper we propose a novel hybrid three-dimensional phase-unwrapping algorithm, which we refer to here as the three-dimensional best-path avoiding singularity loops (3DBPASL) algorithm. This algorithm combines the advantages and avoids the drawbacks of two well-known 3D phase-unwrapping algorithms, namely, the 3D phase-unwrapping noise-immune technique and the 3D phase-unwrapping best-path technique. The hybrid technique presented here is more robust than its predecessors since it not only follows a discrete unwrapping path depending on a 3D quality map, but it also avoids any singularity loops that may occur in the unwrapping path. Simulation and experimental results have shown that the proposed algorithm outperforms its parent techniques in terms of reliability and robustness.
What we believe to be a novel three-dimensional (3D) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last. The... more
What we believe to be a novel three-dimensional (3D) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last. The technique follows a discrete unwrapping path to perform the unwrapping process. The performance of this technique was tested on both simulated and real wrapped-phase maps. And it is found to be robust and fast compared with other 3D phase unwrapping algorithms.
We describe what is to our knowledge a novel approach to phase unwrapping. Using the principle of unwrapping following areas with similar phase values ͑homogenous areas͒, the algorithm reacts satisfactorily to random noise and breaks in... more
We describe what is to our knowledge a novel approach to phase unwrapping. Using the principle of unwrapping following areas with similar phase values ͑homogenous areas͒, the algorithm reacts satisfactorily to random noise and breaks in the wrap distributions. Execution times for a 512 ϫ 512 pixel phase distribution are in the order of a half second on a desktop computer. The precise value depends upon the particular image under analysis. Two inherent parameters allow tuning of the algorithm to images of different quality and nature.
A novel hybrid genetic algorithm (HGA) is proposed to solve the branch-cut phase unwrapping problem. It employs both local and global search methods. The local search is implemented by using the nearestneighbor method, whereas the global... more
A novel hybrid genetic algorithm (HGA) is proposed to solve the branch-cut phase unwrapping problem. It employs both local and global search methods. The local search is implemented by using the nearestneighbor method, whereas the global search is performed by using the genetic algorithm. The branch-cut phase unwrapping problem [a nondeterministic polynomial (NP-hard) problem] is implemented in a similar way to the traveling-salesman problem, a very-well-known combinational optimization problem with profound research and applications. The performance of the proposed algorithm was tested on both simulated and real wrapped phase maps. The HGA is found to be robust and fast compared with three well-known branch-cut phase unwrapping algorithms.
Purpose: The CT body surface underpins millimeter scale dose computation in radical radiotherapy. A lack of technology has prevented measurement of surface topology changes during irradiation. Consequently, body changes are incorporated... more
Purpose: The CT body surface underpins millimeter scale dose computation in radical radiotherapy. A lack of technology has prevented measurement of surface topology changes during irradiation. Consequently, body changes are incorporated into plans statistically. We describe the technology for dynamic measurement of continuous surface topology at submillimeter resolution and suggest appropriately modified planning. Methods and Materials: An interferometer casts cosinusoidal fringes across the surface of a patient on a treatment couch. Motion-induced changes to the spatial phase of the fringes are used to generate dynamic sequences of body height maps. Volume-conserving CT warping, guided by height change, is used to illustrate potential planning perturbations. Results: We present the results for a prone patient with rectal carcinoma. At most of the simultaneously measured 440 ؋ 440 points in each of the 898 body height maps in a dynamic sequence, the standard deviations were <1-2 mm, with occasional points of 6 mm. Surface motion predominantly occurred along the small of the back. This motion was periodic and could take the spine and bladder across the 95% isodose contour. Conclusion: Surface changes are most likely to be within 3 mm during irradiation, despite the effects of breathing and the discomfort of lying prone. The dosimetric effects are acceptable.
- by David Burton and +2
- •
- Algorithms, Anthropometry, Interferometry, Standard Deviation