Yahoo Web Search

Search results

  1. K.S. Arun's 33 research works with 276 citations and 287 reads, including: Bandlimited extrapolation using time-bandwidth dimension K.S. Arun's research while affiliated with IBM...

    • Login

      K.S. Arun's 33 research works with 276 citations and 287...

    • Help Center

      © 2008-2024 ResearchGate GmbH. All rights reserved. Terms;...

  2. Arun, K. S. ; Huang, T. S. ; Blostein, S. D. / Least-Squares Fitting of Two 3-D Point Sets. In: IEEE transactions on pattern analysis and machine intelligence . 1987 ; Vol. PAMI-9, No. 5. pp. 698-700.

    • K. S. Arun, T. S. Huang, S. D. Blostein
    • 1987
  3. Also published under: K. Arun Affiliation School of Medicine, University of California, Los Angeles, CA, USA Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA

  4. Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector. Given {pi} and {p'i}, we present an algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix. This new algorithm is compared to two earlier algorithms with ...

  5. S. Y. Kung, K. S. Arun, and D. V. Bhaskar Rao, "State-space and singular-value decomposition-based approximation methods for the harmonic retrieval problem," J. Opt. Soc. Am. 73, 1799-1811 (1983)

  6. Recently, K.S. Arun et al. (1987) and B.K.P. Horn et al. (1987) presented a solution of this problem. Their solution, however, sometimes fails to give a correct rotation matrix and gives a reflection instead when the data is severely corrupted.

  7. K S Arun 1 , T S Huang , S D Blostein. Affiliation. 1 Coordinated Science Laboratory, University of Illinois, Urbana, IL 61801. PMID: 21869429. DOI: 10.1109/tpami.1987.4767965. Abstract. Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector.

  1. People also search for