Results 1  10
of
52,660
Volume Registrationusingthe3D Pseudopolar FFT Y.Keller
"... This paper introduces an algorithm for the registration of rotated and translated volumes, which operates in the frequency domain. The Fourier domain allows to compute the rotation and translation parameters separately,thus reducing aproblem with six degrees of freedom to two problems of three degre ..."
Abstract
 Add to MetaCart
a rotationusingonlythreeparameters. Twoparameters representtherotationaxisandthethirdrepresents the planar rotation perpendicular to the axis. The 3D pseudopolar FFT is used to accurately estimate the rotation axis and avariant of the angular difference function image registration scheme
Volume Registration using the 3D pseudopolar Fourier transform Accepted for publication. IEEE Transactions on Signal Processing
"... This paper introduces an algorithm for the registration of rotated and translated volumes using the 3D pseudopolar Fourier transform, which accurately computes the Fourier transform of the registered volumes on a nearspherical 3D domain without using interpolation. We propose a threestep proced ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This paper introduces an algorithm for the registration of rotated and translated volumes using the 3D pseudopolar Fourier transform, which accurately computes the Fourier transform of the registered volumes on a nearspherical 3D domain without using interpolation. We propose a three
Image registration methods: a survey
 IMAGE AND VISION COMPUTING
, 2003
"... This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align t ..."
Abstract

Cited by 734 (9 self)
 Add to MetaCart
This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 659 (7 self)
 Add to MetaCart
A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual
Using Linear Algebra for Intelligent Information Retrieval
 SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract

Cited by 672 (18 self)
 Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques
3D SYMMETRY DETECTION USING THE PSEUDOPOLAR FOURIER TRANSFORM
"... Abstract. Symmetry detection in 3D images is an important task in many fields such as computer vision, pattern recognition to name a few. An algebraic based 3D symmetry detection algorithm is presented. The 3D volume is transformed to the Fourier domain by using the pseudopolar Fourier transform. T ..."
Abstract
 Add to MetaCart
Abstract. Symmetry detection in 3D images is an important task in many fields such as computer vision, pattern recognition to name a few. An algebraic based 3D symmetry detection algorithm is presented. The 3D volume is transformed to the Fourier domain by using the pseudopolar Fourier transform
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a new centrality measure that identifies those vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of realworld complex networks.
Results 1  10
of
52,660