925 resultados para discrete tomography
Resumo:
To determine the dimensions of the Schneiderian membrane using limited cone beam computed tomography (CBCT) in individuals referred for dental implant surgery, and to determine factors influencing the mucosal thickness.
Resumo:
This study evaluates the dimensions of nasopalatine duct cysts (NPDCs) and the involvement of neighboring anatomical structures using standardized limited cone beam computed tomography (CBCT) and a possible correlation to the patient's age, gender, preoperative symptoms, and postsurgical complications.
Resumo:
The purpose of the present study was to evaluate the detectability and dimensions of periapical lesions, the relationship of the mandibular canal to the roots of the respective teeth, and the dimension of the buccal bone by using limited cone-beam computed tomography (CBCT) in comparison to conventional periapical (PA) radiographs for evaluation of mandibular molars before apical surgery.
Resumo:
The purpose of this experimental study was to investigate the effect of tube tension reduction on image contrast and image quality in pediatric temporal bone computed tomography (CT).
Resumo:
PURPOSE: The purpose of our study was to retrospectively evaluate the specificity, sensitivity and accuracy of computed tomography (CT), digital radiography (DR) and low-dose linear slit digital radiography (LSDR, Lodox(®)) in the detection of internal cocaine containers. METHODS: Institutional review board approval was obtained. The study collectively consisted of 83 patients (76 males, 7 females, 16-45 years) suspected of having incorporated cocaine drug containers. All underwent radiological imaging; a total of 135 exams were performed: nCT=35, nDR=70, nLSDR=30. An overall calculation of all "drug mules" and a specific evaluation of body packers, pushers and stuffers were performed. The gold standard was stool examination in a dedicated holding cell equipped with a drug toilet. RESULTS: There were 54 drug mules identified in this study. CT of all drug carriers showed the highest diagnostic accuracy 97.1%, sensitivity 100% and specificity 94.1%. DR in all cases was 71.4% accurate, 58.3% sensitive and 85.3% specific. LSDR of all patients with internal cocaine was 60% accurate, 57.9% sensitive and 63.4% specific. CONCLUSIONS: CT was the most accurate test studied. Therefore, the detection of internal cocaine drug packs should be performed by CT, rather than by conventional X-ray, in order to apply the most sensitive exam in the medico-legal investigation of suspected drug carriers. Nevertheless, the higher radiation applied by CT than by DR or LSDR needs to be considered. Future studies should include evaluation of low dose CT protocols in order to address germane issues and to reduce dosage.
Resumo:
This paper presents parallel recursive algorithms for the computation of the inverse discrete Legendre transform (DPT) and the inverse discrete Laguerre transform (IDLT). These recursive algorithms are derived using Clenshaw's recurrence formula, and they are implemented with a set of parallel digital filters with time-varying coefficients.
Resumo:
A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.
Resumo:
We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in
Resumo:
This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )