Search results for " graph"
showing 10 items of 1277 documents
A reverse engineering approach to measure the deformations of a sailing yacht
2016
In this work, a multidisciplinary experience, aimed to study the permanent deformations of the hull of a regatta sailing yacht is described. In particular, a procedure to compare two different surfaces of the hull of a small sailing yacht, designed and manufactured at the University of Palermo, has been developed. The first one represents the original CAD model while the second one has been obtained by means of a reverse engineering approach. The reverse engineering process was performed through an automatic close-range photogrammetry survey, that has allowed to obtain very accurate measures of the hull, and a 3D modelling step by the well-known 3D computer graphics software Rhinoceros. The…
Riesz transform and vertical oscillation in the Heisenberg group
2023
We study the $L^{2}$-boundedness of the $3$-dimensional (Heisenberg) Riesz transform on intrinsic Lipschitz graphs in the first Heisenberg group $\mathbb{H}$. Inspired by the notion of vertical perimeter, recently defined and studied by Lafforgue, Naor, and Young, we first introduce new scale and translation invariant coefficients $\operatorname{osc}_{\Omega}(B(q,r))$. These coefficients quantify the vertical oscillation of a domain $\Omega \subset \mathbb{H}$ around a point $q \in \partial \Omega$, at scale $r > 0$. We then proceed to show that if $\Omega$ is a domain bounded by an intrinsic Lipschitz graph $\Gamma$, and $$\int_{0}^{\infty} \operatorname{osc}_{\Omega}(B(q,r)) \, \frac{dr}{…
Daži trīssakarīgi grafi un to saimes bez Hamiltona cikliem
2013
These manuscripts (in Latvian) contain examples of graphs without Hamiltonian cycles. See the flower snark J5 on the page 13. The date here 1.6.78.
Rotation-Invariant Texture Retrieval via Signature Alignment Based on Steerable Sub-Gaussian Modeling
2008
This paper addresses the construction of a novel efficient rotation-invariant texture retrieval method that is based on the alignment in angle of signatures obtained via a steerable sub-Gaussian model. In our proposed scheme, we first construct a steerable multivariate sub-Gaussian model, where the fractional lower-order moments of a given image are associated with those of its rotated versions. The feature extraction step consists of estimating the so-called covariations between the orientation subbands of the corresponding steerable pyramid at the same or at adjacent decomposition levels and building an appropriate signature that can be rotated directly without the need of rotating the im…
Cost-Efficient On-Chip Routing Implementations for CMP and MPSoC Systems
2011
[EN] The high-performance computing domain is enriching with the inclusion of networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area, and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism, or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge. This paper presents universal logic-based distributed routing (uLBDR), an efficient logic-based mechanism that adapts to any irregular topology derived from 2-D meshes, instead of usi…
LaDy: Software for assessing local landscape diversity profiles of raster land cover maps using geographic windows
2003
Landscape ecology starts from the assumption that diversity and spatial arrangement of ecosystem mosaics have ecological implications and tries to understand the interactions between diversity and structure of large spatially heterogeneous areas and their ecological functions. These assumptions imply effective use of earth observation techniques and geographic information systems, enabling a global view of the landscape mosaics. In this paper, a software, LaDy (Landscape Diversity Software), for computing Re´nyi’s local landscape diversity profile on raster land cover maps is presented. LaDy is based on the use of Merchant’s adaptive geographic window, which is designed to operate on a neig…
Partitionability, coverability and colorability in graphs
2014
Our research are about graph coloring with distance constraints (packing coloring) or neighborhood constraints (Grundy coloring). Let S={si| i in N*} be a non decreasing sequence of integers. An S-packing coloring is a proper coloring such that every set of color i is an si-packing (a set of vertices at pairwise distance greater than si). A graph G is (s1,... ,sk)-colorable if there exists a packing coloring of G with colors 1,... ,k. A Grundy coloring is a proper vertex coloring such that for every vertex of color i, u is adjacent to a vertex of color j, for each ji. These results allow us to determine S-packing coloring of these lattices for several sequences of integers. We examine a cla…
Bezier curves approximation of triangularized surfaces using SVG
2006
This paper presents a technique to convert surfaces, obtained through a Data Dependent Triangulation, in Bezier Curves by using a Scalable Vector Graphics File format. The method starts from a Data Dependent Triangulation, traces a map of the boundaries present into the triangulation, using the characteristics of the triangles, then the estimated barycenters are connected, and a final conversion of the resulting polylines in curves is performed. After the curves have been estimated and closed the final representation is obtained by sorting the surfaces in a decreasing order. The proposed techniques have been compared with other raster to vector conversions in terms of perceptual quality.
Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features
2016
An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics--such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient--are insufficient for achieving adequate results under different image deformations. Thus, new…