## Organizations (1986)

Venue: | Proceedings of the M~RCH |

Citations: | 5 - 0 self |

### BibTeX

@INPROCEEDINGS{(eds86organizations,

author = {Vincent Lepetit (eds and Adrien Bartoli and Nassir Navab and Nassir Navab},

title = {Organizations},

booktitle = {Proceedings of the M~RCH},

year = {1986},

publisher = {John Wiley and Sons}

}

### OpenURL

### Abstract

Proceedings DEFORM’06 is associated to BMVC’06, the 7th British Machine Vision Conference Preface These are the proceedings of DEFORM’06, the Workshop on Image Registration in Deformable Environments, associated to BMVC’06, the 17th British Machine Vision Conference, held in Edinburgh, UK, in

### Citations

3080 | Snakes: Active contour models
- Kass, Witkin, et al.
- 1988
(Show Context)
Citation Context ...1 Introduction The subdivision surfaces are very popular approach for smooth surface representation. They has been extensively used in Computer Graphics for geometric modeling, and computer animation =-=[15, 12, 4]-=-. The problem of 3D reconstruction from unorganized data points using the subdivision surfaces has also been addressed by the graphics community [7, 9, 11, 14, 2, 8]. Those methods use noise free data... |

489 | R.: Distortion invariant object recognition on the dynamic link architecture
- Lades, Vorbruggen, et al.
- 1993
(Show Context)
Citation Context ...1 Introduction The subdivision surfaces are very popular approach for smooth surface representation. They has been extensively used in Computer Graphics for geometric modeling, and computer animation =-=[15, 12, 4]-=-. The problem of 3D reconstruction from unorganized data points using the subdivision surfaces has also been addressed by the graphics community [7, 9, 11, 14, 2, 8]. Those methods use noise free data... |

319 | A survey of general-purpose computation on graphics hardware. Computer Graphics Forum
- Owens, Luebke, et al.
- 2007
(Show Context)
Citation Context ...ffeomorphism, D. Mumford and E. Sharon have worked on the question of the conformal fingerprint for conformal diffeomorphisms between two simply connected regions of the plane [11]. T.F. Cootes et al.=-=[2]-=- work on building a parametric statistical model on the space of diffeomorphisms. A great deal of interest in pattern analysis using diffeomorphic registration has been generated in the field of compu... |

237 | Linear Algebra Operators for GPU Implementation of Numerical Algorithms
- Kruger, Westermann
- 2003
(Show Context)
Citation Context ...a function m : Ω → R which assigns a magnitude to a force at every point of the domain. 3 The same general concept for computing the forces with separate terms for direction and magnitiude is used in =-=[8]-=-. This way we get the following modified formula for the computation of the forces f (x) = m(x) fn(x) . (10) The most simple alternative for m is to not further modify the force term from Equation (9)... |

218 | Sparse matrix solvers on the gpu: conjugate gradients and multigrid
- Bolz, Farmer, et al.
(Show Context)
Citation Context ... geometric modeling, and computer animation [15, 12, 4]. The problem of 3D reconstruction from unorganized data points using the subdivision surfaces has also been addressed by the graphics community =-=[7, 9, 11, 14, 2, 8]-=-. Those methods use noise free data produced by high quality laser scanners. In Computer Vision the 3D shapes were extracted from the images which involve very noisy information. Since this problem is... |

171 |
S.: Object Matching Using Deformable Templates
- Jain, Zhong, et al.
- 1996
(Show Context)
Citation Context ...egistration framework largely based on the papers of Rueckert et al. [12] and Mattes et al. [8]. The similarity measure is the mutual information measure using an implementation by Thévenaz and Unser =-=[16]-=-. The deformation field is parameterised by cubic B-splines. A multiresolution approach is taken to avoid local minima, using a Gaussian pyramid with a subsampling factor of two in each dimension. We ... |

115 | Deformable templates for face recognition - Yuille - 1991 |

98 | Multi-resolution real-time stereo on commodity graphics hardware
- Yang, Pollefeys
- 2003
(Show Context)
Citation Context ...ation is measured by calculating the lung overlap of the registered image with the fixed one. For this purpose automatic lung segmentations are made with an algorithm based on the method by Hu et al. =-=[3,13]-=-. The overlap measure is defined as overlap � 2 ·|L1∩ L2| , (5) |L1|+|L2| where Li is the set of all voxels from the lung, and where |Li| is the size of set Li. From the results reported in Table 1, w... |

84 |
The Cg Tutorial: The definitive guide to programmable real-time graphics. Addison-Wesley Pub Co, February 2003. 212 Juan Fernndez-Recio, Maxim Totrov, and Ruben Abagyan. Soft proteinprotein docking in internal coordinates
- Fernando, Kilgard
(Show Context)
Citation Context ...canners. In Computer Vision the 3D shapes were extracted from the images which involve very noisy information. Since this problem is highly under-constrained, the generic models were extensively used =-=[6, 13, 1]-=- to constrain the solution of the reconstruction task. The main challenge is to find a suitable model parameterization where the number of parameters is small compared to the overall dimensionality of... |

80 |
The fft on a gpu
- Moreland, Angel
- 2003
(Show Context)
Citation Context ...describing the deformation, constraining the nonlinear part of the deformation at rigid locations by multiplication with a weight function. Recently, some approaches similar to our own were published =-=[7, 11]-=-, in which rigidity is enforced by penalising deviation of the Jacobian from being orthonormal. In this paper we propose a penalty term that is capable of penalising locally nonrigid transformations, ... |

69 | Using generative models for handwritten digit recognition
- Revow, Williams, et al.
- 1996
(Show Context)
Citation Context ...ocesses of feature extraction and classification in this area. Deformable or elastic approaches in which the displacement between input and prototype patterns is computed have also been studied (e.g. =-=[17, 18, 19, 20, 21, 22]-=-). After reviewing the previous works, it was thought that the complexity of the procedure and the high computation cost were the main drawbacks of most of these deformable approaches. In 1994, a defo... |

57 | Representation and recognition of handwritten digits using deformable templates
- Jain, Zongker
- 1997
(Show Context)
Citation Context ...ocesses of feature extraction and classification in this area. Deformable or elastic approaches in which the displacement between input and prototype patterns is computed have also been studied (e.g. =-=[17, 18, 19, 20, 21, 22]-=-). After reviewing the previous works, it was thought that the complexity of the procedure and the high computation cost were the main drawbacks of most of these deformable approaches. In 1994, a defo... |

44 |
Elastic matching of line drawings
- Burr
- 1981
(Show Context)
Citation Context ...constraints on the landmarks) with a function σ(t,tj), depending on the (normalized) distance between t and t j: (4) σ(t,tj) = |t − t j|. (5) This form has favorable properties for image registration =-=[17]-=-. However, different functions could be used, as the one described in [9]. With the constraints given by Equation 2, we can calculate the coefficients B of the non-linear term by expressing Equation 1... |

40 |
A dynamic Model for Image Registration
- Burr
- 1981
(Show Context)
Citation Context ...describing the deformation, constraining the nonlinear part of the deformation at rigid locations by multiplication with a weight function. Recently, some approaches similar to our own were published =-=[7, 11]-=-, in which rigidity is enforced by penalising deviation of the Jacobian from being orthonormal. In this paper we propose a penalty term that is capable of penalising locally nonrigid transformations, ... |

35 | Towards fast non-rigid registration
- Clarenz, Droske, et al.
- 2002
(Show Context)
Citation Context ...ity, with the exception of affine maps, none of these methods can guarantee that the matching function is in fact a diffeomorphism. The second strategy is to use a deformation vector field such as in =-=[6]-=-. The diffeomorphism is then the unit time flow induced by the vector field. The vector field representation has three drawbacks: first, calculating features of the full diffeomorphism involves solvin... |

25 |
Multilevel relaxation in low-level computer vision. Multi-resolution image processing and Analysis
- Glazer
- 1984
(Show Context)
Citation Context ...ead of (u [t] ,v [t] ). To avoid the solution being trapped in the local minima and to compute the displacement with a small number of iterations, the coarse-to-fine strategy should be very promising =-=[28, 29]-=-. The number of stages for the coarse-to-fine strategy is referred to as N. N −1 lower resolutional sets of images with 1/(2 N−n ) 2 of the original size, fn and gn, are produced from the original set... |

17 | Image registration by a regularized gradient flow - a streaming implementation in dx9 graphics hardware
- Strzodka, Droske, et al.
- 2005
(Show Context)
Citation Context ... information about the camera or its motion. We therefore used a model-driven bundle-adjustment technique [6] to compute the relative motion and, thus, register the images. We then used the technique =-=[5]-=- to derive the clouds of 3–D points depicted by Fig. 5(b). Because we used fewer images and an automated self-calibration procedure as opposed to a sophisticated manual Page 7sProceedings of the Works... |

17 |
Shape matching using LAT and its application to handwritten numeral recognition
- Wakahara
- 1994
(Show Context)
Citation Context ...ocesses of feature extraction and classification in this area. Deformable or elastic approaches in which the displacement between input and prototype patterns is computed have also been studied (e.g. =-=[17, 18, 19, 20, 21, 22]-=-). After reviewing the previous works, it was thought that the complexity of the procedure and the high computation cost were the main drawbacks of most of these deformable approaches. In 1994, a defo... |

14 |
Multiresolution elastic matching. Computer Vision
- Bajcsy, Kovacic
- 1989
(Show Context)
Citation Context ...ties of the tissues surrounding a pathology. Replacing the distance by another function would then be straightforward using our formulation. Although validation is a common difficulty in registration =-=[13]-=-, we plan an evaluation phase in collaboration with clinicians, as well as comparison with other methods. Acknowledgements The authors would like to thank Liège, Lille, Louisville and Val de Grâce Hos... |

14 |
Computation of stereo disparity using regularization
- March
- 1988
(Show Context)
Citation Context ...eformable approaches. In 1994, a deformable approach to handwritten character recognition was proposed [23, 24], which was originally inspired by a regularization method for a stereo matching problem =-=[25]-=-. The deformable approach has the virtue of simplicity, and is also applicable to handwritten Chinese character by using the processes of feature extraction and statistical classification together [26... |

8 |
and S.Mann, “Using multiple graphics cards as a general purpose parallel computer : Applications to computer vision
- Fung
(Show Context)
Citation Context ...drés Bruhn, Joachim Weickert, Christian Feddern, Timo Kohlberger, and Christoph Schnörr. Variational optical flow computation in real time. IEEE Transactions on Image Processing, 14(5):608–615, 2005. =-=[4]-=- Gerardo Hermosillo. Variational Methods for Multimodal Image Matching. PhD thesis, Université de Nice - Sophia Antipolis, 2002. [5] Berthold K.P. Horn and Brian G. Schunck. Determining optical flow. ... |

8 |
A handwritten character recognition system using hierarchical displacement extraction algorithm
- Mizukami, Koga
- 1996
(Show Context)
Citation Context ...plexity of the procedure and the high computation cost were the main drawbacks of most of these deformable approaches. In 1994, a deformable approach to handwritten character recognition was proposed =-=[23, 24]-=-, which was originally inspired by a regularization method for a stereo matching problem [25]. The deformable approach has the virtue of simplicity, and is also applicable to handwritten Chinese chara... |

7 |
A handwritten Chinese character recognition system using hierarchical displacement extraction based on directional features
- Mizukami
- 1998
(Show Context)
Citation Context ...25]. The deformable approach has the virtue of simplicity, and is also applicable to handwritten Chinese character by using the processes of feature extraction and statistical classification together =-=[26]-=-. Although the simple iterative equation could efficiently compute the displacement, further reduction of computation time was desired. To mitigate this problem, gradual prototype elimination was prop... |

4 |
The rubber-mask technique, I: Pattern measurement and analysis
- Widrow
- 1973
(Show Context)
Citation Context ...= φ ∗ n (Itemplate). (2) We will not address the question of how to calculate φn given In and Itemplate. There is a large existing literature devoted to solving the diffeomorphic registration problem =-=[10]-=-, and we postpone discussing the relationship between the morphlet transform and registration algorithms for a later publication. We will simply assume that we can calculate φn satisfying (2) or some ... |

3 |
A new approach to recognition of deformed patterns
- Daffertshofer, Haken
- 1994
(Show Context)
Citation Context |

3 |
Handwritten digit recognition by hierarchical displacement extraction with gradual prototype eliminations
- Mizukami, Sato, et al.
- 2000
(Show Context)
Citation Context ...e simple iterative equation could efficiently compute the displacement, further reduction of computation time was desired. To mitigate this problem, gradual prototype elimination was proposed in 2000 =-=[27]-=-, where the computation time was reduced to 1/3 without degradation of recognition performance. However, the required computational load still fails to match the ability of present common computers. T... |

2 |
One dimensional-two dimensional dynamic programming matching algorithm for character recognition
- Sakoe, Masroor, et al.
- 1994
(Show Context)
Citation Context |

2 |
Dense matching of two views with large displacement
- Yokoya
- 1994
(Show Context)
Citation Context ...ead of (u [t] ,v [t] ). To avoid the solution being trapped in the local minima and to compute the displacement with a small number of iterations, the coarse-to-fine strategy should be very promising =-=[28, 29]-=-. The number of stages for the coarse-to-fine strategy is referred to as N. N −1 lower resolutional sets of images with 1/(2 N−n ) 2 of the original size, fn and gn, are produced from the original set... |