Approximation of Euclidean Distance between Point from Ellipse
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F05%3A00117026" target="_blank" >RIV/68407700:21230/05:00117026 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximation of Euclidean Distance between Point from Ellipse
Original language description
Efficient computation of Euclidean distance between point and ellipse is needed in many computer vision problems. The true Euclidean distance requires solving of quartic equation which may have up to four solutions, requiring the one with the minimum distance to be determined. To avoid the complexity of evaluating the true Euclidean distance, we propose an approximation measure. We first find transformation projecting the ellipse to the unit circle. The point is projected by the same transformation. Distance of the point from the unit circle is simple to compute. Finally, distance is reprojected to original space.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET101210407" target="_blank" >1ET101210407: Multi-camera system for modeling and recognition of events</a><br>
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů