Extending OpenVX for Model-based Design of Embedded Vision Applications

Developing computer vision applications for lowpower heterogeneous systems is increasingly gaining interest in the embedded systems community. Even more interesting is the tuning of such embedded software for the target architecture when this is driven by multiple constraints (e.g., performance, peak power, energy consumption). Indeed, developers frequently run into system-level inefficiencies and bottlenecks that can not be quickly addressed by traditional methods. In this context OpenVX has been proposed as the standard platform to develop portable, optimized and powerefficient applications for vision algorithms targeting embedded systems. Nevertheless, adopting OpenVX for rapid prototyping, early algorithm parametrization and validation of complex embedded applications is a very challenging task. This paper presents a methodology to integrate a model-based design environment to OpenVX. The methodology allows applying Matlab/Simulink for the model-based design, parametrization, and validation of computer vision applications. Then, it allows for the automatic synthesis of the application model into an OpenVX description for the hardware and constraints-aware application tuning. Experimental results have been conducted with an application for digital image stabilization developed through Simulink and, then, automatically synthesized into OpenVX-VisionWorks code for an NVIDIA Jetson TX1 boar

An Efficient Implementation of a Subgraph Isomorphism Algorithm for GPUs.

The subgraph isomorphism problem is a computational task that applies to a wide range of today's applications, ranging from the understanding of biological networks to the analysis of social networks. Even though different implementations for CPUs have been proposed to improve the efficiency of such a graph search algorithm, they have shown to be bounded by the intrinsic sequential nature of the algorithm. More recently, graphics processing units (GPUs) have become widespread platforms that provide massive parallelism at low cost. Nevertheless, parallelizing any efficient and optimized sequential algorithm for subgraph isomorphism on many-core architectures is a very challenging task. This article presents , a parallel implementation of the subgraph isomorphism algorithm for GPUs. Different strategies are implemented in to deal with the space complexity of the graph searching algorithm, the potential workload imbalance, and the thread divergence involved by the non-homogeneity of actual graphs. The paper presents the results obtained on several graphs of different sizes and characteristics to understand the efficiency of the proposed approach

Automatic synthesis of OSCI TLM-2.0 models into RTL bus-based IPs

n/

Section Extension from Hyperbolic Geometry of Punctured Disk and Holomorphic Family of Flat Bundles

The construction of sections of bundles with prescribed jet values plays a fundamental role in problems of algebraic and complex geometry. When the jet values are prescribed on a positive dimensional subvariety, it is handled by theorems of Ohsawa-Takegoshi type which give extension of line bundle valued square-integrable top-degree holomorphic forms from the fiber at the origin of a family of complex manifolds over the open unit 1-disk when the curvature of the metric of line bundle is semipositive. We prove here an extension result when the curvature of the line bundle is only semipositive on each fiber with negativity on the total space assumed bounded from below and the connection of the metric locally bounded, if a square-integrable extension is known to be possible over a double point at the origin. It is a Hensel-lemma-type result analogous to Artin's application of the generalized implicit function theorem to the theory of obstruction in deformation theory. The motivation is the need in the abundance conjecture to construct pluricanonical sections from flatly twisted pluricanonical sections. We also give here a new approach to the original theorem of Ohsawa-Takegoshi by using the hyperbolic geometry of the punctured open unit 1-disk to reduce the original theorem of Ohsawa-Takegoshi to a simple application of the standard method of constructing holomorphic functions by solving the d-bar equation with cut-off functions and additional blowup weight functions

Assessment of Axial Postural Abnormalities in Parkinsonism: Automatic Picture Analysis Software

BackgroundSoftware-based measurements of axial postural abnormalities in Parkinson's disease (PD) are the gold standard but may be time-consuming and not always feasible in clinical practice. An automatic and reliable software to accurately obtain real-time spine flexion angles according to the recently proposed consensus-based criteria would be a useful tool for both research and clinical practice. ObjectiveWe aimed to develop and validate a new software based on Deep Neural Networks to perform automatic measures of PD axial postural abnormalities. MethodsA total of 76 pictures from 55 PD patients with different degrees of anterior and lateral trunk flexion were used for the development and pilot validation of a new software called AutoPosturePD (APP); postural abnormalities were measured in lateral and posterior view using the freeware NeuroPostureApp (gold standard) and compared with the automatic measurement provided by the APP. Sensitivity and specificity for the diagnosis of camptocormia and Pisa syndrome were assessed. ResultsWe found an excellent agreement between the new APP and the gold standard for lateral trunk flexion (intraclass correlation coefficient [ICC] 0.960, IC95% 0.913-0.982, P < 0.001), anterior trunk flexion with thoracic fulcrum (ICC 0.929, IC95% 0.846-0.968, P < 0.001) and anterior trunk flexion with lumbar fulcrum (ICC 0.991, IC95% 0.962-0.997, P < 0.001). Sensitivity and specificity were 100% and 100% for detecting Pisa syndrome, 100% and 95.5% for camptocormia with thoracic fulcrum, 100% and 80.9% for camptocormia with lumbar fulcrum. ConclusionsAutoPosturePD is a valid tool for spine flexion measurement in PD, accurately supporting the diagnosis of Pisa syndrome and camptocormia

Classification of one-dimensional quasilattices into mutual local-derivability classes

One-dimensional quasilattices are classified into mutual local-derivability (MLD) classes on the basis of geometrical and number-theoretical considerations. Most quasilattices are ternary, and there exist an infinite number of MLD classes. Every MLD class has a finite number of quasilattices with inflation symmetries. We can choose one of them as the representative of the MLD class, and other members are given as decorations of the representative. Several MLD classes of particular importance are listed. The symmetry-preserving decorations rules are investigated extensively.Comment: 42 pages, latex, 5 eps figures, Published in JPS

Sharpenings of Li's criterion for the Riemann Hypothesis

Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. For $n \to \infty$ we obtain that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ (with $A>0$ and $B$ explicitly given, also for the case of more general zeta or $L$-functions); whereas in the opposite case, $\lambda_n$ has a non-tempered oscillatory form.Comment: 10 pages, Math. Phys. Anal. Geom (2006, at press). V2: minor text corrections and updated reference

A generalization of the Bombieri-Pila determinant method

The so-called determinant method was developed by Bombieri and Pila in 1989 for counting integral points of bounded height on affine plane curves. In this paper we give a generalization of that method to varieties of higher dimension, yielding a proof of Heath-Brown's 'Theorem 14' by real-analytic considerations alone.Comment: 13 page

Symmetry of Traveling Wave Solutions to the Allen-Cahn Equation in \Er^2

In this paper, we prove even symmetry of monotone traveling wave solutions to the balanced Allen-Cahn equation in the entire plane. Related results for the unbalanced Allen-Cahn equation are also discussed

Sub-Riemannian Calculus on Hypersurfaces in Carnot Groups

We develope basic geometric quantities and properties of hypersurfaces in Carnot groups