You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/65953
Title: 
Concept of Matching Parallelepiped and its use in the correspondence problem
Author(s): 
Institution: 
Universidade Estadual Paulista (UNESP)
Abstract: 
In this paper, the concept of Matching Parallelepiped (MP) is presented. It is shown that the volume of the MP can be used as an additional measure of `distance' between a pair of candidate points in a matching algorithm by Relaxation Labeling (RL). The volume of the MP is related with the Epipolar Geometry and the use of this measure works as an epipolar constraint in a RL process, decreasing the efforts in the matching algorithm since it is not necessary to explicitly determine the equations of the epipolar lines and to compute the distance of a candidate point to each epipolar line. As at the beginning of the process the Relative Orientation (RO) parameters are unknown, a initial matching based on gradient, intensities and correlation is obtained. Based on this set of labeled points the RO is determined and the epipolar constraint included in the algorithm. The obtained results shown that the proposed approach is suitable to determine feature-point matching with simultaneous estimation of camera orientation parameters even for the cases where the pair of optical axes are not parallel.
Issue Date: 
1-Dec-1999
Citation: 
IEEE International Conference on Image Processing, v. 4, p. 410-414.
Time Duration: 
410-414
Keywords: 
  • Algorithms
  • Computational geometry
  • Computational methods
  • Constraint theory
  • Estimation
  • Problem solving
  • Matching parallelepiped (MP)
  • Relative orientation (RO)
  • Relaxation labeling (RL)
  • Feature extraction
Source: 
http://dx.doi.org/10.1109/ICIP.1999.819625
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/65953
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.