
	Where results make sense

Topic: Reconstruction algorithm

Related Topics

Filtered back projection

Iterative reconstruction

Radon transform

Tomogram

SPECT

Tomographic reconstruction

Medical imaging

Positron emission tomography

Nuclear medicine

Magnetic resonance imaging

Noise

Compton scattering

Nuclear medicine

In the News (Fri 4 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Reconstruction algorithm - Wikipedia, the free encyclopedia
		In tomography, a variety of practical reconstruction algorithms have been developed to implement the process of reconstruction of a 3-dimensional object from its projections.
		These algorithms are designed largely based on the mathematics of the radon transform, statistical knowledge of the data acquisition process and geometry of the data imaging system.
		In medical tomography, the filtered back projection algorithm and its variants are the most efficient algorithms currently in use.
	en.wikipedia.org /wiki/Reconstruction_algorithm (107 words)

	Genome Biology \| Full text \| Enriching for direct regulatory targets in perturbed gene-expression profiles
		To determine the impact of cycles on the accuracy of reconstruction, we assessed the accuracy of the reconstruction under three conditions: when data for only a subset of genes is available; where some accessibility data is missing; and where some of the accessibility data is erroneous.
		The relative sensitivity of the reconstruction algorithm to false-positive data as opposed to false-negative suggests that statistically conservative criteria should be used to define accessibility.
		When this accessibility information is fed into the reconstruction algorithm, four multigene strong components (Figure 4c) are identified as described and collapsed into single nodes in a condensation graph.
	www.genomebiology.com /2004/5/4/R29 (9271 words)

	An Algorithm for Energy Rolling Contact Force Reconstruction (Site not responding. Last check: 2007-10-05)
		Forces reconstructed from different sensors resulted practically the same for a given wheel, forces from nominally equal wheels are statistically compared and the first results of comparison of different rolling stock are shown.
		Authors developed a completely general algorithm for the high-frequency reconstruction of a mobile excitation by using the system properties and the output under a moving input [1]; in this work a faster, simplified and particularly stable procedure for the reconstruction of the contact force 1/3 octave band spectrum is presented.
		Reconstruction algorithm uses the ARMAX model of the track to simulate the response of the system to a known force that moves with the same law of motion of the considered wheel.
	www.dmti.unifi.it /bracciali/ricfzaCPB.htm (2865 words)

	Bern's Surface Reconstruction Page (Site not responding. Last check: 2007-10-05)
		Our algorithm computes a piecewise-linear surface, vertex set exactly equal to the sample points, with a provable guarantee: if the original surface was sampled sufficiently densely, then the reconstructed surface lies within a small error tolerance of the original.
		Our algorithm is especially suitable for scientific visualization, because it has no tuning parameters, computes an interpolating (rather than approximating) surface, and makes no assumptions about the geometry or topology of the surface (other than the minimal assumption that the sample points are dense enough to capture surface features).
		These algorithms use the sample points to define a distance to the surface, then contour the zero set of the distance function on a grid of voxels.
	www.parc.xerox.com /csl/members/bern/surface.html (355 words)

	Comparing FBP and MFA
		Since these two classes of algorithms are quite different in their approaches to tomographic image reconstruction, it is useful to study and compare the performance of these methods.
		As a result, the final reconstructed image is the optimum solution to the global energy function minimization and it is a compromise of the ML reconstruction and the a-priori image model.
		For the MAP reconstruction, the average MSE is very close to the bias, indicating that the reconstructed images are very similar to each other and the random noise level is low.
	www2.ncsu.edu /ncsu/CIL/med_imaging/reconeval/manuscript.doc.html (3174 words)

	Implementation and experimental evaluation of the Constrained ART Algorithm on a multicomputer system. (Site not responding. Last check: 2007-10-05)
		The algorithmic complexity of ART is proportional to the size of volume to be reconstructed and to the number of available projections in a particular problem.
		For this reason, we are going to distinguish between two terms in our algorithmic description; the calculus of the coefficients of the matrix H, and the GART algorithm itself as it is shown in ( 3) and ( 4).
		On the other hand, the convergence of the PGART algorithm is accelerated with the use of the permuted H matrix due to the orthogonality of the equations that are consecutively applied [ 11 ].
	www.cnb.uam.es /~bioinfo/paper/pgart (3016 words)

	Surface Reconstruction
		Reconstructing surfaces from sample points in a faithful way is a difficult challenge.
		The reconstructed surface should be topologically equivalent to the sampled surface and also geometrically close.
		This algorithm can be used with crust or our cocone algorithm to make them robust and detect boundaries.
	www.cse.ohio-state.edu /~tamaldey/surfrecon.htm (429 words)

	Abstract
		The main problem with incorporating a-priori-information into the reconstruction process is to find a compromise between making insufficient use of the seg- mentation of MRT or CT data on the one hand and a reproduction of the a-priori-information on the other hand.
		Reconstructions of computer simulations and patient data show that the proposed algorithm has the capacity to smooth the noise and maintain sharp edges without introducing over/under shoots and ripples around the edges.
		Reconstruction of the first method recovered resolution better at the phantom periphery, consistent with the theory that the formula is approximated for far-field regions.
	www.umich.edu /~nucmedim/am7b.htm (3776 words)

	Spiraling Edge Algorithm for Fast Surface Reconstruction
		Surface reconstruction algorithms that start with a set of unorganized points are extremely time-consuming.
		We have developed a specialized algorithm for surface reconstruction that is three orders of magnitude faster than algorithms for the general case.
		Surface reconstruction algorithms for the general case report times ranging between 10 and 20 minutes of CPU time, depending on the method used.
	www.cs.sandia.gov /MICS/newsnotes/crossno_990107.htm (387 words)

	DIMACS Workshop on Surface Reconstruction
		The Cocone algorithm is a Voronoi based method for surface reconstruction which has geometric and topological guarantees for the output surface given that the input point sample is sufficiently dense.
		Second, the algorithm may be generalized to the case reconstruction of manifolds, of arbitrary dimension and codimension.
		An incremental technique is used to reconstruct the surface / manifold; as a result, the algorithm's complexity, as a function of the number of simplices, is independent of the dimension of the manifold or embedding space.
	dimacs.rutgers.edu /Workshops/Surface/abstracts.html (3283 words)

	Reconstruction Algorithm
		(d) Reconstructed surface model of the distal end of the femur.
		Our first algorithm is based on the concept of signed distance.
		1 shows an example of reconstruction using this algorithm.
	www.nlm.nih.gov /research/visible/vhp_conf/bajajphy/node5.htm (392 words)

	Abstract
		The multiresolution EM algorithm is an attempt to improve the EM based estimation through an effective use of multi-resolution grids in both image- reconstruction and detector spaces.
		The algorithm begins iterating with the coarsest grid level in both spaces and switches both image and detector grid levels simultaneously until the finest detector and image grid level are reached.
		This algorithm incorporates a wavelet decomposition based transition criterion for switching grid levels and a wavelet spline based interpolation method for projecting the intermediate reconstruction from a specific image grid level to the next finer grid.
	www.umich.edu /~nucmedim/am6b.htm (3683 words)

	Abstracts of Recent Publications
		Our algorithm is based on the standard wavelet decomposition of the transport operator and makes use of a four-dimensional wavelet representation for spatially- and angularly-varying radiance distributions.
		We have integrated these algorithms in a prototype mesh viewer that supports progressive transmission, dynamic display at a constant frame rate independent of machine characteristics and load, and interactive choice of tradeoff between the amount of detail in geometry and color.
		The reconstruction algorithm is based on a piecewise-cubic scattered data interpolation method originally proposed by Clough and Tocher.
	salesin.cs.washington.edu /abstracts.html (4935 words)

	Stephanie Moreau's thesis on CMS tracker
		The primary vertex is generally reconstructed by a different algorithm; its spatial resolution is superior, as the number of tracks associated to it is rather large, and the reconstruction is done only on a plane transverse to the beam.
		I finally designed and developped an algorithm for reconstructing secondary vertices and integrated it into the official code of analysis and reconstruction for CMS data : ORCA.
		It is an iterative algorithm : Each vertex seed (a potentiel vertex defined as the intersection of two tracks) is attracted by all tracks; this attraction is parametrized by a potential of the analytic shape of a Boltzman distribution in
	lastethese.free.fr /summary_in_english_6p.html (2097 words)

	3d surface reconstruction (Site not responding. Last check: 2007-10-05)
		The Crust Algorithm is a new algorithm for the reconstruction of surfaces of arbitrary topology from unorganized sample points in 3d.
		The algorithm is the first one for this problem with provable guarantees.
		Given a "good sample" from a smooth surface, the output is guraranteed to be topologically correct and convergent to the original surface as the sampling density increases.
	web.mit.edu /manoli/crust/www/crust.html (147 words)

	Algebraic Description of Coordination Sequences
		Another important feature of the algorithm is that a "hashing" lookup technique was used to determine whether a newly generated node - a candidate for the next shell - was already in the middle or previous shell.
		Since the computation of the CS terms with the recursive reconstruction algorithm requires the whole sequence to be held in memory, major difficulties arise for large period lengths.
		This algorithm is several orders of magnitude slower than the simpler recursive reconstruction algorithm, but - in combination with the manipulation techniques (M2) and (M3) - enabled the determination of the topological density even for the largest cases.
	www.research.att.com /~njas/doc/ac96cs (5164 words)

	An inverse algorithm for velocity reconstruction
		We have devised an inverse algorithm for the reconstruction of underground velocity from seismic waveforms.
		The analytical verification of the reconstruction algorithm makes use of a homogeneous Green function which is defined to be the difference between the causal Green function and its acausal counterpart.
		The algorithm is derived for acoustic waves but has the potential to be extended to elastic waves.
	stacks.iop.org /0266-5611/14/1345 (303 words)

	Va-Vm
		V contains a selection of popular reconstruction tools and is aimed at providing a means for the distribution of such functions among interested researchers.
		Algorithms derived from symbolic model checking are then used to compute quantitative information about the model.
		There are implementations of standard vision algorithms including Canny's edge detector, algorithms for approximating edges by straight lines, the optical flow estimation procedure of Lucas and Kanade, and the camera calibration procedure of Tsai.
	stommel.tamu.edu /~baum/linuxlist/linuxlist/node49.html (8293 words)

	[No title] (Site not responding. Last check: 2007-10-05)
		In general, Jet or MET algorithm need to be tuned and optimized in any specific analysis for better the performance and efficiency.
		Jet and MET algorithm are sensitive to the final states accompanied with the pileup, multiple-scattering, underlying-events, detector performance (mainly calorimetry)...
		Energy Flow Algorithm for Jet and MET reconstruction is promising for this purpose.
	cms00.phys.ufl.edu /cms/JetMET/Algorithm (1791 words)

	A 3-D RECONSTRUCTION ALGORITHM THAT ACCOMMODATES UNCERTAINTY IN CAMERA POSITIONING (Site not responding. Last check: 2007-10-05)
		The standard approach for making these reconstructions is to determine the camera positions or otherwise calibrate the field of view, and then reconstruct the scene (Faugeras, 1992; Hartley et al., 1992).
		The algorithm was originally devised to allow the surface shapes of embryos to be reconstructed from images collected using a robotic macroscope, but it is ideal for other biomechanics applications.
		Accuracy was confirmed by comparing the reconstruction with photographs of the same embryo and serial sections of other embryos.
	www.asb-biomech.org /onlineabs/NACOB98/61 (634 words)

	The Dependency Reconstruction Algorithm (Site not responding. Last check: 2007-10-05)
		We will now study the dependency reconstruction algorithm [ 2, 3 ].
		At the primary a transaction T may access data at several different computers.
		All updates have been made public, and all locks have been released.
	www.cs.unc.edu /~sharma/professional/papers/recovery/node6.html (759 words)

	A Fast Reconstruction Algorithm for Gene Networks (Site not responding. Last check: 2007-10-05)
		Pathway reconstruction is a fundamental task in system biology, and its goal is to construct a model of the network of genetic regulatory interactions.
		We assume that the dynamics can be approximated by a linear system of ordinary differential equations, and we deal with the problem of network reconstruction in the practical situations in which the amount of available data is largely insufficient to uniquely determine the network.
		Its performance is tested and validated in a series of in numero experiments on model gene networks, whose data is generated in several different ways, such as linear and nonlinear generation, scale free and non-interacting sparse networks.
	www.iscb.org /ismb2004/posters/mognoATdis.uniroma1.it_457.html (196 words)

	Surface Reconstruction - Algorithm
		The output is thus guaranteed to be a piecewise linear orientable manifold, possibly with boundary.
		We implemented this algorithm using the CGAL library.
		When the post processing step is not needed, the total running time of the algorithm seems in practice to be less than twice the time spent computing the Delaunay triangulation.
	cgal.inria.fr /Reconstruction/algorithm.html (212 words)

	Emphysema: Effect of Reconstruction Algorithm on CT Imaging Measures -- Boedeker et al. 232 (1): 295 -- Radiology
		Box plot of change in density mask score (compared with that with standard algorithm) as a function of reconstruction algorithm category.
		Number of comparisons was 23, 31, and 12 for overenhancing, sharp, and smooth algorithms, respectively.
		algorithm (sharp category) was used to reconstruct the images.
	radiology.rsnajnls.org /cgi/content/full/232/1/295 (4261 words)

	Implementation of a Multiresolution Surface Reconstruction Algorithm (Site not responding. Last check: 2007-10-05)
		These features are available at object boundaries, abrupt changes in surface orientation, and along surface markings; all of which occur only at scattered points within the image.
		We have implemented a version of this algorithm and found some constraints on its use.
		We also investigated the effect of different Prolongations/Restrictions and of using a higher finite element space on the algorithm.
	www.cs.cmu.edu /afs/cs/usr/sdc/www/papers/paper-8501.html (200 words)

	An Improved Cone-Beam Reconstruction Algorithm for the Circular Orbit (Site not responding. Last check: 2007-10-05)
		An Improved Cone-Beam Reconstruction Algorithm for the Circular Orbit
		Summary: By reformulating Grangeat's algorithm for the circular orbit, it is discovered that an arbitrary function to be reconstructed, f(r
		Thus, a new cone-beam reconstruction algorithm for the circular orbit is proposed as follows: (1) compute f
	www.scanning-fams.org /scanabstracts/SCANNING96/18572.html (178 words)

	A New Voronoi-Based Surface Reconstruction Algorithm - Amenta, Bern, Kamvysselis (ResearchIndex)
		A New Voronoi-Based Surface Reconstruction Algorithm - Amenta, Bern, Kamvysselis (ResearchIndex)
		Abstract: We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3.
		Given a "good sample" from a smooth surface, the output is guaranteed to be topologically correct and convergent to the original surface as the sampling density increases.
	citeseer.ist.psu.edu /42879.html (469 words)

	Reconstruction algorithm in TutorGig Encyclopedia
		In tomography, a variety of practical 'reconstruction algorithms ' have been developed to implement the process of reconstruction of a 3-dimensional object from its projections.
		Magazines See all 6 results in Reconstruction algorithm...
		DVD See all 4 results in Reconstruction algorithm...
	www.tutorgig.com /ed/Reconstruction_algorithm (308 words)

	Three-dimensional reconstruction from reduced sets of very noisy images acquired following a single-axis tilt schema: ... (Site not responding. Last check: 2007-10-05)
		In this work we propose a reconstruction algorithm (ART with blobs) that has not been previously used in electron Tomography and we compare it with the standard method in the field (weighted back projection, WBP).
		In general, the reconstruction problem is undetermined (due to the limited number of projections) and the data are inconsist (due to the high level of noise).
		Results are presented both for simplified line integral data and for realistic simulations of macromolecular structures embedded in amorphous ice.
	www.cnb.uam.es /~bioinfo/paper/jsball/jsb.html (282 words)

Try your search on: Qwika (all wikis)