A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams

This paper presents a syntactic approach based on Adjacency Grammars (AG) for sketch diagram modeling and understanding. Diagrams are a combination of graphical symbols arranged according to a set of spatial rules defined by a visual language. AG describe visual shapes by productions defined in terms of terminal and non-terminal symbols (graphical primitives and subshapes), and a set functions describing the spatial arrangements between symbols. Our approach to sketch diagram understanding provides three main contributions. First, since AG are linear grammars, there is a need to define shapes and relations inherently bidimensional using a sequential formalism. Second, our parsing approach uses an indexing structure based on a spatial tessellation. This serves to reduce the search space when finding candidates to produce a valid reduction. This allows order-free parsing of 2D visual sentences while keeping combinatorial explosion in check. Third, working with sketches requires a distortion model to cope with the natural variations of hand drawn strokes. To this end we extended the basic grammar with a distortion measure modeled on the allowable variation on spatial constraints associated with grammar productions. Finally, the paper reports on an experimental framework an interactive system for sketch analysis. User tests performed on two real scenarios show that our approach is usable in interactive settings.     

Empirical likelihood ratios applied to goodness-of-fit tests based on sample entropy

The likelihood approach based on the empirical distribution functions is a well-accepted statistical tool for testing. However, the proof schemes of the Neyman–Pearson type lemmas induce consideration of density-based likelihood ratios to obtain powerful test statistics. In this article, we introduce the distribution-free density-based likelihood technique, applied to test for goodness-of-fit. We focus on tests for normality and uniformity, which are common tasks in applied studies. The well-known goodness-of-fit tests based on sample entropy are shown to be a product of the proposed empirical likelihood (EL) methodology. Although the efficiency of test statistics based on classes of entropy estimators has been widely addressed in the statistical literature, estimation of the sample entropy has been not invariantly defined, and hence this estimation produces tests that are difficult to be applied to real data studies. The proposed EL approach defines clear forms of the entropy-based tests. Monte Carlo simulation results confirm the preference of the proposed method from a power perspective. Real data examples study the proposed approach in practice.     

A SIMD-efficient 14 instruction shader program for high-throughput microtriangle rasterization

This paper shows that breaking the barrier of 1 triangle/clock rasterization rate for microtriangles in modern GPU architectures in an efficient way is possible. The fixed throughput of the special purpose culling and triangle setup stages of the classic pipeline limits the GPU scalability to rasterize many triangles in parallel when these cover very few pixels. In contrast, the shader core counts and increasing GFLOPs in modern GPUs clearly suggests parallelizing this computation entirely across multiple shader threads, making use of the powerful wide-ALU instructions. In this paper, we present a very efficient SIMD-like rasterization code targeted at very small triangles that scales very well with the number of shader cores and has higher performance than traditional edge equation based algorithms. We have extended the ATTILA GPU shader ISA (del Barrioet al. in IEEE International Symposium on Performance Analysis of Systems and Software, pp. 231–241, 2006) with two fixed point instructions to meet the rasterization precision requirement. This paper also introduces a novel subpixel Bounding Box size optimization that adjusts the bounds much more finely, which is critical for small triangles, and doubles the 2×2-pixel stamp test efficiency. The proposed shader rasterization program can run on top of the original pixel shader program in such a way that selected fragments are rasterized, attribute interpolated and pixel shaded in the same pass. Our results show that our technique yields better performance than a classic rasterizer at 8 or more shader cores, with speedups as high as 4× for 16 shader cores.     

3-D B-spline Wavelet-Based Local Standard Deviation (BWLSD): Its Application to Edge Detection and Vascular Segmentation in Magnetic Resonance Angiography

Extracting reliable image edge information is crucial for active contour models as well as vascular segmentation in magnetic resonance angiography (MRA). However, conventional edge detection techniques, such as gradient-based methods and wavelet-based methods, are incapable of returning reliable detection responses from low contrast edges in the images. In this paper, we propose a novel edge detection method by combining B-spline wavelet magnitude with standard deviation inside local region. It is proved theoretically and demonstrated experimentally in this paper that the new edge detection method, namely BWLSD, is able to give consistent and reliable strengths for edges with different image contrasts. Moreover, the relationship between the size of local region with non-zero wavelet magnitudes and the scale of wavelet function is established. This relationship indicates that if the scale of the adopted wavelet function is s, then the size of a local region, from which the standard deviation is estimated, should be 2s−1. The proposed edge detection technique is embedded in FLUX, namely, BWLSD-FLUX, for vascular segmentation in MRA image volumes. Experimental results on clinical images show that, as compared with the conventional FLUX, BWLSD-FLUX can achieve better segmentations of vasculatures in MRA images under same initial conditions.     

Anisotropic Smoothness Classes: From Finite Element Approximation to Image Models

We propose and study quantitative measures of smoothness f ? A(f) which are adapted to anisotropic features such as edges in images or shocks in PDE’s. These quantities govern the rate of approximation by adaptive finite elements, when no constraint is imposed on the aspect ratio of the triangles, the simplest example being \(A_{p}(f)=\|\sqrt{|\mathrm{det}(d^{2}f)|}\|_{L^{\tau}}\) which appears when approximating in the L ^p norm by piecewise linear elements when \(\frac{1}{\tau}=\frac{1}{p}+1\). The quantities A(f) are not semi-norms, and therefore cannot be used to define linear function spaces. We show that these quantities can be well defined by mollification when f has jump discontinuities along piecewise smooth curves. This motivates for using them in image processing as an alternative to the frequently used total variation semi-norm which does not account for the smoothness of the edges.     

Approximated approximations for SAO

We propose to replace a number of popular approximations by their diagonal quadratic Taylor series expansions. The resulting separable quadratic approximations are easily convexified, and are well suited for use in dual sequential approximate optimization (SAO) algorithms. Global convergence of the resulting SAO algorithms may be enforced in a natural way using conservatism. The approximated approximation approach is explicitly illustrated for (i) reciprocal and exponential intervening variables, (ii) the intervening variables used in the method of moving asymptotes (MMA), (iii) the intervening variables used in CONLIN, and (iv) the TANA-3 approximations. The use of intermediate responses for use in, for example, truss and frame-like structures, is also discussed. Key advantages of replacing nonlinear approximations by their diagonal quadratic approximations are that these approximated approximations can all be used simultaneously in a single dual statement; the dual does not depend on the form of the original approximations. In addition, in a dual setting, the resulting subproblems yield simple analytical relationships between the primal and dual variables, which is often not the case with the original nonlinear approximations. An important example hereof is the exponential approximation. Although the diagonal quadratic approximations may differ notably from their original counterparts, they typically are quite similar in a sufficiently small search subregion, which relates to the move limits commonly used in SAO anyway.     

IEEE 802.21: Media independence beyond handover

The IEEE 802.21 standard facilitates media independent handovers by providing higher layer mobility management functions with common service primitives for all technologies. Right after the base specification was published, several voices rose up in the working group advocating to broaden the scope of IEEE 802.21 beyond handovers. This paper aims at updating the reader with the main challenges and functionalities required to create a Media Independence Service Layer, through the analysis of scenarios which are being discussed within the working group: 1) Wireless Coexistence, and 2) Heterogeneous Wireless Multihop Backhaul Networks.     

Principles and typical computational limitations of sparse speaker separation based on deterministic speech features

The separation of mixed auditory signals into their sources is an eminent neuroscience and engineering challenge. We reveal the principles underlying a deterministic, neural network-like solution to this problem. This approach is orthogonal to ICA/PCA that views the signal constituents as independent realizations of random processes. We demonstrate exemplarily that in the absence of salient frequency modulations, the decomposition of speech signals into local cosine packets allows for a sparse, noise-robust speaker separation. As the main result, we present analytical limitations inherent in the approach, where we propose strategies of how to deal with this situation. Our results offer new perspectives toward efficient noise cleaning and auditory signal separation and provide a new perspective of how the brain might achieve these tasks.