180 resultados para global motion
em Cambridge University Engineering Department Publications Database
Resumo:
Current state-of-the-art techniques for determination of the change in volume of human chests, used in lung-function measurement, calculate the volume bounded by a reconstructed chest surface and its projection on to an approximately parallel static plane over a series of time instants. This method works well so long as the subject does not move globally relative to the reconstructed surface's co-ordinate system. In practice this means the subject has to be braced, which restricts the technique's use. We present here a method to compensate for global motion of the subject, allowing accurate measurement while free-standing, and also while undergoing intentional motion. © 2012 Springer-Verlag.
Resumo:
This paper proposes a design methodology to stabilize isolated relative equilibria in a model of all-to-all coupled identical particles moving in the plane at unit speed. Isolated relative equilibria correspond to either parallel motion of all particles with fixed relative spacing or to circular motion of all particles with fixed relative phases. The stabilizing feedbacks derive from Lyapunov functions that prove exponential stability and suggest almost global convergence properties. The results of the paper provide a low-order parametric family of stabilizable collectives that offer a set of primitives for the design of higher-level tasks at the group level. © 2007 IEEE.
Resumo:
This paper presents a novel coarse-to-fine global localization approach that is inspired by object recognition and text retrieval techniques. Harris-Laplace interest points characterized by SIFT descriptors are used as natural land-marks. These descriptors are indexed into two databases: an inverted index and a location database. The inverted index is built based on a visual vocabulary learned from the feature descriptors. In the location database, each location is directly represented by a set of scale invariant descriptors. The localization process consists of two stages: coarse localization and fine localization. Coarse localization from the inverted index is fast but not accurate enough; whereas localization from the location database using voting algorithm is relatively slow but more accurate. The combination of coarse and fine stages makes fast and reliable localization possible. In addition, if necessary, the localization result can be verified by epipolar geometry between the representative view in database and the view to be localized. Experimental results show that our approach is efficient and reliable. ©2005 IEEE.