Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 58 for “"Affine transformations"”.

  1. Equivalence of Boolean Functions Under Affine Transformations

    Made available in DSpace on 2014-12-14T13:09:34Z (GMT). No. of bitstreams: 1 7726653.pdf: 2293529 bytes, checksum: 8ad98e66278053940114432cf763e41c (MD5) Previous issue date: 1977

    uiuc Repository record for Equivalence of Boolean Functions Under Affine Transformations (opens in a new tab)

  2. Low-level analysis of microarray data

    … package described in Paper F. Paper D is on affine transformations of two-channel microarray data and their effects on the log-ratio log-intensity transform. Affine transformations, that is, the existence of channel biases, can explain commonly observed intensity-dependent effects in the …

    lund Repository record for Low-level analysis of microarray data (opens in a new tab) Download PDF for Low-level analysis of microarray data (opens in a new tab)

  3. Proper scoring rules : properties and applications

    … for scoring forecasts that can be represented as affine transformations of an underlying distribution.

    texas Repository record for Proper scoring rules : properties and applications (opens in a new tab)

  4. Probabilistic matching of planar shapes

    … transformation within the class of allowable transformations which maps B to A in a best possible way. A mapping is considered to be good if large parts of the two shapes coincide within some tolerance distance delta. We assume that the shapes are modeled by finite sets of rectifiable curves in …

    fu-berlin Repository record for Probabilistic matching of planar shapes (opens in a new tab)

  5. Neural network modeling of three-dimensional objects for virtualized reality applications

    … can be easily transformed in size, position (affine transformations) and shape (deformation). Some potential uses of the presented architectures in the context of virtualized reality are for the modeling of set operations and object morphing, for the detection of objects collision and for …

    ottawa-retro Repository record for Neural network modeling of three-dimensional objects for virtualized reality applications (opens in a new tab)

  6. Affine-Diffeomorphic Sequences for Regression and Manifold Learning

    A multivariate regression model of affine and diffeomorphic transformation sequences is presented, with an adaptation of the model for manifold learning. Leveraging concepts from shape analysis, model states are optimally "reshaped” by diffeomorphisms generated by smooth vector fields during …

    jhu Repository record for Affine-Diffeomorphic Sequences for Regression and Manifold Learning (opens in a new tab)

  7. Mathematical methods for 2D-3D cardiac image registration

    … imaging as a visualization tool. Rigid-body and affine transformations are used to validate the parametric model. Target registration error (TRE), Jaccard, and Dice indices are used to evaluate the algorithm and demonstrate the accuracy of the registration scheme on both simulated and clinical …

    uoit Repository record for Mathematical methods for 2D-3D cardiac image registration (opens in a new tab)

  8. A Matrix Based Approach for Color Transformations in Reflections

    … regression with 4 × 4 matrices to perform color transformations, specifically looking at the case of color transformations in reflections. I compare and analyze the power and performance linear regression models based on 3 × 3 and 4 × 4 matrices. I conclude that using 4 × 4 matrices in linear …

    tamu Repository record for A Matrix Based Approach for Color Transformations in Reflections (opens in a new tab)

  9. Perfectly Undetectable False Data Injection Attacks to Robotics with Probabilistic Defense Mechanism

    … objective is to create a perfectly undetectable, affine transformation-based FDIA, which operates with full undetectability regardless of controller or attack detector. In aim 1, we ask: Can an attacker design observable and control command affine transformations to realize perfect undetectability …

    gatech Repository record for Perfectly Undetectable False Data Injection Attacks to Robotics with Probabilistic Defense Mechanism (opens in a new tab)

  10. Geometry of Presentation Videos and Slides, and the Semantic Linking of Instructional Content (SLIC) System

    … We show how we can approximate homographies with affine transformations. Similarly to the original homographies, such transformations allow us to project slides back into the video (i.e., perform backprojection), which improves their resulting appearance. The advantage of our method is that we use …

    arizona-thes Repository record for Geometry of Presentation Videos and Slides, and the Semantic Linking of Instructional Content (SLIC) System (opens in a new tab)

  11. From interest points to map transformation: a discussion of RGB-D SLAM and its applications

    … an environment. The map is then distorted using affine transformations to change the dimensions and appearance of the environment. Views of this distorted environment are generated in real time at the camera's current pose. The effectiveness of the approach is considered and example outputs are …

    uiuc Repository record for From interest points to map transformation: a discussion of RGB-D SLAM and its applications (opens in a new tab)

  12. C-DIFFERENTIALS AND GENERALIZED CRYPTOGRAPHIC PROPERTIES OF VECTORIAL BOOLEAN AND P-ARY FUNCTIONS

    … over finite fields under several extended affine transformations. We demonstrate that c-differential properties do not hold in general across equivalence classes typically used in Boolean function analysis, and in some cases change significantly under slight perturbations. Thus, choosing …

    nps Repository record for C-DIFFERENTIALS AND GENERALIZED CRYPTOGRAPHIC PROPERTIES OF VECTORIAL BOOLEAN AND P-ARY FUNCTIONS (opens in a new tab)

  13. Individual tree detection and localization in aerial imagery

    … for DFFS which is proposed to compensate for affine transformations in the images to be analyzed. Comparative results against the ground truth are presented. Also variations in scale and misalignment in selecting the images in the training set are considered, and how these influence the …

    ubc Repository record for Individual tree detection and localization in aerial imagery (opens in a new tab) Download PDF for Individual tree detection and localization in aerial imagery (opens in a new tab)

  14. Dynamics of initially entangled open quantum systems

    … basis matrices. The maps are also studied as affine transformations on the space of states of the system. An operator sum representation similar to that of completely positive maps is constructed for the maps obtained here and a parameterization of the maps given. The reasons commonly cited …

    texas Repository record for Dynamics of initially entangled open quantum systems (opens in a new tab)

  15. SIMD and GPU-Accelerated Rendering of Implicit Models

    … with implicit primitives, blending operators, affine transformations, deformations and constructive solid geometry in a design environment that organizes all these in a scene graph data structure called the BlobTree. We show that the BlobTree modelling approach provides a very compact data …

    uvic Repository record for SIMD and GPU-Accelerated Rendering of Implicit Models (opens in a new tab)

  16. Faster Fractal Pictures Using Optimal Sequences

    … function system or IFS is a finite collection of affine transformations w1,..., WN, while the attractor A is the unique fixed point of the associated collage map W where W(E) =UiWi(E) for any compact set E [4]. Since only 6N real numbers, known as the code of the IFS, are necessary to store this …

    glasgow Download PDF for Faster Fractal Pictures Using Optimal Sequences (opens in a new tab)

  17. Jigsaws and Faster Fractal Pictures

    … for short, is a finite collection of contractive affine transformations w1, w2,...,wN, while the attractor A is the limit under repeated application of the associated collage map W(E) = UiWi(E) for any compact set E - that is, Wn(E) → A [2, 12, 25, 26]. Since only 6N real numbers, known as the IFS …

    glasgow Download PDF for Jigsaws and Faster Fractal Pictures (opens in a new tab)

  18. Applications of Group Theory to Representation for Computational Intelligence

    … groups, bijections of the unit interval, and affine transformations on Euclidean space. These representations can be used in a variety of applications, including real optimization, data normalization, image generation and modification, and point packing generation. Some can also be used to …

    guelph Repository record for Applications of Group Theory to Representation for Computational Intelligence (opens in a new tab)

  19. Multi-resolution dental image registration based on genetic algorithm

    … as image features that needed to be aligned. Affine transformations were selected to transform the subject dental region of interest to achieve better alignment with the reference region of interest. These transformations are known to capture complex image distortions. The similarity between …

    wvu Repository record for Multi-resolution dental image registration based on genetic algorithm (opens in a new tab)

  20. On neural networks with equivariance or invariance property

    … theory. In the image processing application, an affine equivariant preprocessing method is proposed to build neural networks invariant to affine transformation. \noindent\textbf{Partially Permutation Invariant Graph Node Embedding Model} Graph node embedding aims at learning a vector …

    iastate Repository record for On neural networks with equivariance or invariance property (opens in a new tab)

Page 1 of 3