Plücker Correction Problem: Analysis and Improvements in Efficiency
A given six dimensional vector represents a 3D straight line in Plucker coordinates if its coordinates satisfy the Klein quadric constraint. In many problems aiming to find the Plucker coordinates of lines, noise in the data and other type of errors contribute for obtaining 6D vectors that do not correspond to lines, because of that constraint. A common procedure to overcome this drawback is to find the Plucker coordinates of the lines that are closest to those vectors. This is known as the Plucker correction problem. In this article we propose a simple, closed-form, and global solution for this problem. When compared with the state-of-the-art method, one can conclude that our algorithm is easier and requires much less operations than previous techniques (it does not require Singular Value Decomposition techniques).
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Influence of Regional Pronunciation Variation on Children’s Spelling and the Potential Benefits of Accent Adapted Spellcheckers
A child who is unfamiliar with the correct spelling of a word often employs a “sound it out” approach: breaking the word down into its constituent sounds and then choosing letters to represent the identified sounds. This…
Spelling CorrectionRethinking Convolutional Features in Correlation Filter Based Tracking
Both accuracy and efficiency are of significant importance to the task of visual object tracking. In recent years, as the surge of deep learning, Deep Convolutional NeuralNetwork (DCNN) becomes a very popular choice amon…
feature selectionObject TrackingVisual Object TrackingLearning based convex approximation for constrained parametric optimization
We propose an input convex neural network (ICNN)-based self-supervised learning framework to solve continuous constrained optimization problems. By integrating the augmented Lagrangian method (ALM) with the constraint co…
Computational EfficiencySelf-Supervised LearningNamed Entity Recognition in Historic Legal Text: A Transformer and State Machine Ensemble Method
Older legal texts are often scanned and digitized via Optical Character Recognition (OCR), which results in numerous errors. Although spelling and grammar checkers can correct much of the scanned text automatically, Name…
Language ModelingLanguage Modellingnamed-entity-recognitionNamed Entity Recognition+4uChecker: Masked Pretrained Language Models as Unsupervised Chinese Spelling Checkers
The task of Chinese Spelling Check (CSC) is aiming to detect and correct spelling errors that can be found in the text. While manually annotating a high-quality dataset is expensive and time-consuming, thus the scale of …
Language ModelingLanguage ModellingSentence