liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multidimensional orientation estimation with applications to texture analysis and optical flow
Linköping University, Department of Electrical Engineering, Computer Vision . Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Computer Vision . Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Computer Vision . Linköping University, The Institute of Technology.
1991 (English)In: IEEE Transaction on Pattern Analysis and Machine Intelligence, ISSN 0162-8828, E-ISSN 1939-3539, Vol. 13, no 8, 775-790 p.Article in journal (Refereed) Published
Abstract [en]

The problem of detection of orientation in finite dimensional Euclidean spaces is solved in the least squares sense. In particular, the theory is developed for the case when such orientation computations are necessary at all local neighborhoods of the n-dimensional Euclidean space. Detection of orientation is shown to correspond to fitting an axis or a plane to the Fourier transform of an n-dimensional structure. The solution of this problem is related to the solution of a well-known matrix eigenvalue problem. Moreover, it is shown that the necessary computations can be performed in the spatial domain without actually doing a Fourier transformation. Along with the orientation estimate, a certainty measure, based on the error of the fit, is proposed. Two applications in image analysis are considered: texture segmentation and optical flow. An implementation for 2-D (texture features) as well as 3-D (optical flow) is presented. In the case of 2-D, the method exploits the properties of the complex number field to by-pass the eigenvalue analysis, improving the speed and the numerical stability of the method. The theory is verified by experiments which confirm accurate orientation estimates and reliable certainty measures in the presence of noise. The comparative results indicate that the proposed theory produces algorithms computing robust texture features as well as optical flow. The computations are highly parallelizable and can be used in realtime image analysis since they utilize only elementary functions in a closed form (up to dimension 4) and Cartesian separable convolutions.

Place, publisher, year, edition, pages
1991. Vol. 13, no 8, 775-790 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-21590DOI: 10.1109/34.8566OAI: oai:DiVA.org:liu-21590DiVA: diva2:241552
Available from: 2009-10-04 Created: 2009-10-04 Last updated: 2017-12-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Bigun, JosefGranlund, Gösta H.Wiklund, Johan

Search in DiVA

By author/editor
Bigun, JosefGranlund, Gösta H.Wiklund, Johan
By organisation
Computer Vision The Institute of Technology
In the same journal
IEEE Transaction on Pattern Analysis and Machine Intelligence
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 494 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf