English
Related papers

Related papers: On the Relation between two Rotation Metrics

200 papers

Recently, Zhuang, Roth, \& Sudhakar [1] proposed a method that allows simultaneous computation of the rigid transformations from world frame to robot base frame and from hand frame to camera frame. Their method attempts to solve a…

Robotics · Computer Science 2023-11-21 Fadi Dornaika , Radu Horaud

This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…

Optimization and Control · Mathematics 2026-05-28 Yizun Lin , Jian-Feng Cai , Zhao-Rong Lai , Cheng Li

Existing detection methods commonly use a parameterized bounding box (BBox) to model and detect (horizontal) objects and an additional rotation angle parameter is used for rotated objects. We argue that such a mechanism has fundamental…

Computer Vision and Pattern Recognition · Computer Science 2022-09-23 Xue Yang , Gefan Zhang , Xiaojiang Yang , Yue Zhou , Wentao Wang , Jin Tang , Tao He , Junchi Yan

The general 4D rotation matrix is specialised to the general 3D rotation matrix by equating its leftmost top element (a00) to 1. Its associate matrix of products of the left-hand and right-hand quaternion components is specialised…

General Mathematics · Mathematics 2007-05-23 Johan Ernest Mebius

This paper considers general rank-constrained optimization problems that minimize a general objective function $f(X)$ over the set of rectangular $n\times m$ matrices that have rank at most $r$. To tackle the rank constraint and also to…

Information Theory · Computer Science 2021-09-07 Zhihui Zhu , Qiuwei Li , Gongguo Tang , Michael B. Wakin

Images are an important source of information for spacecraft navigation and for three-dimensional reconstruction of observed space objects. Both of these applications take the form of a triangulation problem when the camera has a known…

Computer Vision and Pattern Recognition · Computer Science 2022-09-02 Sebastien Henry , John A. Christian

A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…

Machine Learning · Computer Science 2014-04-30 Michael Mathieu , Yann LeCun

Random projection has been widely used in data classification. It maps high-dimensional data into a low-dimensional subspace in order to reduce the computational cost in solving the related optimization problem. While previous studies are…

Machine Learning · Computer Science 2014-02-24 Lijun Zhang , Mehrdad Mahdavi , Rong Jin , Tianbao Yang , Shenghuo Zhu

In this paper, we consider optimization problems w.r.t. to pairs of orthogonal matrices $XY = I$. Problems of this form arise in several applications such as finding shape correspondence in computer graphics. We show that the space of such…

Optimization and Control · Mathematics 2016-09-15 Klaus Glashoff , Michael M. Bronstein

A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and…

Computer Vision and Pattern Recognition · Computer Science 2024-06-28 Gabriel Moreira , Manuel Marques , João Paulo Costeira

Transformer models contain substantial internal redundancy arising from coordinate-dependent representations and continuous symmetries, in model space and in head space, respectively. While recent approaches address this by explicitly…

Machine Learning · Computer Science 2026-02-24 J. François , L. Ravera

Surface registration is a technique that is used in various areas such as object recognition and 3D model reconstruction. Problem of surface registration can be analyzed as an optimization problem of seeking a rigid motion between two…

Computer Vision and Pattern Recognition · Computer Science 2013-10-02 Vedran Hrgetić , Tomislav Pribanić

The aim of this paper is to endow the well-known family of hypercubic quantization hashing methods with theoretical guarantees. In hypercubic quantization, applying a suitable (random or learned) rotation after dimensionality reduction has…

Machine Learning · Computer Science 2018-02-13 Anne Morvan , Antoine Souloumiac , Krzysztof Choromanski , Cédric Gouy-Pailler , Jamal Atif

This work presents an elegant formalism to model the evolution of the full two rigid body problem. The equations of motion, given in a Cartesian coordinate system, are expressed in terms of spherical harmonics and Wigner D-matrices. The…

Earth and Planetary Astrophysics · Physics 2017-02-08 Gwenaël Boué

We introduce motions as real six-dimensional vectors. A motion means a rotation and a translation. We define a motion operator which maps unit dual quaternions to motions, and a UDQ operator which maps motions to unit dual quaternions. By…

Optimization and Control · Mathematics 2022-12-29 Liqun Qi

A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses. Lower bounds are obtained by replacing the concave part of the objective function…

Optimization and Control · Mathematics 2009-12-10 William Hager , Dzung Phan

In this work, Yoshikawa's manipulability index is used to investigate reinforcement learning (RL) as a framework for morphology optimization in planar robotic manipulators. A 2R manipulator tracking a circular end-effector path is first…

Robotics · Computer Science 2025-11-18 Arvind Kumar Mishra , Sohom Chakrabarty

In the rod and hole paradox as described by Rindler (1961 Am. J. Phys. 29 365-6), a rigid rod moves at high speed over a table towards a hole of the same size. Observations from the inertial frames of the rod and slot are widely different.…

Classical Physics · Physics 2008-09-11 Chandru Iyer , G. M. Prabhu

This paper studies hidden convexity properties associated with constrained optimization problems over the set of rotation matrices $\text{SO}(n)$. Such problems are nonconvex due to the constraint $X \in \text{SO}(n)$. Nonetheless, we show…

Optimization and Control · Mathematics 2024-05-01 Akshay Ramachandran , Kevin Shu , Alex L. Wang

We study the two-dimensional (geometric) knapsack problem with rotations (2DKR), in which we are given a square knapsack and a set of rectangles with associated profits. The objective is to find a maximum profit subset of rectangles that…

Data Structures and Algorithms · Computer Science 2026-03-27 Debajyoti Kar , Arindam Khan , Andreas Wiese