• No results found

iterative closest point based registration algorithms

Non-rigid MR-TRUS image registration for image-guided prostate biopsy using correlation ratio-based mutual information

Non-rigid MR-TRUS image registration for image-guided prostate biopsy using correlation ratio-based mutual information

... non-rigid registration algorithms have been proposed over the past 20 years ...image registration and has been independently proposed by Collignon [9] and Viola ...map registration frame ...

21

An Improved Iterative Closest Points Algorithm

An Improved Iterative Closest Points Algorithm

... matching algorithms which is mostly used in three-dimension point cloud registra- ...is based on the iterative optimization ...each point of the target point set is focused to ...

7

Anisotropic non-rigid Iterative Closest Point Algorithm for respiratory motion abdominal surface matching

Anisotropic non-rigid Iterative Closest Point Algorithm for respiratory motion abdominal surface matching

... surface registration algorithms. A non-rigid surface registration algorithm which uses feature points and deformation constraint was presented by ...two point clouds using Intrinsic Shape ...

18

A Review of Point Feature Based Medical Image Registration

A Review of Point Feature Based Medical Image Registration

... the registration between two point sets subsampled from the vessel centerlines or bifurcations in vasculature interventions [17, 20, 21, 29, 31, 47, 61], contour or surfaces of bone in orthopaedics [34, ...

16

Iterative algorithms for minimum-norm fixed point of non-expansive mapping in hilbert space

Iterative algorithms for minimum-norm fixed point of non-expansive mapping in hilbert space

... struct iterative sequence to find the minimum-norm fixed point of a nonexpansive mapping T, ...two iterative methods (one implicit and one explicit) for finding the minimum-norm fixed point of ...

10

SPOT: Sliced Partial Optimal Transport

SPOT: Sliced Partial Optimal Transport

... 7 LIMITATIONS, CONCLUSIONS AND FUTURE WORK We have proposed the first fast approach for computing sliced opti- mal transport of point sets of different cardinalities, and used it for color matching and within a ...

13

Planetary Crater Detection and Registration Using Marked Point Processes, Multiple Birth and Death Algorithms, and Region-Based Analysis

Planetary Crater Detection and Registration Using Marked Point Processes, Multiple Birth and Death Algorithms, and Region-Based Analysis

... Moser, "Automatic Extraction of Ellipsoidal Features for Planetary Image Registration," IEEE Geoscience and Remote Sensing Letters, vol. Zerubia, "Automatic Flamingo detectio[r] ...

30

A Soft-Input Soft-Output Target Detection Algorithm for Passive Radar

A Soft-Input Soft-Output Target Detection Algorithm for Passive Radar

... processing, based on soft-input soft-output processing and Bayesian sparse ...presence based on its received signal and the prior information received from a central ...this iterative Bayesian ...

12

Some Geometric Problems on OMTSE Optoelectronic Computer

Some Geometric Problems on OMTSE Optoelectronic Computer

... parallel algorithms on these optoelectronic computers have been addressed and studied exten- sively [3, 4, 5, 7, 8, 9, 10, ...geometry algorithms such as Convex Hull, Smallest Enclosing Rectangle, ...

8

SPIRAL/HELICAL multirow detector computed tomography

SPIRAL/HELICAL multirow detector computed tomography

... single-slice algorithms for CBCT: multirow Fourier reconstruction (MFR) and advanced single-slice rebinning (ASSR), in the framework of the generalized parallel projection using -filtering ...MDCT ...

5

LITERATURE REVIEW ON ENERGY CONSUMPTION AND CONSERVATION IN MOBILE DEVICE

LITERATURE REVIEW ON ENERGY CONSUMPTION AND CONSERVATION IN MOBILE DEVICE

... kuchipudi based on image processing ...pixel algorithms are tested on a dataset of 500 dance images with 100 ...pixel based SLIC segregation registered an average segmentation score of ...

7

Solving a class of functional equations using fixed point theorems

Solving a class of functional equations using fixed point theorems

... It is clear that the conditions of Theorem . are fulfilled. Thus Theorem . guarantees that functional equation (.) possesses a unique solution w ∈ B(S), which satisfies (C). Next we prove the existence, uniqueness ...

19

Finite Iterative Algorithm for Solving a Class of Complex Matrix Equation with Two Unknowns of General Form

Finite Iterative Algorithm for Solving a Class of Complex Matrix Equation with Two Unknowns of General Form

... gradient iterative algorithms for general matrix equations [6, 12] and hierarchical least squares iterative algorithms for generalized coupled Sylvester matrix equations and general coupled ...

12

Iterative Algorithms for Finding Common Solutions to Variational Inclusion Equilibrium and Fixed Point Problems

Iterative Algorithms for Finding Common Solutions to Variational Inclusion Equilibrium and Fixed Point Problems

... fixed point x ∗ , which solves the quadratic minimization problem ...explicit iterative algorithm to studying the existence problem and the approximation problem of the solution to the quadratic ...

17

General iterative algorithms for mixed equilibrium problems, variational inequalities and fixed point problems

General iterative algorithms for mixed equilibrium problems, variational inequalities and fixed point problems

... general iterative algorithm for finding a common solution of a mixed equilibrium problem, a general system of variational inequalities and a fixed point problem of infinitely many nonexpansive mappings in a ...

25

Alternating mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings

Alternating mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings

... Very recently, Moudafi (Alternating CQ-algorithms for convex feasibility and split fixed-point problems, J. Nonlinear Convex Anal. ) introduced an alternating CQ-algorithm with weak convergence for the ...

12

On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces

... considered numerous iteration processes and studied their rate of convergence. For this see [1]-[4], [6]- [8] and [10]-[14]. Some iterations were introduced to study the fixed points of the contractions. Also, others ...

36

The strong convergence theorems for split common fixed point problem ofasymptotically nonexpansive mappings in Hilbert spaces

The strong convergence theorems for split common fixed point problem ofasymptotically nonexpansive mappings in Hilbert spaces

... an iterative algorithm is introduced to solve the split common fixed point problem for asymptotically nonexpansive mappings in Hilbert ...The iterative algorithm presented in this paper is shown to ...

11

Multi Criteria Decision Making Technique For Machine Learning Algorithms: Iterative And   Non-Iterative Algorithms

Multi Criteria Decision Making Technique For Machine Learning Algorithms: Iterative And Non-Iterative Algorithms

... hence algorithms develop knowledge from past ...learning algorithms that are used to discover predictive ...The algorithms that are widely adopted in machine learning are supervised learning and ...

12

Fixed point iteration processes for asymptotic pointwise nonexpansive mapping in modular function spaces

Fixed point iteration processes for asymptotic pointwise nonexpansive mapping in modular function spaces

... We would like to emphasize that all convergence theorems proved in this paper define constructive algorithms that can be actually implemented. When dealing with specific ap- plications of these theorems, one should ...

23

Show all 10000 documents...

Related subjects