Finite volume distance field solution applied to medial axis transform

Accurate and efficient computation of the nearest wall distance d (or level set) is important for many areas of computational science/engineering. Differential equation-based distance/ level set algorithms, such as the hyperbolic-natured Eikonal equation, have demonstrated valuable computational efficiency. Here, in the context, as an 'auxiliary' equation to the main flow equations, the Eikonal equation is solved efficiently with two different finite volume approaches (the cell vertex and cell-centered). Application of the distance solution is studied for various geometries. Moreover, a procedure using the differential field to obtain the medial axis transform (MAT) for different geometries is presented. The latter provides a skeleton representation of geometric models that has many useful analysis properties. As an alternative approach to the pure geometric methods (e.g. the Voronoi approach), the current d-MAT procedure bypasses many difficulties that are usually encountered by pure geometric methods, especially in three dimensional space. It is also shown that the d-MAT approach provides the potential to sculpt/control the MAT form for specialized solution purposes. Copyright © 2010 by the American Institute of Aeronautics and Astronautics, Inc.

DT-MRI data visualisation using the dual tree Complex Wavelet transform

In this paper a novel visualisation method for diffusion tensor MRI datasets is introduced. This is based on the use of Complex Wavelets in order to produce "stripy" textures which depict the anisotropic component of the diffusion tensors. Grey-scale pixel intensity is used to show the isotropic component. This paper also discusses enhancements of the technique for 3D visualisation. © 2004 IEEE.

Spread transform watermarking for video sources

Spread Transform (ST) is a quantization watermarking algorithm in which vectors of the wavelet coefficients of a host work are quantized, using one of two dithered quantizers, to embed hidden information bits; Loo had some success in applying such a scheme to still images. We extend ST to the video watermarking problem. Visibility considerations require that each spreading vector refer to corresponding pixels in each of several frames, that is, a multi-frame embedding approach. Use of the hierarchical complex wavelet transform (CWT) for a visual mask reduces computation and improves robustness to jitter and valumetric scaling. We present a method of recovering temporal synchronization at the detector, and give initial results demonstrating the robustness and capacity of the scheme.

Application of the fractional Fourier transform to the design of LCOS based optical interconnects and fiber switches

It is shown that reflective liquid crystal on silicon (LCOS) spatial light modulator (SLM) based interconnects or fiber switches that use defocus to reduce crosstalk can be evaluated and optimized using a fractional Fourier transform if certain optical symmetry conditions are met. Theoretically the maximum allowable linear hologram phase error compared to a Fourier switch is increased by a factor of six before the target crosstalk for telecom applications of -40 dB is exceeded. A Gerchberg-Saxton algorithm incorporating a fractional Fourier transform modified for use with a reflective LCOS SLM is used to optimize multi-casting holograms in a prototype telecom switch. Experiments are in close agreement to predicted performance. © 2012 Optical Society of America.

Semantic transform: Weakly supervised semantic inference for relating visual attributes

Relative (comparative) attributes are promising for thematic ranking of visual entities, which also aids in recognition tasks. However, attribute rank learning often requires a substantial amount of relational supervision, which is highly tedious, and apparently impractical for real-world applications. In this paper, we introduce the Semantic Transform, which under minimal supervision, adaptively finds a semantic feature space along with a class ordering that is related in the best possible way. Such a semantic space is found for every attribute category. To relate the classes under weak supervision, the class ordering needs to be refined according to a cost function in an iterative procedure. This problem is ideally NP-hard, and we thus propose a constrained search tree formulation for the same. Driven by the adaptive semantic feature space representation, our model achieves the best results to date for all of the tasks of relative, absolute and zero-shot classification on two popular datasets. © 2013 IEEE.