arXiv subjects

Zijia Li

Publications and source records attributed to Zijia Li.

30 records · Page 2Linked to original sources

arXiv2016

Planar Linkages Following a Prescribed Motion

Designing mechanical devices, called linkages, that draw a given plane curve has been a topic that interested engineers and mathematicians for hundreds of years, and recently also computer scientists. Already in 1876, Kempe proposed a procedure for solving the problem in full generality, but his constructions tend to be extremely complicated. We provide a novel algorithm that produces much simpler linkages, but works only for parametric curves. Our approach is to transform the problem into a factorization task over some noncommutative algebra. We show how to compute such a factorization, and how to use it to construct a linkage tracing a given curve.

cs.SC↗

arXiv2015

The Rational Motion of Minimal Dual Quaternion Degree With Prescribed Trajectory

We give a constructive proof for the existence of a unique rational motion of minimal degree in the dual quaternion model of Euclidean displacements with a given rational parametric curve as trajectory. The minimal motion degree equals the trajectory's degree minus its circularity. Hence, it is lower than the degree of a trivial curvilinear translation for circular curves.

math.MG↗

arXiv2015

A Technique for Deriving Equational Conditions on the Denavit-Hartenberg Parameters of 6R Linkages that are Necessary for Movability

A closed 6R linkage is generically rigid. Special cases may be mobile. Many families of mobile 6R linkages have been characterised in terms of the invariant Denavit-Hartenberg parameters of the linkage. In other words, many sufficient conditions for mobility are known. In this paper we give, for the first time, equational conditions on the invariant Denavit-Hartenberg parameters that are necessary for mobility. The method is based on the theory of bonds. We illustrate the method by deriving the equational conditions for various well-known linkages (Bricard's line symmetric linkage, Hooke's linkage, Dietmaier's linkage, and recent a generalization of Bricard's orthogonal linkage), starting from their bond diagrams; and by deriving the equations for another bond diagram, thereby discovering a new mobile 6R linkage.

cs.RO↗

arXiv2015

From the Fundamental Theorem of Algebra to Kempe's Universality Theorem

This article provides a gentle introduction for a general mathematical audience to the factorization theory of motion polynomials and its application in mechanism science. This theory connects in a rather unexpected way a seemingly abstract mathematical topic, the non-unique factorization of certain polynomials over the ring of dual quaternions, with engineering applications. Four years after its introduction, it is already clear how beneficial it has been to both fields.

math.RA↗

arXiv2015

Factorization of Rational Motions: A Survey with Examples and Applications

Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many examples, summarize recent developments and hint at some new applications. In particular, we provide pseudo-code for the generic factorization algorithm, demonstrate how to find a replacement linkage for a special case in the synthesis of Bennett mechanisms and, as an example of non-generic factorization, synthesize open chains for circular and elliptic translations.

cs.RO↗

arXiv2015

7R Darboux Linkages by Factorization of Motion Polynomials

In this paper, we construct two types of 7R closed single loop linkages by combining different factorizations of a general (non-vertical) Darboux motion. These factorizations are obtained by extensions of a factorization algorithm for a generic rational motion. The first type of 7R linkages has several one-dimensional configuration components and one of them corresponds to the Darboux motion. The other type is a 7R linkage with two degrees of freedom and without one-dimensional component. The Darboux motion is a curve in an irreducible two dimensional configuration component.

cs.RO↗

arXiv2015

Factorization of Motion Polynomials

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial factor and factorizations. The first algorithm is conceptually simpler but may require a high degree of the polynomial factor. The second algorithm gives an optimal degree.

cs.SC↗

arXiv2014

Spatial Straight Line Linkages by Factorization of Motion Polynomials

We use the recently introduced factorization of motion polynomials for constructing overconstrained spatial linkages with a straight line trajectory. Unlike previous examples, the end-effector motion is not translational and the link graph is a cycle. In particular, we obtain a number of linkages with four revolute and two prismatic joints and a remarkable linkage with seven revolute joints one of whose joints performs a Darboux motion.

math.MG↗

arXiv2014

An algebraic study of linkages with helical joints

Methods from algebra and algebraic geometry have been used in various ways to study linkages in kinematics. These methods have failed so far for the study of linkages with helical joints (joints with screw motion), because of the presence of some non-algebraic relations. In this article, we explore a delicate reduction of some analytic equations in kinematics to algebraic questions via a theorem of Ax. As an application, we give a classification of mobile closed 5-linkages with revolute, prismatic, and helical joints.

cs.RO↗

arXiv2013

The Theory of Bonds II: Closed 6R Linkages with Maximal Genus

In this paper, we introduce a method that allows to produce necessary conditions on the Denavit--Hartenberg parameters for the mobility of a closed linkage with six rotational joints. We use it to prove that the genus of the configuration curve of a such a linkage is at most five, and to give a complete classification of the linkages with a configuration curve of degree four or five. The classification contains new families.

math.AG↗

arXiv2013

Classification of Angle-Symmetric 6R Linkage

In this paper, we consider a special kind of overconstrained 6R closed linkages which we call angle-symmetric 6R linkages. These are linkages with the property that the rotation angles are equal for each of the three pairs of opposite joints. We give a classification of these linkages. It turns that there are three types. First, we have the linkages with line symmetry. The second type is new. The third type is related to cubic motion polynomials.

math.AG↗

arXiv2012

A Co-Prime Blur Scheme for Data Security in Video Surveillance

This paper presents a novel Coprime Blurred Pair (CBP) model for visual data-hiding for security in camera surveillance. While most previous approaches have focused on completely encrypting the video stream, we introduce a spatial encryption scheme by blurring the image/video contents to create a CBP. Our goal is to obscure detail in public video streams by blurring while allowing behavior to be recognized and to quickly deblur the stream so that details are available if behavior is recognized as suspicious. We create a CBP by blurring the same latent image with two unknown kernels. The two kernels are coprime when mapped to bivariate polynomials in the z domain. To deblur the CBP we first use the coprime constraint to approximate the kernels and sample the bivariate CBP polynomials in one dimension on the unit circle. At each sample point, we factor the 1D polynomial pair and compose the results into a 2D kernel matrix. Finally, we compute the inverse Fast Fourier Transform (FFT) of the kernel matrices to recover the coprime kernels and then the latent video stream. It is therefore only possible to deblur the video stream if a user has access to both streams. To improve the practicability of our algorithm, we implement our algorithm using a graphics processing unit (GPU) to decrypt the blurred video streams in real-time, and extensive experimental results demonstrate that our new scheme can effectively protect sensitive identity information in surveillance videos and faithfully reconstruct the unblurred video stream when two blurred sequences are available.

cs.CV↗