Optimizing Energy Consumption in Vehicular Sensor Networks by Clustering Using Fuzzy C-Means and Fuzzy Subtractive Algorithms

Science.gov (United States)

Ebrahimi, A.; Pahlavani, P.; Masoumi, Z.

2017-09-01

Traffic monitoring and managing in urban intelligent transportation systems (ITS) can be carried out based on vehicular sensor networks. In a vehicular sensor network, vehicles equipped with sensors such as GPS, can act as mobile sensors for sensing the urban traffic and sending the reports to a traffic monitoring center (TMC) for traffic estimation. The energy consumption by the sensor nodes is a main problem in the wireless sensor networks (WSNs); moreover, it is the most important feature in designing these networks. Clustering the sensor nodes is considered as an effective solution to reduce the energy consumption of WSNs. Each cluster should have a Cluster Head (CH), and a number of nodes located within its supervision area. The cluster heads are responsible for gathering and aggregating the information of clusters. Then, it transmits the information to the data collection center. Hence, the use of clustering decreases the volume of transmitting information, and, consequently, reduces the energy consumption of network. In this paper, Fuzzy C-Means (FCM) and Fuzzy Subtractive algorithms are employed to cluster sensors and investigate their performance on the energy consumption of sensors. It can be seen that the FCM algorithm and Fuzzy Subtractive have been reduced energy consumption of vehicle sensors up to 90.68% and 92.18%, respectively. Comparing the performance of the algorithms implies the 1.5 percent improvement in Fuzzy Subtractive algorithm in comparison.

X-ray image subtracting system

International Nuclear Information System (INIS)

Wesbey, W.H.; Keyes, G.S.; Georges, J.-P.J.

1982-01-01

An X-ray image subtracting system for making low contrast structures in the images more conspicuous is described. An X-ray source projects successive high and low energy X-ray beam pulses through a body and the resultant X-ray images are converted to optical images. Two image pick-up devices such as TV cameras that have synchronously operated shutters receive the alternate images and convert them to corresponding analog video signals. In some embodiments, the analog signals are converted to a matrix of digital pixel signals that are variously processed and subtracted and converted to signals for driving a TV monitor display and analog storage devices. In other embodiments the signals are processed and subtracted in analog form for display. The high and low energy pulses can follow each other immediately so good registration between subtracted images is obtainable even though the anatomy is in motion. The energy levels of the X-ray pulses are chosen to maximize the difference in attenuation between the anatomical structure which is to be subtracted out and that which remains. (author)

Improved Savitzky-Golay-method-based fluorescence subtraction algorithm for rapid recovery of Raman spectra.

Science.gov (United States)

Chen, Kun; Zhang, Hongyuan; Wei, Haoyun; Li, Yan

2014-08-20

In this paper, we propose an improved subtraction algorithm for rapid recovery of Raman spectra that can substantially reduce the computation time. This algorithm is based on an improved Savitzky-Golay (SG) iterative smoothing method, which involves two key novel approaches: (a) the use of the Gauss-Seidel method and (b) the introduction of a relaxation factor into the iterative procedure. By applying a novel successive relaxation (SG-SR) iterative method to the relaxation factor, additional improvement in the convergence speed over the standard Savitzky-Golay procedure is realized. The proposed improved algorithm (the RIA-SG-SR algorithm), which uses SG-SR-based iteration instead of Savitzky-Golay iteration, has been optimized and validated with a mathematically simulated Raman spectrum, as well as experimentally measured Raman spectra from non-biological and biological samples. The method results in a significant reduction in computing cost while yielding consistent rejection of fluorescence and noise for spectra with low signal-to-fluorescence ratios and varied baselines. In the simulation, RIA-SG-SR achieved 1 order of magnitude improvement in iteration number and 2 orders of magnitude improvement in computation time compared with the range-independent background-subtraction algorithm (RIA). Furthermore the computation time of the experimentally measured raw Raman spectrum processing from skin tissue decreased from 6.72 to 0.094 s. In general, the processing of the SG-SR method can be conducted within dozens of milliseconds, which can provide a real-time procedure in practical situations.

Level-1 pixel based tracking trigger algorithm for LHC upgrade

CERN Document Server

Moon, Chang-Seong

2015-01-01

The Pixel Detector is the innermost detector of the tracking system of the Compact Muon Solenoid (CMS) experiment at CERN Large Hadron Collider (LHC). It precisely determines the interaction point (primary vertex) of the events and the possible secondary vertexes due to heavy flavours ($b$ and $c$ quarks); it is part of the overall tracking system that allows reconstructing the tracks of the charged particles in the events and combined with the magnetic field to measure their impulsion. The pixel detector allows measuring the tracks in the region closest to the interaction point. The Level-1 (real-time) pixel based tracking trigger is a novel trigger system that is currently being studied for the LHC upgrade. An important goal is developing real-time track reconstruction algorithms able to cope with very high rates and high flux of data in a very harsh environment. The pixel detector has an especially crucial role in precisely identifying the primary vertex of the rare physics events from the large pile-up (P...

OPTIMIZING ENERGY CONSUMPTION IN VEHICULAR SENSOR NETWORKS BY CLUSTERING USING FUZZY C-MEANS AND FUZZY SUBTRACTIVE ALGORITHMS

Directory of Open Access Journals (Sweden)

A. Ebrahimi

2017-09-01

Full Text Available Traffic monitoring and managing in urban intelligent transportation systems (ITS can be carried out based on vehicular sensor networks. In a vehicular sensor network, vehicles equipped with sensors such as GPS, can act as mobile sensors for sensing the urban traffic and sending the reports to a traffic monitoring center (TMC for traffic estimation. The energy consumption by the sensor nodes is a main problem in the wireless sensor networks (WSNs; moreover, it is the most important feature in designing these networks. Clustering the sensor nodes is considered as an effective solution to reduce the energy consumption of WSNs. Each cluster should have a Cluster Head (CH, and a number of nodes located within its supervision area. The cluster heads are responsible for gathering and aggregating the information of clusters. Then, it transmits the information to the data collection center. Hence, the use of clustering decreases the volume of transmitting information, and, consequently, reduces the energy consumption of network. In this paper, Fuzzy C-Means (FCM and Fuzzy Subtractive algorithms are employed to cluster sensors and investigate their performance on the energy consumption of sensors. It can be seen that the FCM algorithm and Fuzzy Subtractive have been reduced energy consumption of vehicle sensors up to 90.68% and 92.18%, respectively. Comparing the performance of the algorithms implies the 1.5 percent improvement in Fuzzy Subtractive algorithm in comparison.

[Affine transformation-based automatic registration for peripheral digital subtraction angiography (DSA)].

Science.gov (United States)

Kong, Gang; Dai, Dao-Qing; Zou, Lu-Min

2008-07-01

In order to remove the artifacts of peripheral digital subtraction angiography (DSA), an affine transformation-based automatic image registration algorithm is introduced here. The whole process is described as follows: First, rectangle feature templates are constructed with their centers of the extracted Harris corners in the mask, and motion vectors of the central feature points are estimated using template matching technology with the similarity measure of maximum histogram energy. And then the optimal parameters of the affine transformation are calculated with the matrix singular value decomposition (SVD) method. Finally, bilinear intensity interpolation is taken to the mask according to the specific affine transformation. More than 30 peripheral DSA registrations are performed with the presented algorithm, and as the result, moving artifacts of the images are removed with sub-pixel precision, and the time consumption is less enough to satisfy the clinical requirements. Experimental results show the efficiency and robustness of the algorithm.

SU-D-17A-02: Four-Dimensional CBCT Using Conventional CBCT Dataset and Iterative Subtraction Algorithm of a Lung Patient

International Nuclear Information System (INIS)

Hu, E; Lasio, G; Yi, B

2014-01-01

Purpose: The Iterative Subtraction Algorithm (ISA) method generates retrospectively a pre-selected motion phase cone-beam CT image from the full motion cone-beam CT acquired at standard rotation speed. This work evaluates ISA method with real lung patient data. Methods: The goal of the ISA algorithm is to extract motion and no- motion components form the full reconstruction CBCT. The workflow consists of subtracting from the full CBCT all of the undesired motion phases and obtain a motion de-blurred single-phase CBCT image, followed by iteration of this subtraction process. ISA is realized as follows: 1) The projections are sorted to various phases, and from all phases, a full reconstruction is performed to generate an image CTM. 2) Generate forward projections of CTM at the desired phase projection angles, the subtraction of projection and the forward projection will reconstruct a CTSub1, which diminishes the desired phase component. 3) By adding back the CTSub1 to CTm, no motion CBCT, CTS1, can be computed. 4) CTS1 still contains residual motion component. 5) This residual motion component can be further reduced by iteration.The ISA 4DCBCT technique was implemented using Varian Trilogy accelerator OBI system. To evaluate the method, a lung patient CBCT dataset was used. The reconstruction algorithm is FDK. Results: The single phase CBCT reconstruction generated via ISA successfully isolates the desired motion phase from the full motion CBCT, effectively reducing motion blur. It also shows improved image quality, with reduced streak artifacts with respect to the reconstructions from unprocessed phase-sorted projections only. Conclusion: A CBCT motion de-blurring algorithm, ISA, has been developed and evaluated with lung patient data. The algorithm allows improved visualization of a single phase motion extracted from a standard CBCT dataset. This study has been supported by National Institute of Health through R01CA133539

Motion compensation in digital subtraction angiography using graphics hardware.

Science.gov (United States)

Deuerling-Zheng, Yu; Lell, Michael; Galant, Adam; Hornegger, Joachim

2006-07-01

An inherent disadvantage of digital subtraction angiography (DSA) is its sensitivity to patient motion which causes artifacts in the subtraction images. These artifacts could often reduce the diagnostic value of this technique. Automated, fast and accurate motion compensation is therefore required. To cope with this requirement, we first examine a method explicitly designed to detect local motions in DSA. Then, we implement a motion compensation algorithm by means of block matching on modern graphics hardware. Both methods search for maximal local similarity by evaluating a histogram-based measure. In this context, we are the first who have mapped an optimizing search strategy on graphics hardware while paralleling block matching. Moreover, we provide an innovative method for creating histograms on graphics hardware with vertex texturing and frame buffer blending. It turns out that both methods can effectively correct the artifacts in most case, as the hardware implementation of block matching performs much faster: the displacements of two 1024 x 1024 images can be calculated at 3 frames/s with integer precision or 2 frames/s with sub-pixel precision. Preliminary clinical evaluation indicates that the computation with integer precision could already be sufficient.

An automatic fuzzy-based multi-temporal brain digital subtraction angiography image fusion algorithm using curvelet transform and content selection strategy.

Science.gov (United States)

Momeni, Saba; Pourghassem, Hossein

2014-08-01

Recently image fusion has prominent role in medical image processing and is useful to diagnose and treat many diseases. Digital subtraction angiography is one of the most applicable imaging to diagnose brain vascular diseases and radiosurgery of brain. This paper proposes an automatic fuzzy-based multi-temporal fusion algorithm for 2-D digital subtraction angiography images. In this algorithm, for blood vessel map extraction, the valuable frames of brain angiography video are automatically determined to form the digital subtraction angiography images based on a novel definition of vessel dispersion generated by injected contrast material. Our proposed fusion scheme contains different fusion methods for high and low frequency contents based on the coefficient characteristic of wrapping second generation of curvelet transform and a novel content selection strategy. Our proposed content selection strategy is defined based on sample correlation of the curvelet transform coefficients. In our proposed fuzzy-based fusion scheme, the selection of curvelet coefficients are optimized by applying weighted averaging and maximum selection rules for the high frequency coefficients. For low frequency coefficients, the maximum selection rule based on local energy criterion is applied to better visual perception. Our proposed fusion algorithm is evaluated on a perfect brain angiography image dataset consisting of one hundred 2-D internal carotid rotational angiography videos. The obtained results demonstrate the effectiveness and efficiency of our proposed fusion algorithm in comparison with common and basic fusion algorithms.

An Image Encryption Algorithm Based on Balanced Pixel and Chaotic Map

Directory of Open Access Journals (Sweden)

Jian Zhang

2014-01-01

Full Text Available Image encryption technology has been applied in many fields and is becoming the main way of protecting the image information security. There are also many ways of image encryption. However, the existing encryption algorithms, in order to obtain a better effect of encryption, always need encrypting several times. There is not an effective method to decide the number of encryption times, generally determined by the human eyes. The paper proposes an image encryption algorithm based on chaos and simultaneously proposes a balanced pixel algorithm to determine the times of image encryption. Many simulation experiments have been done including encryption effect and security analysis. Experimental results show that the proposed method is feasible and effective.

A method for dynamic subtraction MR imaging of the liver

Directory of Open Access Journals (Sweden)

Setti Ernesto

2006-06-01

Full Text Available Abstract Background Subtraction of Dynamic Contrast-Enhanced 3D Magnetic Resonance (DCE-MR volumes can result in images that depict and accurately characterize a variety of liver lesions. However, the diagnostic utility of subtraction images depends on the extent of co-registration between non-enhanced and enhanced volumes. Movement of liver structures during acquisition must be corrected prior to subtraction. Currently available methods are computer intensive. We report a new method for the dynamic subtraction of MR liver images that does not require excessive computer time. Methods Nineteen consecutive patients (median age 45 years; range 37–67 were evaluated by VIBE T1-weighted sequences (TR 5.2 ms, TE 2.6 ms, flip angle 20°, slice thickness 1.5 mm acquired before and 45s after contrast injection. Acquisition parameters were optimized for best portal system enhancement. Pre and post-contrast liver volumes were realigned using our 3D registration method which combines: (a rigid 3D translation using maximization of normalized mutual information (NMI, and (b fast 2D non-rigid registration which employs a complex discrete wavelet transform algorithm to maximize pixel phase correlation and perform multiresolution analysis. Registration performance was assessed quantitatively by NMI. Results The new registration procedure was able to realign liver structures in all 19 patients. NMI increased by about 8% after rigid registration (native vs. rigid registration 0.073 ± 0.031 vs. 0.078 ± 0.031, n.s., paired t-test and by a further 23% (0.096 ± 0.035 vs. 0.078 ± 0.031, p t-test after non-rigid realignment. The overall average NMI increase was 31%. Conclusion This new method for realigning dynamic contrast-enhanced 3D MR volumes of liver leads to subtraction images that enhance diagnostic possibilities for liver lesions.

Model Checking Timed Automata with Priorities using DBM Subtraction

DEFF Research Database (Denmark)

David, Alexandre; Larsen, Kim Guldstrand; Pettersson, Paul

2006-01-01

In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result...... in a non-convex set needing sets of DBMs for representation. Our subtraction algorithms are efficient in the sense that the number of generated DBMs is significantly reduced compared to a naive algorithm. The overhead in time is compensated by the gain from reducing the number of resulting DBMs since...... this number affects the performance of symbolic model-checking. The uses of the DBM subtraction operation extend beyond timed automata with priorities. It is also useful for allowing guards on transitions with urgent actions, deadlock checking, and timed games....

An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm

Science.gov (United States)

Zhang, B.; Sang, Jun; Alam, Mohammad S.

2013-03-01

An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm was proposed. Firstly, the original secret image was encrypted into two phase-only masks M1 and M2 via cascaded iterative Fourier transform (CIFT) algorithm. Then, the public-key encryption algorithm RSA was adopted to encrypt M2 into M2' . Finally, a host image was enlarged by extending one pixel into 2×2 pixels and each element in M1 and M2' was multiplied with a superimposition coefficient and added to or subtracted from two different elements in the 2×2 pixels of the enlarged host image. To recover the secret image from the stego-image, the two masks were extracted from the stego-image without the original host image. By applying public-key encryption algorithm, the key distribution was facilitated, and also compared with the image hiding method based on optical interference, the proposed method may reach higher robustness by employing the characteristics of the CIFT algorithm. Computer simulations show that this method has good robustness against image processing.

Dose related, comparative evaluation of a novel bone-subtraction algorithm in 64-row cervico-cranial CT angiography

Energy Technology Data Exchange (ETDEWEB)

Siebert, E.; Bohner, G. [Department of Neuroradiology, Charite Universitary Medicine Berlin (Germany); Dewey, M.; Bauknecht, C. [Department of Radiology, Charite Universitary Medicine Berlin (Germany); Klingebiel, R. [Department of Neuroradiology, Charite Universitary Medicine Berlin (Germany)], E-mail: randolf.klingebiel@charite.de

2010-01-15

Purpose: Comparative evaluation of a low-dose scan protocol for a novel bone-subtraction (BS) algorithm, applicable to 64-row cervico-cranial (cc) CT angiography (MSCTA). Methods and patients: BS algorithm assessment was performed in cadaveric phantom studies by stepwise variation of tube current and head malrotation using a 64-row CT scanner. In order to define minimum dose requirements and the rotation correction capacity, a low dose BS MSCTA protocol was defined and evaluated in 12 patients in comparison to a common manual bone removal algorithm. Standard MIPs of both modalities were evaluated in a blinded manner by two neuroradiologists for image quality composed, of vessel contour sharpness and bony vessel superposition, by using a five-point score each. Effective Dose (E) and data post-processing times were defined. Results: In experimental studies prescan tube current could be cut down to one-sixth of post-contrast scan doses without compromise of bone-subtraction whereas incomplete subtraction appeared from four degrees head malrotation on. Prescan E amounted to additional 1.1 mSv (+25%) in clinical studies. BS MSCTA performed significantly superior in terms of bony superposition for vascular segments C3-C7 (p < 0.001), V1-V2, V3-V4 (p < 0.05, p < 0.001 respectively) and the ophthalmic artery (p < 0.05), whereas vessel contour sharpness in BS MSCTA only proved superior for arterial segments V3-V4 (p < 0.001) and C3-C7 (p < 0.001). MBR MSCTA received higher ratings in vessel contour sharpness for C1-C2 (p < 0.001), callosomarginal artery (p < 0.001), M1, M2, M3 (p < 0.001 each) and the basilar artery (p < 0.001). Reconstruction times amounted to an average of 1.5 (BS MSCTA) and 3 min (MBR MSCTA) respectively. Conclusion: The novel BS algorithm provides superior skull base artery visualisation as compared to common manual bone removal algorithms, increasing the Effective Dose by one-fourth. Yet, inferior vessel contour sharpness was noted intracranially, thus

Dose related, comparative evaluation of a novel bone-subtraction algorithm in 64-row cervico-cranial CT angiography

International Nuclear Information System (INIS)

Siebert, E.; Bohner, G.; Dewey, M.; Bauknecht, C.; Klingebiel, R.

2010-01-01

Purpose: Comparative evaluation of a low-dose scan protocol for a novel bone-subtraction (BS) algorithm, applicable to 64-row cervico-cranial (cc) CT angiography (MSCTA). Methods and patients: BS algorithm assessment was performed in cadaveric phantom studies by stepwise variation of tube current and head malrotation using a 64-row CT scanner. In order to define minimum dose requirements and the rotation correction capacity, a low dose BS MSCTA protocol was defined and evaluated in 12 patients in comparison to a common manual bone removal algorithm. Standard MIPs of both modalities were evaluated in a blinded manner by two neuroradiologists for image quality composed, of vessel contour sharpness and bony vessel superposition, by using a five-point score each. Effective Dose (E) and data post-processing times were defined. Results: In experimental studies prescan tube current could be cut down to one-sixth of post-contrast scan doses without compromise of bone-subtraction whereas incomplete subtraction appeared from four degrees head malrotation on. Prescan E amounted to additional 1.1 mSv (+25%) in clinical studies. BS MSCTA performed significantly superior in terms of bony superposition for vascular segments C3-C7 (p < 0.001), V1-V2, V3-V4 (p < 0.05, p < 0.001 respectively) and the ophthalmic artery (p < 0.05), whereas vessel contour sharpness in BS MSCTA only proved superior for arterial segments V3-V4 (p < 0.001) and C3-C7 (p < 0.001). MBR MSCTA received higher ratings in vessel contour sharpness for C1-C2 (p < 0.001), callosomarginal artery (p < 0.001), M1, M2, M3 (p < 0.001 each) and the basilar artery (p < 0.001). Reconstruction times amounted to an average of 1.5 (BS MSCTA) and 3 min (MBR MSCTA) respectively. Conclusion: The novel BS algorithm provides superior skull base artery visualisation as compared to common manual bone removal algorithms, increasing the Effective Dose by one-fourth. Yet, inferior vessel contour sharpness was noted intracranially, thus

Clinical utility of Gd-DTPA subtraction MR imaging for spinal bone metastasis

International Nuclear Information System (INIS)

Ando, Keiichi; Murakami, Masao; Kuroda, Yasumasa

1993-01-01

Based on reports that Gd-DTPA contributes to the detection of tumors, we used it in 31 cases (97 lesions) of spinal bone metastases. The result was that Gd-DTPA increased the intensity of tumors and the surrounding bone marrow to almost the same level in 53%. To show the metastases clearly, an existing subtraction command system was utilized. The technique included the pixel-by-pixel method, to obtain a Gd-DTPA T1-weighted image (T1WI) subtracted by the original T1WI. The detectability of the subtraction image was improved up to 96%, but was less than the original T1WI (99%). Because of the different imaging rationale between two methods, a means to assess the quality of diagnosis must be proposed. To check the normal background, the same kind of postprocessing was performed in 21 patients without malignancy. Gd-DTPA prefusion was highest in the paravertebral veins, moderate in muscles and epidural fat, and lowest in the spinal cord, intervertebral disk and bone cortex. Gd-DTPA enhanced subtraction MR imaging provides a new diagnostic tool to detect and to assess bone metastasis. (author)

Digital subtraction angiography in patients with central vertigo

International Nuclear Information System (INIS)

Inamori, Toru; Takayasu, Yukio; Umetani, Yoshio; Taruoka, Akinori.

1985-01-01

Digital subtraction angiography (DSA) is a recently developed non-invasive intravenous angiography which has become possible through real time digital subtraction of x-ray transmission data from an image intensifier and television system. The output signals of the image intensifier-television camera system are digitized by an analog-digital converter. The digital information, 512x512 pixels and 9 bits deep, is fed into the image processing assembly after logarithmic amplification, where 2-8 frames are added and subtracted from mask images for the final digital images. Intravenous digital subtraction angiography was performed in 21 patients with intractable dizzy spells of central origin resistant to treatment. These patients showed some signs of CNS disturbance, although there were no significant findings on CT scans. Surprisingly, findings were abnormal in 14 of 21 patients (66.7%). DSA is, therefore, considered to be an important aid in the diagnosis of vertigo of the central type. (J.P.N.)

Low complexity pixel-based halftone detection

Science.gov (United States)

Ok, Jiheon; Han, Seong Wook; Jarno, Mielikainen; Lee, Chulhee

2011-10-01

With the rapid advances of the internet and other multimedia technologies, the digital document market has been growing steadily. Since most digital images use halftone technologies, quality degradation occurs when one tries to scan and reprint them. Therefore, it is necessary to extract the halftone areas to produce high quality printing. In this paper, we propose a low complexity pixel-based halftone detection algorithm. For each pixel, we considered a surrounding block. If the block contained any flat background regions, text, thin lines, or continuous or non-homogeneous regions, the pixel was classified as a non-halftone pixel. After excluding those non-halftone pixels, the remaining pixels were considered to be halftone pixels. Finally, documents were classified as pictures or photo documents by calculating the halftone pixel ratio. The proposed algorithm proved to be memory-efficient and required low computation costs. The proposed algorithm was easily implemented using GPU.

Image noise reduction algorithm for digital subtraction angiography: clinical results.

Science.gov (United States)

Söderman, Michael; Holmin, Staffan; Andersson, Tommy; Palmgren, Charlotta; Babic, Draženko; Hoornaert, Bart

2013-11-01

To test the hypothesis that an image noise reduction algorithm designed for digital subtraction angiography (DSA) in interventional neuroradiology enables a reduction in the patient entrance dose by a factor of 4 while maintaining image quality. This clinical prospective study was approved by the local ethics committee, and all 20 adult patients provided informed consent. DSA was performed with the default reference DSA program, a quarter-dose DSA program with modified acquisition parameters (to reduce patient radiation dose exposure), and a real-time noise-reduction algorithm. Two consecutive biplane DSA data sets were acquired in each patient. The dose-area product (DAP) was calculated for each image and compared. A randomized, blinded, offline reading study was conducted to show noninferiority of the quarter-dose image sets. Overall, 40 samples per treatment group were necessary to acquire 80% power, which was calculated by using a one-sided α level of 2.5%. The mean DAP with the quarter-dose program was 25.3% ± 0.8 of that with the reference program. The median overall image quality scores with the reference program were 9, 13, and 12 for readers 1, 2, and 3, respectively. These scores increased slightly to 12, 15, and 12, respectively, with the quarter-dose program imaging chain. In DSA, a change in technique factors combined with a real-time noise-reduction algorithm will reduce the patient entrance dose by 75%, without a loss of image quality. RSNA, 2013

Bone marrow edema pattern identification in patients with lytic bone lesions using digital subtraction angiography-like bone subtraction on large-area detector computed tomography.

Science.gov (United States)

Gondim Teixeira, Pedro Augusto; Hossu, Gabriela; Lecocq, Sophie; Razeto, Marco; Louis, Matthias; Blum, Alain

2014-03-01

The objective of this study was to evaluate the performance of digital subtraction angiography (DSA)-like bone subtraction with 2 different registration methods for the identification of bone marrow edema pattern (BMEP) in patients with lytic bone lesions, using magnetic resonance imaging as the criterion standard. Fifty-five patients with a lytic bone lesion were included in this prospective study with approval from the ethics committee. All patients underwent magnetic resonance imaging and low-dose computed tomographic (CT) perfusion after signing an informed consent. Two CT volumes were used for bone subtraction, which was performed with 2 different algorithms (rigid and nonrigid). Enhancement at the nonlytic bone marrow was considered as a sign of BMEP. Two readers evaluated the images blindly. The presence of BMEP on bone-subtracted CT images was evaluated subjectively and quantitatively. Image quality was assessed. Magnetic resonance imaging was used as the criterion standard. Using a rigid registration method, the sensitivity, specificity, positive predictive value, negative predictive value, and accuracy of CT with DSA-like bone subtraction BMEP was 77%, 100%, 100%, 68%, and 85%, respectively. The interobserver agreement was good (κ, 0.782). Image quality was better using a nonrigid registration. With this algorithm, artifacts interfered with image interpretation in only 5% of cases. However, there was a noticeable drop in sensitivity and negative predictive value when a nonrigid algorithm was used: 56% and 52%, respectively. The interobserver agreement was average with a nonrigid subtraction algorithm. Computed tomography with DSA-like bone subtraction is sensitive and highly specific for the identification of BMEP associated with lytic bone lesions. Rigid registering should be preferred, but nonrigid algorithms can be used as a second option when artifacts interfere with image interpretation.

Two-step digit-set-restricted modified signed-digit addition-subtraction algorithm and its optoelectronic implementation.

Science.gov (United States)

Qian, F; Li, G; Ruan, H; Jing, H; Liu, L

1999-09-10

A novel, to our knowledge, two-step digit-set-restricted modified signed-digit (MSD) addition-subtraction algorithm is proposed. With the introduction of the reference digits, the operand words are mapped into an intermediate carry word with all digits restricted to the set {1, 0} and an intermediate sum word with all digits restricted to the set {0, 1}, which can be summed to form the final result without carry generation. The operation can be performed in parallel by use of binary logic. An optical system that utilizes an electron-trapping device is suggested for accomplishing the required binary logic operations. By programming of the illumination of data arrays, any complex logic operations of multiple variables can be realized without additional temporal latency of the intermediate results. This technique has a high space-bandwidth product and signal-to-noise ratio. The main structure can be stacked to construct a compact optoelectronic MSD adder-subtracter.

Digital subtraction radiography evaluation of the bone repair process of chronic apical periodontitis after root canal treatment.

Science.gov (United States)

Benfica e Silva, J; Leles, C R; Alencar, A H G; Nunes, C A B C M; Mendonça, E F

2010-08-01

To monitor radiographically the progress of bone repair within chronic periapical lesions after root canal treatment using digital subtraction radiography (DSR). Twelve patients with 17 single-rooted teeth with chronic apical periodontitis associated with an infected necrotic pulp were selected for root canal treatment. Periapical radiographs were taken before treatment (baseline) and immediately post-treatment, 45, 90, 135 and 180 days after treatment. The radiographic protocol included the use of individualized film holders with silicone bite blocks. The six radiographic images were digitized and submitted to digital subtraction using DSR software, resulting in five subtracted images (SI). Quantitative analysis of these SI was performed using Image Tool software to assess pixel value changes, considering a step-wedge as the gold standard and a cut-off value of 128 pixels. The aim was to identify any increase or decrease in mineral density in the region of the periapical lesion. A minor decrease in mineral density at the canal filling session and a significant progressive mineral gain in the following evaluations (P < 0.001) occurred. Pairwise comparison of pixel grey values revealed that only the 180-day follow-up differed significantly from the previous SI. Digital subtraction radiography is a useful method for evaluating the progress of bone repair after root canal treatment. Noticeable mineral gain was observed approximately 90 days after root canal filling and definite bone repair after 180 days.

Speech Enhancement by Multichannel Crosstalk Resistant ANC and Improved Spectrum Subtraction

Directory of Open Access Journals (Sweden)

Zeng Qingning

2006-01-01

Full Text Available A scheme combining multichannel crosstalk resistant adaptive noise cancellation (MCRANC algorithm and improved spectrum subtraction (ISS algorithm is presented to enhance noise carrying speech signals. The scheme would permit locating the microphones in close proximity by virtue of using MCRANC which has the capability of removing the crosstalk effect. MCRANC would also permit canceling out nonstationary noise and making the residual noise more stationary for further treatment by ISS algorithm. Experimental results have indicated that this scheme outperforms many commonly used techniques in the sense of SNR improvement and music effect reduction which is an inevitable byproduct of the spectrum subtraction algorithm.

Signal-to-noise ratio measurement in parallel MRI with subtraction mapping and consecutive methods

International Nuclear Information System (INIS)

Imai, Hiroshi; Miyati, Tosiaki; Ogura, Akio; Doi, Tsukasa; Tsuchihashi, Toshio; Machida, Yoshio; Kobayashi, Masato; Shimizu, Kouzou; Kitou, Yoshihiro

2008-01-01

When measuring the signal-to-noise ratio (SNR) of an image the used parallel magnetic resonance imaging, it was confirmed that there was a problem in the application of past SNR measurement. With the method of measuring the noise from the background signal, SNR with parallel imaging was higher than that without parallel imaging. In the subtraction method (NEMA standard), which sets a wide region of interest, the white noise was not evaluated correctly although SNR was close to the theoretical value. We proposed two techniques because SNR in parallel imaging was not uniform according to inhomogeneity of the coil sensitivity distribution and geometry factor. Using the first method (subtraction mapping), two images were scanned with identical parameters. The SNR in each pixel divided the running mean (7 by 7 pixels in neighborhood) by standard deviation/√2 in the same region of interest. Using the second (consecutive) method, more than fifty consecutive scans of the uniform phantom were obtained with identical scan parameters. Then the SNR was calculated from the ratio of mean signal intensity to the standard deviation in each pixel on a series of images. Moreover, geometry factors were calculated from SNRs with and without parallel imaging. The SNR and geometry factor using parallel imaging in the subtraction mapping method agreed with those of the consecutive method. Both methods make it possible to obtain a more detailed determination of SNR in parallel imaging and to calculate the geometry factor. (author)

Digital subtraction angiography

International Nuclear Information System (INIS)

Neuwirth, J. Jr.; Bohutova, J.

1987-01-01

The quality of radiodiagnostic methods to a great extent depends on the quality of the resulting image. The basic technical principles are summed up of the different parts of digital subtraction angiography apparatus and of methods of improving the image. The instrument is based on a videochain consisting of an X-ray tube, an intensifier of the radiographic image, optical parts, a video camera, an analog-to-digital converter and a computer. The main advantage of the digitally processed image is the possibility of optimizing the image into a form which will contain the biggest amount of diagnostically valuable information. Described are the mathematical operations for improving the digital image: spatial filtration, pixel shift, time filtration, image integration, time interval differentation and matched filtering. (M.D.). 8 refs., 3 figs

Steganography on quantum pixel images using Shannon entropy

Science.gov (United States)

Laurel, Carlos Ortega; Dong, Shi-Hai; Cruz-Irisson, M.

2016-07-01

This paper presents a steganographical algorithm based on least significant bit (LSB) from the most significant bit information (MSBI) and the equivalence of a bit pixel image to a quantum pixel image, which permits to make the information communicate secretly onto quantum pixel images for its secure transmission through insecure channels. This algorithm offers higher security since it exploits the Shannon entropy for an image.

Two-dimensional real-time imaging system for subtraction angiography using an iodine filter

Science.gov (United States)

Umetani, Keiji; Ueda, Ken; Takeda, Tohoru; Anno, Izumi; Itai, Yuji; Akisada, Masayoshi; Nakajima, Teiichi

1992-01-01

A new type of subtraction imaging system was developed using an iodine filter and a single-energy broad bandwidth monochromatized x ray. The x-ray images of coronary arteries made after intravenous injection of a contrast agent are enhanced by an energy-subtraction technique. Filter chopping of the x-ray beam switches energies rapidly, so that a nearly simultaneous pair of filtered and nonfiltered images can be made. By using a high-speed video camera, a pair of two 512 × 512 pixel images can be obtained within 9 ms. Three hundred eighty-four images (raw data) are stored in a 144-Mbyte frame memory. After phantom studies, in vivo subtracted images of coronary arteries in dogs were obtained at a rate of 15 images/s.

A study of transverse image reconstruction with digital subtraction angiography

International Nuclear Information System (INIS)

Sakamoto, Kiyoshi; Kotoura, Noriko; Terasawa, Yuuji; Oda, Masahiko; Gotou, Hiroshi; Nasada, Toshiya; Tanooka, Masao

1995-01-01

For digital subtraction angiography (DSA) with C-type equipment, it is possible to radiate an X-ray during rotation and to collect data at different angular settings. We tried to reconstruct transverse image from data obtained by scanning DSA images at different angular settings. 88 projection data were obtained by rotating the object at 180deg during radiation. Reconstruction was made using the convolution method with pixel value distribution for each projection. Similarly, the image quality of the reconstructed images were compared with the unsubtracted and subtracted ones. In case a part object was outside the calculating region, artifacts were generally produced. However, the artifacts were reduced by subtracting the background from the image. In addition, the cupping phenomenon caused by beam hardening was relaxed and high-quality imaging could be achieved. This method will become even more effective, if we will use it with selective angiography in which the limited area is enhanced. (author)

Maximum likelihood pixel labeling using a spatially variant finite mixture model

International Nuclear Information System (INIS)

Gopal, S.S.; Hebert, T.J.

1996-01-01

We propose a spatially-variant mixture model for pixel labeling. Based on this spatially-variant mixture model we derive an expectation maximization algorithm for maximum likelihood estimation of the pixel labels. While most algorithms using mixture models entail the subsequent use of a Bayes classifier for pixel labeling, the proposed algorithm yields maximum likelihood estimates of the labels themselves and results in unambiguous pixel labels. The proposed algorithm is fast, robust, easy to implement, flexible in that it can be applied to any arbitrary image data where the number of classes is known and, most importantly, obviates the need for an explicit labeling rule. The algorithm is evaluated both quantitatively and qualitatively on simulated data and on clinical magnetic resonance images of the human brain

Multivariate spatial condition mapping using subtractive fuzzy cluster means.

Science.gov (United States)

Sabit, Hakilo; Al-Anbuky, Adnan

2014-10-13

Wireless sensor networks are usually deployed for monitoring given physical phenomena taking place in a specific space and over a specific duration of time. The spatio-temporal distribution of these phenomena often correlates to certain physical events. To appropriately characterise these events-phenomena relationships over a given space for a given time frame, we require continuous monitoring of the conditions. WSNs are perfectly suited for these tasks, due to their inherent robustness. This paper presents a subtractive fuzzy cluster means algorithm and its application in data stream mining for wireless sensor systems over a cloud-computing-like architecture, which we call sensor cloud data stream mining. Benchmarking on standard mining algorithms, the k-means and the FCM algorithms, we have demonstrated that the subtractive fuzzy cluster means model can perform high quality distributed data stream mining tasks comparable to centralised data stream mining.

A retention-time-shift-tolerant background subtraction and noise reduction algorithm (BgS-NoRA) for extraction of drug metabolites in liquid chromatography/mass spectrometry data from biological matrices.

Science.gov (United States)

Zhu, Peijuan; Ding, Wei; Tong, Wei; Ghosal, Anima; Alton, Kevin; Chowdhury, Swapan

2009-06-01

A retention-time-shift-tolerant background subtraction and noise reduction algorithm (BgS-NoRA) is implemented using the statistical programming language R to remove non-drug-related ion signals from accurate mass liquid chromatography/mass spectrometry (LC/MS) data. The background-subtraction part of the algorithm is similar to a previously published procedure (Zhang H and Yang Y. J. Mass Spectrom. 2008, 43: 1181-1190). The noise reduction algorithm (NoRA) is an add-on feature to help further clean up the residual matrix ion noises after background subtraction. It functions by removing ion signals that are not consistent across many adjacent scans. The effectiveness of BgS-NoRA was examined in biological matrices by spiking blank plasma extract, bile and urine with diclofenac and ibuprofen that have been pre-metabolized by microsomal incubation. Efficient removal of background ions permitted the detection of drug-related ions in in vivo samples (plasma, bile, urine and feces) obtained from rats orally dosed with (14)C-loratadine with minimal interference. Results from these experiments demonstrate that BgS-NoRA is more effective in removing analyte-unrelated ions than background subtraction alone. NoRA is shown to be particularly effective in the early retention region for urine samples and middle retention region for bile samples, where the matrix ion signals still dominate the total ion chromatograms (TICs) after background subtraction. In most cases, the TICs after BgS-NoRA are in excellent qualitative correlation to the radiochromatograms. BgS-NoRA will be a very useful tool in metabolite detection and identification work, especially in first-in-human (FIH) studies and multiple dose toxicology studies where non-radio-labeled drugs are administered. Data from these types of studies are critical to meet the latest FDA guidance on Metabolite in Safety Testing (MIST). Copyright (c) 2009 John Wiley & Sons, Ltd.

IMPROVED BACKGROUND SUBTRACTION FOR THE SLOAN DIGITAL SKY SURVEY IMAGES

International Nuclear Information System (INIS)

Blanton, Michael R.; Kazin, Eyal; Muna, Demitri; Weaver, Benjamin A.; Price-Whelan, Adrian

2011-01-01

We describe a procedure for background subtracting Sloan Digital Sky Survey (SDSS) imaging that improves the resulting detection and photometry of large galaxies on the sky. Within each SDSS drift scan run, we mask out detected sources and then fit a smooth function to the variation of the sky background. This procedure has been applied to all SDSS-III Data Release 8 images, and the results are available as part of that data set. We have tested the effect of our background subtraction on the photometry of large galaxies by inserting fake galaxies into the raw pixels, reanalyzing the data, and measuring them after background subtraction. Our technique results in no size-dependent bias in galaxy fluxes up to half-light radii r 50 ∼ 100 arcsec; in contrast, for galaxies of that size the standard SDSS photometric catalog underestimates fluxes by about 1.5 mag. Our results represent a substantial improvement over the standard SDSS catalog results and should form the basis of any analysis of nearby galaxies using the SDSS imaging data.

Sky Subtraction with Fiber-Fed Spectrograph

Science.gov (United States)

Rodrigues, Myriam

2017-09-01

"Historically, fiber-fed spectrographs had been deemed inadequate for the observation of faint targets, mainly because of the difficulty to achieve high accuracy on the sky subtraction. The impossibility to sample the sky in the immediate vicinity of the target in fiber instruments has led to a commonly held view that a multi-object fibre spectrograph cannot achieve an accurate sky subtraction under 1% contrary to their slit counterpart. The next generation of multi-objects spectrograph at the VLT (MOONS) and the planed MOS for the E-ELT (MOSAIC) are fiber-fed instruments, and are aimed to observed targets fainter than the sky continuum level. In this talk, I will present the state-of-art on sky subtraction strategies and data reduction algorithm specifically developed for fiber-fed spectrographs. I will also present the main results of an observational campaign to better characterise the sky spatial and temporal variations ( in particular the continuum and faint sky lines)."

Super-pixel extraction based on multi-channel pulse coupled neural network

Science.gov (United States)

Xu, GuangZhu; Hu, Song; Zhang, Liu; Zhao, JingJing; Fu, YunXia; Lei, BangJun

2018-04-01

Super-pixel extraction techniques group pixels to form over-segmented image blocks according to the similarity among pixels. Compared with the traditional pixel-based methods, the image descripting method based on super-pixel has advantages of less calculation, being easy to perceive, and has been widely used in image processing and computer vision applications. Pulse coupled neural network (PCNN) is a biologically inspired model, which stems from the phenomenon of synchronous pulse release in the visual cortex of cats. Each PCNN neuron can correspond to a pixel of an input image, and the dynamic firing pattern of each neuron contains both the pixel feature information and its context spatial structural information. In this paper, a new color super-pixel extraction algorithm based on multi-channel pulse coupled neural network (MPCNN) was proposed. The algorithm adopted the block dividing idea of SLIC algorithm, and the image was divided into blocks with same size first. Then, for each image block, the adjacent pixels of each seed with similar color were classified as a group, named a super-pixel. At last, post-processing was adopted for those pixels or pixel blocks which had not been grouped. Experiments show that the proposed method can adjust the number of superpixel and segmentation precision by setting parameters, and has good potential for super-pixel extraction.

Subtraction with hadronic initial states at NLO: an NNLO-compatible scheme

Science.gov (United States)

Somogyi, Gábor

2009-05-01

We present an NNLO-compatible subtraction scheme for computing QCD jet cross sections of hadron-initiated processes at NLO accuracy. The scheme is constructed specifically with those complications in mind, that emerge when extending the subtraction algorithm to next-to-next-to-leading order. It is therefore possible to embed the present scheme in a full NNLO computation without any modifications.

Subtraction with hadronic initial states at NLO: an NNLO-compatible scheme

International Nuclear Information System (INIS)

Somogyi, Gabor

2009-01-01

We present an NNLO-compatible subtraction scheme for computing QCD jet cross sections of hadron-initiated processes at NLO accuracy. The scheme is constructed specifically with those complications in mind, that emerge when extending the subtraction algorithm to next-to-next-to-leading order. It is therefore possible to embed the present scheme in a full NNLO computation without any modifications.

Artificial Mangrove Species Mapping Using Pléiades-1: An Evaluation of Pixel-Based and Object-Based Classifications with Selected Machine Learning Algorithms

Directory of Open Access Journals (Sweden)

Dezhi Wang

2018-02-01

Full Text Available In the dwindling natural mangrove today, mangrove reforestation projects are conducted worldwide to prevent further losses. Due to monoculture and the low survival rate of artificial mangroves, it is necessary to pay attention to mapping and monitoring them dynamically. Remote sensing techniques have been widely used to map mangrove forests due to their capacity for large-scale, accurate, efficient, and repetitive monitoring. This study evaluated the capability of a 0.5-m Pléiades-1 in classifying artificial mangrove species using both pixel-based and object-based classification schemes. For comparison, three machine learning algorithms—decision tree (DT, support vector machine (SVM, and random forest (RF—were used as the classifiers in the pixel-based and object-based classification procedure. The results showed that both the pixel-based and object-based approaches could recognize the major discriminations between the four major artificial mangrove species. However, the object-based method had a better overall accuracy than the pixel-based method on average. For pixel-based image analysis, SVM produced the highest overall accuracy (79.63%; for object-based image analysis, RF could achieve the highest overall accuracy (82.40%, and it was also the best machine learning algorithm for classifying artificial mangroves. The patches produced by object-based image analysis approaches presented a more generalized appearance and could contiguously depict mangrove species communities. When the same machine learning algorithms were compared by McNemar’s test, a statistically significant difference in overall classification accuracy between the pixel-based and object-based classifications only existed in the RF algorithm. Regarding species, monoculture and dominant mangrove species Sonneratia apetala group 1 (SA1 as well as partly mixed and regular shape mangrove species Hibiscus tiliaceus (HT could well be identified. However, for complex and easily

Calculating Viewing Angles Pixel by Pixel in Optical Remote Sensing Satellite Imagery Using the Rational Function Model

OpenAIRE

Kai Xu; Guo Zhang; Qingjun Zhang; Deren Li

2018-01-01

In studies involving the extraction of surface physical parameters using optical remote sensing satellite imagery, sun-sensor geometry must be known, especially for sensor viewing angles. However, while pixel-by-pixel acquisitions of sensor viewing angles are of critical importance to many studies, currently available algorithms for calculating sensor-viewing angles focus only on the center-point pixel or are complicated and are not well known. Thus, this study aims to provide a simple and ge...

Radionuclide identification using subtractive clustering method

International Nuclear Information System (INIS)

Farias, Marcos Santana; Mourelle, Luiza de Macedo

2011-01-01

Radionuclide identification is crucial to planning protective measures in emergency situations. This paper presents the application of a method for a classification system of radioactive elements with a fast and efficient response. To achieve this goal is proposed the application of subtractive clustering algorithm. The proposed application can be implemented in reconfigurable hardware, a flexible medium to implement digital hardware circuits. (author)

A comparison of subtracted images from dental subtraction programs

International Nuclear Information System (INIS)

Han, Won Jeong

2002-01-01

To compare the standard deviation of gray levels on digital subtracted images obtained by different dental subtraction programs. Paired periapical films were taken at the lower premolar and molar areas of the phantoms involving human mandible. The bite registration group used Rinn XCP equipment and bite registration material, based on polyvinyl siloxane, for standardization. The no bite registration group used only Rinn XCP equipment. The periapical film images were digitized at 1200 dpi resolution and 256 gray levels by a flat bed scanner with transparency unit. Dental digital subtraction programs used for this study were Subtractor (Biomedisys Co., Korea) and Emago (Oral Diagnostic Systems, The Netherlands). To measure the similarities between the subtracted images, the standard deviations of the gray levels were obtained using a histogram of subtracted images, which were then analyzed statistically. Subtracted images obtained by using the Emago program without manual selection of corresponding points showed the lowest standard deviation of gray levels (p<0.01). And the standard deviation of gray levels was lower in subtracted images in the group of a bite registration than in the group of no use of bite registration (p<0.01). Digital radiographic subtraction without manual selection of reference points was found to be a convenient and superior method.

Subtractive Leadership

Science.gov (United States)

Larwin, K. H.; Thomas, Eugene M.; Larwin, David A.

2015-01-01

This paper introduces a new term and concept to the leadership discourse: Subtractive Leadership. As an extension of the distributive leadership model, the notion of subtractive leadership refers to a leadership style that detracts from organizational culture and productivity. Subtractive leadership fails to embrace and balance the characteristics…

A Novel Sub-pixel Measurement Algorithm Based on Mixed the Fractal and Digital Speckle Correlation in Frequency Domain

Directory of Open Access Journals (Sweden)

Zhangfang Hu

2014-10-01

Full Text Available The digital speckle correlation is a non-contact in-plane displacement measurement method based on machine vision. Motivated by the facts that the low accuracy and large amount of calculation produced by the traditional digital speckle correlation method in spatial domain, we introduce a sub-pixel displacement measurement algorithm which employs a fast interpolation method based on fractal theory and digital speckle correlation in frequency domain. This algorithm can overcome either the blocking effect or the blurring caused by the traditional interpolation methods, and the frequency domain processing also avoids the repeated searching in the correlation recognition of the spatial domain, thus the operation quantity is largely reduced and the information extracting speed is improved. The comparative experiment is given to verify that the proposed algorithm in this paper is effective.

Segmentation of Moving Object Using Background Subtraction Method in Complex Environments

Directory of Open Access Journals (Sweden)

S. Kumar

2016-06-01

Full Text Available Background subtraction is an extensively used approach to localize the moving object in a video sequence. However, detecting an object under the spatiotemporal behavior of background such as rippling of water, moving curtain and illumination change or low resolution is not a straightforward task. To deal with the above-mentioned problem, we address a background maintenance scheme based on the updating of background pixels by estimating the current spatial variance along the temporal line. The work is focused to immune the variation of local motion in the background. Finally, the most suitable label assignment to the motion field is estimated and optimized by using iterated conditional mode (ICM under a Markovian framework. Performance evaluation and comparisons with the other well-known background subtraction methods show that the proposed method is unaffected by the problem of aperture distortion, ghost image, and high frequency noise.

Momentum-subtraction renormalization techniques in curved space-time

Energy Technology Data Exchange (ETDEWEB)

Foda, O.

1987-10-01

Momentum-subtraction techniques, specifically BPHZ and Zimmermann's Normal Product algorithm, are introduced as useful tools in the study of quantum field theories in the presence of background fields. In a model of a self-interacting massive scalar field, conformally coupled to a general asymptotically-flat curved space-time with a trivial topology, momentum-subtractions are shown to respect invariance under general coordinate transformations. As an illustration, general expressions for the trace anomalies are derived, and checked by explicit evaluation of the purely gravitational contributions in the free field theory limit. Furthermore, the trace of the renormalized energy-momentum tensor is shown to vanish at the Gell-Mann Low eigenvalue as it should.

Momentum-subtraction renormalization techniques in curved space-time

International Nuclear Information System (INIS)

Foda, O.

1987-01-01

Momentum-subtraction techniques, specifically BPHZ and Zimmermann's Normal Product algorithm, are introduced as useful tools in the study of quantum field theories in the presence of background fields. In a model of a self-interacting massive scalar field, conformally coupled to a general asymptotically-flat curved space-time with a trivial topology, momentum-subtractions are shown to respect invariance under general coordinate transformations. As an illustration, general expressions for the trace anomalies are derived, and checked by explicit evaluation of the purely gravitational contributions in the free field theory limit. Furthermore, the trace of the renormalized energy-momentum tensor is shown to vanish at the Gell-Mann Low eigenvalue as it should

Dichromatic Gray Pixel for Camera-agnostic Color Constancy

OpenAIRE

Qian, Yanlin; Chen, Ke; Nikkanen, Jarno; Kämäräinen, Joni-Kristian; Matas, Jiri

2018-01-01

We propose a novel statistical color constancy method, especially suitable for the Camera-agnostic Color Constancy, i.e. the scenario where nothing is known a priori about the capturing devices. The method, called Dichromatic Gray Pixel, or DGP, relies on a novel gray pixel detection algorithm derived using the Dichromatic Reflection Model. DGP is suitable for camera-agnostic color constancy since varying devices are set to make achromatic pixels look gray under standard neutral illumination....

Effects of defect pixel correction algorithms for x-ray detectors on image quality in planar projection and volumetric CT data sets

International Nuclear Information System (INIS)

Kuttig, Jan; Steiding, Christian; Hupfer, Martin; Karolczak, Marek; Kolditz, Daniel

2015-01-01

In this study we compared various defect pixel correction methods for reducing artifact appearance within projection images used for computed tomography (CT) reconstructions.Defect pixel correction algorithms were examined with respect to their artifact behaviour within planar projection images as well as in volumetric CT reconstructions. We investigated four algorithms: nearest neighbour, linear and adaptive linear interpolation, and a frequency-selective spectral-domain approach.To characterise the quality of each algorithm in planar image data, we inserted line defects of varying widths and orientations into images. The structure preservation of each algorithm was analysed by corrupting and correcting the image of a slit phantom pattern and by evaluating its line spread function (LSF). The noise preservation was assessed by interpolating corrupted flat images and estimating the noise power spectrum (NPS) of the interpolated region.For the volumetric investigations, we examined the structure and noise preservation within a structured aluminium foam, a mid-contrast cone-beam phantom and a homogeneous Polyurethane (PUR) cylinder.The frequency-selective algorithm showed the best structure and noise preservation for planar data of the correction methods tested. For volumetric data it still showed the best noise preservation, whereas the structure preservation was outperformed by the linear interpolation.The frequency-selective spectral-domain approach in the correction of line defects is recommended for planar image data, but its abilities within high-contrast volumes are restricted. In that case, the application of a simple linear interpolation might be the better choice to correct line defects within projection images used for CT. (paper)

A Proposed Extension to the Soil Moisture and Ocean Salinity Level 2 Algorithm for Mixed Forest and Moderate Vegetation Pixels

Science.gov (United States)

Panciera, Rocco; Walker, Jeffrey P.; Kalma, Jetse; Kim, Edward

2011-01-01

The Soil Moisture and Ocean Salinity (SMOS)mission, launched in November 2009, provides global maps of soil moisture and ocean salinity by measuring the L-band (1.4 GHz) emission of the Earth's surface with a spatial resolution of 40-50 km.Uncertainty in the retrieval of soilmoisture over large heterogeneous areas such as SMOS pixels is expected, due to the non-linearity of the relationship between soil moisture and the microwave emission. The current baseline soilmoisture retrieval algorithm adopted by SMOS and implemented in the SMOS Level 2 (SMOS L2) processor partially accounts for the sub-pixel heterogeneity of the land surface, by modelling the individual contributions of different pixel fractions to the overall pixel emission. This retrieval approach is tested in this study using airborne L-band data over an area the size of a SMOS pixel characterised by a mix Eucalypt forest and moderate vegetation types (grassland and crops),with the objective of assessing its ability to correct for the soil moisture retrieval error induced by the land surface heterogeneity. A preliminary analysis using a traditional uniform pixel retrieval approach shows that the sub-pixel heterogeneity of land cover type causes significant errors in soil moisture retrieval (7.7%v/v RMSE, 2%v/v bias) in pixels characterised by a significant amount of forest (40-60%). Although the retrieval approach adopted by SMOS partially reduces this error, it is affected by errors beyond the SMOS target accuracy, presenting in particular a strong dry bias when a fraction of the pixel is occupied by forest (4.1%v/v RMSE,-3.1%v/v bias). An extension to the SMOS approach is proposed that accounts for the heterogeneity of vegetation optical depth within the SMOS pixel. The proposed approach is shown to significantly reduce the error in retrieved soil moisture (2.8%v/v RMSE, -0.3%v/v bias) in pixels characterised by a critical amount of forest (40-60%), at the limited cost of only a crude estimate of the

Chandra ACIS Sub-pixel Resolution

Science.gov (United States)

Kim, Dong-Woo; Anderson, C. S.; Mossman, A. E.; Allen, G. E.; Fabbiano, G.; Glotfelty, K. J.; Karovska, M.; Kashyap, V. L.; McDowell, J. C.

2011-05-01

We investigate how to achieve the best possible ACIS spatial resolution by binning in ACIS sub-pixel and applying an event repositioning algorithm after removing pixel-randomization from the pipeline data. We quantitatively assess the improvement in spatial resolution by (1) measuring point source sizes and (2) detecting faint point sources. The size of a bright (but no pile-up), on-axis point source can be reduced by about 20-30%. With the improve resolution, we detect 20% more faint sources when embedded on the extended, diffuse emission in a crowded field. We further discuss the false source rate of about 10% among the newly detected sources, using a few ultra-deep observations. We also find that the new algorithm does not introduce a grid structure by an aliasing effect for dithered observations and does not worsen the positional accuracy

Proceeding Paper for HSTD11 Conference about Luminosity Measurement by Pixel-Cluster-Counting

CERN Document Server

Liu, Peilian; The ATLAS collaboration

2018-01-01

The Insertable B-Layer (IBL) is the innermost layer of the ATLAS tracking system. It consists of planar pixel modules in the central region and 3D pixel modules at two extremities. We use the longitudinal cluster size distributions in 3D modules of the IBL to determine the number of pixel clusters produced by primary charged particles per event and suppress backgrounds. This Pixel Cluster Counting (PCC) algorithm provides a bunch-by-bunch luminosity measurement. An accurate luminosity measurement is a key component for precision measurements at the Large Hadron Collider (LHC) and one of the largest uncertainties on the luminosity determination in ATLAS arises from the long-term stability of the measurement technique. The comparison of the PCC algorithm with other existing algorithms provides key insights in assessing and reducing such uncertainty.

An Adaptive Filtering Algorithm Based on Genetic Algorithm-Backpropagation Network

Directory of Open Access Journals (Sweden)

Kai Hu

2013-01-01

Full Text Available A new image filtering algorithm is proposed. GA-BPN algorithm uses genetic algorithm (GA to decide weights in a back propagation neural network (BPN. It has better global optimal characteristics than traditional optimal algorithm. In this paper, we used GA-BPN to do image noise filter researching work. Firstly, this paper uses training samples to train GA-BPN as the noise detector. Then, we utilize the well-trained GA-BPN to recognize noise pixels in target image. And at last, an adaptive weighted average algorithm is used to recover noise pixels recognized by GA-BPN. Experiment data shows that this algorithm has better performance than other filters.

A novel approach to background subtraction in contrast-enhanced dual-energy digital mammography with commercially available mammography devices: Noise minimization

International Nuclear Information System (INIS)

Contillo, Adriano; Di Domenico, Giovanni; Cardarelli, Paolo; Gambaccini, Mauro; Taibi, Angelo

2016-01-01

Purpose: Dual-energy image subtraction represents a useful tool to improve the detectability of small lesions, especially in dense breasts. A feature it shares with all x-ray imaging techniques is the appearance of fluctuations in the texture of the background, which can obscure the visibility of interesting details. The aim of the work is to investigate the main noise sources, in order to create a better performing subtraction mechanism. In particular, the structural noise cancellation was achieved by means of a suitable extension of the dual-energy algorithm. Methods: The effect of the cancellation procedure was tested on an analytical simulation of a target with varying structural composition. Subsequently, the subtraction algorithm was also applied to a set of actual radiographs of a breast phantom exhibiting a nonuniform background pattern. The background power spectra of the outcomes were computed and compared to the ones obtained from a standard subtraction algorithm. Results: The comparison between the standard and the proposed cancellations showed an overall suppression of the magnitudes of the spectra, as well as a flattening of the frequency dependence of the structural component of the noise. Conclusions: The proposed subtraction procedure provides an effective cancellation of the residual background fluctuations. When combined with the polychromatic correction already described in a companion publication, it results in a high performing dual-energy subtraction scheme for commercial mammography units.

A novel approach to background subtraction in contrast-enhanced dual-energy digital mammography with commercially available mammography devices: Noise minimization

Energy Technology Data Exchange (ETDEWEB)

Contillo, Adriano, E-mail: contillo@fe.infn.it; Di Domenico, Giovanni; Cardarelli, Paolo; Gambaccini, Mauro; Taibi, Angelo [Dipartimento di Fisica e Scienze della Terra, Università degli Studi di Ferrara, Via Saragat 1, I-44122 Ferrara (Italy)

2016-06-15

Purpose: Dual-energy image subtraction represents a useful tool to improve the detectability of small lesions, especially in dense breasts. A feature it shares with all x-ray imaging techniques is the appearance of fluctuations in the texture of the background, which can obscure the visibility of interesting details. The aim of the work is to investigate the main noise sources, in order to create a better performing subtraction mechanism. In particular, the structural noise cancellation was achieved by means of a suitable extension of the dual-energy algorithm. Methods: The effect of the cancellation procedure was tested on an analytical simulation of a target with varying structural composition. Subsequently, the subtraction algorithm was also applied to a set of actual radiographs of a breast phantom exhibiting a nonuniform background pattern. The background power spectra of the outcomes were computed and compared to the ones obtained from a standard subtraction algorithm. Results: The comparison between the standard and the proposed cancellations showed an overall suppression of the magnitudes of the spectra, as well as a flattening of the frequency dependence of the structural component of the noise. Conclusions: The proposed subtraction procedure provides an effective cancellation of the residual background fluctuations. When combined with the polychromatic correction already described in a companion publication, it results in a high performing dual-energy subtraction scheme for commercial mammography units.

Hybrid intravenous digital subtraction angiography of the carotid bifurcation

International Nuclear Information System (INIS)

Burbank, F.H.; Enzmann, D.; Keyes, G.S.; Brody, W.R.

1984-01-01

A hybrid digital subtraction angiography technique and noise-reduction algorithm were used to evaluate the carotid bifurcation. Temporal, hybrid, and reduced-noise hybrid images were obtained in right and left anterior oblique projections, and both single- and multiple-frame images were created with each method. The resulting images were graded on a scale of 1 to 5 by three experienced neuroradiologists. Temporal images were preferred over hybrid images. The percentage of nondiagnostic examinations, as agreed upon by two readers, was higher for temporal alone than temporal + hybrid. In addition, also by agreement between two readers, temporal + hybrid images significantly increased the number of bifurcations seen in two views (87%) compared to temporal subtraction alone

Using pixel intensity as a self-regulating threshold for deterministic image sampling in Milano Retinex: the T-Rex algorithm

Science.gov (United States)

Lecca, Michela; Modena, Carla Maria; Rizzi, Alessandro

2018-01-01

Milano Retinexes are spatial color algorithms, part of the Retinex family, usually employed for image enhancement. They modify the color of each pixel taking into account the surrounding colors and their position, catching in this way the local spatial color distribution relevant to image enhancement. We present T-Rex (from the words threshold and Retinex), an implementation of Milano Retinex, whose main novelty is the use of the pixel intensity as a self-regulating threshold to deterministically sample local color information. The experiments, carried out on real-world pictures, show that T-Rex image enhancement performance are in line with those of the Milano Retinex family: T-Rex increases the brightness, the contrast, and the flatness of the channel distributions of the input image, making more intelligible the content of pictures acquired under difficult light conditions.

Neural network based cluster creation in the ATLAS silicon pixel detector

CERN Document Server

Selbach, K E; The ATLAS collaboration

2012-01-01

The read-out from individual pixels on planar semi-conductor sensors are grouped into clusters to reconstruct the location where a charged particle passed through the sensor. The resolution given by individual pixel sizes is significantly improved by using the information from the charge sharing between pixels. Such analog cluster creation techniques have been used by the ATLAS experiment for many years to obtain an excellent performance. However, in dense environments, such as those inside high-energy jets, clusters have an increased probability of merging the charge deposited by multiple particles. Recently, a neural network based algorithm which estimates both the cluster position and whether a cluster should be split has been developed for the ATLAS pixel detector. The algorithm significantly reduces ambiguities in the assignment of pixel detector measurement to tracks within jets and improves the position accuracy with respect to standard interpolation techniques by taking into account the 2-dimensional ...

Neural network based cluster creation in the ATLAS silicon Pixel Detector

CERN Document Server

Andreazza, A; The ATLAS collaboration

2013-01-01

The read-out from individual pixels on planar semi-conductor sensors are grouped into clusters to reconstruct the location where a charged particle passed through the sensor. The resolution given by individual pixel sizes is significantly improved by using the information from the charge sharing between pixels. Such analog cluster creation techniques have been used by the ATLAS experiment for many years to obtain an excellent performance. However, in dense environments, such as those inside high-energy jets, clusters have an increased probability of merging the charge deposited by multiple particles. Recently, a neural network based algorithm which estimates both the cluster position and whether a cluster should be split has been developed for the ATLAS Pixel Detector. The algorithm significantly reduces ambiguities in the assignment of pixel detector measurement to tracks within jets and improves the position accuracy with respect to standard interpolation techniques by taking into account the 2-dimensional ...

Evaluation of Origin Ensemble algorithm for image reconstruction for pixelated solid-state detectors with large number of channels

Science.gov (United States)

Kolstein, M.; De Lorenzo, G.; Mikhaylova, E.; Chmeissani, M.; Ariño, G.; Calderón, Y.; Ozsahin, I.; Uzun, D.

2013-04-01

The Voxel Imaging PET (VIP) Pathfinder project intends to show the advantages of using pixelated solid-state technology for nuclear medicine applications. It proposes designs for Positron Emission Tomography (PET), Positron Emission Mammography (PEM) and Compton gamma camera detectors with a large number of signal channels (of the order of 106). For PET scanners, conventional algorithms like Filtered Back-Projection (FBP) and Ordered Subset Expectation Maximization (OSEM) are straightforward to use and give good results. However, FBP presents difficulties for detectors with limited angular coverage like PEM and Compton gamma cameras, whereas OSEM has an impractically large time and memory consumption for a Compton gamma camera with a large number of channels. In this article, the Origin Ensemble (OE) algorithm is evaluated as an alternative algorithm for image reconstruction. Monte Carlo simulations of the PET design are used to compare the performance of OE, FBP and OSEM in terms of the bias, variance and average mean squared error (MSE) image quality metrics. For the PEM and Compton camera designs, results obtained with OE are presented.

Multiple image encryption scheme based on pixel exchange operation and vector decomposition

Science.gov (United States)

Xiong, Y.; Quan, C.; Tay, C. J.

2018-02-01

We propose a new multiple image encryption scheme based on a pixel exchange operation and a basic vector decomposition in Fourier domain. In this algorithm, original images are imported via a pixel exchange operator, from which scrambled images and pixel position matrices are obtained. Scrambled images encrypted into phase information are imported using the proposed algorithm and phase keys are obtained from the difference between scrambled images and synthesized vectors in a charge-coupled device (CCD) plane. The final synthesized vector is used as an input in a random phase encoding (DRPE) scheme. In the proposed encryption scheme, pixel position matrices and phase keys serve as additional private keys to enhance the security of the cryptosystem which is based on a 4-f system. Numerical simulations are presented to demonstrate the feasibility and robustness of the proposed encryption scheme.

Photon-counting hexagonal pixel array CdTe detector: Spatial resolution characteristics for image-guided interventional applications.

Science.gov (United States)

Vedantham, Srinivasan; Shrestha, Suman; Karellas, Andrew; Shi, Linxi; Gounis, Matthew J; Bellazzini, Ronaldo; Spandre, Gloria; Brez, Alessandro; Minuti, Massimo

2016-05-01

High-resolution, photon-counting, energy-resolved detector with fast-framing capability can facilitate simultaneous acquisition of precontrast and postcontrast images for subtraction angiography without pixel registration artifacts and can facilitate high-resolution real-time imaging during image-guided interventions. Hence, this study was conducted to determine the spatial resolution characteristics of a hexagonal pixel array photon-counting cadmium telluride (CdTe) detector. A 650 μm thick CdTe Schottky photon-counting detector capable of concurrently acquiring up to two energy-windowed images was operated in a single energy-window mode to include photons of 10 keV or higher. The detector had hexagonal pixels with apothem of 30 μm resulting in pixel pitch of 60 and 51.96 μm along the two orthogonal directions. The detector was characterized at IEC-RQA5 spectral conditions. Linear response of the detector was determined over the air kerma rate relevant to image-guided interventional procedures ranging from 1.3 nGy/frame to 91.4 μGy/frame. Presampled modulation transfer was determined using a tungsten edge test device. The edge-spread function and the finely sampled line spread function accounted for hexagonal sampling, from which the presampled modulation transfer function (MTF) was determined. Since detectors with hexagonal pixels require resampling to square pixels for distortion-free display, the optimal square pixel size was determined by minimizing the root-mean-squared-error of the aperture functions for the square and hexagonal pixels up to the Nyquist limit. At Nyquist frequencies of 8.33 and 9.62 cycles/mm along the apothem and orthogonal to the apothem directions, the modulation factors were 0.397 and 0.228, respectively. For the corresponding axis, the limiting resolution defined as 10% MTF occurred at 13.3 and 12 cycles/mm, respectively. Evaluation of the aperture functions yielded an optimal square pixel size of 54 μm. After resampling to 54 �

Quantitative analysis of planar technetium-99m-sestamibi myocardial perfusion images using modified background subtraction

International Nuclear Information System (INIS)

Koster, K.; Wackers, F.J.; Mattera, J.A.; Fetterman, R.C.

1990-01-01

Standard interpolative background subtraction, as used for thallium-201 ( 201 Tl), may create artifacts when applied to planar technetium-99m-Sestamibi ( 99m Tc-Sestamibi) images, apparently because of the oversubtraction of relatively high extra-cardiac activity. A modified background subtraction algorithm was developed and compared to standard background subtraction in 16 patients who had both exercise-delayed 201 Tl and exercise-rest 99m Tc-Sestamibi imaging. Furthermore, a new normal data base was generated. Normal 99m Tc-Sestamibi distribution was slightly different compared to 201 Tl. Using standard background subtraction, mean defect reversibility was significantly underestimated by 99m Tc-Sestamibi compared to 201 Tl (2.8 +/- 4.9 versus -1.8 +/- 8.4, p less than 0.05). Using the modified background subtraction, mean defect reversibility on 201 Tl and 99m Tc-Sestamibi images was comparable (2.8 +/- 4.9 versus 1.7 +/- 5.2, p = NS). We conclude, that for quantification of 99m Tc-Sestamibi images a new normal data base, as well as a modification of the interpolative background subtraction method should be employed to obtain quantitative results comparable to those with 201 Tl

Theory and applications of structured light single pixel imaging

Science.gov (United States)

Stokoe, Robert J.; Stockton, Patrick A.; Pezeshki, Ali; Bartels, Randy A.

2018-02-01

Many single-pixel imaging techniques have been developed in recent years. Though the methods of image acquisition vary considerably, the methods share unifying features that make general analysis possible. Furthermore, the methods developed thus far are based on intuitive processes that enable simple and physically-motivated reconstruction algorithms, however, this approach may not leverage the full potential of single-pixel imaging. We present a general theoretical framework of single-pixel imaging based on frame theory, which enables general, mathematically rigorous analysis. We apply our theoretical framework to existing single-pixel imaging techniques, as well as provide a foundation for developing more-advanced methods of image acquisition and reconstruction. The proposed frame theoretic framework for single-pixel imaging results in improved noise robustness, decrease in acquisition time, and can take advantage of special properties of the specimen under study. By building on this framework, new methods of imaging with a single element detector can be developed to realize the full potential associated with single-pixel imaging.

Random On-Board Pixel Sampling (ROPS) X-Ray Camera

Energy Technology Data Exchange (ETDEWEB)

Wang, Zhehui [Los Alamos; Iaroshenko, O. [Los Alamos; Li, S. [Los Alamos; Liu, T. [Fermilab; Parab, N. [Argonne (main); Chen, W. W. [Purdue U.; Chu, P. [Los Alamos; Kenyon, G. [Los Alamos; Lipton, R. [Fermilab; Sun, K.-X. [Nevada U., Las Vegas

2017-09-25

Recent advances in compressed sensing theory and algorithms offer new possibilities for high-speed X-ray camera design. In many CMOS cameras, each pixel has an independent on-board circuit that includes an amplifier, noise rejection, signal shaper, an analog-to-digital converter (ADC), and optional in-pixel storage. When X-ray images are sparse, i.e., when one of the following cases is true: (a.) The number of pixels with true X-ray hits is much smaller than the total number of pixels; (b.) The X-ray information is redundant; or (c.) Some prior knowledge about the X-ray images exists, sparse sampling may be allowed. Here we first illustrate the feasibility of random on-board pixel sampling (ROPS) using an existing set of X-ray images, followed by a discussion about signal to noise as a function of pixel size. Next, we describe a possible circuit architecture to achieve random pixel access and in-pixel storage. The combination of a multilayer architecture, sparse on-chip sampling, and computational image techniques, is expected to facilitate the development and applications of high-speed X-ray camera technology.

PIXEL PATTERN BASED STEGANOGRAPHY ON IMAGES

Directory of Open Access Journals (Sweden)

R. Rejani

2015-02-01

Full Text Available One of the drawback of most of the existing steganography methods is that it alters the bits used for storing color information. Some of the examples include LSB or MSB based steganography. There are also various existing methods like Dynamic RGB Intensity Based Steganography Scheme, Secure RGB Image Steganography from Pixel Indicator to Triple Algorithm etc that can be used to find out the steganography method used and break it. Another drawback of the existing methods is that it adds noise to the image which makes the image look dull or grainy making it suspicious for a person about existence of a hidden message within the image. To overcome these shortcomings we have come up with a pixel pattern based steganography which involved hiding the message within in image by using the existing RGB values whenever possible at pixel level or with minimum changes. Along with the image a key will also be used to decrypt the message stored at pixel levels. For further protection, both the message stored as well as the key file will be in encrypted format which can have same or different keys or decryption. Hence we call it as a RGB pixel pattern based steganography.

Lagrange constraint neural networks for massive pixel parallel image demixing

Science.gov (United States)

Szu, Harold H.; Hsu, Charles C.

2002-03-01

We have shown that the remote sensing optical imaging to achieve detailed sub-pixel decomposition is a unique application of blind source separation (BSS) that is truly linear of far away weak signal, instantaneous speed of light without delay, and along the line of sight without multiple paths. In early papers, we have presented a direct application of statistical mechanical de-mixing method called Lagrange Constraint Neural Network (LCNN). While the BSAO algorithm (using a posteriori MaxEnt ANN and neighborhood pixel average) is not acceptable for remote sensing, a mirror symmetric LCNN approach is all right assuming a priori MaxEnt for unknown sources to be averaged over the source statistics (not neighborhood pixel data) in a pixel-by-pixel independent fashion. LCNN reduces the computation complexity, save a great number of memory devices, and cut the cost of implementation. The Landsat system is designed to measure the radiation to deduce surface conditions and materials. For any given material, the amount of emitted and reflected radiation varies by the wavelength. In practice, a single pixel of a Landsat image has seven channels receiving 0.1 to 12 microns of radiation from the ground within a 20x20 meter footprint containing a variety of radiation materials. A-priori LCNN algorithm provides the spatial-temporal variation of mixture that is hardly de-mixable by other a-posteriori BSS or ICA methods. We have already compared the Landsat remote sensing using both methods in WCCI 2002 Hawaii. Unfortunately the absolute benchmark is not possible because of lacking of the ground truth. We will arbitrarily mix two incoherent sampled images as the ground truth. However, the constant total probability of co-located sources within the pixel footprint is necessary for the remote sensing constraint (since on a clear day the total reflecting energy is constant in neighborhood receiving pixel sensors), we have to normalized two image pixel-by-pixel as well. Then, the

Simulation and evaluation of the absorption edge subtraction technique in energy-resolved X-ray radiography applied to the cultural heritage studies

International Nuclear Information System (INIS)

Leyva Pernia, Diana; Cabal Rodriguez, Ana E.; Pinnera Hernandez, Ibrahin; Leyva Fabelo, Antonio; Abreu Alfonso, Yamiel; Espen, Piet Van

2011-01-01

In this work the mathematical simulation of photon transport in the matter was used to evaluate the potentials of a new energy-resolved X-ray radiography system. The system is intended for investigations of cultural heritage object, mainly painting. The radiographic system uses polychromatic radiation from an X-ray tube and measures the spectrum transmitted through the object with an energy-dispersive X-ray detector on a pixel-by-pixel basis. Manipulation of the data-set obtained allows constructing images with enhanced contrast for certain elements. Here the use of the absorption edge subtraction technique was emphasized. The simulated results were in good agreement with the experimental data.(author)

Performance of the reconstruction algorithms of the FIRST experiment pixel sensors vertex detector

Energy Technology Data Exchange (ETDEWEB)

Rescigno, R., E-mail: regina.rescigno@iphc.cnrs.fr [Institut Pluridisciplinaire Hubert Curien, 23 rue du Loess, 67037 Strasbourg Cedex 2 (France); Finck, Ch.; Juliani, D. [Institut Pluridisciplinaire Hubert Curien, 23 rue du Loess, 67037 Strasbourg Cedex 2 (France); Spiriti, E. [Istituto Nazionale di Fisica Nucleare - Laboratori Nazionali di Frascati (Italy); Istituto Nazionale di Fisica Nucleare - Sezione di Roma 3 (Italy); Baudot, J. [Institut Pluridisciplinaire Hubert Curien, 23 rue du Loess, 67037 Strasbourg Cedex 2 (France); Abou-Haidar, Z. [CNA, Sevilla (Spain); Agodi, C. [Istituto Nazionale di Fisica Nucleare - Laboratori Nazionali del Sud (Italy); Alvarez, M.A.G. [CNA, Sevilla (Spain); Aumann, T. [GSI Helmholtzzentrum für Schwerionenforschung, Darmstadt (Germany); Battistoni, G. [Istituto Nazionale di Fisica Nucleare - Sezione di Milano (Italy); Bocci, A. [CNA, Sevilla (Spain); Böhlen, T.T. [European Organization for Nuclear Research CERN, Geneva (Switzerland); Medical Radiation Physics, Karolinska Institutet and Stockholm University, Stockholm (Sweden); Boudard, A. [CEA-Saclay, IRFU/SPhN, Gif sur Yvette Cedex (France); Brunetti, A.; Carpinelli, M. [Istituto Nazionale di Fisica Nucleare - Sezione di Cagliari (Italy); Università di Sassari (Italy); Cirrone, G.A.P. [Istituto Nazionale di Fisica Nucleare - Laboratori Nazionali del Sud (Italy); Cortes-Giraldo, M.A. [Departamento de Fisica Atomica, Molecular y Nuclear, University of Sevilla, 41080-Sevilla (Spain); Cuttone, G.; De Napoli, M. [Istituto Nazionale di Fisica Nucleare - Laboratori Nazionali del Sud (Italy); Durante, M. [GSI Helmholtzzentrum für Schwerionenforschung, Darmstadt (Germany); and others

2014-12-11

Hadrontherapy treatments use charged particles (e.g. protons and carbon ions) to treat tumors. During a therapeutic treatment with carbon ions, the beam undergoes nuclear fragmentation processes giving rise to significant yields of secondary charged particles. An accurate prediction of these production rates is necessary to estimate precisely the dose deposited into the tumours and the surrounding healthy tissues. Nowadays, a limited set of double differential carbon fragmentation cross-section is available. Experimental data are necessary to benchmark Monte Carlo simulations for their use in hadrontherapy. The purpose of the FIRST experiment is to study nuclear fragmentation processes of ions with kinetic energy in the range from 100 to 1000 MeV/u. Tracks are reconstructed using information from a pixel silicon detector based on the CMOS technology. The performances achieved using this device for hadrontherapy purpose are discussed. For each reconstruction step (clustering, tracking and vertexing), different methods are implemented. The algorithm performances and the accuracy on reconstructed observables are evaluated on the basis of simulated and experimental data.

Photon-counting hexagonal pixel array CdTe detector: Spatial resolution characteristics for image-guided interventional applications

Energy Technology Data Exchange (ETDEWEB)

Vedantham, Srinivasan; Shrestha, Suman; Karellas, Andrew, E-mail: andrew.karellas@umassmed.edu; Shi, Linxi; Gounis, Matthew J. [Department of Radiology, University of Massachusetts Medical School, Worcester, Massachusetts 01655 (United States); Bellazzini, Ronaldo; Spandre, Gloria; Brez, Alessandro; Minuti, Massimo [Istituto Nazionale di Fisica Nucleare (INFN), Pisa 56127, Italy and Pixirad Imaging Counters s.r.l., L. Pontecorvo 3, Pisa 56127 (Italy)

2016-05-15

Purpose: High-resolution, photon-counting, energy-resolved detector with fast-framing capability can facilitate simultaneous acquisition of precontrast and postcontrast images for subtraction angiography without pixel registration artifacts and can facilitate high-resolution real-time imaging during image-guided interventions. Hence, this study was conducted to determine the spatial resolution characteristics of a hexagonal pixel array photon-counting cadmium telluride (CdTe) detector. Methods: A 650 μm thick CdTe Schottky photon-counting detector capable of concurrently acquiring up to two energy-windowed images was operated in a single energy-window mode to include photons of 10 keV or higher. The detector had hexagonal pixels with apothem of 30 μm resulting in pixel pitch of 60 and 51.96 μm along the two orthogonal directions. The detector was characterized at IEC-RQA5 spectral conditions. Linear response of the detector was determined over the air kerma rate relevant to image-guided interventional procedures ranging from 1.3 nGy/frame to 91.4 μGy/frame. Presampled modulation transfer was determined using a tungsten edge test device. The edge-spread function and the finely sampled line spread function accounted for hexagonal sampling, from which the presampled modulation transfer function (MTF) was determined. Since detectors with hexagonal pixels require resampling to square pixels for distortion-free display, the optimal square pixel size was determined by minimizing the root-mean-squared-error of the aperture functions for the square and hexagonal pixels up to the Nyquist limit. Results: At Nyquist frequencies of 8.33 and 9.62 cycles/mm along the apothem and orthogonal to the apothem directions, the modulation factors were 0.397 and 0.228, respectively. For the corresponding axis, the limiting resolution defined as 10% MTF occurred at 13.3 and 12 cycles/mm, respectively. Evaluation of the aperture functions yielded an optimal square pixel size of 54 �

99mTc-RBC subtraction scintigraphy

International Nuclear Information System (INIS)

Inagaki, Syoichi; Tonami, Syuichi; Yasui, Masakazu; Kuranishi, Makoto; Sugishita, Kouki; Nakamura, Mamoru

1994-01-01

Sequential abdominal scintigrams with 99m Tc-labelled red blood cells (RBC) were subtracted for observing a site of gastrointestinal bleeding and calculating the bleeding rate. This method is technically very easy and can detect the site of bleeding with the minimum rate, as low as 0.2 ml/min., in a phantom experiment. In 23 cases with final diagnosis of gastrointestinal bleeding, conventional non-subtraction scintigraphy detected only 30% (7/23), but subtraction scintigraphy detected 61% (14/23). It was concluded that subtraction scintigraphy had higher sensitivity than conventional scintigraphy for early diagnosing bleeding. A combination of non-subtraction and subtraction scintigraphy is recommended to detect a site of gastrointestinal bleeding in a clinical setting. (author)

Principal distance constraint error diffusion algorithm for homogeneous dot distribution

Science.gov (United States)

Kang, Ki-Min; Kim, Choon-Woo

1999-12-01

The perceived quality of the halftoned image strongly depends on the spatial distribution of the binary dots. Various error diffusion algorithms have been proposed for realizing the homogeneous dot distribution in the highlight and shadow regions. However, they are computationally expensive and/or require large memory space. This paper presents a new threshold modulated error diffusion algorithm for the homogeneous dot distribution. The proposed method is applied exactly same as the Floyd-Steinberg's algorithm except the thresholding process. The threshold value is modulated based on the difference between the distance to the nearest minor pixel, `minor pixel distance', and the principal distance. To do so, calculation of the minor pixel distance is needed for every pixel. But, it is quite time consuming and requires large memory resources. In order to alleviate this problem, `the minor pixel offset array' that transforms the 2D history of minor pixels into the 1D codes is proposed. The proposed algorithm drastically reduces the computational load and memory spaces needed for calculation of the minor pixel distance.

Reconstruction of 2D PET data with Monte Carlo generated system matrix for generalized natural pixels

International Nuclear Information System (INIS)

Vandenberghe, Stefaan; Staelens, Steven; Byrne, Charles L; Soares, Edward J; Lemahieu, Ignace; Glick, Stephen J

2006-01-01

In discrete detector PET, natural pixels are image basis functions calculated from the response of detector pairs. By using reconstruction with natural pixel basis functions, the discretization of the object into a predefined grid can be avoided. Here, we propose to use generalized natural pixel reconstruction. Using this approach, the basis functions are not the detector sensitivity functions as in the natural pixel case but uniform parallel strips. The backprojection of the strip coefficients results in the reconstructed image. This paper proposes an easy and efficient way to generate the matrix M directly by Monte Carlo simulation. Elements of the generalized natural pixel system matrix are formed by calculating the intersection of a parallel strip with the detector sensitivity function. These generalized natural pixels are easier to use than conventional natural pixels because the final step from solution to a square pixel representation is done by simple backprojection. Due to rotational symmetry in the PET scanner, the matrix M is block circulant and only the first blockrow needs to be stored. Data were generated using a fast Monte Carlo simulator using ray tracing. The proposed method was compared to a listmode MLEM algorithm, which used ray tracing for doing forward and backprojection. Comparison of the algorithms with different phantoms showed that an improved resolution can be obtained using generalized natural pixel reconstruction with accurate system modelling. In addition, it was noted that for the same resolution a lower noise level is present in this reconstruction. A numerical observer study showed the proposed method exhibited increased performance as compared to a standard listmode EM algorithm. In another study, more realistic data were generated using the GATE Monte Carlo simulator. For these data, a more uniform contrast recovery and a better contrast-to-noise performance were observed. It was observed that major improvements in contrast

Novel artefact removal algorithms for co-registered EEG/fMRI based on selective averaging and subtraction.

Science.gov (United States)

de Munck, Jan C; van Houdt, Petra J; Gonçalves, Sónia I; van Wegen, Erwin; Ossenblok, Pauly P W

2013-01-01

Co-registered EEG and functional MRI (EEG/fMRI) is a potential clinical tool for planning invasive EEG in patients with epilepsy. In addition, the analysis of EEG/fMRI data provides a fundamental insight into the precise physiological meaning of both fMRI and EEG data. Routine application of EEG/fMRI for localization of epileptic sources is hampered by large artefacts in the EEG, caused by switching of scanner gradients and heartbeat effects. Residuals of the ballistocardiogram (BCG) artefacts are similarly shaped as epileptic spikes, and may therefore cause false identification of spikes. In this study, new ideas and methods are presented to remove gradient artefacts and to reduce BCG artefacts of different shapes that mutually overlap in time. Gradient artefacts can be removed efficiently by subtracting an average artefact template when the EEG sampling frequency and EEG low-pass filtering are sufficient in relation to MR gradient switching (Gonçalves et al., 2007). When this is not the case, the gradient artefacts repeat themselves at time intervals that depend on the remainder between the fMRI repetition time and the closest multiple of the EEG acquisition time. These repetitions are deterministic, but difficult to predict due to the limited precision by which these timings are known. Therefore, we propose to estimate gradient artefact repetitions using a clustering algorithm, combined with selective averaging. Clustering of the gradient artefacts yields cleaner EEG for data recorded during scanning of a 3T scanner when using a sampling frequency of 2048 Hz. It even gives clean EEG when the EEG is sampled with only 256 Hz. Current BCG artefacts-reduction algorithms based on average template subtraction have the intrinsic limitation that they fail to deal properly with artefacts that overlap in time. To eliminate this constraint, the precise timings of artefact overlaps were modelled and represented in a sparse matrix. Next, the artefacts were disentangled with

Weighted Local Active Pixel Pattern (WLAPP for Face Recognition in Parallel Computation Environment

Directory of Open Access Journals (Sweden)

Gundavarapu Mallikarjuna Rao

2013-10-01

Full Text Available Abstract  - The availability of multi-core technology resulted totally new computational era. Researchers are keen to explore available potential in state of art-machines for breaking the bearer imposed by serial computation. Face Recognition is one of the challenging applications on so ever computational environment. The main difficulty of traditional Face Recognition algorithms is lack of the scalability. In this paper Weighted Local Active Pixel Pattern (WLAPP, a new scalable Face Recognition Algorithm suitable for parallel environment is proposed.  Local Active Pixel Pattern (LAPP is found to be simple and computational inexpensive compare to Local Binary Patterns (LBP. WLAPP is developed based on concept of LAPP. The experimentation is performed on FG-Net Aging Database with deliberately introduced 20% distortion and the results are encouraging. Keywords — Active pixels, Face Recognition, Local Binary Pattern (LBP, Local Active Pixel Pattern (LAPP, Pattern computing, parallel workers, template, weight computation.  

SVM Pixel Classification on Colour Image Segmentation

Science.gov (United States)

Barui, Subhrajit; Latha, S.; Samiappan, Dhanalakshmi; Muthu, P.

2018-04-01

The aim of image segmentation is to simplify the representation of an image with the help of cluster pixels into something meaningful to analyze. Segmentation is typically used to locate boundaries and curves in an image, precisely to label every pixel in an image to give each pixel an independent identity. SVM pixel classification on colour image segmentation is the topic highlighted in this paper. It holds useful application in the field of concept based image retrieval, machine vision, medical imaging and object detection. The process is accomplished step by step. At first we need to recognize the type of colour and the texture used as an input to the SVM classifier. These inputs are extracted via local spatial similarity measure model and Steerable filter also known as Gabon Filter. It is then trained by using FCM (Fuzzy C-Means). Both the pixel level information of the image and the ability of the SVM Classifier undergoes some sophisticated algorithm to form the final image. The method has a well developed segmented image and efficiency with respect to increased quality and faster processing of the segmented image compared with the other segmentation methods proposed earlier. One of the latest application result is the Light L16 camera.

Routine evaluation ot arteriopathies of the lower extremities by digital subtraction angiography

Energy Technology Data Exchange (ETDEWEB)

Stacul, F; Pozzi-Mucelli, R; Predonzan, F; Magnaldi, S; Abbona, M; Pozzi-Mucelli, R S; Dalla Palma, L

1985-11-01

Intravenous digital subtraction angiography (DSA) was performed in 119 patients with lower extremity ischemia using a 14'' amplifier. Four injections of contrast medium were usually necessary for a complete evaluation of this vascular region. Images of good quality were obtained in most cases; movement artifacts and a faint opacification accounted for any poor results, which occured mainly under the knee. The technique of pixel shifting turned out to be very useful to remove movement artifacts. The 'measuring field' allowed us to minimize the problem of the inhomogeneous saturation of the amplifier. In 8% of the cases an intra-arterial DSA has been performed after an unsatisfactory intravenous examination. Conventional angiography appears to be no longer necessary.

High spatiotemporal resolution measurement of regional lung air volumes from 2D phase contrast x-ray images.

Science.gov (United States)

Leong, Andrew F T; Fouras, Andreas; Islam, M Sirajul; Wallace, Megan J; Hooper, Stuart B; Kitchen, Marcus J

2013-04-01

Described herein is a new technique for measuring regional lung air volumes from two-dimensional propagation-based phase contrast x-ray (PBI) images at very high spatial and temporal resolution. Phase contrast dramatically increases lung visibility and the outlined volumetric reconstruction technique quantifies dynamic changes in respiratory function. These methods can be used for assessing pulmonary disease and injury and for optimizing mechanical ventilation techniques for preterm infants using animal models. The volumetric reconstruction combines the algorithms of temporal subtraction and single image phase retrieval (SIPR) to isolate the image of the lungs from the thoracic cage in order to measure regional lung air volumes. The SIPR algorithm was used to recover the change in projected thickness of the lungs on a pixel-by-pixel basis (pixel dimensions ≈ 16.2 μm). The technique has been validated using numerical simulation and compared results of measuring regional lung air volumes with and without the use of temporal subtraction for removing the thoracic cage. To test this approach, a series of PBI images of newborn rabbit pups mechanically ventilated at different frequencies was employed. Regional lung air volumes measured from PBI images of newborn rabbit pups showed on average an improvement of at least 20% in 16% of pixels within the lungs in comparison to that measured without the use of temporal subtraction. The majority of pixels that showed an improvement was found to be in regions occupied by bone. Applying the volumetric technique to sequences of PBI images of newborn rabbit pups, it is shown that lung aeration at birth can be highly heterogeneous. This paper presents an image segmentation technique based on temporal subtraction that has successfully been used to isolate the lungs from PBI chest images, allowing the change in lung air volume to be measured over regions as small as the pixel size. Using this technique, it is possible to measure

Reduction of Musical Noise in Spectral Subtraction Method Using Subframe Phase Randomization

Energy Technology Data Exchange (ETDEWEB)

Seok, J.W.; Bae, K.S. [Kyungpook National University, Taegu (Korea)

1999-06-01

The Subframe phase randomization method is applied to the spectral subtraction method to reduce the musical noise in nonvoicing region after speech enhancement. The musical noise in the spectral subtraction method is the result of the narrowband tonal components that appearing somewhat periodically in the spectrogram of unvoiced and silence regions. Thus each synthesis frame in nonvoicing region is divided into several subframes to broaden the narrowband spectrum, and then phases of silence and unvoiced regions are randomized to eliminate the tonal components in the spectrum while keeping the shape of the amplitude spectrum. Performance assessments based on visual inspection of spectrogram, objective measure, and informal subjective listening tests demonstrate the superiority of the proposed algorithm. (author). 7 refs., 5 figs.

Adaptation of an aerosol retrieval algorithm using multi-wavelength and multi-pixel information of satellites (MWPM) to GOSAT/TANSO-CAI

Science.gov (United States)

Hashimoto, M.; Takenaka, H.; Higurashi, A.; Nakajima, T.

2017-12-01

Aerosol in the atmosphere is an important constituent for determining the earth's radiation budget, so the accurate aerosol retrievals from satellite is useful. We have developed a satellite remote sensing algorithm to retrieve the aerosol optical properties using multi-wavelength and multi-pixel information of satellite imagers (MWPM). The method simultaneously derives aerosol optical properties, such as aerosol optical thickness (AOT), single scattering albedo (SSA) and aerosol size information, by using spatial difference of wavelegths (multi-wavelength) and surface reflectances (multi-pixel). The method is useful for aerosol retrieval over spatially heterogeneous surface like an urban region. In this algorithm, the inversion method is a combination of an optimal method and smoothing constraint for the state vector. Furthermore, this method has been combined with the direct radiation transfer calculation (RTM) numerically solved by each iteration step of the non-linear inverse problem, without using look up table (LUT) with several constraints. However, it takes too much computation time. To accelerate the calculation time, we replaced the RTM with an accelerated RTM solver learned by neural network-based method, EXAM (Takenaka et al., 2011), using Rster code. And then, the calculation time was shorternd to about one thouthandth. We applyed MWPM combined with EXAM to GOSAT/TANSO-CAI (Cloud and Aerosol Imager). CAI is a supplement sensor of TANSO-FTS, dedicated to measure cloud and aerosol properties. CAI has four bands, 380, 674, 870 and 1600 nm, and observes in 500 meters resolution for band1, band2 and band3, and 1.5 km for band4. Retrieved parameters are aerosol optical properties, such as aerosol optical thickness (AOT) of fine and coarse mode particles at a wavelenth of 500nm, a volume soot fraction in fine mode particles, and ground surface albedo of each observed wavelength by combining a minimum reflectance method and Fukuda et al. (2013). We will show

TU-CD-207-03: Time Evolution of Texture Parameters of Subtracted Images Obtained by Contrast-Enhanced Digital Mammography (CEDM)

Energy Technology Data Exchange (ETDEWEB)

Mateos, M-J; Brandan, M-E [Instituto de Fisica, Universidad Nacional Autonom de Mexico, Mexico, Distrito Federal (Mexico); Gastelum, A; Marquez, J [Centro de Ciencias Aplicadas y Desarrollo Tecnologico Universidad Nacional Autonoma de Mexico, Mexico, Distrito Federal (Mexico)

2015-06-15

Purpose: To evaluate the time evolution of texture parameters, based on the gray level co-occurrence matrix (GLCM), in subtracted images of 17 patients (10 malignant and 7 benign) subjected to contrast-enhanced digital mammography (CEDM). The goal is to determine the sensitivity of texture to iodine uptake at the lesion, and its correlation (or lack of) with mean-pixel-value (MPV). Methods: Acquisition of clinical images followed a single-energy CEDM protocol using Rh/Rh/48 kV plus external 0.5 cm Al from a Senographe DS unit. Prior to the iodine-based contrast medium (CM) administration a mask image was acquired; four CM images were obtained 1, 2, 3, and 5 minutes after CM injection. Temporal series were obtained by logarithmic subtraction of registered CM minus mask images.Regions of interest (ROI) for the lesion were drawn by a radiologist and the texture was analyzed. GLCM was evaluated at a 3 pixel distance, 0° angle, and 64 gray-levels. Pixels identified as registration errors were excluded from the computation. 17 texture parameters were chosen, classified according to similarity into 7 groups, and analyzed. Results: In all cases the texture parameters within a group have similar dynamic behavior. Two texture groups (associated to cluster and sum mean) show a strong correlation with MPV; their average correlation coefficient (ACC) is r{sup 2}=0.90. Other two groups (contrast, homogeneity) remain constant with time, that is, a low-sensitivity to CM uptake. Three groups (regularity, lacunarity and diagonal moment) are sensitive to CM uptake but less correlated with MPV; their ACC is r{sup 2}=0.78. Conclusion: This analysis has shown that, at least groups associated to regularity, lacunarity and diagonal moment offer dynamical information additional to the mean pixel value due to the presence of CM at the lesion. The next step will be the analysis in terms of the lesion pathology. Authors thank PAPIIT-IN105813 for support. Consejo Nacional de Ciencia Y

A posteriori registration and subtraction of periapical radiographs for the evaluation of external apical root resorption after orthodontic treatment.

Science.gov (United States)

Kreich, Eliane Maria; Chibinski, Ana Cláudia; Coelho, Ulisses; Wambier, Letícia Stadler; Zedebski, Rosário de Arruda Moura; de Moraes, Mari Eli Leonelli; de Moraes, Luiz Cesar

2016-03-01

This study employed a posteriori registration and subtraction of radiographic images to quantify the apical root resorption in maxillary permanent central incisors after orthodontic treatment, and assessed whether the external apical root resorption (EARR) was related to a range of parameters involved in the treatment. A sample of 79 patients (mean age, 13.5±2.2 years) with no history of trauma or endodontic treatment of the maxillary permanent central incisors was selected. Periapical radiographs taken before and after orthodontic treatment were digitized and imported to the Regeemy software. Based on an analysis of the posttreatment radiographs, the length of the incisors was measured using Image J software. The mean EARR was described in pixels and relative root resorption (%). The patient's age and gender, tooth extraction, use of elastics, and treatment duration were evaluated to identify possible correlations with EARR. The mean EARR observed was 15.44±12.1 pixels (5.1% resorption). No differences in the mean EARR were observed according to patient characteristics (gender, age) or treatment parameters (use of elastics, treatment duration). The only parameter that influenced the mean EARR of a patient was the need for tooth extraction. A posteriori registration and subtraction of periapical radiographs was a suitable method to quantify EARR after orthodontic treatment, and the need for tooth extraction increased the extent of root resorption after orthodontic treatment.

A posterior registration and subtraction of periapical radiographs for the evaluation of external apical root resorption after orthodontic treatment

Energy Technology Data Exchange (ETDEWEB)

Kreich, Eliane Maria; Chibinski, Ana Claudia; Coelho, Ulisses; Wambier, Leticia Stadler; Zedebski, Rosaio De Arruda Moura [School of Dentistry, Ponta Grossa State University, Ponta Grossa, Parana (Brazil); De Moraes, Mari Eli Leonelli; De Moraes, Luiz Cesar [Dept. of Dental Radiology, School of Dentistry, State University of Sao Paulo, Sao Jose dos Campos, Sao Paulo (Brazil)

2016-03-15

This study employed a posteriori registration and subtraction of radiographic images to quantify the apical root resorption in maxillary permanent central incisors after orthodontic treatment, and assessed whether the external apical root resorption (EARR) was related to a range of parameters involved in the treatment. A sample of 79 patients (mean age, 13.5±2.2 years) with no history of trauma or endodontic treatment of the maxillary permanent central incisors was selected. Periapical radiographs taken before and after orthodontic treatment were digitized and imported to the Regeemy software. Based on an analysis of the posttreatment radiographs, the length of the incisors was measured using Image J software. The mean EARR was described in pixels and relative root resorption (%). The patient's age and gender, tooth extraction, use of elastics, and treatment duration were evaluated to identify possible correlations with EARR. The mean EARR observed was 15.44±12.1 pixels (5.1% resorption). No differences in the mean EARR were observed according to patient characteristics (gender, age) or treatment parameters (use of elastics, treatment duration). The only parameter that influenced the mean EARR of a patient was the need for tooth extraction. A posteriori registration and subtraction of periapical radiographs was a suitable method to quantify EARR after orthodontic treatment, and the need for tooth extraction increased the extent of root resorption after orthodontic treatment.

A posterior registration and subtraction of periapical radiographs for the evaluation of external apical root resorption after orthodontic treatment

International Nuclear Information System (INIS)

Kreich, Eliane Maria; Chibinski, Ana Claudia; Coelho, Ulisses; Wambier, Leticia Stadler; Zedebski, Rosaio De Arruda Moura; De Moraes, Mari Eli Leonelli; De Moraes, Luiz Cesar

2016-01-01

This study employed a posteriori registration and subtraction of radiographic images to quantify the apical root resorption in maxillary permanent central incisors after orthodontic treatment, and assessed whether the external apical root resorption (EARR) was related to a range of parameters involved in the treatment. A sample of 79 patients (mean age, 13.5±2.2 years) with no history of trauma or endodontic treatment of the maxillary permanent central incisors was selected. Periapical radiographs taken before and after orthodontic treatment were digitized and imported to the Regeemy software. Based on an analysis of the posttreatment radiographs, the length of the incisors was measured using Image J software. The mean EARR was described in pixels and relative root resorption (%). The patient's age and gender, tooth extraction, use of elastics, and treatment duration were evaluated to identify possible correlations with EARR. The mean EARR observed was 15.44±12.1 pixels (5.1% resorption). No differences in the mean EARR were observed according to patient characteristics (gender, age) or treatment parameters (use of elastics, treatment duration). The only parameter that influenced the mean EARR of a patient was the need for tooth extraction. A posteriori registration and subtraction of periapical radiographs was a suitable method to quantify EARR after orthodontic treatment, and the need for tooth extraction increased the extent of root resorption after orthodontic treatment

Increasing LIGO sensitivity by feedforward subtraction of auxiliary length control noise

International Nuclear Information System (INIS)

Meadors, Grant David; Riles, Keith; Kawabe, Keita

2014-01-01

LIGO, the Laser Interferometer Gravitational-wave Observatory, has been designed and constructed to measure gravitational wave strain via differential arm length. The LIGO 4 km Michelson arms with Fabry–Perot cavities have auxiliary length control servos for suppressing Michelson motion of the beam-splitter and arm cavity input mirrors, which degrades interferometer sensitivity. We demonstrate how a post facto pipeline improves a data sample from LIGO Science Run 6 with feedforward subtraction. Dividing data into 1024 s windows, we numerically fit filter functions representing the frequency-domain transfer functions from Michelson length channels into the gravitational-wave strain data channel for each window, then subtract the filtered Michelson channel noise (witness) from the strain channel (target). In this paper we describe the algorithm, assess achievable improvements in sensitivity to astrophysical sources, and consider relevance to future interferometry. (paper)

Pixel-based OPC optimization based on conjugate gradients.

Science.gov (United States)

Ma, Xu; Arce, Gonzalo R

2011-01-31

Optical proximity correction (OPC) methods are resolution enhancement techniques (RET) used extensively in the semiconductor industry to improve the resolution and pattern fidelity of optical lithography. In pixel-based OPC (PBOPC), the mask is divided into small pixels, each of which is modified during the optimization process. Two critical issues in PBOPC are the required computational complexity of the optimization process, and the manufacturability of the optimized mask. Most current OPC optimization methods apply the steepest descent (SD) algorithm to improve image fidelity augmented by regularization penalties to reduce the complexity of the mask. Although simple to implement, the SD algorithm converges slowly. The existing regularization penalties, however, fall short in meeting the mask rule check (MRC) requirements often used in semiconductor manufacturing. This paper focuses on developing OPC optimization algorithms based on the conjugate gradient (CG) method which exhibits much faster convergence than the SD algorithm. The imaging formation process is represented by the Fourier series expansion model which approximates the partially coherent system as a sum of coherent systems. In order to obtain more desirable manufacturability properties of the mask pattern, a MRC penalty is proposed to enlarge the linear size of the sub-resolution assistant features (SRAFs), as well as the distances between the SRAFs and the main body of the mask. Finally, a projection method is developed to further reduce the complexity of the optimized mask pattern.

Temporal subtraction of dual-energy chest radiographs

International Nuclear Information System (INIS)

Armato, Samuel G. III; Doshi, Devang J.; Engelmann, Roger; Caligiuri, Philip; MacMahon, Heber

2006-01-01

Temporal subtraction and dual-energy imaging are two enhanced radiography techniques that are receiving increased attention in chest radiography. Temporal subtraction is an image processing technique that facilitates the visualization of pathologic change across serial chest radiographic images acquired from the same patient; dual-energy imaging exploits the differential relative attenuation of x-ray photons exhibited by soft-tissue and bony structures at different x-ray energies to generate a pair of images that accentuate those structures. Although temporal subtraction images provide a powerful mechanism for enhancing visualization of subtle change, misregistration artifacts in these images can mimic or obscure abnormalities. The purpose of this study was to evaluate whether dual-energy imaging could improve the quality of temporal subtraction images. Temporal subtraction images were generated from 100 pairs of temporally sequential standard radiographic chest images and from the corresponding 100 pairs of dual-energy, soft-tissue radiographic images. The registration accuracy demonstrated in the resulting temporal subtraction images was evaluated subjectively by two radiologists. The registration accuracy of the soft-tissue-based temporal subtraction images was rated superior to that of the conventional temporal subtraction images. Registration accuracy also was evaluated objectively through an automated method, which achieved an area-under-the-ROC-curve value of 0.92 in the distinction between temporal subtraction images that demonstrated clinically acceptable and clinically unacceptable registration accuracy. By combining dual-energy soft-tissue images with temporal subtraction, misregistration artifacts can be reduced and superior image quality can be obtained

Improved liver R2* mapping by pixel-wise curve fitting with adaptive neighborhood regularization.

Science.gov (United States)

Wang, Changqing; Zhang, Xinyuan; Liu, Xiaoyun; He, Taigang; Chen, Wufan; Feng, Qianjin; Feng, Yanqiu

2018-08-01

To improve liver R2* mapping by incorporating adaptive neighborhood regularization into pixel-wise curve fitting. Magnetic resonance imaging R2* mapping remains challenging because of the serial images with low signal-to-noise ratio. In this study, we proposed to exploit the neighboring pixels as regularization terms and adaptively determine the regularization parameters according to the interpixel signal similarity. The proposed algorithm, called the pixel-wise curve fitting with adaptive neighborhood regularization (PCANR), was compared with the conventional nonlinear least squares (NLS) and nonlocal means filter-based NLS algorithms on simulated, phantom, and in vivo data. Visually, the PCANR algorithm generates R2* maps with significantly reduced noise and well-preserved tiny structures. Quantitatively, the PCANR algorithm produces R2* maps with lower root mean square errors at varying R2* values and signal-to-noise-ratio levels compared with the NLS and nonlocal means filter-based NLS algorithms. For the high R2* values under low signal-to-noise-ratio levels, the PCANR algorithm outperforms the NLS and nonlocal means filter-based NLS algorithms in the accuracy and precision, in terms of mean and standard deviation of R2* measurements in selected region of interests, respectively. The PCANR algorithm can reduce the effect of noise on liver R2* mapping, and the improved measurement precision will benefit the assessment of hepatic iron in clinical practice. Magn Reson Med 80:792-801, 2018. © 2018 International Society for Magnetic Resonance in Medicine. © 2018 International Society for Magnetic Resonance in Medicine.

Harmonics rejection in pixelated interferograms using spatio-temporal demodulation.

Science.gov (United States)

Padilla, J M; Servin, M; Estrada, J C

2011-09-26

Pixelated phase-mask interferograms have become an industry standard in spatial phase-shifting interferometry. These pixelated interferograms allow full wavefront encoding using a single interferogram. This allows the study of fast dynamic events in hostile mechanical environments. Recently an error-free demodulation method for ideal pixelated interferograms was proposed. However, non-ideal conditions in interferometry may arise due to non-linear response of the CCD camera, multiple light paths in the interferometer, etc. These conditions generate non-sinusoidal fringes containing harmonics which degrade the phase estimation. Here we show that two-dimensional Fourier demodulation of pixelated interferograms rejects most harmonics except the complex ones at {-3(rd), +5(th), -7(th), +9(th), -11(th),…}. We propose temporal phase-shifting to remove these remaining harmonics. In particular, a 2-step phase-shifting algorithm is used to eliminate the -3(rd) and +5(th) complex harmonics, while a 3-step one is used to remove the -3(rd), +5harmonics. © 2011 Optical Society of America

Digital subtraction angiography of the heart and lungs

International Nuclear Information System (INIS)

Moodie, D.S.; Yiannikas, J.

1986-01-01

This book contains 12 chapters. Some of the chapter titles are: Physical Principles of Cardiac Digital Subtraction Angiography, The Use of Intravenous Digital Subtraction Angiography in Evaluating Patients with Complex Congenital Heart Disease, Exercise Intravenous Digital Subtraction Angiograpny, Cardiomyopathic and Cardiac Neoplastic Disease, Digital Subtraction Angiography in the Catheterization Laboratory, and Cardiac Digital Subtraction Angiography - Future Directions

A subtraction scheme for computing QCD jet cross sections at NNLO: integrating the subtraction terms I

Science.gov (United States)

Somogyi, Gábor; Trócsányi, Zoltán

2008-08-01

In previous articles we outlined a subtraction scheme for regularizing doubly-real emission and real-virtual emission in next-to-next-to-leading order (NNLO) calculations of jet cross sections in electron-positron annihilation. In order to find the NNLO correction these subtraction terms have to be integrated over the factorized unresolved phase space and combined with the two-loop corrections. In this paper we perform the integration of all one-parton unresolved subtraction terms.

An accurate projection algorithm for array processor based SPECT systems

International Nuclear Information System (INIS)

King, M.A.; Schwinger, R.B.; Cool, S.L.

1985-01-01

A data re-projection algorithm has been developed for use in single photon emission computed tomography (SPECT) on an array processor based computer system. The algorithm makes use of an accurate representation of pixel activity (uniform square pixel model of intensity distribution), and is rapidly performed due to the efficient handling of an array based algorithm and the Fast Fourier Transform (FFT) on parallel processing hardware. The algorithm consists of using a pixel driven nearest neighbour projection operation to an array of subdivided projection bins. This result is then convolved with the projected uniform square pixel distribution before being compressed to original bin size. This distribution varies with projection angle and is explicitly calculated. The FFT combined with a frequency space multiplication is used instead of a spatial convolution for more rapid execution. The new algorithm was tested against other commonly used projection algorithms by comparing the accuracy of projections of a simulated transverse section of the abdomen against analytically determined projections of that transverse section. The new algorithm was found to yield comparable or better standard error and yet result in easier and more efficient implementation on parallel hardware. Applications of the algorithm include iterative reconstruction and attenuation correction schemes and evaluation of regions of interest in dynamic and gated SPECT

Thinning an object boundary on digital image using pipelined algorithm

International Nuclear Information System (INIS)

Dewanto, S.; Aliyanta, B.

1997-01-01

In digital image processing, the thinning process to an object boundary is required to analyze the image structure with a measurement of parameter such as area, circumference of the image object. The process needs a sufficient large memory and time consuming if all the image pixels stored in the memory and the following process is done after all the pixels has ben transformed. pipelined algorithm can reduce the time used in the process. This algorithm uses buffer memory where its size can be adjusted. the next thinning process doesn't need to wait all the transformation of pixels. This paper described pipelined algorithm with some result on the use of the algorithm to digital image

Detection algorithm of infrared small target based on improved SUSAN operator

Science.gov (United States)

Liu, Xingmiao; Wang, Shicheng; Zhao, Jing

2010-10-01

The methods of detecting small moving targets in infrared image sequences that contain moving nuisance objects and background noise is analyzed in this paper. A novel infrared small target detection algorithm based on improved SUSAN operator is put forward. The algorithm selects double templates for the infrared small target detection: one size is greater than the small target point size and another size is equal to the small target point size. First, the algorithm uses the big template to calculate the USAN of each pixel in the image and detect the small target, the edge of the image and isolated noise pixels; Then the algorithm uses the another template to calculate the USAN of pixels detected in the first step and improves the principles of SUSAN algorithm based on the characteristics of the small target so that the algorithm can only detect small targets and don't sensitive to the edge pixels of the image and isolated noise pixels. So the interference of the edge of the image and isolate noise points are removed and the candidate target points can be identified; At last, the target is detected by utilizing the continuity and consistency of target movement. The experimental results indicate that the improved SUSAN detection algorithm can quickly and effectively detect the infrared small targets.

Iterative algorithm for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution

Science.gov (United States)

Quan, Haiyang; Wu, Fan; Hou, Xi

2015-10-01

New method for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution is proposed. It is based on basic iterative scheme and accelerates the Gauss-Seidel method by introducing an acceleration parameter. This modified Successive Over-relaxation (SOR) is effective for solving the rotationally asymmetric components with pixel-level spatial resolution, without the usage of a fitting procedure. Compared to the Jacobi and Gauss-Seidel method, the modified SOR method with an optimal relaxation factor converges much faster and saves more computational costs and memory space without reducing accuracy. It has been proved by real experimental results.

Evaluation of PET Imaging Resolution Using 350 mu{m} Pixelated CZT as a VP-PET Insert Detector

Science.gov (United States)

Yin, Yongzhi; Chen, Ximeng; Li, Chongzheng; Wu, Heyu; Komarov, Sergey; Guo, Qingzhen; Krawczynski, Henric; Meng, Ling-Jian; Tai, Yuan-Chuan

2014-02-01

A cadmium-zinc-telluride (CZT) detector with 350 μm pitch pixels was studied in high-resolution positron emission tomography (PET) imaging applications. The PET imaging system was based on coincidence detection between a CZT detector and a lutetium oxyorthosilicate (LSO)-based Inveon PET detector in virtual-pinhole PET geometry. The LSO detector is a 20 ×20 array, with 1.6 mm pitches, and 10 mm thickness. The CZT detector uses ac 20 ×20 ×5 mm substrate, with 350 μm pitch pixelated anodes and a coplanar cathode. A NEMA NU4 Na-22 point source of 250 μm in diameter was imaged by this system. Experiments show that the image resolution of single-pixel photopeak events was 590 μm FWHM while the image resolution of double-pixel photopeak events was 640 μm FWHM. The inclusion of double-pixel full-energy events increased the sensitivity of the imaging system. To validate the imaging experiment, we conducted a Monte Carlo (MC) simulation for the same PET system in Geant4 Application for Emission Tomography. We defined LSO detectors as a scanner ring and 350 μm pixelated CZT detectors as an insert ring. GATE simulated coincidence data were sorted into an insert-scanner sinogram and reconstructed. The image resolution of MC-simulated data (which did not factor in positron range and acolinearity effect) was 460 μm at FWHM for single-pixel events. The image resolutions of experimental data, MC simulated data, and theoretical calculation are all close to 500 μm FWHM when the proposed 350 μm pixelated CZT detector is used as a PET insert. The interpolation algorithm for the charge sharing events was also investigated. The PET image that was reconstructed using the interpolation algorithm shows improved image resolution compared with the image resolution without interpolation algorithm.

The Level 0 Pixel Trigger system for the ALICE experiment

International Nuclear Information System (INIS)

Rinella, G Aglieri; Kluge, A; Krivda, M

2007-01-01

The ALICE Silicon Pixel Detector contains 1200 readout chips. Fast-OR signals indicate the presence of at least one hit in the 8192 pixel matrix of each chip. The 1200 bits are transmitted every 100 ns on 120 data readout optical links using the G-Link protocol. The Pixel Trigger System extracts and processes them to deliver an input signal to the Level 0 trigger processor targeting a latency of 800 ns. The system is compact, modular and based on FPGA devices. The architecture allows the user to define and implement various trigger algorithms. The system uses advanced 12-channel parallel optical fiber modules operating at 1310 nm as optical receivers and 12 deserializer chips closely packed in small area receiver boards. Alternative solutions with multi-channel G-Link deserializers implemented directly in programmable hardware devices were investigated. The design of the system and the progress of the ALICE Pixel Trigger project are described in this paper

Design of readout drivers for ATLAS pixel detectors using field programmable gate arrays

CERN Document Server

Sivasubramaniyan, Sriram

Microstrip detectors are an integral patt of high energy physics research . Special protocols are used to transmit the data from these detectors . To readout the data from such detectors specialized instrumentation have to be designed . To achieve this task, creative and innovative high speed algorithms were designed simulated and implemented in Field Programmable gate arrays, using CAD/CAE tools. The simulation results indicated that these algorithms would be able to perform all the required tasks quickly and efficiently. This thesis describes the design of data acquisition system called the Readout Drivers (ROD) . It focuses on the ROD data path for ATLAS Pixel detectors. The data path will be an integrated part of Readout Drivers setup to decode the data from the silicon micro strip detectors and pixel detectors. This research also includes the design of Readout Driver controller. This Module is used to control the operation of the ROD. This module is responsible for the operation of the Pixel decoders bas...

Quantitative immunohistochemistry by measuring cumulative signal strength using commercially available software photoshop and matlab.

Science.gov (United States)

Matkowskyj, K A; Schonfeld, D; Benya, R V

2000-02-01

Currently available techniques for performing quantitative immunohistochemistry (Q-IHC) rely upon pixel-counting algorithms and therefore cannot provide information as to the absolute amount of chromogen present. We describe a novel algorithm for true Q-IHC based on calculating the cumulative signal strength, or energy, of the digital file representing any portion of an image. This algorithm involves subtracting the energy of the digital file encoding the control image (i.e., not exposed to antibody) from that of the experimental image (i.e., antibody-treated). In this manner, the absolute amount of antibody-specific chromogen per pixel can be determined for any cellular region or structure. (J Histochem Cytochem 48:303-311, 2000)

Demosaicking algorithm for the Kodak-RGBW color filter array

Science.gov (United States)

Rafinazari, M.; Dubois, E.

2015-01-01

Digital cameras capture images through different Color Filter Arrays and then reconstruct the full color image. Each CFA pixel only captures one primary color component; the other primary components will be estimated using information from neighboring pixels. During the demosaicking algorithm, the two unknown color components will be estimated at each pixel location. Most of the demosaicking algorithms use the RGB Bayer CFA pattern with Red, Green and Blue filters. The least-Squares Luma-Chroma demultiplexing method is a state of the art demosaicking method for the Bayer CFA. In this paper we develop a new demosaicking algorithm using the Kodak-RGBW CFA. This particular CFA reduces noise and improves the quality of the reconstructed images by adding white pixels. We have applied non-adaptive and adaptive demosaicking method using the Kodak-RGBW CFA on the standard Kodak image dataset and the results have been compared with previous work.

Digital contrast subtraction radiography for proximal caries diagnosis

International Nuclear Information System (INIS)

Kang, Byung Cheol; Yoon, Suk Ja

2002-01-01

To determine whether subtraction images utilizing contrast media can improve the diagnostic performance of proximal caries diagnosis compared to conventional periapical radiographic images. Thirty-six teeth with 57 proximal surfaces were radiographied using a size no.2 RVG-ui sensor (Trophy Radiology, Marne-la-Vallee, France). The teeth immersed in water-soluble contrast media and subtraction images were taken. Each tooth was then sectioned for histologic examination. The digital radiographic images and subtraction images were examined and interpreted by three dentists for proximal caries. The results of the proximal caries diagnosis were then verified with the results of the histologic examination. The proximal caries sensitivity using digital subtraction radiography was significantly higher than simply examining a single digital radiograph. The sensitivity of the proximal dentinal carious lesion when analyzed with the subtraction radiograph and the radiograph together was higher than with the subtraction radiograph or the radiograph alone. The use of subtraction radiography with contrast media may be useful for detecting proximal dentinal carious lesions.

PIXEL ANALYSIS OF PHOTOSPHERIC SPECTRAL DATA. I. PLASMA DYNAMICS

Energy Technology Data Exchange (ETDEWEB)

Rasca, Anthony P.; Chen, James [Plasma Physics Division, U.S. Naval Research Laboratory, Washington, DC 20375 (United States); Pevtsov, Alexei A., E-mail: anthony.rasca.ctr@nrl.navy.mil [National Solar Observatory, Sunspot, NM 88349 (United States)

2016-11-20

Recent observations of the photosphere using high spatial and temporal resolution show small dynamic features at or below the current resolving limits. A new pixel dynamics method has been developed to analyze spectral profiles and quantify changes in line displacement, width, asymmetry, and peakedness of photospheric absorption lines. The algorithm evaluates variations of line profile properties in each pixel and determines the statistics of such fluctuations averaged over all pixels in a given region. The method has been used to derive statistical characteristics of pixel fluctuations in observed quiet-Sun regions, an active region with no eruption, and an active region with an ongoing eruption. Using Stokes I images from the Vector Spectromagnetograph (VSM) of the Synoptic Optical Long-term Investigations of the Sun (SOLIS) telescope on 2012 March 13, variations in line width and peakedness of Fe i 6301.5 Å are shown to have a distinct spatial and temporal relationship with an M7.9 X-ray flare in NOAA 11429. This relationship is observed as stationary and contiguous patches of pixels adjacent to a sunspot exhibiting intense flattening in the line profile and line-center displacement as the X-ray flare approaches peak intensity, which is not present in area scans of the non-eruptive active region. The analysis of pixel dynamics allows one to extract quantitative information on differences in plasma dynamics on sub-pixel scales in these photospheric regions. The analysis can be extended to include the Stokes parameters and study signatures of vector components of magnetic fields and coupled plasma properties.

Mental Subtraction in High- and Lower Skilled Arithmetic Problem Solvers: Verbal Report versus Operand-Recognition Paradigms

Science.gov (United States)

Thevenot, Catherine; Castel, Caroline; Fanget, Muriel; Fayol, Michel

2010-01-01

The authors used the operand-recognition paradigm (C. Thevenot, M. Fanget, & M. Fayol, 2007) in order to study the strategies used by adults to solve subtraction problems. This paradigm capitalizes on the fact that algorithmic procedures degrade the memory traces of the operands. Therefore, greater difficulty in recognizing them is expected…

Automated segmentation of geographic atrophy in fundus autofluorescence images using supervised pixel classification.

Science.gov (United States)

Hu, Zhihong; Medioni, Gerard G; Hernandez, Matthias; Sadda, Srinivas R

2015-01-01

Geographic atrophy (GA) is a manifestation of the advanced or late stage of age-related macular degeneration (AMD). AMD is the leading cause of blindness in people over the age of 65 in the western world. The purpose of this study is to develop a fully automated supervised pixel classification approach for segmenting GA, including uni- and multifocal patches in fundus autofluorescene (FAF) images. The image features include region-wise intensity measures, gray-level co-occurrence matrix measures, and Gaussian filter banks. A [Formula: see text]-nearest-neighbor pixel classifier is applied to obtain a GA probability map, representing the likelihood that the image pixel belongs to GA. Sixteen randomly chosen FAF images were obtained from 16 subjects with GA. The algorithm-defined GA regions are compared with manual delineation performed by a certified image reading center grader. Eight-fold cross-validation is applied to evaluate the algorithm performance. The mean overlap ratio (OR), area correlation (Pearson's [Formula: see text]), accuracy (ACC), true positive rate (TPR), specificity (SPC), positive predictive value (PPV), and false discovery rate (FDR) between the algorithm- and manually defined GA regions are [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text], respectively.

Real-time out-of-plane artifact subtraction tomosynthesis imaging using prior CT for scanning beam digital x-ray system

Energy Technology Data Exchange (ETDEWEB)

Wu, Meng, E-mail: mengwu@stanford.edu [Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Fahrig, Rebecca [Department of Radiology, Stanford University, Stanford, California 94305 (United States)

2014-11-01

Purpose: The scanning beam digital x-ray system (SBDX) is an inverse geometry fluoroscopic system with high dose efficiency and the ability to perform continuous real-time tomosynthesis in multiple planes. This system could be used for image guidance during lung nodule biopsy. However, the reconstructed images suffer from strong out-of-plane artifact due to the small tomographic angle of the system. Methods: The authors propose an out-of-plane artifact subtraction tomosynthesis (OPAST) algorithm that utilizes a prior CT volume to augment the run-time image processing. A blur-and-add (BAA) analytical model, derived from the project-to-backproject physical model, permits the generation of tomosynthesis images that are a good approximation to the shift-and-add (SAA) reconstructed image. A computationally practical algorithm is proposed to simulate images and out-of-plane artifacts from patient-specific prior CT volumes using the BAA model. A 3D image registration algorithm to align the simulated and reconstructed images is described. The accuracy of the BAA analytical model and the OPAST algorithm was evaluated using three lung cancer patients’ CT data. The OPAST and image registration algorithms were also tested with added nonrigid respiratory motions. Results: Image similarity measurements, including the correlation coefficient, mean squared error, and structural similarity index, indicated that the BAA model is very accurate in simulating the SAA images from the prior CT for the SBDX system. The shift-variant effect of the BAA model can be ignored when the shifts between SBDX images and CT volumes are within ±10 mm in the x and y directions. The nodule visibility and depth resolution are improved by subtracting simulated artifacts from the reconstructions. The image registration and OPAST are robust in the presence of added respiratory motions. The dominant artifacts in the subtraction images are caused by the mismatches between the real object and the prior CT

Digital subtraction angiography for breast cancer

International Nuclear Information System (INIS)

Tsurumi, Kiyohiko; Okuyama, Nobuo

1987-01-01

We performed digital subtraction angiography (DSA) on 42 patients with breast diseases to investigate its efficiency. As a result we came to the following conclusions: 1. The sensitivity was well evaluated in intraarterial digital subtraction angiography (IA-DSA) of breast. 2. IA-DSA could diagnose difficult cases like cancer which had undergone augmentation mammoplasty, or like Paget's disease and others. 3. DSA was a safe examination method. 4. The sensitivity of IA-DSA of breast cancer is superior to intravenous digital subtraction angiography (IV-DSA). (author)

Low-level pixelated representations suffice for aesthetically pleasing contrast adjustment in photographs

Directory of Open Access Journals (Sweden)

Ghose Tandra

2017-01-01

Full Text Available Today’s web-based automatic image enhancement algorithms decide to apply an enhancement operation by searching for “similar” images in an online database of images and then applying the same level of enhancement as the image in the database. Two key bottlenecks in these systems are the storage cost for images and the cost of the search. Based on the principles of computational aesthetics, we consider storing task-relevant aesthetic summaries, a set of features which are sufficient to predict the level at which an image enhancement operation should be performed, instead of the entire image. The empirical question, then, is to ensure that the reduced representation indeed maintains enough information so that the resulting operation is perceived to be aesthetically pleasing to humans. We focus on the contrast adjustment operation, an important image enhancement primitive. We empirically study the efficacy of storing a pixelated summary of the 16 most representative colors of an image and performing contrast adjustments on this representation. We tested two variants of the pixelated image: a “mid-level pixelized version” that retained spatial relationships and allowed for region segmentation and grouping as in the original image and a “low-level pixelized-random version” which only retained the colors by randomly shuffling the 50 x 50 pixels. In an empirical study on 25 human subjects, we demonstrate that the preferred contrast for the low-level pixelized-random image is comparable to the original image even though it retains very few bits and no semantic information, thereby making it ideal for image matching and retrieval for automated contrast editing. In addition, we use an eye tracking study to show that users focus only on a small central portion of the low-level image, thus improving the performance of image search over commonly used computer vision algorithms to determine interesting key points.

Digital subtraction angiography in ischemic cerebrovascular accidents

Energy Technology Data Exchange (ETDEWEB)

Manelfe, C.; Bonafe, A.; Ducos de Lahitte, M.; Rascol, A.; Prere, J.; Guiraud, B.; Marc-Vergnes, J.P. (Hopital Purpan, 31 - Toulouse (France))

1983-12-29

Recent advances in computer and radiological technology have permitted reassessment of intravenous angiography in the evaluation of cerebrovascular disorders. Although digital subtraction angiography is a relatively new technique, it has rapidly gained a widespread acceptance. It has extended the use of angiography to outpatients and to people in whom conventional angiography is contraindicated. This reliable, safe, and relatively noninvasive technique offers the user two benefits: real-time subtraction and enhanced image quality. The system allows angiographic evaluation of the extracranial and intracranial vessels by means of intravenous injection of contrast material. Extracranial studies clearly demonstrate stenoses and occlusions of the major cervicocephalic arteries. Intracranial studies usually detect major cerebrovascular occlusions and provide insight into the collateral flow patterns. Intravenous digital subtraction angiography permits accurate assessment of cervicocephalic vessels after surgical repair. Although intravenous digital subtraction angiography obviates the need for conventional angiography in many cases, movements from the patients, or superimposition of vascular structures can substantially degrade the quality of the images. Digital subtraction angiography with intra-arterial injection of contrast medium will be contemplated in patients with poor intravenous digital subtraction angiography studies prior to surgery.

Digital subtraction angiography in ischemic cerebrovascular accidents

International Nuclear Information System (INIS)

Manelfe, C.; Bonafe, A.; Ducos de Lahitte, M.; Rascol, A.; Prere, J.; Guiraud, B.; Marc-Vergnes, J.P.

1983-01-01

Recent advances in computer and radiological technology have permitted reassessment of intravenous angiography in the evaluation of cerebrovascular disorders. Although digital subtraction angiography is a relatively new technique, it has rapidly gained a widespread acceptance. It has extended the use of angiography to outpatients and to people in whom conventional angiography is contraindicated. This reliable, safe, and relatively noninvasive technique offers the user two benefits: real-time subtraction and enhanced image quality. The system allows angiographic evaluation of the extracranial and intracranial vessels by means of intravenous injection of contrast material. Extracranial studies clearly demonstrate stenoses and occlusions of the major cervicocephalic arteries. Intracranial studies usually detect major cerebrovascular occlusions and provide insight into the collateral flow patterns. Intravenous digital subtraction angiography permits accurate assessment of cervicocephalic vessels after surgical repair. Although intravenous digital subtraction angiography obviates the need for conventional angiography in many cases, movements from the patients, or superimposition of vascular structures can substantially degrade the quality of the images. Digital subtraction angiography with intra-arterial injection of contrast medium will be contemplated in patients with poor intravenous digital subtraction angiography studies prior to surgery [fr

A fast implementation of the incremental backprojection algorithms for parallel beam geometries

International Nuclear Information System (INIS)

Chen, C.M.; Wang, C.Y.; Cho, Z.H.

1996-01-01

Filtered-backprojection algorithms are the most widely used approaches for reconstruction of computed tomographic (CT) images, such as X-ray CT and positron emission tomographic (PET) images. The Incremental backprojection algorithm is a fast backprojection approach based on restructuring the Shepp and Logan algorithm. By exploiting interdependency (position and values) of adjacent pixels, the Incremental algorithm requires only O(N) and O(N 2 ) multiplications in contrast to O(N 2 ) and O(N 3 ) multiplications for the Shepp and Logan algorithm in two-dimensional (2-D) and three-dimensional (3-D) backprojections, respectively, for each view, where N is the size of the image in each dimension. In addition, it may reduce the number of additions for each pixel computation. The improvement achieved by the Incremental algorithm in practice was not, however, as significant as expected. One of the main reasons is due to inevitably visiting pixels outside the beam in the searching flow scheme originally developed for the Incremental algorithm. To optimize implementation of the Incremental algorithm, an efficient scheme, namely, coded searching flow scheme, is proposed in this paper to minimize the overhead caused by searching for all pixels in a beam. The key idea of this scheme is to encode the searching flow for all pixels inside each beam. While backprojecting, all pixels may be visited without any overhead due to using the coded searching flow as the a priori information. The proposed coded searching flow scheme has been implemented on a Sun Sparc 10 and a Sun Sparc 20 workstations. The implementation results show that the proposed scheme is 1.45--2.0 times faster than the original searching flow scheme for most cases tested

A linear-time algorithm for Euclidean feature transform sets

NARCIS (Netherlands)

Hesselink, Wim H.

2007-01-01

The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the

Sparsity-Based Pixel Super Resolution for Lens-Free Digital In-line Holography.

Science.gov (United States)

Song, Jun; Leon Swisher, Christine; Im, Hyungsoon; Jeong, Sangmoo; Pathania, Divya; Iwamoto, Yoshiko; Pivovarov, Misha; Weissleder, Ralph; Lee, Hakho

2016-04-21

Lens-free digital in-line holography (LDIH) is a promising technology for portable, wide field-of-view imaging. Its resolution, however, is limited by the inherent pixel size of an imaging device. Here we present a new computational approach to achieve sub-pixel resolution for LDIH. The developed method is a sparsity-based reconstruction with the capability to handle the non-linear nature of LDIH. We systematically characterized the algorithm through simulation and LDIH imaging studies. The method achieved the spatial resolution down to one-third of the pixel size, while requiring only single-frame imaging without any hardware modifications. This new approach can be used as a general framework to enhance the resolution in nonlinear holographic systems.

New Technique for Luminosity Measurement Using 3D Pixel Modules in the ATLAS IBL Detector

CERN Document Server

Liu, Peilian; The ATLAS collaboration

2017-01-01

The Insertable b-Layer ( IBL ) is the innermost layer of the ATLAS tracking system. It consists of planar pixel modules in the central region and 3D modules at two extremities. We use the cluster length distributions in 3D sensor modules of the IBL to determine the number of primary charged particles per event and suppress backgrounds. This Pixel Cluster Counting ( PCC ) algorithm provides a bunch-by-bunch luminosity measurement. An accurate luminosity measurement is a key component for precision measurements at the Large Hadron Collider and one of the largest uncertainties on the luminosity determination in ATLAS arises from the long-term stability of the measurement technique. The comparison of the PCC algorithm with other existing algorithms provides key insights in assessing and reducing such uncertainty.

Hand Gesture Recognition Using Modified 1$ and Background Subtraction Algorithms

Directory of Open Access Journals (Sweden)

Hazem Khaled

2015-01-01

Full Text Available Computers and computerized machines have tremendously penetrated all aspects of our lives. This raises the importance of Human-Computer Interface (HCI. The common HCI techniques still rely on simple devices such as keyboard, mice, and joysticks, which are not enough to convoy the latest technology. Hand gesture has become one of the most important attractive alternatives to existing traditional HCI techniques. This paper proposes a new hand gesture detection system for Human-Computer Interaction using real-time video streaming. This is achieved by removing the background using average background algorithm and the 1$ algorithm for hand’s template matching. Then every hand gesture is translated to commands that can be used to control robot movements. The simulation results show that the proposed algorithm can achieve high detection rate and small recognition time under different light changes, scales, rotation, and background.

A level-1 pixel based track trigger for the CMS HL-LHC upgrade

CERN Document Server

Moon, Chang-Seong

2016-01-01

We present feasibility studies to investigate the performance and interest of a Level-1 trigger based on pixels. The Level-1 (real-time) pixel based tracking trigger is a novel trigger system that is based on real-time track reconstruction algorithms able to cope with very high rates and high flux of data in a very harsh environment. The pixel detector has an especially crucial role in precisely identifying the primary vertex of rare physics events from the large pile-up of events. The goal of adding the pixel information already at the real-time level of the selection is to help reducing the total Level-1 trigger rate while keeping a high selection capability. This is quite an innovative and challenging objective for the upgrade of the experiments for the High Luminosity LHC.

Improved MDCT monitoring of pelvic myeloma bone disease through the use of a novel longitudinal bone subtraction post-processing algorithm

Energy Technology Data Exchange (ETDEWEB)

Horger, Marius; Thaiss, Wolfgang M.; Nikolaou, Konstantin; Kloth, Christopher [Eberhard-Karls-University Tuebingen, Department of Diagnostic and Interventional Radiology, Tuebingen (Germany); Ditt, Hendrik [Sector Imaging and Interventional Radiology, Siemens AG Healthcare, Forchheim (Germany); Weisel, Katja [Eberhard-Karls-University Tuebingen, Department of Internal Medicine II, Tuebingen (Germany); Fritz, Jan [Johns Hopkins University School of Medcine, Russell H. Morgan Department of Radiology and Radiological Science, Baltimore, MD (United States); Liao, Shu [Siemens Medical Solutions, Malvern, PA (United States)

2017-07-15

To evaluate the diagnostic performance of a novel CT post-processing software that generates subtraction maps of baseline and follow-up CT examinations in the course of myeloma bone lesions. This study included 61 consecutive myeloma patients who underwent repeated whole-body reduced-dose MDCT at our institution between November 2013 and June 2015. CT subtraction maps classified a progressive disease (PD) vs. stable disease (SD)/remission. Bone subtraction maps (BSMs) only and in combination with 1-mm (BSM+) source images were compared with 5-mm axial/MPR scans. Haematological response categories at follow-up were: complete remission (n = 9), very good partial remission (n = 2), partial remission (n = 17) and SDh (n = 19) vs. PDh (n = 14). Five-millimetre CT scan yielded PD (n = 14) and SD/remission (n = 47) whereas bone subtraction + 1-mm axial scans (BSM+) reading resulted in PD (n = 18) and SD/remission (n = 43). Sensitivity/ specificity/accuracy for 5-mm/1-mm/BSM(alone)/BSM + in ''lesion-by-lesion'' reading was 89.4 %/98.9 %/98.3 %/ 99.5 %; 69.1 %/96.9 %/72 %/92.1 % and 83.8 %/98.4 %/92.1 %/98.3 %, respectively. The use of BSM+ resulted in a change of response classification in 9.8 % patients (n = 6) from SD to PD. BSM reading is more accurate for monitoring myeloma compared to axial scans whereas BSM+ yields similar results with 1-mm reading (gold standard) but by significantly reduced reading time. (orig.)

Improved MDCT monitoring of pelvic myeloma bone disease through the use of a novel longitudinal bone subtraction post-processing algorithm

International Nuclear Information System (INIS)

Horger, Marius; Thaiss, Wolfgang M.; Nikolaou, Konstantin; Kloth, Christopher; Ditt, Hendrik; Weisel, Katja; Fritz, Jan; Liao, Shu

2017-01-01

To evaluate the diagnostic performance of a novel CT post-processing software that generates subtraction maps of baseline and follow-up CT examinations in the course of myeloma bone lesions. This study included 61 consecutive myeloma patients who underwent repeated whole-body reduced-dose MDCT at our institution between November 2013 and June 2015. CT subtraction maps classified a progressive disease (PD) vs. stable disease (SD)/remission. Bone subtraction maps (BSMs) only and in combination with 1-mm (BSM+) source images were compared with 5-mm axial/MPR scans. Haematological response categories at follow-up were: complete remission (n = 9), very good partial remission (n = 2), partial remission (n = 17) and SDh (n = 19) vs. PDh (n = 14). Five-millimetre CT scan yielded PD (n = 14) and SD/remission (n = 47) whereas bone subtraction + 1-mm axial scans (BSM+) reading resulted in PD (n = 18) and SD/remission (n = 43). Sensitivity/ specificity/accuracy for 5-mm/1-mm/BSM(alone)/BSM + in ''lesion-by-lesion'' reading was 89.4 %/98.9 %/98.3 %/ 99.5 %; 69.1 %/96.9 %/72 %/92.1 % and 83.8 %/98.4 %/92.1 %/98.3 %, respectively. The use of BSM+ resulted in a change of response classification in 9.8 % patients (n = 6) from SD to PD. BSM reading is more accurate for monitoring myeloma compared to axial scans whereas BSM+ yields similar results with 1-mm reading (gold standard) but by significantly reduced reading time. (orig.)

Detector performance of the ALICE silicon pixel detector

CERN Document Server

Cavicchioli, C

2011-01-01

The ALICE Silicon Pixel Detector (SPD) forms the two innermost layers of the ALICE Inner Tracking System (ITS). It consists of two barrel layers of hybrid silicon pixel detectors at radii of 39 and 76 mm. The physics targets of the ALICE experiment require that the material budget of the SPD is kept within approximate to 1\\%X(0) per layer. This has set some stringent constraints on the design and construction of the SPD. A unique feature of the ALICE SPD is that it is capable of providing a prompt trigger signal, called Fast-OR, which contributes to the L0 trigger decision. The pixel trigger system allows to apply a set of algorithms for the trigger selection, and its output is sent to the Central Trigger Processor (CTP). The detector has been installed in the experiment in summer 2007. During the first injection tests in June 2008 the SPD was able to record the very first sign of life of the LHC by registering secondary particles from the beam dumped upstream the ALICE experiment. In the following months the...

High dynamic range low-noise focal plane readout for VLWIR applications implemented with current mode background subtraction

Science.gov (United States)

Yang, Guang; Sun, Chao; Shaw, Timothy; Wrigley, Chris; Peddada, Pavani; Blazejewski, Edward R.; Pain, Bedabrata

1998-09-01

Design and operation of a low noise CMOS focal pa;ne readout circuit with ultra-high charge handling capacity is presented. Designed for high-background, VLWIR detector readout, each readout unit cell use an accurate dynamic current memory for automatic subtraction of the dark pedestal in current domain enabling measurement of small signals 85 dB below the dark level. The redout circuit operates with low-power dissipation, high linearity, and is capable of handling pedestal currents up to 300 nA. Measurements indicate an effective charge handling capacity of over 5 X 10(superscript 9) charges/pixel with less than 10(superscript 5) electrons of input referred noise.

A Moving Object Detection Algorithm Based on Color Information

International Nuclear Information System (INIS)

Fang, X H; Xiong, W; Hu, B J; Wang, L T

2006-01-01

This paper designed a new algorithm of moving object detection for the aim of quick moving object detection and orientation, which used a pixel and its neighbors as an image vector to represent that pixel and modeled different chrominance component pixel as a mixture of Gaussians, and set up different mixture model of Gauss for different YUV chrominance components. In order to make full use of the spatial information, color segmentation and background model were combined. Simulation results show that the algorithm can detect intact moving objects even when the foreground has low contrast with background

Thorough statistical comparison of machine learning regression models and their ensembles for sub-pixel imperviousness and imperviousness change mapping

Directory of Open Access Journals (Sweden)

Drzewiecki Wojciech

2017-12-01

Full Text Available We evaluated the performance of nine machine learning regression algorithms and their ensembles for sub-pixel estimation of impervious areas coverages from Landsat imagery. The accuracy of imperviousness mapping in individual time points was assessed based on RMSE, MAE and R2. These measures were also used for the assessment of imperviousness change intensity estimations. The applicability for detection of relevant changes in impervious areas coverages at sub-pixel level was evaluated using overall accuracy, F-measure and ROC Area Under Curve. The results proved that Cubist algorithm may be advised for Landsat-based mapping of imperviousness for single dates. Stochastic gradient boosting of regression trees (GBM may be also considered for this purpose. However, Random Forest algorithm is endorsed for both imperviousness change detection and mapping of its intensity. In all applications the heterogeneous model ensembles performed at least as well as the best individual models or better. They may be recommended for improving the quality of sub-pixel imperviousness and imperviousness change mapping. The study revealed also limitations of the investigated methodology for detection of subtle changes of imperviousness inside the pixel. None of the tested approaches was able to reliably classify changed and non-changed pixels if the relevant change threshold was set as one or three percent. Also for fi ve percent change threshold most of algorithms did not ensure that the accuracy of change map is higher than the accuracy of random classifi er. For the threshold of relevant change set as ten percent all approaches performed satisfactory.

Thorough statistical comparison of machine learning regression models and their ensembles for sub-pixel imperviousness and imperviousness change mapping

Science.gov (United States)

Drzewiecki, Wojciech

2017-12-01

We evaluated the performance of nine machine learning regression algorithms and their ensembles for sub-pixel estimation of impervious areas coverages from Landsat imagery. The accuracy of imperviousness mapping in individual time points was assessed based on RMSE, MAE and R2. These measures were also used for the assessment of imperviousness change intensity estimations. The applicability for detection of relevant changes in impervious areas coverages at sub-pixel level was evaluated using overall accuracy, F-measure and ROC Area Under Curve. The results proved that Cubist algorithm may be advised for Landsat-based mapping of imperviousness for single dates. Stochastic gradient boosting of regression trees (GBM) may be also considered for this purpose. However, Random Forest algorithm is endorsed for both imperviousness change detection and mapping of its intensity. In all applications the heterogeneous model ensembles performed at least as well as the best individual models or better. They may be recommended for improving the quality of sub-pixel imperviousness and imperviousness change mapping. The study revealed also limitations of the investigated methodology for detection of subtle changes of imperviousness inside the pixel. None of the tested approaches was able to reliably classify changed and non-changed pixels if the relevant change threshold was set as one or three percent. Also for fi ve percent change threshold most of algorithms did not ensure that the accuracy of change map is higher than the accuracy of random classifi er. For the threshold of relevant change set as ten percent all approaches performed satisfactory.

PHOTOMETRIC STEREO SHAPE-AND-ALBEDO-FROM-SHADING FOR PIXEL-LEVEL RESOLUTION LUNAR SURFACE RECONSTRUCTION

Directory of Open Access Journals (Sweden)

W. C. Liu

2017-07-01

Full Text Available Shape and Albedo from Shading (SAfS techniques recover pixel-wise surface details based on the relationship between terrain slopes, illumination and imaging geometry, and the energy response (i.e., image intensity captured by the sensing system. Multiple images with different illumination geometries (i.e., photometric stereo can provide better SAfS surface reconstruction due to the increase in observations. Photometric stereo SAfS is suitable for detailed surface reconstruction of the Moon and other extra-terrestrial bodies due to the availability of photometric stereo and the less complex surface reflecting properties (i.e., albedo of the target bodies as compared to the Earth. Considering only one photometric stereo pair (i.e., two images, pixel-variant albedo is still a major obstacle to satisfactory reconstruction and it needs to be regulated by the SAfS algorithm. The illumination directional difference between the two images also becomes an important factor affecting the reconstruction quality. This paper presents a photometric stereo SAfS algorithm for pixel-level resolution lunar surface reconstruction. The algorithm includes a hierarchical optimization architecture for handling pixel-variant albedo and improving performance. With the use of Lunar Reconnaissance Orbiter Camera - Narrow Angle Camera (LROC NAC photometric stereo images, the reconstructed topography (i.e., the DEM is compared with the DEM produced independently by photogrammetric methods. This paper also addresses the effect of illumination directional difference in between one photometric stereo pair on the reconstruction quality of the proposed algorithm by both mathematical and experimental analysis. In this case, LROC NAC images under multiple illumination directions are utilized by the proposed algorithm for experimental comparison. The mathematical derivation suggests an illumination azimuthal difference of 90 degrees between two images is recommended to achieve

BPHZL-subtraction scheme and axial gauges

Energy Technology Data Exchange (ETDEWEB)

Kreuzer, M.; Rebhan, A.; Schweda, M.; Piguet, O.

1986-03-27

The application of the BPHZL subtraction scheme to Yang-Mills theories in axial gauges is presented. In the auxillary mass formulation we show the validity of the convergence theorems for subtracted momentum space integrals, and we give the integral formulae necessary for one-loop calculations. (orig.).

Embedded FPGA Design for Optimal Pixel Adjustment Process of Image Steganography

Directory of Open Access Journals (Sweden)

Chiung-Wei Huang

2018-01-01

Full Text Available We propose a prototype of field programmable gate array (FPGA implementation for optimal pixel adjustment process (OPAP algorithm of image steganography. In the proposed scheme, the cover image and the secret message are transmitted from a personal computer (PC to an FPGA board using RS232 interface for hardware processing. We firstly embed k-bit secret message into each pixel of the cover image by the last-significant-bit (LSB substitution method, followed by executing associated OPAP calculations to construct a stego pixel. After all pixels of the cover image have been embedded, a stego image is created and transmitted from FPGA back to the PC and stored in the PC. Moreover, we have extended the basic pixel-wise structure to a parallel structure which can fully use the hardware devices to speed up the embedding process and embed several bits of secret message at the same time. Through parallel mechanism of the hardware based design, the data hiding process can be completed in few clock cycles to produce steganography outcome. Experimental results show the effectiveness and correctness of the proposed scheme.

Subtracted versus non-subtracted digital imaging in peripheral angiography

International Nuclear Information System (INIS)

Fink, U.; Heywang, S.; Mayr, B.; Berger, H.

1989-01-01

Digital subtraction angiography (DSA) plays an important role in the management of vascular diseases of the lower extremities. A disadvantage is the lack of an automatically moving table top. We used a 1,024x1,024 matrix with a large-screen intensifier system and an automated 'stepping' facility. In 161 examinations of the arteries of the lower extremity digital peripheral arteriography was performed with and without the subtraction technique. We compared the influence of different iodine concentrations in DA and DSA. Peripheral DA proved to be equal to peripheral DSA in the region of the pelvis, thigh and knee, with no adequate contrasting being obtained merely in the region of the lower leg arteries in about 45%. It is necessary to use contrast medium at a concentration of 300 mg I/ml. The installation of an automated 'stepping' facility reduces the amount of contrast' medium needed and the exposure time. (orig.)

Effects of global signal regression and subtraction methods on resting-state functional connectivity using arterial spin labeling data.

Science.gov (United States)

Silva, João Paulo Santos; Mônaco, Luciana da Mata; Paschoal, André Monteiro; Oliveira, Ícaro Agenor Ferreira de; Leoni, Renata Ferranti

2018-05-16

Arterial spin labeling (ASL) is an established magnetic resonance imaging (MRI) technique that is finding broader applications in functional studies of the healthy and diseased brain. To promote improvement in cerebral blood flow (CBF) signal specificity, many algorithms and imaging procedures, such as subtraction methods, were proposed to eliminate or, at least, minimize noise sources. Therefore, this study addressed the main considerations of how CBF functional connectivity (FC) is changed, regarding resting brain network (RBN) identification and correlations between regions of interest (ROI), by different subtraction methods and removal of residual motion artifacts and global signal fluctuations (RMAGSF). Twenty young healthy participants (13 M/7F, mean age = 25 ± 3 years) underwent an MRI protocol with a pseudo-continuous ASL (pCASL) sequence. Perfusion-based images were obtained using simple, sinc and running subtraction. RMAGSF removal was applied to all CBF time series. Independent Component Analysis (ICA) was used for RBN identification, while Pearson' correlation was performed for ROI-based FC analysis. Temporal signal-to-noise ratio (tSNR) was higher in CBF maps obtained by sinc subtraction, although RMAGSF removal had a significant effect on maps obtained with simple and running subtractions. Neither the subtraction method nor the RMAGSF removal directly affected the identification of RBNs. However, the number of correlated and anti-correlated voxels varied for different subtraction and filtering methods. In an ROI-to-ROI level, changes were prominent in FC values and their statistical significance. Our study showed that both RMAGSF filtering and subtraction method might influence resting-state FC results, especially in an ROI level, consequently affecting FC analysis and its interpretation. Taking our results and the whole discussion together, we understand that for an exploratory assessment of the brain, one could avoid removing RMAGSF to

A level-1 pixel based track trigger for the CMS HL-LHC upgrade

CERN Document Server

CMS Collaboration

2016-01-01

We present feasibility studies to investigate the performances and interest of a Level-1 trigger based on pixels. The Level-1 (real-time) pixel based tracking trigger is a novel trigger system that is based on the real-time track reconstruction algorithms able to cope with very high rates and high flux of data in a very harsh environment. The pixel detector has an especially crucial role in precisely identifying the primary vertex of the rare physics events from the large pile-up (PU) of events. The goal of adding the pixel information already at the real-time level of the selection is to help reducing the total level-1 trigger rate while keeping an high selection capability. This is quite an innovative and challenging objective for the experiments upgrade for the High Luminosity LHC (HL-LHC).

Pixelated Checkerboard Metasurface for Ultra-Wideband Radar Cross Section Reduction.

Science.gov (United States)

Haji-Ahmadi, Mohammad-Javad; Nayyeri, Vahid; Soleimani, Mohammad; Ramahi, Omar M

2017-09-12

In this paper we designed and fabricated a metasurface working as a radar cross section (RCS) reducer over an ultra wide band of frequency from 3.8 to 10.7 GHz. The designed metasurface is a chessboard-like surface made of alternating tiles, with each tile composed of identical unit cells. We develop a novel, simple, highly robust and fully automated approach for designing the unit cells. First, a topology optimization algorithm is used to engineer the shape of the two unit cells. The area of each unit cell is pixelated. A particle swarm optimization algorithm is applied wherein each pixel corresponds to a bit having a binary value of 1 or 0 indicating metallization or no metallization. With the objective of reducing the RCS over a specified frequency range, the optimization algorithm is then linked to a full wave three-dimensional electromagnetic simulator. To validate the design procedure, a surface was designed, fabricated and experimentally tested showing significantly enhanced performance than previous works. Additionally, angular analysis is also presented showing good stability and wide-angle behavior of the designed RCS reducer. The automated design procedure has a wide range of applications and can be easily extended to design surfaces for antennas, energy harvesters, noise mitigation in electronic circuit boards amongst others.

Self-masking subtraction tomosynthesis

International Nuclear Information System (INIS)

Chakraborty, D.P.; Yester, M.V.; Barnes, G.T.; Lakshminarayanan, A.V.

1984-01-01

The authors tested the image quality and dose savings of self-masking subtraction tomosynthesis (SST), which combines digital tomosynthesis with subtraction of a blurred self-mask. High-quality images of the inner ear of a head phantom were obtained at moderate dose savings. Although they were taken with linear motion, they did not exhibit the streaking due to off-fulcrum objects that is characteristic of conventional linear tomography. SST could reduce patient dose by a factor of at least 12 in examinations of the inner ear, and the mechanical aspects can be implemented with moderate modifications of existing instrumentation

[An Algorithm to Eliminate Power Frequency Interference in ECG Using Template].

Science.gov (United States)

Shi, Guohua; Li, Jiang; Xu, Yan; Feng, Liang

2017-01-01

Researching an algorithm to eliminate power frequency interference in ECG. The algorithm first creates power frequency interference template, then, subtracts the template from the original ECG signals, final y, the algorithm gets the ECG signals without interference. Experiment shows the algorithm can eliminate interference effectively and has none side effect to normal signal. It’s efficient and suitable for practice.

A hash-based image encryption algorithm

Science.gov (United States)

Cheddad, Abbas; Condell, Joan; Curran, Kevin; McKevitt, Paul

2010-03-01

There exist several algorithms that deal with text encryption. However, there has been little research carried out to date on encrypting digital images or video files. This paper describes a novel way of encrypting digital images with password protection using 1D SHA-2 algorithm coupled with a compound forward transform. A spatial mask is generated from the frequency domain by taking advantage of the conjugate symmetry of the complex imagery part of the Fourier Transform. This mask is then XORed with the bit stream of the original image. Exclusive OR (XOR), a logical symmetric operation, that yields 0 if both binary pixels are zeros or if both are ones and 1 otherwise. This can be verified simply by modulus (pixel1, pixel2, 2). Finally, confusion is applied based on the displacement of the cipher's pixels in accordance with a reference mask. Both security and performance aspects of the proposed method are analyzed, which prove that the method is efficient and secure from a cryptographic point of view. One of the merits of such an algorithm is to force a continuous tone payload, a steganographic term, to map onto a balanced bits distribution sequence. This bit balance is needed in certain applications, such as steganography and watermarking, since it is likely to have a balanced perceptibility effect on the cover image when embedding.

An accurate algorithm to match imperfectly matched images for lung tumor detection without markers.

Science.gov (United States)

Rozario, Timothy; Bereg, Sergey; Yan, Yulong; Chiu, Tsuicheng; Liu, Honghuan; Kearney, Vasant; Jiang, Lan; Mao, Weihua

2015-05-08

In order to locate lung tumors on kV projection images without internal markers, digitally reconstructed radiographs (DRRs) are created and compared with projection images. However, lung tumors always move due to respiration and their locations change on projection images while they are static on DRRs. In addition, global image intensity discrepancies exist between DRRs and projections due to their different image orientations, scattering, and noises. This adversely affects comparison accuracy. A simple but efficient comparison algorithm is reported to match imperfectly matched projection images and DRRs. The kV projection images were matched with different DRRs in two steps. Preprocessing was performed in advance to generate two sets of DRRs. The tumors were removed from the planning 3D CT for a single phase of planning 4D CT images using planning contours of tumors. DRRs of background and DRRs of tumors were generated separately for every projection angle. The first step was to match projection images with DRRs of background signals. This method divided global images into a matrix of small tiles and similarities were evaluated by calculating normalized cross-correlation (NCC) between corresponding tiles on projections and DRRs. The tile configuration (tile locations) was automatically optimized to keep the tumor within a single projection tile that had a bad matching with the corresponding DRR tile. A pixel-based linear transformation was determined by linear interpolations of tile transformation results obtained during tile matching. The background DRRs were transformed to the projection image level and subtracted from it. The resulting subtracted image now contained only the tumor. The second step was to register DRRs of tumors to the subtracted image to locate the tumor. This method was successfully applied to kV fluoro images (about 1000 images) acquired on a Vero (BrainLAB) for dynamic tumor tracking on phantom studies. Radiation opaque markers were

Motion induced second order temperature and y-type anisotropies after the subtraction of linear dipole in the CMB maps

International Nuclear Information System (INIS)

Sunyaev, Rashid A.; Khatri, Rishi

2013-01-01

y-type spectral distortions of the cosmic microwave background allow us to detect clusters and groups of galaxies, filaments of hot gas and the non-uniformities in the warm hot intergalactic medium. Several CMB experiments (on small areas of sky) and theoretical groups (for full sky) have recently published y-type distortion maps. We propose to search for two artificial hot spots in such y-type maps resulting from the incomplete subtraction of the effect of the motion induced dipole on the cosmic microwave background sky. This dipole introduces, at second order, additional temperature and y-distortion anisotropy on the sky of amplitude few μK which could potentially be measured by Planck HFI and Pixie experiments and can be used as a source of cross channel calibration by CMB experiments. This y-type distortion is present in every pixel and is not the result of averaging the whole sky. This distortion, calculated exactly from the known linear dipole, can be subtracted from the final y-type maps, if desired

PET image reconstruction with rotationally symmetric polygonal pixel grid based highly compressible system matrix

International Nuclear Information System (INIS)

Yu Yunhan; Xia Yan; Liu Yaqiang; Wang Shi; Ma Tianyu; Chen Jing; Hong Baoyu

2013-01-01

To achieve a maximum compression of system matrix in positron emission tomography (PET) image reconstruction, we proposed a polygonal image pixel division strategy in accordance with rotationally symmetric PET geometry. Geometrical definition and indexing rule for polygonal pixels were established. Image conversion from polygonal pixel structure to conventional rectangular pixel structure was implemented using a conversion matrix. A set of test images were analytically defined in polygonal pixel structure, converted to conventional rectangular pixel based images, and correctly displayed which verified the correctness of the image definition, conversion description and conversion of polygonal pixel structure. A compressed system matrix for PET image recon was generated by tap model and tested by forward-projecting three different distributions of radioactive sources to the sinogram domain and comparing them with theoretical predictions. On a practical small animal PET scanner, a compress ratio of 12.6:1 of the system matrix size was achieved with the polygonal pixel structure, comparing with the conventional rectangular pixel based tap-mode one. OS-EM iterative image reconstruction algorithms with the polygonal and conventional Cartesian pixel grid were developed. A hot rod phantom was detected and reconstructed based on these two grids with reasonable time cost. Image resolution of reconstructed images was both 1.35 mm. We conclude that it is feasible to reconstruct and display images in a polygonal image pixel structure based on a compressed system matrix in PET image reconstruction. (authors)

A Low-Stress Algorithm for Fractions

Science.gov (United States)

Ruais, Ronald W.

1978-01-01

An algorithm is given for the addition and subtraction of fractions based on dividing the sum of diagonal numerator and denominator products by the product of the denominators. As an explanation of the teaching method, activities used in teaching are demonstrated. (MN)

Longitudinal development of subtraction performance in elementary school.

Science.gov (United States)

Artemenko, Christina; Pixner, Silvia; Moeller, Korbinian; Nuerk, Hans-Christoph

2017-10-05

A major goal of education in elementary mathematics is the mastery of arithmetic operations. However, research on subtraction is rather scarce, probably because subtraction is often implicitly assumed to be cognitively similar to addition, its mathematical inverse. To evaluate this assumption, we examined the relation between the borrow effect in subtraction and the carry effect in addition, and the developmental trajectory of the borrow effect in children using a choice reaction paradigm in a longitudinal study. In contrast to the carry effect in adults, carry and borrow effects in children were found to be categorical rather than continuous. From grades 3 to 4, children became more proficient in two-digit subtraction in general, but not in performing the borrow operation in particular. Thus, we observed no specific developmental progress in place-value computation, but a general improvement in subtraction procedures. Statement of contribution What is already known on this subject? The borrow operation increases difficulty in two-digit subtraction in adults. The carry effect in addition, as the inverse operation of borrowing, comprises categorical and continuous processing characteristics. What does this study add? In contrast to the carry effect in adults, the borrow and carry effects are categorical in elementary school children. Children generally improve in subtraction performance from grades 3 to 4 but do not progress in place-value computation in particular. © 2017 The British Psychological Society.

A fast image encryption algorithm based on only blocks in cipher text

Science.gov (United States)

Wang, Xing-Yuan; Wang, Qian

2014-03-01

In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simultaneously. The cipher-text image is divided into blocks and each block has k ×k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed according to the encrypted pixel's value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks.

A fast image encryption algorithm based on only blocks in cipher text

International Nuclear Information System (INIS)

Wang Xing-Yuan; Wang Qian

2014-01-01

In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simultaneously. The cipher-text image is divided into blocks and each block has k ×k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed according to the encrypted pixel's value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks

Development of Shimadzu digital subtraction system

International Nuclear Information System (INIS)

Nishioka, Hiroyuki; Shibata, Koichi; Shimizu, Yasumitsu; Shibata, Kenji; Wani, Hidenobu

1985-01-01

Shimadzu has recently developed a digital subtraction system. It can perform intra-arterial digital subtraction angiography (DSA) using low concentration of contrast medium, or can visualize arteries with intravenuous injection. It can extremely reduce patient's pain in angiography. Image quality of DSA has been much improved by the development of high quality image amplifiers, improvement of signal-to-noise ratio of the x-ray television unit and the development of digital disk recorders. The peak-hold subtraction method that is now under clinical study presents images of blood vessels as the trace of the flow of contrast medium. The maximum-hold memory where the maximum value of the brightness in some period is stored for every picture element is subtracted from the minimum-hold memory where the minimum value is stored, and thus images of blood vessels can be obtained. Hardware of this method is rather simple and it is expected that the amount of contrast medium may be reduced or x-ray dose of the patient may be decreased. (author)

An automated subtraction of NLO EW infrared divergences

Energy Technology Data Exchange (ETDEWEB)

Schoenherr, Marek [CERN, Theoretical Physics Department, Geneva (Switzerland)

2018-02-15

In this paper a generalisation of the Catani-Seymour dipole subtraction method to next-to-leading order electroweak calculations is presented. All singularities due to photon and gluon radiation off both massless and massive partons in the presence of both massless and massive spectators are accounted for. Particular attention is paid to the simultaneous subtraction of singularities of both QCD and electroweak origin which are present in the next-to-leading order corrections to processes with more than one perturbative order contributing at Born level. Similarly, embedding non-dipole-like photon splittings in the dipole subtraction scheme discussed. The implementation of the formulated subtraction scheme in the framework of the Sherpa Monte-Carlo event generator, including the restriction of the dipole phase space through the α-parameters and expanding its existing subtraction for NLO QCD calculations, is detailed and numerous internal consistency checks validating the obtained results are presented. (orig.)

Soft-collinear factorization and zero-bin subtractions

International Nuclear Information System (INIS)

Chiu Juiyu; Fuhrer, Andreas; Kelley, Randall; Manohar, Aneesh V.; Hoang, Andre H.

2009-01-01

We study the Sudakov form factor for a spontaneously broken gauge theory using a (new) Δ-regulator. To be well defined, the effective theory requires zero-bin subtractions for the collinear sectors. The zero-bin subtractions depend on the gauge boson mass M and are not scaleless. They have both finite and 1/ε contributions and are needed to give the correct anomalous dimension and low-scale matching contributions. We also demonstrate the necessity of zero-bin subtractions for soft-collinear factorization. We find that after zero-bin subtractions the form factor is the sum of the collinear contributions minus a soft mass-mode contribution, in agreement with a previous result of Idilbi and Mehen in QCD. This appears to conflict with the method-of-regions approach, where one gets the sum of contributions from different regions.

Diamond Pixel Detectors

International Nuclear Information System (INIS)

Adam, W.; Berdermann, E.; Bergonzo, P.; Bertuccio, G.; Bogani, F.; Borchi, E.; Brambilla, A.; Bruzzi, M.; Colledani, C.; Conway, J.; D'Angelo, P.; Dabrowski, W.; Delpierre, P.; Deneuville, A.; Doroshenko, J.; Dulinski, W.; Eijk, B. van; Fallou, A.; Fizzotti, F.; Foster, J.; Foulon, F.; Friedl, M.; Gan, K.K.; Gheeraert, E.; Gobbi, B.; Grim, G.P.; Hallewell, G.; Han, S.; Hartjes, F.; Hrubec, J.; Husson, D.; Kagan, H.; Kania, D.; Kaplon, J.; Kass, R.; Koeth, T.; Krammer, M.; Lander, R.; Logiudice, A.; Lu, R.; Lynne, L.M.; Manfredotti, C.; Meier, D.; Mishina, M.; Moroni, L.; Oh, A.; Pan, L.S.; Pernicka, M.; Perera, L.; Pirollo, S.; Plano, R.; Procario, M.; Riester, J.L.; Roe, S.; Rott, C.; Rousseau, L.; Rudge, A.; Russ, J.; Sala, S.; Sampietro, M.; Schnetzer, S.; Sciortino, S.; Stelzer, H.; Stone, R.; Suter, B.; Tapper, R.J.; Tesarek, R.; Trischuk, W.; Tromson, D.; Vittone, E.; Wedenig, R.; Weilhammer, P.; White, C.; Zeuner, W.; Zoeller, M.

2001-01-01

Diamond based pixel detectors are a promising radiation-hard technology for use at the LHC. We present first results on a CMS diamond pixel sensor. With a threshold setting of 2000 electrons, an average pixel efficiency of 78% was obtained for normally incident minimum ionizing particles

Diamond Pixel Detectors

Energy Technology Data Exchange (ETDEWEB)

Adam, W.; Berdermann, E.; Bergonzo, P.; Bertuccio, G.; Bogani, F.; Borchi, E.; Brambilla, A.; Bruzzi, M.; Colledani, C.; Conway, J.; D' Angelo, P.; Dabrowski, W.; Delpierre, P.; Deneuville, A.; Doroshenko, J.; Dulinski, W.; Eijk, B. van; Fallou, A.; Fizzotti, F.; Foster, J.; Foulon, F.; Friedl, M.; Gan, K.K.; Gheeraert, E.; Gobbi, B.; Grim, G.P.; Hallewell, G.; Han, S.; Hartjes, F.; Hrubec, J.; Husson, D.; Kagan, H.; Kania, D.; Kaplon, J.; Kass, R.; Koeth, T.; Krammer, M.; Lander, R.; Logiudice, A.; Lu, R.; Lynne, L.M.; Manfredotti, C.; Meier, D.; Mishina, M.; Moroni, L.; Oh, A.; Pan, L.S.; Pernicka, M.; Perera, L. E-mail: perera@physics.rutgers.edu; Pirollo, S.; Plano, R.; Procario, M.; Riester, J.L.; Roe, S.; Rott, C.; Rousseau, L.; Rudge, A.; Russ, J.; Sala, S.; Sampietro, M.; Schnetzer, S.; Sciortino, S.; Stelzer, H.; Stone, R.; Suter, B.; Tapper, R.J.; Tesarek, R.; Trischuk, W.; Tromson, D.; Vittone, E.; Wedenig, R.; Weilhammer, P.; White, C.; Zeuner, W.; Zoeller, M

2001-06-01

Diamond based pixel detectors are a promising radiation-hard technology for use at the LHC. We present first results on a CMS diamond pixel sensor. With a threshold setting of 2000 electrons, an average pixel efficiency of 78% was obtained for normally incident minimum ionizing particles.

A CCTV system with SMS alert (CMDSA): An implementation of pixel processing algorithm for motion detection

Science.gov (United States)

Rahman, Nurul Hidayah Ab; Abdullah, Nurul Azma; Hamid, Isredza Rahmi A.; Wen, Chuah Chai; Jelani, Mohamad Shafiqur Rahman Mohd

2017-10-01

Closed-Circuit TV (CCTV) system is one of the technologies in surveillance field to solve the problem of detection and monitoring by providing extra features such as email alert or motion detection. However, detecting and alerting the admin on CCTV system may complicate due to the complexity to integrate the main program with an external Application Programming Interface (API). In this study, pixel processing algorithm is applied due to its efficiency and SMS alert is added as an alternative solution for users who opted out email alert system or have no Internet connection. A CCTV system with SMS alert (CMDSA) was developed using evolutionary prototyping methodology. The system interface was implemented using Microsoft Visual Studio while the backend components, which are database and coding, were implemented on SQLite database and C# programming language, respectively. The main modules of CMDSA are motion detection, capturing and saving video, image processing and Short Message Service (SMS) alert functions. Subsequently, the system is able to reduce the processing time making the detection process become faster, reduce the space and memory used to run the program and alerting the system admin instantly.

FACT. New image parameters based on the watershed-algorithm

Energy Technology Data Exchange (ETDEWEB)

Linhoff, Lena; Bruegge, Kai Arno; Buss, Jens [TU Dortmund (Germany). Experimentelle Physik 5b; Collaboration: FACT-Collaboration

2016-07-01

FACT, the First G-APD Cherenkov Telescope, is the first imaging atmospheric Cherenkov telescope that is using Geiger-mode avalanche photodiodes (G-APDs) as photo sensors. The raw data produced by this telescope are processed in an analysis chain, which leads to a classification of the primary particle that induce a shower and to an estimation of its energy. One important step in this analysis chain is the parameter extraction from shower images. By the application of a watershed algorithm to the camera image, new parameters are computed. Perceiving the brightness of a pixel as height, a set of pixels can be seen as 'landscape' with hills and valleys. A watershed algorithm groups all pixels to a cluster that belongs to the same hill. From the emerging segmented image, one can find new parameters for later analysis steps, e.g. number of clusters, their shape and containing photon charge. For FACT data, the FellWalker algorithm was chosen from the class of watershed algorithms, because it was designed to work on discrete distributions, in this case the pixels of a camera image. The FellWalker algorithm is implemented in FACT-tools, which provides the low level analysis framework for FACT. This talk will focus on the computation of new, FellWalker based, image parameters, which can be used for the gamma-hadron separation. Additionally, their distributions concerning real and Monte Carlo Data are compared.

Comparison of different reconstruction algorithms for three-dimensional ultrasound imaging in a neurosurgical setting.

Science.gov (United States)

Miller, D; Lippert, C; Vollmer, F; Bozinov, O; Benes, L; Schulte, D M; Sure, U

2012-09-01

Freehand three-dimensional ultrasound imaging (3D-US) is increasingly used in image-guided surgery. During image acquisition, a set of B-scans is acquired that is distributed in a non-parallel manner over the area of interest. Reconstructing these images into a regular array allows 3D visualization. However, the reconstruction process may introduce artefacts and may therefore reduce image quality. The aim of the study is to compare different algorithms with respect to image quality and diagnostic value for image guidance in neurosurgery. 3D-US data sets were acquired during surgery of various intracerebral lesions using an integrated ultrasound-navigation device. They were stored for post-hoc evaluation. Five different reconstruction algorithms, a standard multiplanar reconstruction with interpolation (MPR), a pixel nearest neighbour method (PNN), a voxel nearest neighbour method (VNN) and two voxel based distance-weighted algorithms (VNN2 and DW) were tested with respect to image quality and artefact formation. The capability of the algorithm to fill gaps within the sample volume was investigated and a clinical evaluation with respect to the diagnostic value of the reconstructed images was performed. MPR was significantly worse than the other algorithms in filling gaps. In an image subtraction test, VNN2 and DW reliably reconstructed images even if large amounts of data were missing. However, the quality of the reconstruction improved, if data acquisition was performed in a structured manner. When evaluating the diagnostic value of reconstructed axial, sagittal and coronal views, VNN2 and DW were judged to be significantly better than MPR and VNN. VNN2 and DW could be identified as robust algorithms that generate reconstructed US images with a high diagnostic value. These algorithms improve the utility and reliability of 3D-US imaging during intraoperative navigation. Copyright © 2012 John Wiley & Sons, Ltd.

Subtraction and dynamic MR images of breast cancer

Energy Technology Data Exchange (ETDEWEB)

Murakami, Yoshitaka; Aoki, Manabu; Harada, Junta (Jikei Univ., Tokyo (Japan). School of Medicine)

1993-04-01

The purpose of this study was to evaluate the diagnostic effectiveness of subtraction and dynamic MR imaging in patients with breast masses. In 23 breast cancers and six fibroadenomas, spin echo T1 images were obtained at 0.2 Tesla before and every minute after intravenous injection of Gd-DTPA (0.1 or 0.2 mmol/kg). Subtraction images were obtained sequentially on the CRT monitor. All breast masses were enhanced after gadolinium and stood out as bright lesions on subtraction images. The tumor margin and its extension were more precisely evaluated on subtraction MR images than on conventional postcontrast MR images. Breast cancer showed a characteristic time-intensity curve with an early peak, in contrast to fibroadenoma, which showed a gradual increase in signal intensity. Subtraction MR imaging is a simple method for the evaluation of breast masses, and further, the time-intensity curve obtained by dynamic study is helpful in the differential diagnosis of lesions. (author).

Pixel Experiments

DEFF Research Database (Denmark)

Petersen, Kjell Yngve; Søndergaard, Karin; Augustesen, Christina

2015-01-01

Pixel Experiments The term pixel is traditionally defined as any of the minute elements that together constitute a larger context or image. A pixel has its own form and is the smallest unit seen within a larger structure. In working with the potentials of LED technology in architectural lighting...... for using LED lighting in lighting design practice. The speculative experiments that have been set-up have aimed to clarify the variables that can be used as parameters in the design of lighting applications; including, for example, the structuring and software control of light. The experiments also...... elucidate and exemplify already well-known problems in relation to the experience of vertical and horizontal lighting. Pixel Experiments exist as a synergy between speculative test setups and lighting design in practice. This book is one of four books that is published in connection with the research...

Pixel-Cluster Counting Luminosity Measurement in ATLAS

CERN Document Server

McCormack, William Patrick; The ATLAS collaboration

2016-01-01

A precision measurement of the delivered luminosity is a key component of the ATLAS physics program at the Large Hadron Collider (LHC). A fundamental ingredient of the strategy to control the systematic uncertainties affecting the absolute luminosity has been to compare the measurements of several luminometers, most of which use more than one counting technique. The level of consistency across the various methods provides valuable cross-checks as well as an estimate of the detector-related systematic uncertainties. This poster describes the development of a luminosity algorithm based on pixel-cluster counting in the recently installed ATLAS inner b-layer (IBL), using data recorded during the 2015 pp run at the LHC. The noise and background contamination of the luminosity-associated cluster count is minimized by a multi-component fit to the measured cluster-size distribution in the forward pixel modules of the IBL. The linearity, long-term stability and statistical precision of the cluster-counting method are ...

Pixel-Cluster Counting Luminosity Measurement In ATLAS

CERN Document Server

AUTHOR|(SzGeCERN)782710; The ATLAS collaboration

2017-01-01

A precision measurement of the delivered luminosity is a key component of the ATLAS physics program at the Large Hadron Collider (LHC). A fundamental ingredient of the strategy to control the systematic uncertainties affecting the absolute luminosity has been to compare the measure- ments of several luminometers, most of which use more than one counting technique. The level of consistency across the various methods provides valuable cross-checks as well as an estimate of the detector-related systematic uncertainties. This poster describes the development of a luminosity algorithm based on pixel-cluster counting in the recently installed ATLAS inner b-layer (IBL), using data recorded during the 2015 pp run at the LHC. The noise and background contamination of the luminosity-associated cluster count is minimized by a multi-component fit to the measured cluster-size distribution in the forward pixel modules of the IBL. The linearity, long-term stability and statistical precision of the cluster- counting method a...

PCA-based approach for subtracting thermal background emission in high-contrast imaging data

Science.gov (United States)

Hunziker, S.; Quanz, S. P.; Amara, A.; Meyer, M. R.

2018-03-01

Aims.Ground-based observations at thermal infrared wavelengths suffer from large background radiation due to the sky, telescope and warm surfaces in the instrument. This significantly limits the sensitivity of ground-based observations at wavelengths longer than 3 μm. The main purpose of this work is to analyse this background emission in infrared high-contrast imaging data as illustrative of the problem, show how it can be modelled and subtracted and demonstrate that it can improve the detection of faint sources, such as exoplanets. Methods: We used principal component analysis (PCA) to model and subtract the thermal background emission in three archival high-contrast angular differential imaging datasets in the M' and L' filter. We used an M' dataset of β Pic to describe in detail how the algorithm works and explain how it can be applied. The results of the background subtraction are compared to the results from a conventional mean background subtraction scheme applied to the same dataset. Finally, both methods for background subtraction are compared by performing complete data reductions. We analysed the results from the M' dataset of HD 100546 only qualitatively. For the M' band dataset of β Pic and the L' band dataset of HD 169142, which was obtained with an angular groove phase mask vortex vector coronagraph, we also calculated and analysed the achieved signal-to-noise ratio (S/N). Results: We show that applying PCA is an effective way to remove spatially and temporarily varying thermal background emission down to close to the background limit. The procedure also proves to be very successful at reconstructing the background that is hidden behind the point spread function. In the complete data reductions, we find at least qualitative improvements for HD 100546 and HD 169142, however, we fail to find a significant increase in S/N of β Pic b. We discuss these findings and argue that in particular datasets with strongly varying observing conditions or

Spectral amplitude coding OCDMA using and subtraction technique.

Science.gov (United States)

Hasoon, Feras N; Aljunid, S A; Samad, M D A; Abdullah, Mohamad Khazani; Shaari, Sahbudin

2008-03-20

An optical decoding technique is proposed for a spectral-amplitude-coding-optical code division multiple access, namely, the AND subtraction technique. The theory is being elaborated and experimental results have been done by comparing a double-weight code against the existing code, Hadamard. We have proved that the and subtraction technique gives better bit error rate performance than the conventional complementary subtraction technique against the received power level.

Development of information preserving data compression algorithm for CT images

International Nuclear Information System (INIS)

Kobayashi, Yoshio

1989-01-01

Although digital imaging techniques in radiology develop rapidly, problems arise in archival storage and communication of image data. This paper reports on a new information preserving data compression algorithm for computed tomographic (CT) images. This algorithm consists of the following five processes: 1. Pixels surrounding the human body showing CT values smaller than -900 H.U. are eliminated. 2. Each pixel is encoded by its numerical difference from its neighboring pixel along a matrix line. 3. Difference values are encoded by a newly designed code rather than the natural binary code. 4. Image data, obtained with the above process, are decomposed into bit planes. 5. The bit state transitions in each bit plane are encoded by run length coding. Using this new algorithm, the compression ratios of brain, chest, and abdomen CT images are 4.49, 4.34. and 4.40 respectively. (author)

PIXEL 2010 - A Resume

International Nuclear Information System (INIS)

Wermes, N.

2011-01-01

The Pixel 2010 conference focused on semiconductor pixel detectors for particle tracking/vertexing as well as for imaging, in particular for synchrotron light sources and XFELs. The big LHC hybrid pixel detectors have impressively started showing their capabilities. X-ray imaging detectors, also using the hybrid pixel technology, have greatly advanced the experimental possibilities for diffraction experiments. Monolithic or semi-monolithic devices like CMOS active pixels and DEPFET pixels have now reached a state such that complete vertex detectors for RHIC and superKEKB are being built with these technologies. Finally, new advances towards fully monolithic active pixel detectors, featuring full CMOS electronics merged with efficient signal charge collection, exploiting standard CMOS technologies, SOI and/or 3D integration, show the path for the future. This resume attempts to extract the main statements of the results and developments presented at this conference.

Fast Superpixel Segmentation Algorithm for PolSAR Images

Directory of Open Access Journals (Sweden)

Zhang Yue

2017-10-01

Full Text Available As a pre-processing technique, superpixel segmentation algorithms should be of high computational efficiency, accurate boundary adherence and regular shape in homogeneous regions. A fast superpixel segmentation algorithm based on Iterative Edge Refinement (IER has shown to be applicable on optical images. However, it is difficult to obtain the ideal results when IER is applied directly to PolSAR images due to the speckle noise and small or slim regions in PolSAR images. To address these problems, in this study, the unstable pixel set is initialized as all the pixels in the PolSAR image instead of the initial grid edge pixels. In the local relabeling of the unstable pixels, the fast revised Wishart distance is utilized instead of the Euclidean distance in CIELAB color space. Then, a post-processing procedure based on dissimilarity measure is empolyed to remove isolated small superpixels as well as to retain the strong point targets. Finally, extensive experiments based on a simulated image and a real-world PolSAR image from Airborne Synthetic Aperture Radar (AirSAR are conducted, showing that the proposed algorithm, compared with three state-of-the-art methods, performs better in terms of several commonly used evaluation criteria with high computational efficiency, accurate boundary adherence, and homogeneous regularity.

Crystal identification for a dual-layer-offset LYSO based PET system via Lu-176 background radiation and mean shift algorithm

Science.gov (United States)

Wei, Qingyang; Ma, Tianyu; Xu, Tianpeng; Zeng, Ming; Gu, Yu; Dai, Tiantian; Liu, Yaqiang

2018-01-01

Modern positron emission tomography (PET) detectors are made from pixelated scintillation crystal arrays and readout by Anger logic. The interaction position of the gamma-ray should be assigned to a crystal using a crystal position map or look-up table. Crystal identification is a critical procedure for pixelated PET systems. In this paper, we propose a novel crystal identification method for a dual-layer-offset LYSO based animal PET system via Lu-176 background radiation and mean shift algorithm. Single photon event data of the Lu-176 background radiation are acquired in list-mode for 3 h to generate a single photon flood map (SPFM). Coincidence events are obtained from the same data using time information to generate a coincidence flood map (CFM). The CFM is used to identify the peaks of the inner layer using the mean shift algorithm. The response of the inner layer is deducted from the SPFM by subtracting CFM. Then, the peaks of the outer layer are also identified using the mean shift algorithm. The automatically identified peaks are manually inspected by a graphical user interface program. Finally, a crystal position map is generated using a distance criterion based on these peaks. The proposed method is verified on the animal PET system with 48 detector blocks on a laptop with an Intel i7-5500U processor. The total runtime for whole system peak identification is 67.9 s. Results show that the automatic crystal identification has 99.98% and 99.09% accuracy for the peaks of the inner and outer layers of the whole system respectively. In conclusion, the proposed method is suitable for the dual-layer-offset lutetium based PET system to perform crystal identification instead of external radiation sources.

Updates to Constituent Subtraction in Heavy Ions at CMS

CERN Document Server

CMS Collaboration

2018-01-01

The latest upgrades and performance of constituent subtraction in 5.02 TeV PbPb collisions is presented. The constituent subtraction is extended through the full tracker acceptance, increasing the rapidity reach of correctly subtracted jets. A modulation in azimuthal angle is added to the subtraction, accounting for flow on an event-by-event basis and improving jet energy resolution. Closure of jet energy scale after corrections and jet energy resolution is shown for R=0.4 and R=0.8 jets, the latter for the first time in CMS Heavy-Ions.

A contextual classifier that only requires one prototype pixel for each class

DEFF Research Database (Denmark)

Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær; Conradsen, Knut

2001-01-01

constructed with experimental data is used in this stage. The algorithm was tested with the Kappa coefficient k on synthetical images and compared with K-means (k~=0.41) and a similar scheme that uses spectral means (k~=0.75) instead of histograms (k~=0.90). Results are shown on a dermatological image......A three stage scheme for classification of multi-spectral images is proposed. In each stage, statistics of each class present in the image are estimated. The user is required to provide only one prototype pixel for each class to be seeded into a homogeneous region. The algorithm starts...... by generating optimum initial training sets, one for each class, maximizing the redundancy in the data sets. These sets are the realizations of the maximal discs centered on the prototype pixels for which it is true that all the elements belong to the same class as the center one. Afterwards a region growing...

A Contextual Classifier That Only Requires One Prototype Pixel for Each Class

DEFF Research Database (Denmark)

Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær; Conradsen, Knut

2002-01-01

constructed with experimental data is used in this stage. The algorithm was tested with the Kappa coefficient κ on synthetic images and compared with K-means (κ~=0.41) and a similar scheme that uses spectral means (κ~=0.75) instead of histograms (κ~=0.90). The results are shown on a dermatological image......A three-stage scheme for the classification of multispectral images is proposed. In each stage, the statistics of each class present in the image are estimated. The user is required to provide only one prototype pixel for each class to be seeded into a homogeneous region. The algorithm starts...... by generating optimum initial training sets, one for each class, maximizing the redundancy in the data sets. These sets are the realizations of the maximal discs centered on the prototype pixels for which it is true that all the elements belong to the same class as the center one. Afterwards, a region...

Three-pass protocol scheme for bitmap image security by using vernam cipher algorithm

Science.gov (United States)

Rachmawati, D.; Budiman, M. A.; Aulya, L.

2018-02-01

Confidentiality, integrity, and efficiency are the crucial aspects of data security. Among the other digital data, image data is too prone to abuse of operation like duplication, modification, etc. There are some data security techniques, one of them is cryptography. The security of Vernam Cipher cryptography algorithm is very dependent on the key exchange process. If the key is leaked, security of this algorithm will collapse. Therefore, a method that minimizes key leakage during the exchange of messages is required. The method which is used, is known as Three-Pass Protocol. This protocol enables message delivery process without the key exchange. Therefore, the sending messages process can reach the receiver safely without fear of key leakage. The system is built by using Java programming language. The materials which are used for system testing are image in size 200×200 pixel, 300×300 pixel, 500×500 pixel, 800×800 pixel and 1000×1000 pixel. The result of experiments showed that Vernam Cipher algorithm in Three-Pass Protocol scheme could restore the original image.

arXiv Performance verification of the CMS Phase-1 Upgrade Pixel detector

CERN Document Server

Veszpremi, Viktor

2017-12-04

The CMS tracker consists of two tracking systems utilizing semiconductor technology: the inner pixel and the outer strip detectors. The tracker detectors occupy the volume around the beam interaction region between 3 cm and 110 cm in radius and up to 280 cm along the beam axis. The pixel detector consists of 124 million pixels, corresponding to about 2 m 2 total area. It plays a vital role in the seeding of the track reconstruction algorithms and in the reconstruction of primary interactions and secondary decay vertices. It is surrounded by the strip tracker with 10 million read-out channels, corresponding to 200 m 2 total area. The tracker is operated in a high-occupancy and high-radiation environment established by particle collisions in the LHC . The current strip detector continues to perform very well. The pixel detector that has been used in Run 1 and in the first half of Run 2 was, however, replaced with the so-called Phase-1 Upgrade detector. The new system is better suited to match the increased inst...

SU-F-T-20: Novel Catheter Lumen Recognition Algorithm for Rapid Digitization

Energy Technology Data Exchange (ETDEWEB)

Dise, J; McDonald, D; Ashenafi, M; Peng, J; Mart, C; Koch, N; Vanek, K [Medical University of South Carolina, Charleston, SC (United States)

2016-06-15

Purpose: Manual catheter recognition remains a time-consuming aspect of high-dose-rate brachytherapy (HDR) treatment planning. In this work, a novel catheter lumen recognition algorithm was created for accurate and rapid digitization. Methods: MatLab v8.5 was used to create the catheter recognition algorithm. Initially, the algorithm searches the patient CT dataset using an intensity based k-means filter designed to locate catheters. Once the catheters have been located, seed points are manually selected to initialize digitization of each catheter. From each seed point, the algorithm searches locally in order to automatically digitize the remaining catheter. This digitization is accomplished by finding pixels with similar image curvature and divergence parameters compared to the seed pixel. Newly digitized pixels are treated as new seed positions, and hessian image analysis is used to direct the algorithm toward neighboring catheter pixels, and to make the algorithm insensitive to adjacent catheters that are unresolvable on CT, air pockets, and high Z artifacts. The algorithm was tested using 11 HDR treatment plans, including the Syed template, tandem and ovoid applicator, and multi-catheter lung brachytherapy. Digitization error was calculated by comparing manually determined catheter positions to those determined by the algorithm. Results: he digitization error was 0.23 mm ± 0.14 mm axially and 0.62 mm ± 0.13 mm longitudinally at the tip. The time of digitization, following initial seed placement was less than 1 second per catheter. The maximum total time required to digitize all tested applicators was 4 minutes (Syed template with 15 needles). Conclusion: This algorithm successfully digitizes HDR catheters for a variety of applicators with or without CT markers. The minimal axial error demonstrates the accuracy of the algorithm, and its insensitivity to image artifacts and challenging catheter positioning. Future work to automatically place initial seed

SU-F-T-20: Novel Catheter Lumen Recognition Algorithm for Rapid Digitization

International Nuclear Information System (INIS)

Dise, J; McDonald, D; Ashenafi, M; Peng, J; Mart, C; Koch, N; Vanek, K

2016-01-01

Purpose: Manual catheter recognition remains a time-consuming aspect of high-dose-rate brachytherapy (HDR) treatment planning. In this work, a novel catheter lumen recognition algorithm was created for accurate and rapid digitization. Methods: MatLab v8.5 was used to create the catheter recognition algorithm. Initially, the algorithm searches the patient CT dataset using an intensity based k-means filter designed to locate catheters. Once the catheters have been located, seed points are manually selected to initialize digitization of each catheter. From each seed point, the algorithm searches locally in order to automatically digitize the remaining catheter. This digitization is accomplished by finding pixels with similar image curvature and divergence parameters compared to the seed pixel. Newly digitized pixels are treated as new seed positions, and hessian image analysis is used to direct the algorithm toward neighboring catheter pixels, and to make the algorithm insensitive to adjacent catheters that are unresolvable on CT, air pockets, and high Z artifacts. The algorithm was tested using 11 HDR treatment plans, including the Syed template, tandem and ovoid applicator, and multi-catheter lung brachytherapy. Digitization error was calculated by comparing manually determined catheter positions to those determined by the algorithm. Results: he digitization error was 0.23 mm ± 0.14 mm axially and 0.62 mm ± 0.13 mm longitudinally at the tip. The time of digitization, following initial seed placement was less than 1 second per catheter. The maximum total time required to digitize all tested applicators was 4 minutes (Syed template with 15 needles). Conclusion: This algorithm successfully digitizes HDR catheters for a variety of applicators with or without CT markers. The minimal axial error demonstrates the accuracy of the algorithm, and its insensitivity to image artifacts and challenging catheter positioning. Future work to automatically place initial seed

The NUC and blind pixel eliminating in the DTDI application

Science.gov (United States)

Su, Xiao Feng; Chen, Fan Sheng; Pan, Sheng Da; Gong, Xue Yi; Dong, Yu Cui

2013-12-01

AS infrared CMOS Digital TDI (Time Delay and integrate) has a simple structure, excellent performance and flexible operation, it has been used in more and more applications. Because of the limitation of the Production process level, the plane array of the infrared detector has a large NU (non-uniformity) and a certain blind pixel rate. Both of the two will raise the noise and lead to the TDI works not very well. In this paper, for the impact of the system performance, the most important elements are analyzed, which are the NU of the optical system, the NU of the Plane array and the blind pixel in the Plane array. Here a reasonable algorithm which considers the background removal and the linear response model of the infrared detector is used to do the NUC (Non-uniformity correction) process, when the infrared detector array is used as a Digital TDI. In order to eliminate the impact of the blind pixel, the concept of surplus pixel method is introduced in, through the method, the SNR (signal to noise ratio) can be improved and the spatial and temporal resolution will not be changed. Finally we use a MWIR (Medium Ware Infrared) detector to do the experiment and the result proves the effectiveness of the method.

Measurement of the two track separation capability of hybrid pixel sensors

Energy Technology Data Exchange (ETDEWEB)

Muñoz, F.J., E-mail: Francisca.MunozSanchez@manchester.ac.uk [University of Manchester (United Kingdom); Battaglia, M. [University of California, Santa Cruz, United States of America (United States); CERN, The European Organization for Nuclear Research (Switzerland); Da Vià, C. [University of Manchester (United Kingdom); La Rosa, A. [University of California, Santa Cruz, United States of America (United States); Dann, N. [University of Manchester (United Kingdom)

2017-02-11

Large Hadron Collider experiments face new challenges in Run-2 conditions due to the increased beam energy, the interest for searches of new physics signals with higher jet pT and the consequent longer decay length of heavy hadrons. In this new scenario, the capability of the innermost pixel sensors to distinguish tracks in very dense environment becomes crucial for efficient tracking and flavour tagging performance. In this work, we discuss the measurement in a test beam of the two track separation capability of hybrid pixel sensors using the interaction particles out of the collision of high energy pions on a thin copper target. With this method we are able to evaluate the effect of merged hits in the sensors under test due to tracks closer than the sensor spatial granularity in terms of collected charge, multiplicity and reconstruction efficiency. - Highlights: • Measurement of the two-track separation capability of hybrid pixel sensors. • Emulating track dense environment with a cooper target in a test beam. • Cooper target in between telescope arms to create vertices. • Validation of simulation and reconstruction algorithm for future vertex detectors. • New qualification method for pixel modules in track dense environments.

Image-reconstruction algorithms for positron-emission tomography systems

International Nuclear Information System (INIS)

Cheng, S.N.C.

1982-01-01

The positional uncertainty in the time-of-flight measurement of a positron-emission tomography system is modelled as a Gaussian distributed random variable and the image is assumed to be piecewise constant on a rectilinear lattice. A reconstruction algorithm using maximum-likelihood estimation is derived for the situation in which time-of-flight data are sorted as the most-likely-position array. The algorithm is formulated as a linear system described by a nonseparable, block-banded, Toeplitz matrix, and a sine-transform technique is used to implement this algorithm efficiently. The reconstruction algorithms for both the most-likely-position array and the confidence-weighted array are described by similar equations, hence similar linear systems can be used to described the reconstruction algorithm for a discrete, confidence-weighted array, when the matrix and the entries in the data array are properly identified. It is found that the mean square-error depends on the ratio of the full width at half the maximum of time-of-flight measurement over the size of a pixel. When other parameters are fixed, the larger the pixel size, the smaller is the mean square-error. In the study of resolution, parameters that affect the impulse response of time-of-flight reconstruction algorithms are identified. It is found that the larger the pixel size, the larger is the standard deviation of the impulse response. This shows that small mean square-error and fine resolution are two contradictory requirements

Parallel decompositions of Mueller matrices and polarimetric subtraction

Directory of Open Access Journals (Sweden)

Gil J.J.

2010-06-01

Full Text Available From a general formulation of the physically realizable parallel decompositions of the Mueller matrix M of a given depolarizing system, a procedure for determining the set of pure Mueller matrices susceptible to be subtracted from M is presented. This procedure provides a way to check if a given pure Mueller matrix N can be subtracted from M or not. If this check is positive, the value of the relative cross section of the subtracted component is also determined.

Hot pixel generation in active pixel sensors: dosimetric and micro-dosimetric response

Science.gov (United States)

Scheick, Leif; Novak, Frank

2003-01-01

The dosimetric response of an active pixel sensor is analyzed. heavy ions are seen to damage the pixel in much the same way as gamma radiation. The probability of a hot pixel is seen to exhibit behavior that is not typical with other microdose effects.

Synthesis of blind source separation algorithms on reconfigurable FPGA platforms

Science.gov (United States)

Du, Hongtao; Qi, Hairong; Szu, Harold H.

2005-03-01

Recent advances in intelligence technology have boosted the development of micro- Unmanned Air Vehicles (UAVs) including Sliver Fox, Shadow, and Scan Eagle for various surveillance and reconnaissance applications. These affordable and reusable devices have to fit a series of size, weight, and power constraints. Cameras used on such micro-UAVs are therefore mounted directly at a fixed angle without any motion-compensated gimbals. This mounting scheme has resulted in the so-called jitter effect in which jitter is defined as sub-pixel or small amplitude vibrations. The jitter blur caused by the jitter effect needs to be corrected before any other processing algorithms can be practically applied. Jitter restoration has been solved by various optimization techniques, including Wiener approximation, maximum a-posteriori probability (MAP), etc. However, these algorithms normally assume a spatial-invariant blur model that is not the case with jitter blur. Szu et al. developed a smart real-time algorithm based on auto-regression (AR) with its natural generalization of unsupervised artificial neural network (ANN) learning to achieve restoration accuracy at the sub-pixel level. This algorithm resembles the capability of the human visual system, in which an agreement between the pair of eyes indicates "signal", otherwise, the jitter noise. Using this non-statistical method, for each single pixel, a deterministic blind sources separation (BSS) process can then be carried out independently based on a deterministic minimum of the Helmholtz free energy with a generalization of Shannon's information theory applied to open dynamic systems. From a hardware implementation point of view, the process of jitter restoration of an image using Szu's algorithm can be optimized by pixel-based parallelization. In our previous work, a parallelly structured independent component analysis (ICA) algorithm has been implemented on both Field Programmable Gate Array (FPGA) and Application

A Demosaicking Algorithm with Adaptive Inter-Channel Correlation

Directory of Open Access Journals (Sweden)

Joan Duran

2015-12-01

Full Text Available Most common cameras use a CCD sensor device measuring a single color per pixel. Demosaicking is the interpolation process by which one can infer a full color image from such a matrix of values, thus interpolating the two missing components per pixel. Most demosaicking methods take advantage of inter-channel correlation locally selecting the best interpolation direction. The obtained results look convincing except when local geometry cannot be inferred from neighboring pixels or channel correlation is low. In these cases, these algorithms create interpolation artifacts such as zipper effect or color aliasing. This paper discusses the implementation details of the algorithm proposed in [J. Duran, A. Buades, ``Self-Similarity and Spectral Correlation Adaptive Algorithm for Color Demosaicking'', IEEE Transactions on Image Processing, 23(9, pp. 4031--4040, 2014]. The proposed method involves nonlocal image self-similarity in order to reduce interpolation artifacts when local geometry is ambiguous. It further introduces a clear and intuitive manner of balancing how much channel-correlation must be taken advantage of.

Performance of in-pixel circuits for photon counting arrays (PCAs) based on polycrystalline silicon TFTs

International Nuclear Information System (INIS)

Liang, Albert K; Koniczek, Martin; Antonuk, Larry E; El-Mohri, Youcef; Zhao, Qihua; Street, Robert A; Lu, Jeng Ping

2016-01-01

Photon counting arrays (PCAs), defined as pixelated imagers which measure the absorbed energy of x-ray photons individually and record this information digitally, are of increasing clinical interest. A number of PCA prototypes with a 1 mm pixel-to-pixel pitch have recently been fabricated with polycrystalline silicon (poly-Si)—a thin-film technology capable of creating monolithic imagers of a size commensurate with human anatomy. In this study, analog and digital simulation frameworks were developed to provide insight into the influence of individual poly-Si transistors on pixel circuit performance—information that is not readily available through empirical means. The simulation frameworks were used to characterize the circuit designs employed in the prototypes. The analog framework, which determines the noise produced by individual transistors, was used to estimate energy resolution, as well as to identify which transistors contribute the most noise. The digital framework, which analyzes how well circuits function in the presence of significant variations in transistor properties, was used to estimate how fast a circuit can produce an output (referred to as output count rate). In addition, an algorithm was developed and used to estimate the minimum pixel pitch that could be achieved for the pixel circuits of the current prototypes. The simulation frameworks predict that the analog component of the PCA prototypes could have energy resolution as low as 8.9% full width at half maximum (FWHM) at 70 keV; and the digital components should work well even in the presence of significant thin-film transistor (TFT) variations, with the fastest component having output count rates as high as 3 MHz. Finally, based on conceivable improvements in the underlying fabrication process, the algorithm predicts that the 1 mm pitch of the current PCA prototypes could be reduced significantly, potentially to between ∼240 and 290 μm. (paper)

Robustness of the Artificial Neural Networks Used for Clustering in the ATLAS Pixel Detector

CERN Document Server

The ATLAS collaboration

2015-01-01

A study of the robustness of the ATLAS pixel neural network clustering algorithm is presented. The sensitivity to variations to its input is evaluated. These variations are motivated by potential discrepancies between data and simulation due to uncertainties in the modelling of pixel clusters in simulation, as well as uncertainties from the detector calibration. Within reasonable variation magnitudes, the neural networks prove to be robust to most variations. The neural network used to identify pixel clusters created by multiple charged particles, is most sensitive to variations affecting the total amount of charge collected in the cluster. Modifying the read-out threshold has the biggest effect on the clustering's ability to estimate the position of the particle's intersection with the detector.

LASR-Guided Variability Subtraction: The Linear Algorithm for Significance Reduction of Stellar Seismic Activity

Science.gov (United States)

Horvath, Sarah; Myers, Sam; Ahlers, Johnathon; Barnes, Jason W.

2017-10-01

Stellar seismic activity produces variations in brightness that introduce oscillations into transit light curves, which can create challenges for traditional fitting models. These oscillations disrupt baseline stellar flux values and potentially mask transits. We develop a model that removes these oscillations from transit light curves by minimizing the significance of each oscillation in frequency space. By removing stellar variability, we prepare each light curve for traditional fitting techniques. We apply our model to $\\delta$-Scuti KOI-976 and demonstrate that our variability subtraction routine successfully allows for measuring bulk system characteristics using traditional light curve fitting. These results open a new window for characterizing bulk system parameters of planets orbiting seismically active stars.

Instrument-induced spatial crosstalk deconvolution algorithm

Science.gov (United States)

Wright, Valerie G.; Evans, Nathan L., Jr.

1986-01-01

An algorithm has been developed which reduces the effects of (deconvolves) instrument-induced spatial crosstalk in satellite image data by several orders of magnitude where highly precise radiometry is required. The algorithm is based upon radiance transfer ratios which are defined as the fractional bilateral exchange of energy betwen pixels A and B.

2D Sub-Pixel Disparity Measurement Using QPEC / Medicis

Directory of Open Access Journals (Sweden)

M. Cournet

2016-06-01

Full Text Available In the frame of its earth observation missions, CNES created a library called QPEC, and one of its launcher called Medicis. QPEC / Medicis is a sub-pixel two-dimensional stereo matching algorithm that works on an image pair. This tool is a block matching algorithm, which means that it is based on a local method. Moreover it does not regularize the results found. It proposes several matching costs, such as the Zero mean Normalised Cross-Correlation or statistical measures (the Mutual Information being one of them, and different match validation flags. QPEC / Medicis is able to compute a two-dimensional dense disparity map with a subpixel precision. Hence, it is more versatile than disparity estimation methods found in computer vision literature, which often assume an epipolar geometry. CNES uses Medicis, among other applications, during the in-orbit image quality commissioning of earth observation satellites. For instance the Pléiades-HR 1A & 1B and the Sentinel-2 geometric calibrations are based on this block matching algorithm. Over the years, it has become a common tool in ground segments for in-flight monitoring purposes. For these two kinds of applications, the two-dimensional search and the local sub-pixel measure without regularization can be essential. This tool is also used to generate automatic digital elevation models, for which it was not initially dedicated. This paper deals with the QPEC / Medicis algorithm. It also presents some of its CNES applications (in-orbit commissioning, in flight monitoring or digital elevation model generation. Medicis software is distributed outside the CNES as well. This paper finally describes some of these external applications using Medicis, such as ground displacement measurement, or intra-oral scanner in the dental domain.

Retrieval of Cloud Properties for Partially Cloud-Filled Pixels During CRYSTAL-FACE

Science.gov (United States)

Nguyen, L.; Minnis, P.; Smith, W. L.; Khaiyer, M. M.; Heck, P. W.; Sun-Mack, S.; Uttal, T.; Comstock, J.

2003-12-01

Partially cloud-filled pixels can be a significant problem for remote sensing of cloud properties. Generally, the optical depth and effective particle sizes are often too small or too large, respectively, when derived from radiances that are assumed to be overcast but contain radiation from both clear and cloud areas within the satellite imager field of view. This study presents a method for reducing the impact of such partially cloud field pixels by estimating the cloud fraction within each pixel using higher resolution visible (VIS, 0.65mm) imager data. Although the nominal resolution for most channels on the Geostationary Operational Environmental Satellite (GOES) imager and the Moderate Resolution Imaging Spectroradiometer (MODIS) on Terra are 4 and 1 km, respectively, both instruments also take VIS channel data at 1 km and 0.25 km, respectively. Thus, it may be possible to obtain an improved estimate of cloud fraction within the lower resolution pixels by using the information contained in the higher resolution VIS data. GOES and MODIS multi-spectral data, taken during the Cirrus Regional Study of Tropical Anvils and Cirrus Layers - Florida Area Cirrus Experiment (CRYSTAL-FACE), are analyzed with the algorithm used for the Atmospheric Radiation Measurement Program (ARM) and the Clouds and Earth's Radiant Energy System (CERES) to derive cloud amount, temperature, height, phase, effective particle size, optical depth, and water path. Normally, the algorithm assumes that each pixel is either entirely clear or cloudy. In this study, a threshold method is applied to the higher resolution VIS data to estimate the partial cloud fraction within each low-resolution pixel. The cloud properties are then derived from the observed low-resolution radiances using the cloud cover estimate to properly extract the radiances due only to the cloudy part of the scene. This approach is applied to both GOES and MODIS data to estimate the improvement in the retrievals for each

Developing a Model to Support Students in Solving Subtraction

Directory of Open Access Journals (Sweden)

Nila Mareta Murdiyani

2013-01-01

Full Text Available Subtraction has two meanings and each meaning leads to the different strategies. The meaning of “taking away something” suggests a direct subtraction, while the meaning of “determining the difference between two numbers” is more likely to be modeled as indirect addition. Many prior researches found that the second meaning and second strategy rarely appeared in the mathematical textbooks and teacher explanations, including in Indonesia. Therefore, this study was conducted to contribute to the development of a local instruction theory for subtraction by designing instructional activities that can facilitate first grade of primary school students to develop a model in solving two digit numbers subtraction. Consequently, design research was chosen as an appropriate approach for achieving the research aim and Realistic Mathematics Education (RME was used as a guide to design the lesson. This study involved 6 students in the pilot experiment, 31 students in the teaching experiment, and a first grade teacher of SDN 179 Palembang. The  result of this study shows that the beads string could bridge students from the contextual problems (taking ginger candies and making grains bracelets to the use of the empty number line. It also shows that the empty number line could promote students to  use different strategies (direct subtraction, indirect addition, and indirect subtraction in solving subtraction problems. Based on these findings, it is recommended to apply RME in the teaching learning process to make it more meaningful for students. Keywords: Subtraction, Design Research, Realistic Mathematics Education, The Beads String, The Empty Number Line DOI: http://dx.doi.org/10.22342/jme.4.1.567.95-112

A high accuracy algorithm of displacement measurement for a micro-positioning stage

Directory of Open Access Journals (Sweden)

Xiang Zhang

2017-05-01

Full Text Available A high accuracy displacement measurement algorithm for a two degrees of freedom compliant precision micro-positioning stage is proposed based on the computer micro-vision technique. The algorithm consists of an integer-pixel and a subpixel matching procedure. Series of simulations are conducted to verify the proposed method. The results show that the proposed algorithm possesses the advantages of high precision and stability, the resolution can attain to 0.01 pixel theoretically. In addition, the consuming time is reduced about 6.7 times compared with the classical normalized cross correlation algorithm. To validate the practical performance of the proposed algorithm, a laser interferometer measurement system (LIMS is built up. The experimental results demonstrate that the algorithm has better adaptability than that of the LIMS.

Dual-energy subtraction radiography of the breast

International Nuclear Information System (INIS)

Asaga, Taro; Masuzawa, Chihiro; Kawahara, Satoru; Motohashi, Hisahiko; Okamoto, Takashi; Tamura, Nobuo

1988-01-01

Dual-energy projection radiography was applied to breast examination. To perform the dual-energy subtraction radiography using a digital radiography unit, high and low-energy exposures were made at an appropriate time interval under differing X-ray exposure conditions. Dual-energy subtraction radiography was performed in 41 cancer patients in whom the tumor shadow was equivocal or the border of cancer infiltration was not clearly demonstrated by compression mammography, and 15 patients with benign diseases such as fibrocystic disease, cyst and fibroadenoma. In 21 cases out of the 41 cancer patients, the dual-energy subtraction radiography clearly visualized the malignant tumor shadows and the border of cancer infiltration and the daughter nodules by removing the shadows of normal mammary gland. On the other hand, beign diseases such as fibrocystic disease and cyst could be diagnosed as such, because the tumor shadow and the irregularly concentrated image of mammary gland disappeared by the dual-energy subtraction. These results suggest that this new technique will be useful in examination of breast masses. (author)

Dual-energy subtraction radiography of the breast

Energy Technology Data Exchange (ETDEWEB)

Asaga, Taro; Masuzawa, Chihiro; Kawahara, Satoru; Motohashi, Hisahiko; Okamoto, Takashi; Tamura, Nobuo

1988-06-01

Dual-energy projection radiography was applied to breast examination. To perform the dual-energy subtraction radiography using a digital radiography unit, high and low-energy exposures were made at an appropriate time interval under differing X-ray exposure conditions. Dual-energy subtraction radiography was performed in 41 cancer patients in whom the tumor shadow was equivocal or the border of cancer infiltration was not clearly demonstrated by compression mammography, and 15 patients with benign diseases such as fibrocystic disease, cyst and fibroadenoma. In 21 cases out of the 41 cancer patients, the dual-energy subtraction radiography clearly visualized the malignant tumor shadows and the border of cancer infiltration and the daughter nodules by removing the shadows of normal mammary gland. On the other hand, beign diseases such as fibrocystic disease and cyst could be diagnosed as such, because the tumor shadow and the irregularly concentrated image of mammary gland disappeared by the dual-energy subtraction. These results suggest that this new technique will be useful in examination of breast masses.

Automation of Endmember Pixel Selection in SEBAL/METRIC Model

Science.gov (United States)

Bhattarai, N.; Quackenbush, L. J.; Im, J.; Shaw, S. B.

2015-12-01

The commonly applied surface energy balance for land (SEBAL) and its variant, mapping evapotranspiration (ET) at high resolution with internalized calibration (METRIC) models require manual selection of endmember (i.e. hot and cold) pixels to calibrate sensible heat flux. Current approaches for automating this process are based on statistical methods and do not appear to be robust under varying climate conditions and seasons. In this paper, we introduce a new approach based on simple machine learning tools and search algorithms that provides an automatic and time efficient way of identifying endmember pixels for use in these models. The fully automated models were applied on over 100 cloud-free Landsat images with each image covering several eddy covariance flux sites in Florida and Oklahoma. Observed land surface temperatures at automatically identified hot and cold pixels were within 0.5% of those from pixels manually identified by an experienced operator (coefficient of determination, R2, ≥ 0.92, Nash-Sutcliffe efficiency, NSE, ≥ 0.92, and root mean squared error, RMSE, ≤ 1.67 K). Daily ET estimates derived from the automated SEBAL and METRIC models were in good agreement with their manual counterparts (e.g., NSE ≥ 0.91 and RMSE ≤ 0.35 mm day-1). Automated and manual pixel selection resulted in similar estimates of observed ET across all sites. The proposed approach should reduce time demands for applying SEBAL/METRIC models and allow for their more widespread and frequent use. This automation can also reduce potential bias that could be introduced by an inexperienced operator and extend the domain of the models to new users.

A new methodology for pixel-quantitative precipitation nowcasting using a pyramid Lucas Kanade optical flow approach

Science.gov (United States)

Liu, Yu; Xi, Du-Gang; Li, Zhao-Liang; Hong, Yang

2015-10-01

Short-term high-resolution Quantitative Precipitation Nowcasting (QPN) has important implications for navigation, flood forecasting, and other hydrological and meteorological concerns. This study proposes a new algorithm called Pixel-based QPN using the Pyramid Lucas-Kanade Optical Flow method (PPLK), which comprises three steps: employing a Pyramid Lucas-Kanade Optical Flow method (PLKOF) to estimate precipitation advection, projecting rainy clouds by considering the advection and evolution pixel by pixel, and interpolating QPN imagery based on the space-time continuum of cloud patches. The PPLK methodology was evaluated with 2338 images from the geostationary meteorological satellite Fengyun-2F (FY-2F) of China and compared with two other advection-based methods, i.e., the maximum correlation method and the Horn-Schunck Optical Flow scheme. The data sample covered all intensive observations since the launch of FY-2F, despite covering a total of only approximately 10 days. The results show that the PPLK performed better than the algorithms used for comparison, demonstrating less time expenditure, more effective cloud tracking, and improved QPN accuracy.

Digital subtraction angiography system evaluation with phantoms

International Nuclear Information System (INIS)

Wenstrup, R.S.; Sweeney, K.P.; Scholz, F.J.

1985-01-01

Advances in digital subtraction angiography imaging demonstrate the need for critical evaluation of the performance of digital subtraction equipment. The design of a phantom set for noninvasive assessment of the imaging quality of digital subtraction equipment is described; components include a remotely controlled transport system and individual patterns to evaluate the contrast and detail properties of the image intensifier, low-contrast sensitivity and resolution of the system, geometric distortion of image, linearity, mechanical and electronic stability of equipment, and effects of bone and bowel gas on iodine perception. The performance of an add-on digital radiographic system is presented, along with radiation exposure levels at the image intensifier for a range of radiographic techniques

Motion subtraction of the larynx using digital radiography

International Nuclear Information System (INIS)

Kumakawa, Kohzoh; Miyakawa, Kouichi

1990-01-01

The development of digital radiography (DR) has made it possible to analyze the contour of the laryngeal soft tissue structures in more detail than the conventional screen-film method. The authors first used the DR system for time subtraction of the larynx during inspiration and phonation. The images are acquired by means of frontal tomography of the larynx using the imaging plate during inspiration and phonation separately, and stored into the memory of the DR system. The thickness of the slices is 5.0 mm. Time subtraction between the mask image during inspiration and the live image during phonation is performed using digital processing on CRT. Superimposing the two images at the upper trachea and the thyroid cartilage of the same depth, makes it possible to measure movement of the vocal cord and false vocal cord quantitatively in three dimensions. The authors named this time subtraction as motion subtraction of the larynx. This motion subtraction image can be obtained by on-line digital processing without complicated development technique, but has so high spatial resolution. This image processing seems to be useful in functional radiographic analysis of laryngeal diseases. (author)

Digital subtraction cerebral angiography by intraarterial injection: comparison with conventional angiography

International Nuclear Information System (INIS)

Brant-Zawadzki, M.; Gould, R.; Norman, D.; Newton, T.H.; Lane, B.

1983-01-01

For 4 months, a prototype digital subtraction system was used to obtain images of the cerebral vasculature after intraarterial contrast injections. In 12 instances, the intraarterial injections were recorded with both a digital subtraction unit and conventional direct magnification film-screen system. The digital subtraction and conventional film subtraction images were compared and graded for quality and information content by three skilled observers. In addition, quantitative measurements of contrast-detail performance and spatial resolution were obtained on both the digital system and the screen-film imaging chain. In a clinical setting, both the digital subtraction and conventional film-screen systems provided similar quality images and angiographic information. Contrast-detail curves demonstrated that digital subtraction angiography outperformed conventional film technique for low-contrast objects. Digital subtraction angiography also reduced the time required to obtain the angiogram, markedly reduced film cost, and lowered the contrast agent burden

Development of digital subtraction system DAR-1200

International Nuclear Information System (INIS)

Kawai, Masumi; Shimizu, Yasumitsu; Ozaki, Takeshi; Sawada, Hiroshi; Uzuyama, Kazuhiro; Nishioka, Hiroyuki

1989-01-01

Digital subtraction angiography (DSA) has been of widespread use clinically, and it has attracted considerable attention in angiographic examination today. The merits of Shimadzu high resolution digital subtraction system DAR-1200 are reported in this paper. Furthermore, the principle and clinical usefullness of a new method of DSA called the Peak-Hold DSA are explained especially in details. (author)

From hybrid to CMOS pixels ... a possibility for LHC's pixel future?

International Nuclear Information System (INIS)

Wermes, N.

2015-01-01

Hybrid pixel detectors have been invented for the LHC to make tracking and vertexing possible at all in LHC's radiation intense environment. The LHC pixel detectors have meanwhile very successfully fulfilled their promises and R and D for the planned HL-LHC upgrade is in full swing, targeting even higher ionising doses and non-ionising fluences. In terms of rate and radiation tolerance hybrid pixels are unrivaled. But they have disadvantages as well, most notably material thickness, production complexity, and cost. Meanwhile also active pixel sensors (DEPFET, MAPS) have become real pixel detectors but they would by far not stand the rates and radiation faced from HL-LHC. New MAPS developments, so-called DMAPS (depleted MAPS) which are full CMOS-pixel structures with charge collection in a depleted region have come in the R and D focus for pixels at high rate/radiation levels. This goal can perhaps be realised exploiting HV technologies, high ohmic substrates and/or SOI based technologies. The paper covers the main ideas and some encouraging results from prototyping R and D, not hiding the difficulties

Advanced Background Subtraction Applied to Aeroacoustic Wind Tunnel Testing

Science.gov (United States)

Bahr, Christopher J.; Horne, William C.

2015-01-01

An advanced form of background subtraction is presented and applied to aeroacoustic wind tunnel data. A variant of this method has seen use in other fields such as climatology and medical imaging. The technique, based on an eigenvalue decomposition of the background noise cross-spectral matrix, is robust against situations where isolated background auto-spectral levels are measured to be higher than levels of combined source and background signals. It also provides an alternate estimate of the cross-spectrum, which previously might have poor definition for low signal-to-noise ratio measurements. Simulated results indicate similar performance to conventional background subtraction when the subtracted spectra are weaker than the true contaminating background levels. Superior performance is observed when the subtracted spectra are stronger than the true contaminating background levels. Experimental results show limited success in recovering signal behavior for data where conventional background subtraction fails. They also demonstrate the new subtraction technique's ability to maintain a proper coherence relationship in the modified cross-spectral matrix. Beam-forming and de-convolution results indicate the method can successfully separate sources. Results also show a reduced need for the use of diagonal removal in phased array processing, at least for the limited data sets considered.

Automatic Coregistration Algorithm to Remove Canopy Shaded Pixels in UAV-Borne Thermal Images to Improve the Estimation of Crop Water Stress Index of a Drip-Irrigated Cabernet Sauvignon Vineyard

Directory of Open Access Journals (Sweden)

Tomas Poblete

2018-01-01

Full Text Available Water stress caused by water scarcity has a negative impact on the wine industry. Several strategies have been implemented for optimizing water application in vineyards. In this regard, midday stem water potential (SWP and thermal infrared (TIR imaging for crop water stress index (CWSI have been used to assess plant water stress on a vine-by-vine basis without considering the spatial variability. Unmanned Aerial Vehicle (UAV-borne TIR images are used to assess the canopy temperature variability within vineyards that can be related to the vine water status. Nevertheless, when aerial TIR images are captured over canopy, internal shadow canopy pixels cannot be detected, leading to mixed information that negatively impacts the relationship between CWSI and SWP. This study proposes a methodology for automatic coregistration of thermal and multispectral images (ranging between 490 and 900 nm obtained from a UAV to remove shadow canopy pixels using a modified scale invariant feature transformation (SIFT computer vision algorithm and Kmeans++ clustering. Our results indicate that our proposed methodology improves the relationship between CWSI and SWP when shadow canopy pixels are removed from a drip-irrigated Cabernet Sauvignon vineyard. In particular, the coefficient of determination (R2 increased from 0.64 to 0.77. In addition, values of the root mean square error (RMSE and standard error (SE decreased from 0.2 to 0.1 MPa and 0.24 to 0.16 MPa, respectively. Finally, this study shows that the negative effect of shadow canopy pixels was higher in those vines with water stress compared with well-watered vines.

Automatic Coregistration Algorithm to Remove Canopy Shaded Pixels in UAV-Borne Thermal Images to Improve the Estimation of Crop Water Stress Index of a Drip-Irrigated Cabernet Sauvignon Vineyard.

Science.gov (United States)

Poblete, Tomas; Ortega-Farías, Samuel; Ryu, Dongryeol

2018-01-30

Water stress caused by water scarcity has a negative impact on the wine industry. Several strategies have been implemented for optimizing water application in vineyards. In this regard, midday stem water potential (SWP) and thermal infrared (TIR) imaging for crop water stress index (CWSI) have been used to assess plant water stress on a vine-by-vine basis without considering the spatial variability. Unmanned Aerial Vehicle (UAV)-borne TIR images are used to assess the canopy temperature variability within vineyards that can be related to the vine water status. Nevertheless, when aerial TIR images are captured over canopy, internal shadow canopy pixels cannot be detected, leading to mixed information that negatively impacts the relationship between CWSI and SWP. This study proposes a methodology for automatic coregistration of thermal and multispectral images (ranging between 490 and 900 nm) obtained from a UAV to remove shadow canopy pixels using a modified scale invariant feature transformation (SIFT) computer vision algorithm and Kmeans++ clustering. Our results indicate that our proposed methodology improves the relationship between CWSI and SWP when shadow canopy pixels are removed from a drip-irrigated Cabernet Sauvignon vineyard. In particular, the coefficient of determination (R²) increased from 0.64 to 0.77. In addition, values of the root mean square error (RMSE) and standard error (SE) decreased from 0.2 to 0.1 MPa and 0.24 to 0.16 MPa, respectively. Finally, this study shows that the negative effect of shadow canopy pixels was higher in those vines with water stress compared with well-watered vines.

LSB Based Quantum Image Steganography Algorithm

Science.gov (United States)

Jiang, Nan; Zhao, Na; Wang, Luo

2016-01-01

Quantum steganography is the technique which hides a secret message into quantum covers such as quantum images. In this paper, two blind LSB steganography algorithms in the form of quantum circuits are proposed based on the novel enhanced quantum representation (NEQR) for quantum images. One algorithm is plain LSB which uses the message bits to substitute for the pixels' LSB directly. The other is block LSB which embeds a message bit into a number of pixels that belong to one image block. The extracting circuits can regain the secret message only according to the stego cover. Analysis and simulation-based experimental results demonstrate that the invisibility is good, and the balance between the capacity and the robustness can be adjusted according to the needs of applications.

Tomography of photon-added and photon-subtracted states

NARCIS (Netherlands)

Bazrafkan, MR; Man'ko, [No Value

The purpose of this paper is to introduce symplectic and optical tomograms of photon-added and photon-subtracted quantum states. Explicit relations for the tomograms of photon-added and photon-subtracted squeezed coherent states and squeezed number states are obtained. Generating functions for the

A smart-pixel holographic competitive learning network

Science.gov (United States)

Slagle, Timothy Michael

Neural networks are adaptive classifiers which modify their decision boundaries based on feedback from externally- or internally-generated error signals. Optics is an attractive technology for neural network implementation because it offers the possibility of parallel, nearly instantaneous computation of the weighted neuron inputs by the propagation of light through the optical system. Using current optical device technology, system performance levels of 3 × 1011 connection updates per second can be achieved. This thesis presents an architecture for an optical competitive learning network which offers advantages over previous optical implementations, including smart-pixel-based optical neurons, phase- conjugate self-alignment of a single neuron plane, and high-density, parallel-access weight storage, interconnection, and learning in a volume hologram. The competitive learning algorithm with modifications for optical implementation is described, and algorithm simulations are performed for an example problem. The optical competitive learning architecture is then introduced. The optical system is simulated using the ``beamprop'' algorithm at the level of light propagating through the system components, and results showing competitive learning operation in agreement with the algorithm simulations are presented. The optical competitive learning requires a non-linear, non-local ``winner-take-all'' (WTA) neuron function. Custom-designed smart-pixel WTA neuron arrays were fabricated using CMOS VLSI/liquid crystal technology. Results of laboratory tests of the WTA arrays' switching characteristics, time response, and uniformity are then presented. The system uses a phase-conjugate mirror to write the self-aligning interconnection weight holograms, and energy gain is required from the reflection to minimize erasure of the existing weights. An experimental system for characterizing the PCM response is described. Useful gains of 20 were obtained with a polarization

An algorithm for automatic crystal identification in pixelated scintillation detectors using thin plate splines and Gaussian mixture models.

Science.gov (United States)

Schellenberg, Graham; Stortz, Greg; Goertzen, Andrew L

2016-02-07

A typical positron emission tomography detector is comprised of a scintillator crystal array coupled to a photodetector array or other position sensitive detector. Such detectors using light sharing to read out crystal elements require the creation of a crystal lookup table (CLUT) that maps the detector response to the crystal of interaction based on the x-y position of the event calculated through Anger-type logic. It is vital for system performance that these CLUTs be accurate so that the location of events can be accurately identified and so that crystal-specific corrections, such as energy windowing or time alignment, can be applied. While using manual segmentation of the flood image to create the CLUT is a simple and reliable approach, it is both tedious and time consuming for systems with large numbers of crystal elements. In this work we describe the development of an automated algorithm for CLUT generation that uses a Gaussian mixture model paired with thin plate splines (TPS) to iteratively fit a crystal layout template that includes the crystal numbering pattern. Starting from a region of stability, Gaussians are individually fit to data corresponding to crystal locations while simultaneously updating a TPS for predicting future Gaussian locations at the edge of a region of interest that grows as individual Gaussians converge to crystal locations. The algorithm was tested with flood image data collected from 16 detector modules, each consisting of a 409 crystal dual-layer offset LYSO crystal array readout by a 32 pixel SiPM array. For these detector flood images, depending on user defined input parameters, the algorithm runtime ranged between 17.5-82.5 s per detector on a single core of an Intel i7 processor. The method maintained an accuracy above 99.8% across all tests, with the majority of errors being localized to error prone corner regions. This method can be easily extended for use with other detector types through adjustment of the initial

An algorithm for automatic crystal identification in pixelated scintillation detectors using thin plate splines and Gaussian mixture models

International Nuclear Information System (INIS)

Schellenberg, Graham; Goertzen, Andrew L; Stortz, Greg

2016-01-01

A typical positron emission tomography detector is comprised of a scintillator crystal array coupled to a photodetector array or other position sensitive detector. Such detectors using light sharing to read out crystal elements require the creation of a crystal lookup table (CLUT) that maps the detector response to the crystal of interaction based on the x–y position of the event calculated through Anger-type logic. It is vital for system performance that these CLUTs be accurate so that the location of events can be accurately identified and so that crystal-specific corrections, such as energy windowing or time alignment, can be applied. While using manual segmentation of the flood image to create the CLUT is a simple and reliable approach, it is both tedious and time consuming for systems with large numbers of crystal elements. In this work we describe the development of an automated algorithm for CLUT generation that uses a Gaussian mixture model paired with thin plate splines (TPS) to iteratively fit a crystal layout template that includes the crystal numbering pattern. Starting from a region of stability, Gaussians are individually fit to data corresponding to crystal locations while simultaneously updating a TPS for predicting future Gaussian locations at the edge of a region of interest that grows as individual Gaussians converge to crystal locations. The algorithm was tested with flood image data collected from 16 detector modules, each consisting of a 409 crystal dual-layer offset LYSO crystal array readout by a 32 pixel SiPM array. For these detector flood images, depending on user defined input parameters, the algorithm runtime ranged between 17.5–82.5 s per detector on a single core of an Intel i7 processor. The method maintained an accuracy above 99.8% across all tests, with the majority of errors being localized to error prone corner regions. This method can be easily extended for use with other detector types through adjustment of the initial

An algorithm for automatic crystal identification in pixelated scintillation detectors using thin plate splines and Gaussian mixture models

Science.gov (United States)

Schellenberg, Graham; Stortz, Greg; Goertzen, Andrew L.

2016-02-01

A typical positron emission tomography detector is comprised of a scintillator crystal array coupled to a photodetector array or other position sensitive detector. Such detectors using light sharing to read out crystal elements require the creation of a crystal lookup table (CLUT) that maps the detector response to the crystal of interaction based on the x-y position of the event calculated through Anger-type logic. It is vital for system performance that these CLUTs be accurate so that the location of events can be accurately identified and so that crystal-specific corrections, such as energy windowing or time alignment, can be applied. While using manual segmentation of the flood image to create the CLUT is a simple and reliable approach, it is both tedious and time consuming for systems with large numbers of crystal elements. In this work we describe the development of an automated algorithm for CLUT generation that uses a Gaussian mixture model paired with thin plate splines (TPS) to iteratively fit a crystal layout template that includes the crystal numbering pattern. Starting from a region of stability, Gaussians are individually fit to data corresponding to crystal locations while simultaneously updating a TPS for predicting future Gaussian locations at the edge of a region of interest that grows as individual Gaussians converge to crystal locations. The algorithm was tested with flood image data collected from 16 detector modules, each consisting of a 409 crystal dual-layer offset LYSO crystal array readout by a 32 pixel SiPM array. For these detector flood images, depending on user defined input parameters, the algorithm runtime ranged between 17.5-82.5 s per detector on a single core of an Intel i7 processor. The method maintained an accuracy above 99.8% across all tests, with the majority of errors being localized to error prone corner regions. This method can be easily extended for use with other detector types through adjustment of the initial

Self-masking noise subtraction (SMNS) in digital X-ray tomosynthesis for the improvement of tomographic image quality

International Nuclear Information System (INIS)

Oh, J.E.; Cho, H.S.; Choi, S.I.; Park, Y.O.; Lee, M.S.; Cho, H.M.; Yang, Y.J.; Je, U.K.; Woo, T.H.; Lee, H.K.

2011-01-01

In this paper, we proposed a simple and effective reconstruction algorithm, the so-called self-masking noise subtraction (SMNS), in digital X-ray tomosynthesis to reduce the tomographic blur that is inherent in the conventional tomosynthesis based upon the shift-and-add (SAA) method. Using the SAA and the SMNS algorithms, we investigated the influence of tomographic parameters such as tomographic angle (θ) and angle step (Δθ) on the image quality, measuring the signal-difference-to-noise ratio (SDNR). Our simulation results show that the proposed algorithm seems to be efficient in reducing the tomographic blur and, thus, improving image sharpness. We expect the simulation results to be useful for the optimal design of a digital X-ray tomosynthesis system for our ongoing application of nondestructive testing (NDT).

A study on the geometric correction for the digital subtraction radiograph

International Nuclear Information System (INIS)

Lim, Suk Young; Koh, Kwang Joon

2001-01-01

To develop a new subtraction program for registering digital images based on the correspondence of anatomic structures. The digital periapical images were obtained by Digora system with Rinn XCP equipment after translation of 1-16 mm, and rotation of 2-20 at the premolar and molar areas of the human dried mandible. The new subtraction program, NIH Image program and Emago/Advanced program were compared by the peak-signal -to noise ratio (PSNR). The new subtraction program was superior to NIH Images program and Emago/Advanced program up to 16 mm translation and horizontal angulation up to 4. The new subtraction program can be used for subtracting digital periapical images

Readout architecture for the Pixel-Strip module of the CMS Outer Tracker Phase-2 upgrade

CERN Document Server

Caratelli, Alessandro; Jan Kaplon; Kloukinas, Konstantinos; Simone Scarfi

2017-01-01

The Outer Tracker upgrade of the Compact Muon Solenoid (CMS) experiment at CERN introduces new challenges for the front-end readout electronics. In particular, the capability of identifying particles with high transverse momentum using modules with double sensor layers requires high speed real time interconnects between readout ASICs. The Pixel-Strip module combines a pixelated silicon layer with a silicon-strip layer. Consequently, it needs two different readout ASICs, namely the Short Strip ASIC (SSA) for the strip sensor and the Macro Pixel ASIC (MPA) for the pixelated sensor. The architecture proposed in this paper allows for a total data flow between readout ASICs of $\\sim$100\\,Gbps and reduces the output data flow from 1.3\\,Tbps to 30\\,Gbps per module while limiting the total power density to below 100\\,mW/cm$^2$. In addition a system-level simulation framework of all the front-end readout ASICs is developed in order to verify the data processing algorithm and the hardware implementation allowing mult...

Aircraft target detection algorithm based on high resolution spaceborne SAR imagery

Science.gov (United States)

Zhang, Hui; Hao, Mengxi; Zhang, Cong; Su, Xiaojing

2018-03-01

In this paper, an image classification algorithm for airport area is proposed, which based on the statistical features of synthetic aperture radar (SAR) images and the spatial information of pixels. The algorithm combines Gamma mixture model and MRF. The algorithm using Gamma mixture model to obtain the initial classification result. Pixel space correlation based on the classification results are optimized by the MRF technique. Additionally, morphology methods are employed to extract airport (ROI) region where the suspected aircraft target samples are clarified to reduce the false alarm and increase the detection performance. Finally, this paper presents the plane target detection, which have been verified by simulation test.

A 1,000 Frames/s Programmable Vision Chip with Variable Resolution and Row-Pixel-Mixed Parallel Image Processors

Directory of Open Access Journals (Sweden)

Nanjian Wu

2009-07-01

Full Text Available A programmable vision chip with variable resolution and row-pixel-mixed parallel image processors is presented. The chip consists of a CMOS sensor array, with row-parallel 6-bit Algorithmic ADCs, row-parallel gray-scale image processors, pixel-parallel SIMD Processing Element (PE array, and instruction controller. The resolution of the image in the chip is variable: high resolution for a focused area and low resolution for general view. It implements gray-scale and binary mathematical morphology algorithms in series to carry out low-level and mid-level image processing and sends out features of the image for various applications. It can perform image processing at over 1,000 frames/s (fps. A prototype chip with 64 × 64 pixels resolution and 6-bit gray-scale image is fabricated in 0.18 mm Standard CMOS process. The area size of chip is 1.5 mm × 3.5 mm. Each pixel size is 9.5 μm × 9.5 μm and each processing element size is 23 μm × 29 μm. The experiment results demonstrate that the chip can perform low-level and mid-level image processing and it can be applied in the real-time vision applications, such as high speed target tracking.

MODIS Collection 6 Clear Sky Restoral (CSR): Filtering Cloud Mast 'Not Clear' Pixels

Science.gov (United States)

Meyer, Kerry G.; Platnick, Steven Edward; Wind, Galina; Riedi, Jerome

2014-01-01

Correctly identifying cloudy pixels appropriate for the MOD06 cloud optical and microphysical property retrievals is accomplished in large part using results from the MOD35 1km cloud mask tests (note there are also two 250m subpixel cloud mask tests that can convert the 1km cloudy designations to clear sky). However, because MOD35 is by design clear sky conservative (i.e., it identifies "not clear" pixels), certain situations exist in which pixels identified by MOD35 as "cloudy" are nevertheless likely to be poor retrieval candidates. For instance, near the edge of clouds or within broken cloud fields, a given 1km MODIS field of view (FOV) may in fact only be partially cloudy. This can be problematic for the MOD06 retrievals because in these cases the assumptions of a completely overcast homogenous cloudy FOV and 1-dimensional plane-parallel radiative transfer no longer hold, and subsequent retrievals will be of low confidence. Furthermore, some pixels may be identified by MOD35 as "cloudy" for reasons other than the presence of clouds, such as scenes with thick smoke or lofted dust, and should therefore not be retrieved as clouds. With such situations in mind, a Clear Sky Restoral (CSR) algorithm was introduced in C5 that attempts to identify pixels expected to be poor retrieval candidates. Table 1 provides SDS locations for CSR and partly cloudy (PCL) pixels.

First large DEPFET pixel modules for the Belle II Pixel Detector

Energy Technology Data Exchange (ETDEWEB)

Mueller, Felix; Avella, Paola; Kiesling, Christian; Koffmane, Christian; Moser, Hans-Guenther; Valentan, Manfred [Max-Planck-Institut fuer Physik, Muenchen (Germany); Andricek, Ladislav; Richter, Rainer [Halbleiterlabor der Max-Planck-Gesellschaft, Muenchen (Germany); Collaboration: Belle II-Collaboration

2016-07-01

DEPFET pixel detectors offer excellent signal to noise ratio, resolution and low power consumption with a low material budget. They will be used at Belle II and are a candidate for an ILC vertex detector. The pixels are integrated in a monolithic piece of silicon which also acts as PCB providing the signal and control routings for the ASICs on top. The first prototype DEPFET sensor modules for Belle II have been produced. The modules have 192000 pixels and are equipped with SMD components and three different kinds of ASICs to control and readout the pixels. The entire readout chain has to be studied; the metal layer interconnectivity and routings need to be verified. The modules are fully characterized, and the operation voltages and control sequences of the ASICs are investigated. An overview of the DEPFET concept and first characterization results is presented.

Fixed-point image orthorectification algorithms for reduced computational cost

Science.gov (United States)

French, Joseph Clinton

Imaging systems have been applied to many new applications in recent years. With the advent of low-cost, low-power focal planes and more powerful, lower cost computers, remote sensing applications have become more wide spread. Many of these applications require some form of geolocation, especially when relative distances are desired. However, when greater global positional accuracy is needed, orthorectification becomes necessary. Orthorectification is the process of projecting an image onto a Digital Elevation Map (DEM), which removes terrain distortions and corrects the perspective distortion by changing the viewing angle to be perpendicular to the projection plane. Orthorectification is used in disaster tracking, landscape management, wildlife monitoring and many other applications. However, orthorectification is a computationally expensive process due to floating point operations and divisions in the algorithm. To reduce the computational cost of on-board processing, two novel algorithm modifications are proposed. One modification is projection utilizing fixed-point arithmetic. Fixed point arithmetic removes the floating point operations and reduces the processing time by operating only on integers. The second modification is replacement of the division inherent in projection with a multiplication of the inverse. The inverse must operate iteratively. Therefore, the inverse is replaced with a linear approximation. As a result of these modifications, the processing time of projection is reduced by a factor of 1.3x with an average pixel position error of 0.2% of a pixel size for 128-bit integer processing and over 4x with an average pixel position error of less than 13% of a pixel size for a 64-bit integer processing. A secondary inverse function approximation is also developed that replaces the linear approximation with a quadratic. The quadratic approximation produces a more accurate approximation of the inverse, allowing for an integer multiplication calculation

Thresholding: A Pixel-Level Image Processing Methodology Preprocessing Technique for an OCR System for the Brahmi Script

Directory of Open Access Journals (Sweden)

H. K. Anasuya Devi

2006-12-01

Full Text Available In this paper we study the methodology employed for preprocessing the archaeological images. We present the various algorithms used in the low-level processing stage of image analysis for Optical Character Recognition System for Brahmi Script. The image preprocessing technique covered in this paper is thresholding. We also try to analyze the results obtained by the pixel-level processing algorithms.

Pixel Experiments

DEFF Research Database (Denmark)

Petersen, Kjell Yngve; Søndergaard, Karin; Augustesen, Christina

2015-01-01

Pixel Experiments The term pixel is traditionally defined as any of the minute elements that together constitute a larger context or image. A pixel has its own form and is the smallest unit seen within a larger structure. In working with the potentials of LED technology in architectural lighting...... lighting design in practice, one quickly experiences and realises that there are untapped potentials in the attributes of LED technology. In this research, speculative studies have been made working with the attributes of LEDs in architectural contexts, with the ambition to ascertain new strategies...... for using LED lighting in lighting design practice. The speculative experiments that have been set-up have aimed to clarify the variables that can be used as parameters in the design of lighting applications; including, for example, the structuring and software control of light. The experiments also...

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

OpenAIRE

Hsiang, Tien-Ruey; Arkin, Esther M.; Bender, Michael; Fekete, Sandor P.; Mitchell, Joseph S. B.

2002-01-01

We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region. An environment is composed of pixels that form a connected subset of the integer grid. There is at most one robot per pixel and robots move horizontally or vertically at unit speed. Robots enter R by means of k>=1 door pixels Robots are primitive finite automata, only having local communicatio...

On-Orbit Solar Dynamics Observatory (SDO) Star Tracker Warm Pixel Analysis

Science.gov (United States)

Felikson, Denis; Ekinci, Matthew; Hashmall, Joseph A.; Vess, Melissa

2011-01-01

This paper describes the process of identification and analysis of warm pixels in two autonomous star trackers on the Solar Dynamics Observatory (SDO) mission. A brief description of the mission orbit and attitude regimes is discussed and pertinent star tracker hardware specifications are given. Warm pixels are defined and the Quality Index parameter is introduced, which can be explained qualitatively as a manifestation of a possible warm pixel event. A description of the algorithm used to identify warm pixel candidates is given. Finally, analysis of dumps of on-orbit star tracker charge coupled devices (CCD) images is presented and an operational plan going forward is discussed. SDO, launched on February 11, 2010, is operated from the NASA Goddard Space Flight Center (GSFC). SDO is in a geosynchronous orbit with a 28.5 inclination. The nominal mission attitude points the spacecraft X-axis at the Sun, with the spacecraft Z-axis roughly aligned with the Solar North Pole. The spacecraft Y-axis completes the triad. In attitude, SDO moves approximately 0.04 per hour, mostly about the spacecraft Z-axis. The SDO star trackers, manufactured by Galileo Avionica, project the images of stars in their 16.4deg x 16.4deg fields-of-view onto CCD detectors consisting of 512 x 512 pixels. The trackers autonomously identify the star patterns and provide an attitude estimate. Each unit is able to track up to 9 stars. Additionally, each tracker calculates a parameter called the Quality Index, which is a measure of the quality of the attitude solution. Each pixel in the CCD measures the intensity of light and a warns pixel is defined as having a measurement consistently and significantly higher than the mean background intensity level. A warns pixel should also have lower intensity than a pixel containing a star image and will not move across the field of view as the attitude changes (as would a dim star image). It should be noted that the maximum error introduced in the star tracker

Local Competition-Based Superpixel Segmentation Algorithm in Remote Sensing.

Science.gov (United States)

Liu, Jiayin; Tang, Zhenmin; Cui, Ying; Wu, Guoxing

2017-06-12

Remote sensing technologies have been widely applied in urban environments' monitoring, synthesis and modeling. Incorporating spatial information in perceptually coherent regions, superpixel-based approaches can effectively eliminate the "salt and pepper" phenomenon which is common in pixel-wise approaches. Compared with fixed-size windows, superpixels have adaptive sizes and shapes for different spatial structures. Moreover, superpixel-based algorithms can significantly improve computational efficiency owing to the greatly reduced number of image primitives. Hence, the superpixel algorithm, as a preprocessing technique, is more and more popularly used in remote sensing and many other fields. In this paper, we propose a superpixel segmentation algorithm called Superpixel Segmentation with Local Competition (SSLC), which utilizes a local competition mechanism to construct energy terms and label pixels. The local competition mechanism leads to energy terms locality and relativity, and thus, the proposed algorithm is less sensitive to the diversity of image content and scene layout. Consequently, SSLC could achieve consistent performance in different image regions. In addition, the Probability Density Function (PDF), which is estimated by Kernel Density Estimation (KDE) with the Gaussian kernel, is introduced to describe the color distribution of superpixels as a more sophisticated and accurate measure. To reduce computational complexity, a boundary optimization framework is introduced to only handle boundary pixels instead of the whole image. We conduct experiments to benchmark the proposed algorithm with the other state-of-the-art ones on the Berkeley Segmentation Dataset (BSD) and remote sensing images. Results demonstrate that the SSLC algorithm yields the best overall performance, while the computation time-efficiency is still competitive.

Evaluation of sacroiliitis: contrast-enhanced MRI with subtraction technique

Energy Technology Data Exchange (ETDEWEB)

Algin, Oktay; Gokalp, Gokhan; Baran, Bulent; Ocakoglu, Gokhan; Yazici, Zeynep [Uludag University, Medical Faculty, Department of Radiology, Gorukle, Bursa (Turkey)

2009-10-15

The purpose of the study was to investigate the diagnostic value of contrast-enhanced MRI using the subtraction technique in the detection of active sacroiliitis. Magnetic resonance imaging was performed in 8 asymptomatic volunteers and 50 patients with clinically suspected active sacroiliitis. On precontrast MR images, T1-weighted spin-echo images with and without fat saturation (T1WFS and T1W), STIR and 3D-FLASH images with fat saturation were obtained in the semicoronal plane using a 1.5 Tesla imager. Postcontrast MRI was performed using the same T1WFS sequence as before contrast injection for all volunteers and patients. Postcontrast images were subtracted from fat-suppressed precontrast images. Enhancement within the joint space and bone marrow was considered to demonstrate active sacroiliitis. In 50 patients (100 sacroiliac joints [SIJs]), 40 (76 SIJs) were considered to have active sacroiliitis based on MR images. Bone marrow edema was present in 33 patients (62 SIJs) on STIR images. Routine MRI allowed identification of contrast enhancement in SIJs on postcontrast T1WFS images in 31 patients (49 SIJs). Contrast enhancement was observed in 40 patients (76 SIJs) who were examined by MRI using the subtraction technique. Contrast enhancement was significantly more conspicuous on subtraction images than on non-subtracted postcontrast T1WFS images (Mann-Whitney U test, p<0.001). Contrast-enhanced MRI with subtraction technique may be useful for early detection of active sacroiliitis. (orig.)

A novel color image encryption scheme using fractional-order hyperchaotic system and DNA sequence operations

International Nuclear Information System (INIS)

Zhang Li-Min; Sun Ke-Hui; Liu Wen-Hao; He Shao-Bo

2017-01-01

In this paper, Adomian decomposition method (ADM) with high accuracy and fast convergence is introduced to solve the fractional-order piecewise-linear (PWL) hyperchaotic system. Based on the obtained hyperchaotic sequences, a novel color image encryption algorithm is proposed by employing a hybrid model of bidirectional circular permutation and DNA masking. In this scheme, the pixel positions of image are scrambled by circular permutation, and the pixel values are substituted by DNA sequence operations. In the DNA sequence operations, addition and substraction operations are performed according to traditional addition and subtraction in the binary, and two rounds of addition rules are used to encrypt the pixel values. The simulation results and security analysis show that the hyperchaotic map is suitable for image encryption, and the proposed encryption algorithm has good encryption effect and strong key sensitivity. It can resist brute-force attack, statistical attack, differential attack, known-plaintext, and chosen-plaintext attacks. (paper)

Development of pixellated Ir-TESs

International Nuclear Information System (INIS)

Zen, Nobuyuki; Takahashi, Hiroyuki; Kunieda, Yuichi; Dayanthi, Rathnayaka M.T.; Mori, Fumiakira; Fujita, Kaoru; Nakazawa, Masaharu; Fukuda, Daiji; Ohkubo, Masataka

2006-01-01

We have been developing Ir-based pixellated superconducting transition edge sensors (TESs). In the area of material or astronomical applications, the sensor with few eV energy resolution and over 1000 pixels imaging property is desired. In order to achieve this goal, we have been analyzing signals from pixellated TESs. In the case of a 20 pixel array of Ir-TESs, with 45 μmx45 μm pixel sizes, the incident X-ray signals have been classified into 16 groups. We have applied numerical signal analysis. On the one hand, the energy resolution of our pixellated TES is strongly degraded. However, using pulse shape analysis, we can dramatically improve the resolution. Thus, we consider that the pulse signal analysis will lead this device to be used as a practical photon incident position identifying TES

Digital subtraction radiographic evaluation of the standardize periapical intraoral radiographs

International Nuclear Information System (INIS)

Cho, Bong Hae; Nah, Kyung Soo

1993-01-01

The geometrically standardized intraoral radiographs using 5 occlusal registration material were taken serially from immediate, 1 day, 2, 4, 8, 12 and 16 weeks after making the bite blocks. The qualities of those subtracted images were evaluated to check the degree of reproducibility of each impression material. The results were as follows: 1. The standard deviations of the grey scales of the overall subtracted images were 4.9 for Exaflex, 7.2 for Pattern resin, 9.0 for Tooth Shade Acrylic, 12.2 for XCP only, 14.8 for Impregum. 2. The standard deviation of the grey scales of the overall subtracted images were grossly related to those of the localized horizontal line of interest. 3. Exaflex which showed the best subtracted image quality had 15 cases of straight, 14 cases of wave, 1 case of canyon shape. Impregum which showed the worst subtracted image quality had 4 cases of straight, 8 cases of wave, 18 cases of canyon shape respectively.

Temporal subtraction in chest radiography: Automated assessment of registration accuracy

International Nuclear Information System (INIS)

Armato, Samuel G. III; Doshi, Devang J.; Engelmann, Roger; Croteau, Charles L.; MacMahon, Heber

2006-01-01

Radiologists routinely compare multiple chest radiographs acquired from the same patient over time to more completely understand changes in anatomy and pathology. While such comparisons are achieved conventionally through a side-by-side display of images, image registration techniques have been developed to combine information from two separate radiographic images through construction of a 'temporal subtraction image'. Although temporal subtraction images provide a powerful mechanism for the enhanced visualization of subtle change, errors in the clinical evaluation of these images may arise from misregistration artifacts that can mimic or obscure pathologic change. We have developed a computerized method for the automated assessment of registration accuracy as demonstrated in temporal subtraction images created from radiographic chest image pairs. The registration accuracy of 150 temporal subtraction images constructed from the computed radiography images of 72 patients was rated manually using a five-point scale ranging from '5-excellent' to '1-poor'; ratings of 3, 4, or 5 reflected clinically acceptable subtraction images, and ratings of 1 or 2 reflected clinically unacceptable images. Gray-level histogram-based features and texture measures are computed at multiple spatial scales within a 'lung mask' region that encompasses both lungs in the temporal subtraction images. A subset of these features is merged through a linear discriminant classifier. With a leave-one-out-by-patient training/testing paradigm, the automated method attained an A z value of 0.92 in distinguishing between temporal subtraction images that demonstrated clinically acceptable and clinically unacceptable registration accuracy. A second linear discriminant classifier yielded an A z value of 0.82 based on a feature subset selected from an independent database of digitized film images. These methods are expected to advance the clinical utility of temporal subtraction images for chest

TRANSFORMATION ALGORITHM FOR IMAGES OBTAINED BY OMNIDIRECTIONAL CAMERAS

Directory of Open Access Journals (Sweden)

V. P. Lazarenko

2015-01-01

Full Text Available Omnidirectional optoelectronic systems find their application in areas where a wide viewing angle is critical. However, omnidirectional optoelectronic systems have a large distortion that makes their application more difficult. The paper compares the projection functions of traditional perspective lenses and omnidirectional wide angle fish-eye lenses with a viewing angle not less than 180°. This comparison proves that distortion models of omnidirectional cameras cannot be described as a deviation from the classic model of pinhole camera. To solve this problem, an algorithm for transforming omnidirectional images has been developed. The paper provides a brief comparison of the four calibration methods available in open source toolkits for omnidirectional optoelectronic systems. Geometrical projection model is given used for calibration of omnidirectional optical system. The algorithm consists of three basic steps. At the first step, we calculate he field of view of a virtual pinhole PTZ camera. This field of view is characterized by an array of 3D points in the object space. At the second step the array of corresponding pixels for these three-dimensional points is calculated. Then we make a calculation of the projection function that expresses the relation between a given 3D point in the object space and a corresponding pixel point. In this paper we use calibration procedure providing the projection function for calibrated instance of the camera. At the last step final image is formed pixel-by-pixel from the original omnidirectional image using calculated array of 3D points and projection function. The developed algorithm gives the possibility for obtaining an image for a part of the field of view of an omnidirectional optoelectronic system with the corrected distortion from the original omnidirectional image. The algorithm is designed for operation with the omnidirectional optoelectronic systems with both catadioptric and fish-eye lenses

How many pixels does it take to make a good 4"×6" print? Pixel count wars revisited

Science.gov (United States)

Kriss, Michael A.

2011-01-01

In the early 1980's the future of conventional silver-halide photographic systems was of great concern due to the potential introduction of electronic imaging systems then typified by the Sony Mavica analog electronic camera. The focus was on the quality of film-based systems as expressed in the number of equivalent number pixels and bits-per-pixel, and how many pixels would be required to create an equivalent quality image from a digital camera. It was found that 35-mm frames, for ISO 100 color negative film, contained equivalent pixels of 12 microns for a total of 18 million pixels per frame (6 million pixels per layer) with about 6 bits of information per pixel; the introduction of new emulsion technology, tabular AgX grains, increased the value to 8 bit per pixel. Higher ISO speed films had larger equivalent pixels, fewer pixels per frame, but retained the 8 bits per pixel. Further work found that a high quality 3.5" x 5.25" print could be obtained from a three layer system containing 1300 x 1950 pixels per layer or about 7.6 million pixels in all. In short, it became clear that when a digital camera contained about 6 million pixels (in a single layer using a color filter array and appropriate image processing) that digital systems would challenge and replace conventional film-based system for the consumer market. By 2005 this became the reality. Since 2005 there has been a "pixel war" raging amongst digital camera makers. The question arises about just how many pixels are required and are all pixels equal? This paper will provide a practical look at how many pixels are needed for a good print based on the form factor of the sensor (sensor size) and the effective optical modulation transfer function (optical spread function) of the camera lens. Is it better to have 16 million, 5.7-micron pixels or 6 million 7.8-micron pixels? How does intrinsic (no electronic boost) ISO speed and exposure latitude vary with pixel size? A systematic review of these issues will

Development of pixellated Ir-TESs

Science.gov (United States)

Zen, Nobuyuki; Takahashi, Hiroyuki; Kunieda, Yuichi; Damayanthi, Rathnayaka M. T.; Mori, Fumiakira; Fujita, Kaoru; Nakazawa, Masaharu; Fukuda, Daiji; Ohkubo, Masataka

2006-04-01

We have been developing Ir-based pixellated superconducting transition edge sensors (TESs). In the area of material or astronomical applications, the sensor with few eV energy resolution and over 1000 pixels imaging property is desired. In order to achieve this goal, we have been analyzing signals from pixellated TESs. In the case of a 20 pixel array of Ir-TESs, with 45 μm×45 μm pixel sizes, the incident X-ray signals have been classified into 16 groups. We have applied numerical signal analysis. On the one hand, the energy resolution of our pixellated TES is strongly degraded. However, using pulse shape analysis, we can dramatically improve the resolution. Thus, we consider that the pulse signal analysis will lead this device to be used as a practical photon incident position identifying TES.

VIDEO DENOISING USING SWITCHING ADAPTIVE DECISION BASED ALGORITHM WITH ROBUST MOTION ESTIMATION TECHNIQUE

Directory of Open Access Journals (Sweden)

V. Jayaraj

2010-08-01

Full Text Available A Non-linear adaptive decision based algorithm with robust motion estimation technique is proposed for removal of impulse noise, Gaussian noise and mixed noise (impulse and Gaussian with edge and fine detail preservation in images and videos. The algorithm includes detection of corrupted pixels and the estimation of values for replacing the corrupted pixels. The main advantage of the proposed algorithm is that an appropriate filter is used for replacing the corrupted pixel based on the estimation of the noise variance present in the filtering window. This leads to reduced blurring and better fine detail preservation even at the high mixed noise density. It performs both spatial and temporal filtering for removal of the noises in the filter window of the videos. The Improved Cross Diamond Search Motion Estimation technique uses Least Median Square as a cost function, which shows improved performance than other motion estimation techniques with existing cost functions. The results show that the proposed algorithm outperforms the other algorithms in the visual point of view and in Peak Signal to Noise Ratio, Mean Square Error and Image Enhancement Factor.

FPGA implementation for real-time background subtraction based on Horprasert model.

Science.gov (United States)

Rodriguez-Gomez, Rafael; Fernandez-Sanchez, Enrique J; Diaz, Javier; Ros, Eduardo

2012-01-01

Background subtraction is considered the first processing stage in video surveillance systems, and consists of determining objects in movement in a scene captured by a static camera. It is an intensive task with a high computational cost. This work proposes an embedded novel architecture on FPGA which is able to extract the background on resource-limited environments and offers low degradation (produced because of the hardware-friendly model modification). In addition, the original model is extended in order to detect shadows and improve the quality of the segmentation of the moving objects. We have analyzed the resource consumption and performance in Spartan3 Xilinx FPGAs and compared to others works available on the literature, showing that the current architecture is a good trade-off in terms of accuracy, performance and resources utilization. With less than a 65% of the resources utilization of a XC3SD3400 Spartan-3A low-cost family FPGA, the system achieves a frequency of 66.5 MHz reaching 32.8 fps with resolution 1,024 × 1,024 pixels, and an estimated power consumption of 5.76 W.

FPGA Implementation for Real-Time Background Subtraction Based on Horprasert Model

Directory of Open Access Journals (Sweden)

Eduardo Ros

2012-01-01

Full Text Available Background subtraction is considered the first processing stage in video surveillance systems, and consists of determining objects in movement in a scene captured by a static camera. It is an intensive task with a high computational cost. This work proposes an embedded novel architecture on FPGA which is able to extract the background on resource-limited environments and offers low degradation (produced because of the hardware-friendly model modification. In addition, the original model is extended in order to detect shadows and improve the quality of the segmentation of the moving objects. We have analyzed the resource consumption and performance in Spartan3 Xilinx FPGAs and compared to others works available on the literature, showing that the current architecture is a good trade-off in terms of accuracy, performance and resources utilization. With less than a 65% of the resources utilization of a XC3SD3400 Spartan-3A low-cost family FPGA, the system achieves a frequency of 66.5 MHz reaching 32.8 fps with resolution 1,024 x 1,024 pixels, and an estimated power consumption of 5.76 W.

Parametric boundary reconstruction algorithm for industrial CT metrology application.

Science.gov (United States)

Yin, Zhye; Khare, Kedar; De Man, Bruno

2009-01-01

High-energy X-ray computed tomography (CT) systems have been recently used to produce high-resolution images in various nondestructive testing and evaluation (NDT/NDE) applications. The accuracy of the dimensional information extracted from CT images is rapidly approaching the accuracy achieved with a coordinate measuring machine (CMM), the conventional approach to acquire the metrology information directly. On the other hand, CT systems generate the sinogram which is transformed mathematically to the pixel-based images. The dimensional information of the scanned object is extracted later by performing edge detection on reconstructed CT images. The dimensional accuracy of this approach is limited by the grid size of the pixel-based representation of CT images since the edge detection is performed on the pixel grid. Moreover, reconstructed CT images usually display various artifacts due to the underlying physical process and resulting object boundaries from the edge detection fail to represent the true boundaries of the scanned object. In this paper, a novel algorithm to reconstruct the boundaries of an object with uniform material composition and uniform density is presented. There are three major benefits in the proposed approach. First, since the boundary parameters are reconstructed instead of image pixels, the complexity of the reconstruction algorithm is significantly reduced. The iterative approach, which can be computationally intensive, will be practical with the parametric boundary reconstruction. Second, the object of interest in metrology can be represented more directly and accurately by the boundary parameters instead of the image pixels. By eliminating the extra edge detection step, the overall dimensional accuracy and process time can be improved. Third, since the parametric reconstruction approach shares the boundary representation with other conventional metrology modalities such as CMM, boundary information from other modalities can be directly

Fully Pipelined Parallel Architecture for Candidate Block and Pixel-Subsampling-Based Motion Estimation

Directory of Open Access Journals (Sweden)

Reeba Korah

2008-01-01

Full Text Available This paper presents a low power and high speed architecture for motion estimation with Candidate Block and Pixel Subsampling (CBPS Algorithm. Coarse-to-fine search approach is employed to find the motion vector so that the local minima problem is totally eliminated. Pixel subsampling is performed in the selected candidate blocks which significantly reduces computational cost with low quality degradation. The architecture developed is a fully pipelined parallel design with 9 processing elements. Two different methods are deployed to reduce the power consumption, parallel and pipelined implementation and parallel accessing to memory. For processing 30 CIF frames per second our architecture requires a clock frequency of 4.5 MHz.

On the usefulness of portal monitor unit subtraction in radiation therapy

International Nuclear Information System (INIS)

Kuperman, Vadim Y; Lubich, Leslie M

2003-01-01

In order to avoid additional dose to patients caused by portal imaging with megavoltage x-rays, portal monitor units (MUs) are frequently subtracted from the actual treatment MUs. This study examines the usefulness of portal MU subtraction in radiation therapy. For 11 prostate cancer patients treated with 23 MV photons, dose to prostate due to portal filming with 6 MV photons was determined. In all 11 patients subtraction of portal MU values from the actual treatment MUs resulted in a small underdosing of the prostate with an average treatment error of -0.5%. Portal filming without MU subtraction would cause small overdosing of the prostate with an average treatment error of 1.2%. The results of this study indicate that the benefits of portal MU subtraction are in doubt if (a) the energy of treatment x-rays is much higher than that of the portal x-rays and/or (b) when radiotherapy is performed with physical wedges. Based on the obtained results, we argue against unconditional use of the portal MU subtraction method to eliminate the dose from portal imaging

A hybrid 3D LIDAR imager based on pixel-by-pixel scanning and DS-OCDMA

Science.gov (United States)

Kim, Gunzung; Eom, Jeongsook; Park, Yongwan

2016-03-01

We propose a new hybrid 3D light detection and ranging (LIDAR) system, which measures a scene with 1280 x 600 pixels at a refresh rate of 60fps. The emitted pulses of each pixel are modulated by direct sequence optical code division multiple access (DS-OCDMA) techniques. The modulated pulses include a unique device identification number, the pixel position in the line, and a checksum. The LIDAR emits the modulated pulses periodically without waiting to receive returning light at the detector. When all the pixels are completely through the process, the travel time, amplitude, width, and speed are used by the pixel-by-pixel scanning LIDAR imager to generate point cloud data as the measured results. We programmed the entire hybrid 3D LIDAR operation in a simulator to observe the functionality accomplished by our proposed model.

Crowded Field Photometry and Moving Object Detection with Optimal Image Subtraction

Science.gov (United States)

Lee, Austin A. T.; Scheulen, F.; Sauro, C. M.; McMahon, C. T.; Berry, S. J.; Robinson, C. H.; Buie, M. W.; Little, P.

2010-05-01

High precision photometry and moving object detection are essential in the study of Pluto and the Kuiper Belt. In particular, the New Horizons mission would benefit from an accurate and fast method of performing image subtraction to locate faint Kuiper Belt Objects (KBO) among large data sets. The optimal image subtraction (OIS) algorithm was optimized for IDL to decrease execution time by a factor of about 140 from a previous implementation (Miller 2008, PASP, 120, 449). In addition, a powerful image transformation and interpolation routine was written to provide OIS with well-aligned input images using astrometric fit data. The first half of this project is complete including the code optimization and the alignment routine. The second half of the project is focused on using these tools to search a 5 x 10 degree search area to find KBOs for possible targets for the New Horizons mission. We will present examples of how these tools work and along with resulting Pluto photometry and KBO target lists. The optimized OIS and transformation routines are available in Marc Buie's IDL library at http://www.boulder.swri.edu/ buie/idl/ as ois.pro and dewarp.pro. This project was conducted for Harvey Mudd College's Clinic Program with financial support from the NASA Planetary Astronomy Program grant number NNX09AB43G.

A new registration method with voxel-matching technique for temporal subtraction images

Science.gov (United States)

Itai, Yoshinori; Kim, Hyoungseop; Ishikawa, Seiji; Katsuragawa, Shigehiko; Doi, Kunio

2008-03-01

A temporal subtraction image, which is obtained by subtraction of a previous image from a current one, can be used for enhancing interval changes on medical images by removing most of normal structures. One of the important problems in temporal subtraction is that subtraction images commonly include artifacts created by slight differences in the size, shape, and/or location of anatomical structures. In this paper, we developed a new registration method with voxel-matching technique for substantially removing the subtraction artifacts on the temporal subtraction image obtained from multiple-detector computed tomography (MDCT). With this technique, the voxel value in a warped (or non-warped) previous image is replaced by a voxel value within a kernel, such as a small cube centered at a given location, which would be closest (identical or nearly equal) to the voxel value in the corresponding location in the current image. Our new method was examined on 16 clinical cases with MDCT images. Preliminary results indicated that interval changes on the subtraction images were enhanced considerably, with a substantial reduction of misregistration artifacts. The temporal subtraction images obtained by use of the voxel-matching technique would be very useful for radiologists in the detection of interval changes on MDCT images.

A Pixel Correlation Technique for Smaller Telescopes to Measure Doubles

Science.gov (United States)

Wiley, E. O.

2013-04-01

Pixel correlation uses the same reduction techniques as speckle imaging but relies on autocorrelation among captured pixel hits rather than true speckles. A video camera operating at speeds (8-66 milliseconds) similar to lucky imaging to capture 400-1,000 video frames. The AVI files are converted to bitmap images and analyzed using the interferometric algorithms in REDUC using all frames. This results in a series of corellograms from which theta and rho can be measured. Results using a 20 cm (8") Dall-Kirkham working at f22.5 are presented for doubles with separations between 1" to 5.7" under average seeing conditions. I conclude that this form of visualizing and analyzing visual double stars is a viable alternative to lucky imaging that can be employed by telescopes that are too small in aperture to capture a sufficient number of speckles for true speckle interferometry.

Noise properties of the EM algorithm. Pt. 1

International Nuclear Information System (INIS)

Barrett, H.H.; Wilson, D.W.; Tsui, B.M.W.

1994-01-01

The expectation-maximisation (EM) algorithm is an important tool for maximum-likelihood (ML) estimation and image reconstruction, especially in medical imaging. It is a non-linear iterative algorithm that attempts to find the ML estimate of the object that produced a data set. The convergence of the algorithm and other deterministic properties are well established, but relatively little is known about how noise in the data influences noise in the final reconstructed image. In this paper we present a detailed treatment of these statistical properties. The specific application we have in mind is image reconstruction in emission tomography, but the results are valid for any application of the EM algorithm in which the data set can be described by Poisson statistics. We show that the probability density function for the grey level at a pixel in the image is well approximated by a log-normal law. An expression is derived for the variance of the grey level and for pixel-to-pixel covariance. The variance increases rapidly with iteration number at first, but eventually saturates as the ML estimate is approached. Moreover, the variance at any iteration number has a factor proportional to the square of the mean image (though other factors may also depend on the mean image), so a map of the standard deviation resembles the object itself. Thus low-intensity regions of the image tend to have low noise. (author)

Dispersed-fringe-accumulation-based left-subtract-right method for fine co-phasing of a dispersed fringe sensor.

Science.gov (United States)

Li, Yang; Wang, Shengqian; Rao, Changhui

2017-05-20

In this paper, a dispersed-fringe-accumulation (DFA)-based left-subtract-right (LSR) piston estimation method (DFA-LSR), in which the dispersed fringe image is accumulated in the dispersed direction, and then the LSR method is used to estimate the piston error, is proposed for dispersed fringe sensors (DFS) in the fine co-phasing stage. The DFS is usually used to detect the piston errors (optical path difference) between different segmented mirrors or synthetic aperture telescopes. The DFA-LSR makes up for the shortcomings of the main peak position (MPP) method, which suffers from the constant offset in the pixel counts. The analysis and experiment results show that the proposed method can keep relatively better performance even at the condition of poor signal-to-noise ratio, compared with the MPP method in fine co-phasing stage.

THE KEPLER PIXEL RESPONSE FUNCTION

International Nuclear Information System (INIS)

Bryson, Stephen T.; Haas, Michael R.; Dotson, Jessie L.; Koch, David G.; Borucki, William J.; Tenenbaum, Peter; Jenkins, Jon M.; Chandrasekaran, Hema; Caldwell, Douglas A.; Klaus, Todd; Gilliland, Ronald L.

2010-01-01

Kepler seeks to detect sequences of transits of Earth-size exoplanets orbiting solar-like stars. Such transit signals are on the order of 100 ppm. The high photometric precision demanded by Kepler requires detailed knowledge of how the Kepler pixels respond to starlight during a nominal observation. This information is provided by the Kepler pixel response function (PRF), defined as the composite of Kepler's optical point-spread function, integrated spacecraft pointing jitter during a nominal cadence and other systematic effects. To provide sub-pixel resolution, the PRF is represented as a piecewise-continuous polynomial on a sub-pixel mesh. This continuous representation allows the prediction of a star's flux value on any pixel given the star's pixel position. The advantages and difficulties of this polynomial representation are discussed, including characterization of spatial variation in the PRF and the smoothing of discontinuities between sub-pixel polynomial patches. On-orbit super-resolution measurements of the PRF across the Kepler field of view are described. Two uses of the PRF are presented: the selection of pixels for each star that maximizes the photometric signal-to-noise ratio for that star, and PRF-fitted centroids which provide robust and accurate stellar positions on the CCD, primarily used for attitude and plate scale tracking. Good knowledge of the PRF has been a critical component for the successful collection of high-precision photometry by Kepler.

Combined nuclear and digital subtraction contrast arthrography in painful knee prosthesis

International Nuclear Information System (INIS)

Namasivayam, J.; Forrester, A.; Poon, F.W.; Cuthbert, G.F.; McKillop, J.H.; Bryan, A.S.

1992-01-01

The evaluation of a painful knee prosthesis remains a difficult problem for both orthopaedic surgeons and radiologists. We have compared digital subtraction arthrography with nuclear-arthrography in 7 patients with a painful knee prosthesis. Three patients showed a loose tibial component, demonstrated by both digital subtraction and nuclear arthrography. All 3 underwent revision of their prosthesis. One patient had an equivocal digital subtraction arthrogram and negative nuclear arthrogram, while both studies were negative in the 3 remaining patients. Nuclear arthrography is a simple procedure and can provide useful additional information when combined with digital subtraction arthrography. (orig.)

Arthrography of painful hips following arthroplasty: Digital versus plain film subtraction

Energy Technology Data Exchange (ETDEWEB)

Walker, C W; FitzRandolph, R L; Dalrymple, G V [Arkansas Univ. for Medical Sciences, Little Rock, AR (USA). Dept. of Radiology John McClellan Memorial Veterans Hospital, Little Rock, AR (USA); Collins, D N [Arkansas Univ. for Medical Sciences, Little Rock, AR (USA). Dept. of Orthopedics John McClellan Memorial Veterans Hospital, Little Rock, AR (USA)

1991-08-01

Digital and manual subtraction images obtained during the arthrographic evaluation of 78 painful hip prostheses were reviewed retrospectively. Revision arthroplasty was performed in 53 of these cases, and the arthrographic and surgical findings were correlated. The digital and manual subtraction images were evaluated without knowledge of the surgical results using established criteria for component loosening. The difference between detection of femoral component loosening on digital as opposed to manual subtraction images was statistically significant (P < 0.05). This study demonstrates that digital subtraction improves the evaluation of femoral component loosening in painful hip prostheses. (orig./GDG).

A technique of scatter and glare correction for videodensitometric studies in digital subtraction videoangiography

International Nuclear Information System (INIS)

Shaw, C.G.; Ergun, D.L.; Myerowitz, P.D.; Van Lysel, M.S.; Mistretta, C.A.; Zarnstorff, W.C.; Crummy, A.B.

1982-01-01

The logarithmic amplification of video signals and the availability of data in digital form make digital subtraction videoangiography a suitable tool for videodensitometric estimation of physiological quantities. A system for this purpose was implemented with a digital video image processor. However, it was found that the radiation scattering and veiling glare present in the image-intensified video must be removed to make meaningful quantitations. An algorithm to make such a correction was developed and is presented. With this correction, the videodensitometry system was calibrated with phantoms and used to measure the left ventricular ejection fraction of a canine heart

Operational experience of ATLAS SCT and Pixel Detector

CERN Document Server

Kocian, Martin; The ATLAS collaboration

2017-01-01

The ATLAS Inner Detector based on silicon sensors is consisting of a strip detector (SCT) and a pixel detector. It is the crucial component for vertexing and tracking in the ATLAS experiment. With the excellent performance of the LHC well beyond the original specification the silicon tracking detectors are facing substantial challenges in terms of data acquisition, radiation damage to the sensors, and SEUs in the readout ASICs. The approaches on how the detector systems cope with the demands of high luminosity operation while maintaining excellent performance through hardware upgrades, software and firmware algorithms, and operational settings, are presented.

[sup 99m]Tc-RBC subtraction scintigraphy; Assessmet of bleeding site and rate

Energy Technology Data Exchange (ETDEWEB)

Inagaki, Syoichi; Tonami, Syuichi; Yasui, Masakazu; Kuranishi, Makoto; Sugishita, Kouki; Nakamura, Mamoru (Toyama Medical and Pharmaceutical Univ. (Japan). Hospital)

1994-03-01

Sequential abdominal scintigrams with [sup 99m]Tc-labelled red blood cells (RBC) were subtracted for observing a site of gastrointestinal bleeding and calculating the bleeding rate. This method is technically very easy and can detect the site of bleeding with the minimum rate, as low as 0.2 ml/min., in a phantom experiment. In 23 cases with final diagnosis of gastrointestinal bleeding, conventional non-subtraction scintigraphy detected only 30% (7/23), but subtraction scintigraphy detected 61% (14/23). It was concluded that subtraction scintigraphy had higher sensitivity than conventional scintigraphy for early diagnosing bleeding. A combination of non-subtraction and subtraction scintigraphy is recommended to detect a site of gastrointestinal bleeding in a clinical setting. (author).

Local Competition-Based Superpixel Segmentation Algorithm in Remote Sensing

Directory of Open Access Journals (Sweden)

Jiayin Liu

2017-06-01

Full Text Available Remote sensing technologies have been widely applied in urban environments’ monitoring, synthesis and modeling. Incorporating spatial information in perceptually coherent regions, superpixel-based approaches can effectively eliminate the “salt and pepper” phenomenon which is common in pixel-wise approaches. Compared with fixed-size windows, superpixels have adaptive sizes and shapes for different spatial structures. Moreover, superpixel-based algorithms can significantly improve computational efficiency owing to the greatly reduced number of image primitives. Hence, the superpixel algorithm, as a preprocessing technique, is more and more popularly used in remote sensing and many other fields. In this paper, we propose a superpixel segmentation algorithm called Superpixel Segmentation with Local Competition (SSLC, which utilizes a local competition mechanism to construct energy terms and label pixels. The local competition mechanism leads to energy terms locality and relativity, and thus, the proposed algorithm is less sensitive to the diversity of image content and scene layout. Consequently, SSLC could achieve consistent performance in different image regions. In addition, the Probability Density Function (PDF, which is estimated by Kernel Density Estimation (KDE with the Gaussian kernel, is introduced to describe the color distribution of superpixels as a more sophisticated and accurate measure. To reduce computational complexity, a boundary optimization framework is introduced to only handle boundary pixels instead of the whole image. We conduct experiments to benchmark the proposed algorithm with the other state-of-the-art ones on the Berkeley Segmentation Dataset (BSD and remote sensing images. Results demonstrate that the SSLC algorithm yields the best overall performance, while the computation time-efficiency is still competitive.

The reduction of motion artifacts in digital subtraction angiography by geometrical image transformation

International Nuclear Information System (INIS)

Fitzpatrick, J.M.; Pickens, D.R.; Mandava, V.R.; Grefenstette, J.J.

1988-01-01

In the diagnosis of arteriosclerosis, radio-opaque dye is injected into the interior of the arteries to make them visible. Because of its increased contrast sensitivity, digital subtraction angiography has the potential for providing diagnostic images of arteries with reduced dye volumes. In the conventional technique, a mask image, acquired before the introduction of the dye, is subtracted from the contrast image, acquired after the dye is introduced, to produce a difference image in which only the dye in the arteries is visible. The usefulness of this technique has been severely limited by the image degradation caused by patient motion during image acquisition. This motion produces artifacts in the difference image that obscure the arteries. One technique for dealing with the problem is to reduce the degradation by means of image registration. The registration is carried out by means of a geometrical transformation of the mask image before subtraction so that it is in registration with the contrast image. This paper describes a technique for determining an optimal transformation. The authors employ a one-to-one elastic mapping and the Jacobian of that mapping to produce a geometrical image transformation. They choose a parameterized class of such mappings and use a heuristic search algorithm to optimize the parameters to minimize the severity of the motion artifacts. To increase the speed of the optimization process they use a statistical image comparison technique that provides a quick approximate evaluation of each image transformation. They present the experimental results of the application of their registration system to mask-contrast pairs, for images acquired from a specially designed phantom, and for clinical images

The study of myocardial ischemic quality with weighted-subtraction-bull's-eye analysis

International Nuclear Information System (INIS)

Chen Wuduan; Tian Jiahe; Hou Qingtian

1993-01-01

Weighted-Subtraction-Bull's-eye analysis was studied in 33 normal subjects and 58 patients with coronary artery disease after dipyridamole 99m Tc-MIBI myocardial SPECT imaging. Two kinds of Bull's-eye were produced: (1) subtract rest from 1.2 times dipyridamole from 1.2 times rest Bull's-eye; (2) subtract dipyridamole Bull's-eye. The results showed that the weighted-subtraction-Bull's-eye could clearly displayed the location and puality of ischemic myocardium. And also 74% segments showed so called combined ischemic i.e the blood perfusion reduced, increased and sustained simultaneously after dipyridamole. Therefore weighted-subtraction-Bull's-eye analysis had provided a new method for determination of the quality of ischemia

A supervised contextual classifier based on a region-growth algorithm

DEFF Research Database (Denmark)

Lira, Jorge; Maletti, Gabriela Mariel

2002-01-01

A supervised classification scheme to segment optical multi-spectral images has been developed. In this classifier, an automated region-growth algorithm delineates the training sets. This algorithm handles three parameters: an initial pixel seed, a window size and a threshold for each class. A su...

Exploring New Clustering Algorithms for the CMS Tracker FED

CERN Document Server

Gamboa Alvarado, Jose Leandro

2013-01-01

In the current Front End (FE) firmware clusters of hits within the APV frames are found using a simple threshold comparison (which is made between the data and a 3 or 5 sigma strip noise cut) on reordered pedestal and Common Mode (CM) noise subtracted data. In addition the CM noise subtraction requires the baseline of each APV frame to be approximately uniform. Therefore, the current algorithm will fail if the APV baseline exhibits large-scale non-uniform behavior. Under very high luminosity conditions the assumption of a uniform APV baseline breaks down and the FED is unable to maintain a high efficiency of cluster finding. \

Digital subtraction cardiopulmonary angiography using FCR (Fuji computed radiography)

International Nuclear Information System (INIS)

Tanimura, Shigeo; Tomoyasu, Hiroshi; Banba, Jiro; Masaki, Mikio; Kanno, Yukio; Abe, Kazuo

1987-01-01

Digital subtraction cardiopulmonary angiography using FCR was performed on 46 patients including lung cancer, mediastinal tumor, giant bullous formation and others. The images of digital subtraction for pulmonary artery, pulmonary vein and thoracic aorta were studied by comparing to the conventional pulmonary angiogram. Good images of pulmonary artery due to digital subtraction were obtained in 80 % of the 45 cases. This method needed only half volume of contrast media compared to the conventional for obtaining good images and thus reduced side effect. Therefore this method seems to be an usefull pre-operative examination in various chest diseases, especially in case of lung cancer. (author)

A new method to improve multiplication factor in micro-pixel avalanche photodiodes with high pixel density

Energy Technology Data Exchange (ETDEWEB)

Sadygov, Z. [National Nuclear Research Center, Baku (Azerbaijan); Joint Institute for Nuclear Research, Dubna (Russian Federation); Ahmadov, F. [National Nuclear Research Center, Baku (Azerbaijan); Khorev, S. [Zecotek Photonics Inc., Vancouver (Canada); Sadigov, A., E-mail: saazik@yandex.ru [National Nuclear Research Center, Baku (Azerbaijan); Suleymanov, S. [National Nuclear Research Center, Baku (Azerbaijan); Madatov, R.; Mehdiyeva, R. [Institute of Radiation Problems, Baku (Azerbaijan); Zerrouk, F. [Zecotek Photonics Inc., Vancouver (Canada)

2016-07-11

Presented is a new model describing development of the avalanche process in time, taking into account the dynamics of electric field within the depleted region of the diode and the effect of parasitic capacitance shunting individual quenching micro-resistors on device parameters. Simulations show that the effective capacitance of a single pixel, which defines the multiplication factor, is the sum of the pixel capacitance and a parasitic capacitance shunting its quenching micro-resistor. Conclusions obtained as a result of modeling open possibilities of improving the pixel gain in micropixel avalanche photodiodes with high pixel density (or low pixel capacitance).

Modified SURF Algorithm Implementation on FPGA For Real-Time Object Tracking

Directory of Open Access Journals (Sweden)

Tomyslav Sledevič

2013-05-01

Full Text Available The paper describes the FPGA-based implementation of the modified speeded-up robust features (SURF algorithm. FPGA was selected for parallel process implementation using VHDL to ensure features extraction in real-time. A sliding 84×84 size window was used to store integral pixels and accelerate Hessian determinant calculation, orientation assignment and descriptor estimation. The local extreme searching was used to find point of interest in 8 scales. The simplified descriptor and orientation vector were calculated in parallel in 6 scales. The algorithm was investigated by tracking marker and drawing a plane or cube. All parts of algorithm worked on 25 MHz clock. The video stream was generated using 60 fps and 640×480 pixel camera.Article in Lithuanian

N-jettiness Subtractions for NNLO QCD calculations

International Nuclear Information System (INIS)

Gaunt, Jonathan R.; Stahlhofen, Maximilian; Tackmann, Frank J.; Walsh, Jonathan R.; California Univ., CA

2015-05-01

We present a subtraction method utilizing the N-jettiness observable, Τ N , to perform QCD calculations for arbitrary processes at next-to-next-to-leading order (NNLO). Our method employs soft-collinear effective theory (SCET) to determine the IR singular contributions of N-jet cross sections for Τ N → 0, and uses these to construct suitable Τ N -subtractions. The construction is systematic and economic, due to being based on a physical observable. The resulting NNLO calculation is fully differential and in a form directly suitable for combining with resummation and parton showers. We explain in detail the application to processes with an arbitrary number of massless partons at lepton and hadron colliders together with the required external inputs in the form of QCD amplitudes and lower-order calculations. We provide explicit expressions for the Τ N -subtractions at NLO and NNLO. The required ingredients are fully known at NLO, and at NNLO for processes with two external QCD partons. The remaining NNLO ingredient for three or more external partons can be obtained numerically with existing NNLO techniques. As an example, we employ our method to obtain the NNLO rapidity spectrum for Drell-Yan and gluon-fusion Higgs production. We discuss aspects of numerical accuracy and convergence and the practical implementation. We also discuss and comment on possible extensions, such as more-differential subtractions, necessary steps for going to N 3 LO, and the treatment of massive quarks.

Value of blood-pool subtraction in cardiac indium-111-labeled platelet imaging

Energy Technology Data Exchange (ETDEWEB)

Machac, J.; Vallabhajosula, S.; Goldman, M.E.; Goldsmith, S.J.; Palestro, C.; Strashun, A.; Vaquer, R.; Phillips, R.A.; Fuster, V. (Mt. Sinai Medical Center, New York, NY (USA))

1989-09-01

Blood-pool subtraction has been proposed to enhance {sup 111}In-labeled platelet imaging of intracardiac thrombi. We tested the accuracy of labeled platelet imaging, with and without blood-pool subtraction, in ten subjects with cardiac thrombi of varying age, eight with endocarditis being treated with antimicrobial therapy and ten normal controls. Imaging was performed early after labeled platelet injection (24 hr or less) and late (48 hr or more). Blood-pool subtraction was carried out. All images were graded subjectively by four experienced, blinded readers. Detection accuracy was measured by the sensitivity at three fixed levels of specificity estimated from receiver operator characteristic curve analysis and tested by three-way analysis of variance. Detection accuracy was generally improved on delayed images. Blood-pool subtraction did not improve accuracy. Although blood-pool subtraction increased detection sensitivity, this was offset by decreased specificity. For this population studied, blood-pool subtraction did not improve subjective detection of abnormal platelet deposition by 111In platelet imaging.

Value of blood-pool subtraction in cardiac indium-111-labeled platelet imaging

International Nuclear Information System (INIS)

Machac, J.; Vallabhajosula, S.; Goldman, M.E.; Goldsmith, S.J.; Palestro, C.; Strashun, A.; Vaquer, R.; Phillips, R.A.; Fuster, V.

1989-01-01

Blood-pool subtraction has been proposed to enhance 111 In-labeled platelet imaging of intracardiac thrombi. We tested the accuracy of labeled platelet imaging, with and without blood-pool subtraction, in ten subjects with cardiac thrombi of varying age, eight with endocarditis being treated with antimicrobial therapy and ten normal controls. Imaging was performed early after labeled platelet injection (24 hr or less) and late (48 hr or more). Blood-pool subtraction was carried out. All images were graded subjectively by four experienced, blinded readers. Detection accuracy was measured by the sensitivity at three fixed levels of specificity estimated from receiver operator characteristic curve analysis and tested by three-way analysis of variance. Detection accuracy was generally improved on delayed images. Blood-pool subtraction did not improve accuracy. Although blood-pool subtraction increased detection sensitivity, this was offset by decreased specificity. For this population studied, blood-pool subtraction did not improve subjective detection of abnormal platelet deposition by 111In platelet imaging

Research on Geometric Positioning Algorithm of License Plate in Multidimensional Parameter Space

Directory of Open Access Journals (Sweden)

Yinhua Huan

2014-05-01

Full Text Available Considering features of vehicle license plate location method which commonly used, in order to search a consistent location for reference images with license plates feature in multidimensional parameter space, a new algorithm of geometric location is proposed. Geometric location algorithm main include model training and real time search. Which not only adapt the gray-scale linearity and the gray non-linear changes, but also support changes of scale and angle. Compared with the mainstream locating software, numerical results shows under the same test conditions that the position deviation of geometric positioning algorithm is less than 0.5 pixel. Without taking into account the multidimensional parameter space, Geometric positioning algorithm position deviation is less than 1.0 pixel and angle deviation is less than 1.0 degree taking into account the multidimensional parameter space. This algorithm is robust, simple, practical and is better than the traditional method.

Infrared Thermography Approach for Effective Shielding Area of Field Smoke Based on Background Subtraction and Transmittance Interpolation.

Science.gov (United States)

Tang, Runze; Zhang, Tonglai; Chen, Yongpeng; Liang, Hao; Li, Bingyang; Zhou, Zunning

2018-05-06

Effective shielding area is a crucial indicator for the evaluation of the infrared smoke-obscuring effectiveness on the battlefield. The conventional methods for assessing the shielding area of the smoke screen are time-consuming and labor intensive, in addition to lacking precision. Therefore, an efficient and convincing technique for testing the effective shielding area of the smoke screen has great potential benefits in the smoke screen applications in the field trial. In this study, a thermal infrared sensor with a mid-wavelength infrared (MWIR) range of 3 to 5 μm was first used to capture the target scene images through clear as well as obscuring smoke, at regular intervals. The background subtraction in motion detection was then applied to obtain the contour of the smoke cloud at each frame. The smoke transmittance at each pixel within the smoke contour was interpolated based on the data that was collected from the image. Finally, the smoke effective shielding area was calculated, based on the accumulation of the effective shielding pixel points. One advantage of this approach is that it utilizes only one thermal infrared sensor without any other additional equipment in the field trial, which significantly contributes to the efficiency and its convenience. Experiments have been carried out to demonstrate that this approach can determine the effective shielding area of the field infrared smoke both practically and efficiently.

Infrared Thermography Approach for Effective Shielding Area of Field Smoke Based on Background Subtraction and Transmittance Interpolation

Directory of Open Access Journals (Sweden)

Runze Tang

2018-05-01

Full Text Available Effective shielding area is a crucial indicator for the evaluation of the infrared smoke-obscuring effectiveness on the battlefield. The conventional methods for assessing the shielding area of the smoke screen are time-consuming and labor intensive, in addition to lacking precision. Therefore, an efficient and convincing technique for testing the effective shielding area of the smoke screen has great potential benefits in the smoke screen applications in the field trial. In this study, a thermal infrared sensor with a mid-wavelength infrared (MWIR range of 3 to 5 μm was first used to capture the target scene images through clear as well as obscuring smoke, at regular intervals. The background subtraction in motion detection was then applied to obtain the contour of the smoke cloud at each frame. The smoke transmittance at each pixel within the smoke contour was interpolated based on the data that was collected from the image. Finally, the smoke effective shielding area was calculated, based on the accumulation of the effective shielding pixel points. One advantage of this approach is that it utilizes only one thermal infrared sensor without any other additional equipment in the field trial, which significantly contributes to the efficiency and its convenience. Experiments have been carried out to demonstrate that this approach can determine the effective shielding area of the field infrared smoke both practically and efficiently.

Ictal cerebral perfusion patterns in partial epilepsy: SPECT subtraction

International Nuclear Information System (INIS)

Lee, Hyang Woon; Hong, Seung Bong; Tae, Woo Suk; Kim, Sang Eun; Seo, Dae Won; Jeong, Seung Cheol; Yi, Ji Young; Hong, Seung Chyul

2000-01-01

To investigate the various ictal perfusion patterns and find the relationships between clinical factors and different perfusion patterns. Interictal and ictal SPECT and SPECT subtraction were performed in 61 patients with partial epilepsy. Both positive images showing ictal hyperperfusion and negative images revealing ictal hypoperfusion were obtained by SPECT subtraction. The ictal perfusion patterns of subtracted SPECT were classified into focal hyperperfusion, hyperperfusion-plus, combined hyperperfusion-hypoperfusion, and focal hypoperfusion only. The concordance rates with epileptic focus were 91.8% in combined analysis of ictal hyperperfusion and hypoperfusion images of subtracted SPECT, 85.2% in hyperperfusion images only of subtracted SPECT, and 68.9% in conventional ictal SPECT analysis. Ictal hypoperfusion occurred less frequently in temporal lobe epilepsy (TLE) than extratemporal lobe epilepsy. Mesial temporal hyperperfusion alone was seen only in mesial TLE while lateral temporal hyperperfusion alone was observed only in neocortical TLE. Hippocampal sclerosis had much lower incidence of ictal hypoperfusion than any other pathology. Some patients showed ictal hypoperfusion at epileptic focus with ictal hyperperfusion in the neighboring brain regions where ictal discharges propagated. Hypoperfusion as well as hyperperfusion in ictal SPECT should be considered for localizing epileptic focus. Although the mechanism of ictal hypoperfusion could be an intra-ictal early exhaustion of seizure focus or a steal phenomenon by the propagation of ictal discharges to adjacent brain areas, further study is needed to elucidate it.=20

Ictal cerebral perfusion patterns in partial epilepsy: SPECT subtraction

Energy Technology Data Exchange (ETDEWEB)

Lee, Hyang Woon; Hong, Seung Bong; Tae, Woo Suk; Kim, Sang Eun; Seo, Dae Won; Jeong, Seung Cheol; Yi, Ji Young; Hong, Seung Chyul [Sungkyunkwan Univ. School of Medicine, Seoul (Korea, Republic of)

2000-06-01

To investigate the various ictal perfusion patterns and find the relationships between clinical factors and different perfusion patterns. Interictal and ictal SPECT and SPECT subtraction were performed in 61 patients with partial epilepsy. Both positive images showing ictal hyperperfusion and negative images revealing ictal hypoperfusion were obtained by SPECT subtraction. The ictal perfusion patterns of subtracted SPECT were classified into focal hyperperfusion, hyperperfusion-plus, combined hyperperfusion-hypoperfusion, and focal hypoperfusion only. The concordance rates with epileptic focus were 91.8% in combined analysis of ictal hyperperfusion and hypoperfusion images of subtracted SPECT, 85.2% in hyperperfusion images only of subtracted SPECT, and 68.9% in conventional ictal SPECT analysis. Ictal hypoperfusion occurred less frequently in temporal lobe epilepsy (TLE) than extratemporal lobe epilepsy. Mesial temporal hyperperfusion alone was seen only in mesial TLE while lateral temporal hyperperfusion alone was observed only in neocortical TLE. Hippocampal sclerosis had much lower incidence of ictal hypoperfusion than any other pathology. Some patients showed ictal hypoperfusion at epileptic focus with ictal hyperperfusion in the neighboring brain regions where ictal discharges propagated. Hypoperfusion as well as hyperperfusion in ictal SPECT should be considered for localizing epileptic focus. Although the mechanism of ictal hypoperfusion could be an intra-ictal early exhaustion of seizure focus or a steal phenomenon by the propagation of ictal discharges to adjacent brain areas, further study is needed to elucidate it.

Assessment of illumination conditions in a single-pixel imaging configuration

Science.gov (United States)

Garoi, Florin; Udrea, Cristian; Damian, Cristian; Logofǎtu, Petre C.; Colţuc, Daniela

2016-12-01

Single-pixel imaging based on multiplexing is a promising technique, especially in applications where 2D detectors or raster scanning imaging are not readily applicable. With this method, Hadamard masks are projected on a spatial light modulator to encode an incident scene and a signal is recorded at the photodiode detector for each of these masks. Ultimately, the image is reconstructed on the computer by applying the inverse transform matrix. Thus, various algorithms were optimized and several spatial light modulators already characterized for such a task. This work analyses the imaging quality of such a single-pixel arrangement, when various illumination conditions are used. More precisely, the main comparison is made between coherent and incoherent ("white light") illumination and between two multiplexing methods, namely Hadamard and Scanning. The quality of the images is assessed by calculating their SNR, using two relations. The results show better images are obtained with "white light" illumination for the first method and coherent one for the second.

Digital subtraction imaging in cardiac investigations

International Nuclear Information System (INIS)

Partridge, J.B.; Dickinson, D.F.

1984-01-01

The role of digital subtraction imaging (DSI) in the investigation of heart disease in patients of all ages, including neonates, was evaluated by the addition of a continuous fluoroscopy system to an existing, single-plane catheterisation laboratory. In some situations, DSI provided diagnostic images where conventional radiography could not and, in general, provided images of comparable quality to cineangiography. The total dose of contrast medium was usually less than that which would have been required for biplane cineangiography and the dose of radiation was always less. Digital subtraction imaging can make a significant contribution to the investigation of congenital heart disease and has some useful features in the study of acquired heart disease. (author)

Clinical evaluation of bone-subtraction CT angiography (BSCTA) in head and neck imaging

International Nuclear Information System (INIS)

Lell, M.; Anders, K.; Bautz, W.; Klotz, E.; Ditt, H.; Tomandl, B.F.

2006-01-01

Fifty-one patients were examined with bone subtraction CT angiography (BSCTA). Data were acquired on 4-and 64-slice spiral CT systems. The post-processing method is based on fully automatic registration of non-enhanced and contrast-enhanced CT data and subsequent selective bone removal. Vascular structures and brain tissue are retained with the original CTA noise level. Image quality and delineation of the pathologic process were assessed and artifacts introduced by the bone removal process recorded. The bone subtraction algorithm worked successfully in all examinations. The processing time was 6 min on average. Image quality was rated excellent in 20 (39%), good in 26 (51%) and acceptable in 5 (10%) patients. Ophthalmic arteries were visible in 12 (24%) patients bilaterally, in 13 (25%) patients unilaterally and in 26 (51%) patients at least at the origin. BSCTA improved visualization of the infraclinoid ICA and the vertebral arteries. The depiction of stenosis of the extracranial ICA and supraclinoid aneurysms was not significantly improved. In patients with suspicion of sinus thrombosis, BSCTA and conventional CTA yielded similar results. To conclude, BSCTA improves the visualization of vessels with close contact to bone and can improve the diagnostic accuracy and therapy planning of infraclinoid aneurysms. (orig.)

Improving sub-pixel imperviousness change prediction by ensembling heterogeneous non-linear regression models

Science.gov (United States)

Drzewiecki, Wojciech

2016-12-01

In this work nine non-linear regression models were compared for sub-pixel impervious surface area mapping from Landsat images. The comparison was done in three study areas both for accuracy of imperviousness coverage evaluation in individual points in time and accuracy of imperviousness change assessment. The performance of individual machine learning algorithms (Cubist, Random Forest, stochastic gradient boosting of regression trees, k-nearest neighbors regression, random k-nearest neighbors regression, Multivariate Adaptive Regression Splines, averaged neural networks, and support vector machines with polynomial and radial kernels) was also compared with the performance of heterogeneous model ensembles constructed from the best models trained using particular techniques. The results proved that in case of sub-pixel evaluation the most accurate prediction of change may not necessarily be based on the most accurate individual assessments. When single methods are considered, based on obtained results Cubist algorithm may be advised for Landsat based mapping of imperviousness for single dates. However, Random Forest may be endorsed when the most reliable evaluation of imperviousness change is the primary goal. It gave lower accuracies for individual assessments, but better prediction of change due to more correlated errors of individual predictions. Heterogeneous model ensembles performed for individual time points assessments at least as well as the best individual models. In case of imperviousness change assessment the ensembles always outperformed single model approaches. It means that it is possible to improve the accuracy of sub-pixel imperviousness change assessment using ensembles of heterogeneous non-linear regression models.

AutoDipole - Automated generation of dipole subtraction terms

International Nuclear Information System (INIS)

Hasegawa, K.; Uwer, P.

2009-11-01

We present an automated generation of the subtraction terms for next-to-leading order QCD calculations in the Catani-Seymour dipole formalism. For a given scattering process with n external particles our Mathematica package generates all dipole terms, allowing for bothmassless and massive dipoles. The numerical evaluation of the subtraction terms proceeds with MadGraph, which provides Fortran code for the necessary scattering amplitudes. Checks of the numerical stability are discussed. (orig.)

AutoDipole - Automated generation of dipole subtraction terms

Energy Technology Data Exchange (ETDEWEB)

Hasegawa, K.; Uwer, P. [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; Moch, S. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)

2009-11-15

We present an automated generation of the subtraction terms for next-to-leading order QCD calculations in the Catani-Seymour dipole formalism. For a given scattering process with n external particles our Mathematica package generates all dipole terms, allowing for bothmassless and massive dipoles. The numerical evaluation of the subtraction terms proceeds with MadGraph, which provides Fortran code for the necessary scattering amplitudes. Checks of the numerical stability are discussed. (orig.)

A fast image encryption algorithm based on chaotic map

Science.gov (United States)

Liu, Wenhao; Sun, Kehui; Zhu, Congxu

2016-09-01

Derived from Sine map and iterative chaotic map with infinite collapse (ICMIC), a new two-dimensional Sine ICMIC modulation map (2D-SIMM) is proposed based on a close-loop modulation coupling (CMC) model, and its chaotic performance is analyzed by means of phase diagram, Lyapunov exponent spectrum and complexity. It shows that this map has good ergodicity, hyperchaotic behavior, large maximum Lyapunov exponent and high complexity. Based on this map, a fast image encryption algorithm is proposed. In this algorithm, the confusion and diffusion processes are combined for one stage. Chaotic shift transform (CST) is proposed to efficiently change the image pixel positions, and the row and column substitutions are applied to scramble the pixel values simultaneously. The simulation and analysis results show that this algorithm has high security, low time complexity, and the abilities of resisting statistical analysis, differential, brute-force, known-plaintext and chosen-plaintext attacks.

The Design and Implementation in $0.13\\mu m$ CMOS of an Algorithm Permitting Spectroscopic Imaging with High Spatial Resolution for Hybrid Pixel Detectors

CERN Document Server

Ballabriga, Rafael; Vilasís-Cardona, Xavier

2009-01-01

Advances in pixel detector technology are opening up new possibilities in many fields of science. Modern High Energy Physics (HEP) experiments use pixel detectors in tracking systems where excellent spatial resolution, precise timing and high signal-to-noise ratio are required for accurate and clean track reconstruction. Many groups are working worldwide to adapt the hybrid pixel technology to other fields such as medical X-ray radiography, protein structure analysis or neutron imaging. The Medipix3 chip is a 256x256 channel hybrid pixel detector readout chip working in Single Photon Counting Mode. It has been developed with a new front-end architecture aimed at eliminating the spectral distortion produced by charge diffusion in highly segmented semiconductor detectors. In the new architecture neighbouring pixels communicate with one another. Charges can be summed event-by-event and the incoming quantum can be assigned as a single hit to the pixel with the biggest charge deposit. In the case where incoming X-...

Spatial clustering of pixels of a multispectral image

Science.gov (United States)

Conger, James Lynn

2014-08-19

A method and system for clustering the pixels of a multispectral image is provided. A clustering system computes a maximum spectral similarity score for each pixel that indicates the similarity between that pixel and the most similar neighboring. To determine the maximum similarity score for a pixel, the clustering system generates a similarity score between that pixel and each of its neighboring pixels and then selects the similarity score that represents the highest similarity as the maximum similarity score. The clustering system may apply a filtering criterion based on the maximum similarity score so that pixels with similarity scores below a minimum threshold are not clustered. The clustering system changes the current pixel values of the pixels in a cluster based on an averaging of the original pixel values of the pixels in the cluster.

SU-E-T-33: A Feasibility-Seeking Algorithm Applied to Planning of Intensity Modulated Proton Therapy: A Proof of Principle Study

International Nuclear Information System (INIS)

Penfold, S; Casiraghi, M; Dou, T; Schulte, R; Censor, Y

2015-01-01

Purpose: To investigate the applicability of feasibility-seeking cyclic orthogonal projections to the field of intensity modulated proton therapy (IMPT) inverse planning. Feasibility of constraints only, as opposed to optimization of a merit function, is less demanding algorithmically and holds a promise of parallel computations capability with non-cyclic orthogonal projections algorithms such as string-averaging or block-iterative strategies. Methods: A virtual 2D geometry was designed containing a C-shaped planning target volume (PTV) surrounding an organ at risk (OAR). The geometry was pixelized into 1 mm pixels. Four beams containing a subset of proton pencil beams were simulated in Geant4 to provide the system matrix A whose elements a-ij correspond to the dose delivered to pixel i by a unit intensity pencil beam j. A cyclic orthogonal projections algorithm was applied with the goal of finding a pencil beam intensity distribution that would meet the following dose requirements: D-OAR < 54 Gy and 57 Gy < D-PTV < 64.2 Gy. The cyclic algorithm was based on the concept of orthogonal projections onto half-spaces according to the Agmon-Motzkin-Schoenberg algorithm, also known as ‘ART for inequalities’. Results: The cyclic orthogonal projections algorithm resulted in less than 5% of the PTV pixels and less than 1% of OAR pixels violating their dose constraints, respectively. Because of the abutting OAR-PTV geometry and the realistic modelling of the pencil beam penumbra, complete satisfaction of the dose objectives was not achieved, although this would be a clinically acceptable plan for a meningioma abutting the brainstem, for example. Conclusion: The cyclic orthogonal projections algorithm was demonstrated to be an effective tool for inverse IMPT planning in the 2D test geometry described. We plan to further develop this linear algorithm to be capable of incorporating dose-volume constraints into the feasibility-seeking algorithm

Research on remote sensing image pixel attribute data acquisition method in AutoCAD

Science.gov (United States)

Liu, Xiaoyang; Sun, Guangtong; Liu, Jun; Liu, Hui

2013-07-01

The remote sensing image has been widely used in AutoCAD, but AutoCAD lack of the function of remote sensing image processing. In the paper, ObjectARX was used for the secondary development tool, combined with the Image Engine SDK to realize remote sensing image pixel attribute data acquisition in AutoCAD, which provides critical technical support for AutoCAD environment remote sensing image processing algorithms.

Monte Carlo simulation for pixel detectors: a feasibility study for X radiation applications

International Nuclear Information System (INIS)

Marinho, F.; Akiba, K.

2014-01-01

In this paper we analyze the feasibility of a Monte Carlo simulation for the description of pixel semiconductor detectors as a tool for research and development of such devices and their applications for X-rays. We present as a result the technical aspects and main characteristics of a set of algorithms recently developed which allows one to estimate the energy spectrum and cluster classification. (author)

Analysis of pixel systematics and space point reconstruction with DEPFET PXD5 matrices using high energy beam test data

Energy Technology Data Exchange (ETDEWEB)

Reuen, Lars

2011-02-15

To answer the current questions in particle physics vertex-detectors, the innermost sub-detector system of a multipurpose particle detector, with brilliant spatial resolution and at the same time with as little sensor material as possible are mandatory. These requirements are the driving force behind the newest generation of silicon pixel sensors like the DEPFET pixel, which incorporates the first amplification stage in form of a transistor in the fully depleted sensor bulk, allowing for a high spatial resolution even with thinned down sensors. A DEPFET pixel prototype system, build for the future TeV-scale liner collider ILC, was characterized in a high energy beam test at CERN with a spatial resolution and statistics that allowed for the first time in-pixel homogeneity measurements of DEPFET pixels. Yet, in the quest for higher precision the sensor development must be accompanied by progress in position reconstruction algorithms. A study with three novel approaches in position reconstruction was undertaken. The results of the in-pixel beam test and the performance of the new methods with an emphasis on {delta}-electrons will be presented here. (orig.)

Analysis of pixel systematics and space point reconstruction with DEPFET PXD5 matrices using high energy beam test data

International Nuclear Information System (INIS)

Reuen, Lars

2011-02-01

To answer the current questions in particle physics vertex-detectors, the innermost sub-detector system of a multipurpose particle detector, with brilliant spatial resolution and at the same time with as little sensor material as possible are mandatory. These requirements are the driving force behind the newest generation of silicon pixel sensors like the DEPFET pixel, which incorporates the first amplification stage in form of a transistor in the fully depleted sensor bulk, allowing for a high spatial resolution even with thinned down sensors. A DEPFET pixel prototype system, build for the future TeV-scale liner collider ILC, was characterized in a high energy beam test at CERN with a spatial resolution and statistics that allowed for the first time in-pixel homogeneity measurements of DEPFET pixels. Yet, in the quest for higher precision the sensor development must be accompanied by progress in position reconstruction algorithms. A study with three novel approaches in position reconstruction was undertaken. The results of the in-pixel beam test and the performance of the new methods with an emphasis on δ-electrons will be presented here. (orig.)

ECG-gating in non-cardiac digital subtraction angiography

International Nuclear Information System (INIS)

Gattoni, F.; Baldini, V.; Cairo, F.

1987-01-01

This paper reports the results of the ECG-gating in non-cardiac digital subtraction angiography (DSA). One hundred and fifteen patients underwent DSA (126 examinations); ECG-gating was applied in 66/126 examinations: images recorded at 70% of R wave were subtracted. Artifacts produced by vascular movements were evaluated in all patients: only 40 examinations, carried out whithout ECG-gating, showed vascular artifacts. The major advantage of the ECG-gated DSA is the more efficent subtraction because of the better images superimposition: therefore, ECG-gating can be clinically helpful. On the contrary, it could be a problem in arrhytmic or bradycardic patients. ECG-gating is helpful in DSA imaging of the thoracic and abdominal aorta and of the cervical and renal arteries. In the examinations of peripheral vessels of the limbs it is not so efficent as in the trunk or in the neck

A neural network clustering algorithm for the ATLAS silicon pixel detector

CERN Document Server

Aad, Georges; Abdallah, Jalal; Abdel Khalek, Samah; Abdinov, Ovsat; Aben, Rosemarie; Abi, Babak; Abolins, Maris; AbouZeid, Ossama; Abramowicz, Halina; Abreu, Henso; Abreu, Ricardo; Abulaiti, Yiming; Acharya, Bobby Samir; Adamczyk, Leszek; Adams, David; Adelman, Jahred; Adomeit, Stefanie; Adye, Tim; Agatonovic-Jovin, Tatjana; Aguilar-Saavedra, Juan Antonio; Agustoni, Marco; Ahlen, Steven; Ahmadov, Faig; Aielli, Giulio; Akerstedt, Henrik; Åkesson, Torsten Paul Ake; Akimoto, Ginga; Akimov, Andrei; Alberghi, Gian Luigi; Albert, Justin; Albrand, Solveig; Alconada Verzini, Maria Josefina; Aleksa, Martin; Aleksandrov, Igor; Alexa, Calin; Alexander, Gideon; Alexandre, Gauthier; Alexopoulos, Theodoros; Alhroob, Muhammad; Alimonti, Gianluca; Alio, Lion; Alison, John; Allbrooke, Benedict; Allison, Lee John; Allport, Phillip; Almond, John; Aloisio, Alberto; Alonso, Alejandro; Alonso, Francisco; Alpigiani, Cristiano; Altheimer, Andrew David; Alvarez Gonzalez, Barbara; Alviggi, Mariagrazia; Amako, Katsuya; Amaral Coutinho, Yara; Amelung, Christoph; Amidei, Dante; Amor Dos Santos, Susana Patricia; Amorim, Antonio; Amoroso, Simone; Amram, Nir; Amundsen, Glenn; Anastopoulos, Christos; Ancu, Lucian Stefan; Andari, Nansi; Andeen, Timothy; Anders, Christoph Falk; Anders, Gabriel; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Anduaga, Xabier; Angelidakis, Stylianos; Angelozzi, Ivan; Anger, Philipp; Angerami, Aaron; Anghinolfi, Francis; Anisenkov, Alexey; Anjos, Nuno; Annovi, Alberto; Antonaki, Ariadni; Antonelli, Mario; Antonov, Alexey; Antos, Jaroslav; Anulli, Fabio; Aoki, Masato; Aperio Bella, Ludovica; Apolle, Rudi; Arabidze, Giorgi; Aracena, Ignacio; Arai, Yasuo; Araque, Juan Pedro; Arce, Ayana; Arguin, Jean-Francois; Argyropoulos, Spyridon; Arik, Metin; Armbruster, Aaron James; Arnaez, Olivier; Arnal, Vanessa; Arnold, Hannah; Arratia, Miguel; Arslan, Ozan; Artamonov, Andrei; Artoni, Giacomo; Asai, Shoji; Asbah, Nedaa; Ashkenazi, Adi; Åsman, Barbro; Asquith, Lily; Assamagan, Ketevi; Astalos, Robert; Atkinson, Markus; Atlay, Naim Bora; Auerbach, Benjamin; Augsten, Kamil; Aurousseau, Mathieu; Avolio, Giuseppe; Azuelos, Georges; Azuma, Yuya; Baak, Max; Baas, Alessandra; Bacci, Cesare; Bachacou, Henri; Bachas, Konstantinos; Backes, Moritz; Backhaus, Malte; Backus Mayes, John; Badescu, Elisabeta; Bagiacchi, Paolo; Bagnaia, Paolo; Bai, Yu; Bain, Travis; Baines, John; Baker, Oliver Keith; Balek, Petr; Balli, Fabrice; Banas, Elzbieta; Banerjee, Swagato; Bannoura, Arwa A E; Bansal, Vikas; Bansil, Hardeep Singh; Barak, Liron; Baranov, Sergei; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Barillari, Teresa; Barisonzi, Marcello; Barklow, Timothy; Barlow, Nick; Barnett, Bruce; Barnett, Michael; Barnovska, Zuzana; Baroncelli, Antonio; Barone, Gaetano; Barr, Alan; Barreiro, Fernando; Barreiro Guimarães da Costa, João; Bartoldus, Rainer; Barton, Adam Edward; Bartos, Pavol; Bartsch, Valeria; Bassalat, Ahmed; Basye, Austin; Bates, Richard; Batkova, Lucia; Batley, Richard; Battaglia, Marco; Battistin, Michele; Bauer, Florian; Bawa, Harinder Singh; Beau, Tristan; Beauchemin, Pierre-Hugues; Beccherle, Roberto; Bechtle, Philip; Beck, Hans Peter; Becker, Anne Kathrin; Becker, Sebastian; Beckingham, Matthew; Becot, Cyril; Beddall, Andrew; Beddall, Ayda; Bedikian, Sourpouhi; Bednyakov, Vadim; Bee, Christopher; Beemster, Lars; Beermann, Thomas; Begel, Michael; Behr, Katharina; Belanger-Champagne, Camille; Bell, Paul; Bell, William; Bella, Gideon; Bellagamba, Lorenzo; Bellerive, Alain; Bellomo, Massimiliano; Belotskiy, Konstantin; Beltramello, Olga; Benary, Odette; Benchekroun, Driss; Bendtz, Katarina; Benekos, Nektarios; Benhammou, Yan; Benhar Noccioli, Eleonora; Benitez Garcia, Jorge-Armando; Benjamin, Douglas; Bensinger, James; Benslama, Kamal; Bentvelsen, Stan; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Berghaus, Frank; Beringer, Jürg; Bernard, Clare; Bernat, Pauline; Bernius, Catrin; Bernlochner, Florian Urs; Berry, Tracey; Berta, Peter; Bertella, Claudia; Bertoli, Gabriele; Bertolucci, Federico; Bertsche, David; Besana, Maria Ilaria; Besjes, Geert-Jan; Bessidskaia, Olga; Bessner, Martin Florian; Besson, Nathalie; Betancourt, Christopher; Bethke, Siegfried; Bhimji, Wahid; Bianchi, Riccardo-Maria; Bianchini, Louis; Bianco, Michele; Biebel, Otmar; Bieniek, Stephen Paul; Bierwagen, Katharina; Biesiada, Jed; Biglietti, Michela; Bilbao De Mendizabal, Javier; Bilokon, Halina; Bindi, Marcello; Binet, Sebastien; Bingul, Ahmet; Bini, Cesare; Black, Curtis; Black, James; Black, Kevin; Blackburn, Daniel; Blair, Robert; Blanchard, Jean-Baptiste; Blazek, Tomas; Bloch, Ingo; Blocker, Craig; Blum, Walter; Blumenschein, Ulrike; Bobbink, Gerjan; Bobrovnikov, Victor; Bocchetta, Simona Serena; Bocci, Andrea; Bock, Christopher; Boddy, Christopher Richard; Boehler, Michael; Boek, Thorsten Tobias; Bogaerts, Joannes Andreas; Bogdanchikov, Alexander; Bogouch, Andrei; Bohm, Christian; Bohm, Jan; Boisvert, Veronique; Bold, Tomasz; Boldea, Venera; Boldyrev, Alexey; Bomben, Marco; Bona, Marcella; Boonekamp, Maarten; Borisov, Anatoly; Borissov, Guennadi; Borri, Marcello; Borroni, Sara; Bortfeldt, Jonathan; Bortolotto, Valerio; Bos, Kors; Boscherini, Davide; Bosman, Martine; Boterenbrood, Hendrik; Boudreau, Joseph; Bouffard, Julian; Bouhova-Thacker, Evelina Vassileva; Boumediene, Djamel Eddine; Bourdarios, Claire; Bousson, Nicolas; Boutouil, Sara; Boveia, Antonio; Boyd, James; Boyko, Igor; Bracinik, Juraj; Brandt, Andrew; Brandt, Gerhard; Brandt, Oleg; Bratzler, Uwe; Brau, Benjamin; Brau, James; Braun, Helmut; Brazzale, Simone Federico; Brelier, Bertrand; Brendlinger, Kurt; Brennan, Amelia Jean; Brenner, Richard; Bressler, Shikma; Bristow, Kieran; Bristow, Timothy Michael; Britton, Dave; Brochu, Frederic; Brock, Ian; Brock, Raymond; Bromberg, Carl; Bronner, Johanna; Brooijmans, Gustaaf; Brooks, Timothy; Brooks, William; Brosamer, Jacquelyn; Brost, Elizabeth; Brown, Jonathan; Bruckman de Renstrom, Pawel; Bruncko, Dusan; Bruneliere, Renaud; Brunet, Sylvie; Bruni, Alessia; Bruni, Graziano; Bruschi, Marco; Bryngemark, Lene; Buanes, Trygve; Buat, Quentin; Bucci, Francesca; Buchholz, Peter; Buckingham, Ryan; Buckley, Andrew; Buda, Stelian Ioan; Budagov, Ioulian; Buehrer, Felix; Bugge, Lars; Bugge, Magnar Kopangen; Bulekov, Oleg; Bundock, Aaron Colin; Burckhart, Helfried; Burdin, Sergey; Burghgrave, Blake; Burke, Stephen; Burmeister, Ingo; Busato, Emmanuel; Büscher, Daniel; Büscher, Volker; Bussey, Peter; Buszello, Claus-Peter; Butler, Bart; Butler, John; Butt, Aatif Imtiaz; Buttar, Craig; Butterworth, Jonathan; Butti, Pierfrancesco; Buttinger, William; Buzatu, Adrian; Byszewski, Marcin; Cabrera Urbán, Susana; Caforio, Davide; Cakir, Orhan; Calafiura, Paolo; Calandri, Alessandro; Calderini, Giovanni; Calfayan, Philippe; Calkins, Robert; Caloba, Luiz; Calvet, David; Calvet, Samuel; Camacho Toro, Reina; Camarda, Stefano; Cameron, David; Caminada, Lea Michaela; Caminal Armadans, Roger; Campana, Simone; Campanelli, Mario; Campoverde, Angel; Canale, Vincenzo; Canepa, Anadi; Cano Bret, Marc; Cantero, Josu; Cantrill, Robert; Cao, Tingting; Capeans Garrido, Maria Del Mar; Caprini, Irinel; Caprini, Mihai; Capua, Marcella; Caputo, Regina; Cardarelli, Roberto; Carli, Tancredi; Carlino, Gianpaolo; Carminati, Leonardo; Caron, Sascha; Carquin, Edson; Carrillo-Montoya, German D; Carter, Janet; Carvalho, João; Casadei, Diego; Casado, Maria Pilar; Casolino, Mirkoantonio; Castaneda-Miranda, Elizabeth; Castelli, Angelantonio; Castillo Gimenez, Victoria; Castro, Nuno Filipe; Catastini, Pierluigi; Catinaccio, Andrea; Catmore, James; Cattai, Ariella; Cattani, Giordano; Caughron, Seth; Cavaliere, Viviana; Cavalli, Donatella; Cavalli-Sforza, Matteo; Cavasinni, Vincenzo; Ceradini, Filippo; Cerio, Benjamin; Cerny, Karel; Santiago Cerqueira, Augusto; Cerri, Alessandro; Cerrito, Lucio; Cerutti, Fabio; Cerv, Matevz; Cervelli, Alberto; Cetin, Serkant Ali; Chafaq, Aziz; Chakraborty, Dhiman; Chalupkova, Ina; Chang, Philip; Chapleau, Bertrand; Chapman, John Derek; Charfeddine, Driss; Charlton, Dave; Chau, Chav Chhiv; Chavez Barajas, Carlos Alberto; Cheatham, Susan; Chegwidden, Andrew; Chekanov, Sergei; Chekulaev, Sergey; Chelkov, Gueorgui; Chelstowska, Magda Anna; Chen, Chunhui; Chen, Hucheng; Chen, Karen; Chen, Liming; Chen, Shenjian; Chen, Xin; Chen, Yujiao; Cheng, Hok Chuen; Cheng, Yangyang; Cheplakov, Alexander; Cherkaoui El Moursli, Rajaa; Chernyatin, Valeriy; Cheu, Elliott; Chevalier, Laurent; Chiarella, Vitaliano; Chiefari, Giovanni; Childers, John Taylor; Chilingarov, Alexandre; Chiodini, Gabriele; Chisholm, Andrew; Chislett, Rebecca Thalatta; Chitan, Adrian; Chizhov, Mihail; Chouridou, Sofia; Chow, Bonnie Kar Bo; Chromek-Burckhart, Doris; Chu, Ming-Lee; Chudoba, Jiri; Chwastowski, Janusz; Chytka, Ladislav; Ciapetti, Guido; Ciftci, Abbas Kenan; Ciftci, Rena; Cinca, Diane; Cindro, Vladimir; Ciocio, Alessandra; Cirkovic, Predrag; Citron, Zvi Hirsh; Citterio, Mauro; Ciubancan, Mihai; Clark, Allan G; Clark, Philip James; Clarke, Robert; Cleland, Bill; Clemens, Jean-Claude; Clement, Christophe; Coadou, Yann; Cobal, Marina; Coccaro, Andrea; Cochran, James H; Coffey, Laurel; Cogan, Joshua Godfrey; Coggeshall, James; Cole, Brian; Cole, Stephen; Colijn, Auke-Pieter; Collot, Johann; Colombo, Tommaso; Colon, German; Compostella, Gabriele; Conde Muiño, Patricia; Coniavitis, Elias; Conidi, Maria Chiara; Connell, Simon Henry; Connelly, Ian; Consonni, Sofia Maria; Consorti, Valerio; Constantinescu, Serban; Conta, Claudio; Conti, Geraldine; Conventi, Francesco; Cooke, Mark; Cooper, Ben; Cooper-Sarkar, Amanda; Cooper-Smith, Neil; Copic, Katherine; Cornelissen, Thijs; Corradi, Massimo; Corriveau, Francois; Corso-Radu, Alina; Cortes-Gonzalez, Arely; Cortiana, Giorgio; Costa, Giuseppe; Costa, María José; Costanzo, Davide; Côté, David; Cottin, Giovanna; Cowan, Glen; Cox, Brian; Cranmer, Kyle; Cree, Graham; Crépé-Renaudin, Sabine; Crescioli, Francesco; Cribbs, Wayne Allen; Crispin Ortuzar, Mireia; Cristinziani, Markus; Croft, Vince; Crosetti, Giovanni; Cuciuc, Constantin-Mihai; Cuhadar Donszelmann, Tulay; Cummings, Jane; Curatolo, Maria; Cuthbert, Cameron; Czirr, Hendrik; Czodrowski, Patrick; Czyczula, Zofia; D'Auria, Saverio; D'Onofrio, Monica; Da Cunha Sargedas De Sousa, Mario Jose; Da Via, Cinzia; Dabrowski, Wladyslaw; Dafinca, Alexandru; Dai, Tiesheng; Dale, Orjan; Dallaire, Frederick; Dallapiccola, Carlo; Dam, Mogens; Daniells, Andrew Christopher; Dano Hoffmann, Maria; Dao, Valerio; Darbo, Giovanni; Darmora, Smita; Dassoulas, James; Dattagupta, Aparajita; Davey, Will; David, Claire; Davidek, Tomas; Davies, Eleanor; Davies, Merlin; Davignon, Olivier; Davison, Adam; Davison, Peter; Davygora, Yuriy; Dawe, Edmund; Dawson, Ian; Daya-Ishmukhametova, Rozmin; De, Kaushik; de Asmundis, Riccardo; De Castro, Stefano; De Cecco, Sandro; De Groot, Nicolo; de Jong, Paul; De la Torre, Hector; De Lorenzi, Francesco; De Nooij, Lucie; De Pedis, Daniele; De Salvo, Alessandro; De Sanctis, Umberto; De Santo, Antonella; De Vivie De Regie, Jean-Baptiste; Dearnaley, William James; Debbe, Ramiro; Debenedetti, Chiara; Dechenaux, Benjamin; Dedovich, Dmitri; Deigaard, Ingrid; Del Peso, Jose; Del Prete, Tarcisio; Deliot, Frederic; Delitzsch, Chris Malena; Deliyergiyev, Maksym; Dell'Acqua, Andrea; Dell'Asta, Lidia; Dell'Orso, Mauro; Della Pietra, Massimo; della Volpe, Domenico; Delmastro, Marco; Delsart, Pierre-Antoine; Deluca, Carolina; Demers, Sarah; Demichev, Mikhail; Demilly, Aurelien; Denisov, Sergey; Derendarz, Dominik; Derkaoui, Jamal Eddine; Derue, Frederic; Dervan, Paul; Desch, Klaus Kurt; Deterre, Cecile; Deviveiros, Pier-Olivier; Dewhurst, Alastair; Dhaliwal, Saminder; Di Ciaccio, Anna; Di Ciaccio, Lucia; Di Domenico, Antonio; Di Donato, Camilla; Di Girolamo, Alessandro; Di Girolamo, Beniamino; Di Mattia, Alessandro; Di Micco, Biagio; Di Nardo, Roberto; Di Simone, Andrea; Di Sipio, Riccardo; Di Valentino, David; Dias, Flavia; Diaz, Marco Aurelio; Diehl, Edward; Dietrich, Janet; Dietzsch, Thorsten; Diglio, Sara; Dimitrievska, Aleksandra; Dingfelder, Jochen; Dionisi, Carlo; Dita, Petre; Dita, Sanda; Dittus, Fridolin; Djama, Fares; Djobava, Tamar; Barros do Vale, Maria Aline; Do Valle Wemans, André; Doan, Thi Kieu Oanh; Dobos, Daniel; Doglioni, Caterina; Doherty, Tom; Dohmae, Takeshi; Dolejsi, Jiri; Dolezal, Zdenek; Dolgoshein, Boris; Donadelli, Marisilvia; Donati, Simone; Dondero, Paolo; Donini, Julien; Dopke, Jens; Doria, Alessandra; Dova, Maria-Teresa; Doyle, Tony; Dris, Manolis; Dubbert, Jörg; Dube, Sourabh; Dubreuil, Emmanuelle; Duchovni, Ehud; Duckeck, Guenter; Ducu, Otilia Anamaria; Duda, Dominik; Dudarev, Alexey; Dudziak, Fanny; Duflot, Laurent; Duguid, Liam; Dührssen, Michael; Dunford, Monica; Duran Yildiz, Hatice; Düren, Michael; Durglishvili, Archil; Dwuznik, Michal; Dyndal, Mateusz; Ebke, Johannes; Edson, William; Edwards, Nicholas Charles; Ehrenfeld, Wolfgang; Eifert, Till; Eigen, Gerald; Einsweiler, Kevin; Ekelof, Tord; El Kacimi, Mohamed; Ellert, Mattias; Elles, Sabine; Ellinghaus, Frank; Ellis, Nicolas; Elmsheuser, Johannes; Elsing, Markus; Emeliyanov, Dmitry; Enari, Yuji; Endner, Oliver Chris; Endo, Masaki; Engelmann, Roderich; Erdmann, Johannes; Ereditato, Antonio; Eriksson, Daniel; Ernis, Gunar; Ernst, Jesse; Ernst, Michael; Ernwein, Jean; Errede, Deborah; Errede, Steven; Ertel, Eugen; Escalier, Marc; Esch, Hendrik; Escobar, Carlos; Esposito, Bellisario; Etienvre, Anne-Isabelle; Etzion, Erez; Evans, Hal; Ezhilov, Alexey; Fabbri, Laura; Facini, Gabriel; Fakhrutdinov, Rinat; Falciano, Speranza; Falla, Rebecca Jane; Faltova, Jana; Fang, Yaquan; Fanti, Marcello; Farbin, Amir; Farilla, Addolorata; Farooque, Trisha; Farrell, Steven; Farrington, Sinead; Farthouat, Philippe; Fassi, Farida; Fassnacht, Patrick; Fassouliotis, Dimitrios; Favareto, Andrea; Fayard, Louis; Federic, Pavol; Fedin, Oleg; Fedorko, Wojciech; Fehling-Kaschek, Mirjam; Feigl, Simon; Feligioni, Lorenzo; Feng, Cunfeng; Feng, Eric; Feng, Haolu; Fenyuk, Alexander; Fernandez Perez, Sonia; Ferrag, Samir; Ferrando, James; Ferrari, Arnaud; Ferrari, Pamela; Ferrari, Roberto; Ferreira de Lima, Danilo Enoque; Ferrer, Antonio; Ferrere, Didier; Ferretti, Claudio; Ferretto Parodi, Andrea; Fiascaris, Maria; Fiedler, Frank; Filipčič, Andrej; Filipuzzi, Marco; Filthaut, Frank; Fincke-Keeler, Margret; Finelli, Kevin Daniel; Fiolhais, Miguel; Fiorini, Luca; Firan, Ana; Fischer, Adam; Fischer, Julia; Fisher, Wade Cameron; Fitzgerald, Eric Andrew; Flechl, Martin; Fleck, Ivor; Fleischmann, Philipp; Fleischmann, Sebastian; Fletcher, Gareth Thomas; Fletcher, Gregory; Flick, Tobias; Floderus, Anders; Flores Castillo, Luis; Florez Bustos, Andres Carlos; Flowerdew, Michael; Formica, Andrea; Forti, Alessandra; Fortin, Dominique; Fournier, Daniel; Fox, Harald; Fracchia, Silvia; Francavilla, Paolo; Franchini, Matteo; Franchino, Silvia; Francis, David; Franklin, Melissa; Franz, Sebastien; Fraternali, Marco; French, Sky; Friedrich, Conrad; Friedrich, Felix; Froidevaux, Daniel; Frost, James; Fukunaga, Chikara; Fullana Torregrosa, Esteban; Fulsom, Bryan Gregory; Fuster, Juan; Gabaldon, Carolina; Gabizon, Ofir; Gabrielli, Alessandro; Gabrielli, Andrea; Gadatsch, Stefan; Gadomski, Szymon; Gagliardi, Guido; Gagnon, Pauline; Galea, Cristina; Galhardo, Bruno; Gallas, Elizabeth; Gallo, Valentina Santina; Gallop, Bruce; Gallus, Petr; Galster, Gorm Aske Gram Krohn; Gan, KK; Gandrajula, Reddy Pratap; Gao, Jun; Gao, Yongsheng; Garay Walls, Francisca; Garberson, Ford; García, Carmen; García Navarro, José Enrique; Garcia-Sciveres, Maurice; Gardner, Robert; Garelli, Nicoletta; Garonne, Vincent; Gatti, Claudio; Gaudio, Gabriella; Gaur, Bakul; Gauthier, Lea; Gauzzi, Paolo; Gavrilenko, Igor; Gay, Colin; Gaycken, Goetz; Gazis, Evangelos; Ge, Peng; Gecse, Zoltan; Gee, Norman; Geerts, Daniël Alphonsus Adrianus; Geich-Gimbel, Christoph; Gellerstedt, Karl; Gemme, Claudia; Gemmell, Alistair; Genest, Marie-Hélène; Gentile, Simonetta; George, Matthias; George, Simon; Gerbaudo, Davide; Gershon, Avi; Ghazlane, Hamid; Ghodbane, Nabil; Giacobbe, Benedetto; Giagu, Stefano; Giangiobbe, Vincent; Giannetti, Paola; Gianotti, Fabiola; Gibbard, Bruce; Gibson, Stephen; Gilchriese, Murdock; Gillam, Thomas; Gillberg, Dag; Gilles, Geoffrey; Gingrich, Douglas; Giokaris, Nikos; Giordani, MarioPaolo; Giordano, Raffaele; Giorgi, Filippo Maria; Giorgi, Francesco Michelangelo; Giraud, Pierre-Francois; Giugni, Danilo; Giuliani, Claudia; Giulini, Maddalena; Gjelsten, Børge Kile; Gkaitatzis, Stamatios; Gkialas, Ioannis; Gladilin, Leonid; Glasman, Claudia; Glatzer, Julian; Glaysher, Paul; Glazov, Alexandre; Glonti, George; Goblirsch-Kolb, Maximilian; Goddard, Jack Robert; Godfrey, Jennifer; Godlewski, Jan; Goeringer, Christian; Goldfarb, Steven; Golling, Tobias; Golubkov, Dmitry; Gomes, Agostinho; Gomez Fajardo, Luz Stella; Gonçalo, Ricardo; Goncalves Pinto Firmino Da Costa, Joao; Gonella, Laura; González de la Hoz, Santiago; Gonzalez Parra, Garoe; Gonzalez-Sevilla, Sergio; Goossens, Luc; Gorbounov, Petr Andreevich; Gordon, Howard; Gorelov, Igor; Gorini, Benedetto; Gorini, Edoardo; Gorišek, Andrej; Gornicki, Edward; Goshaw, Alfred; Gössling, Claus; Gostkin, Mikhail Ivanovitch; Gouighri, Mohamed; Goujdami, Driss; Goulette, Marc Phillippe; Goussiou, Anna; Goy, Corinne; Gozpinar, Serdar; Grabas, Herve Marie Xavier; Graber, Lars; Grabowska-Bold, Iwona; Grafström, Per; Grahn, Karl-Johan; Gramling, Johanna; Gramstad, Eirik; Grancagnolo, Sergio; Grassi, Valerio; Gratchev, Vadim; Gray, Heather; Graziani, Enrico; Grebenyuk, Oleg; Greenwood, Zeno Dixon; Gregersen, Kristian; Gregor, Ingrid-Maria; Grenier, Philippe; Griffiths, Justin; Grillo, Alexander; Grimm, Kathryn; Grinstein, Sebastian; Gris, Philippe Luc Yves; Grishkevich, Yaroslav; Grivaz, Jean-Francois; Grohs, Johannes Philipp; Grohsjean, Alexander; Gross, Eilam; Grosse-Knetter, Joern; Grossi, Giulio Cornelio; Groth-Jensen, Jacob; Grout, Zara Jane; Guan, Liang; Guescini, Francesco; Guest, Daniel; Gueta, Orel; Guicheney, Christophe; Guido, Elisa; Guillemin, Thibault; Guindon, Stefan; Gul, Umar; Gumpert, Christian; Gunther, Jaroslav; Guo, Jun; Gupta, Shaun; Gutierrez, Phillip; Gutierrez Ortiz, Nicolas Gilberto; Gutschow, Christian; Guttman, Nir; Guyot, Claude; Gwenlan, Claire; Gwilliam, Carl; Haas, Andy; Haber, Carl; Hadavand, Haleh Khani; Haddad, Nacim; Haefner, Petra; Hageböck, Stephan; Hajduk, Zbigniew; Hakobyan, Hrachya; Haleem, Mahsana; Hall, David; Halladjian, Garabed; Hamacher, Klaus; Hamal, Petr; Hamano, Kenji; Hamer, Matthias; Hamilton, Andrew; Hamilton, Samuel; Hamnett, Phillip George; Han, Liang; Hanagaki, Kazunori; Hanawa, Keita; Hance, Michael; Hanke, Paul; Hanna, Remie; Hansen, Jørgen Beck; Hansen, Jorn Dines; Hansen, Peter Henrik; Hara, Kazuhiko; Hard, Andrew; Harenberg, Torsten; Hariri, Faten; Harkusha, Siarhei; Harper, Devin; Harrington, Robert; Harris, Orin; Harrison, Paul Fraser; Hartjes, Fred; Hasegawa, Satoshi; Hasegawa, Yoji; Hasib, A; Hassani, Samira; Haug, Sigve; Hauschild, Michael; Hauser, Reiner; Havranek, Miroslav; Hawkes, Christopher; Hawkings, Richard John; Hawkins, Anthony David; Hayashi, Takayasu; Hayden, Daniel; Hays, Chris; Hayward, Helen; Haywood, Stephen; Head, Simon; Heck, Tobias; Hedberg, Vincent; Heelan, Louise; Heim, Sarah; Heim, Timon; Heinemann, Beate; Heinrich, Lukas; Hejbal, Jiri; Helary, Louis; Heller, Claudio; Heller, Matthieu; Hellman, Sten; Hellmich, Dennis; Helsens, Clement; Henderson, James; Henderson, Robert; Heng, Yang; Hengler, Christopher; Henrichs, Anna; Henriques Correia, Ana Maria; Henrot-Versille, Sophie; Hensel, Carsten; Herbert, Geoffrey Henry; Hernández Jiménez, Yesenia; Herrberg-Schubert, Ruth; Herten, Gregor; Hertenberger, Ralf; Hervas, Luis; Hesketh, Gavin Grant; Hessey, Nigel; Hickling, Robert; Higón-Rodriguez, Emilio; Hill, Ewan; Hill, John; Hiller, Karl Heinz; Hillert, Sonja; Hillier, Stephen; Hinchliffe, Ian; Hines, Elizabeth; Hirose, Minoru; Hirschbuehl, Dominic; Hobbs, John; Hod, Noam; Hodgkinson, Mark; Hodgson, Paul; Hoecker, Andreas; Hoeferkamp, Martin; Hoffman, Julia; Hoffmann, Dirk; Hofmann, Julia Isabell; Hohlfeld, Marc; Holmes, Tova Ray; Hong, Tae Min; Hooft van Huysduynen, Loek; Hostachy, Jean-Yves; Hou, Suen; Hoummada, Abdeslam; Howard, Jacob; Howarth, James; Hrabovsky, Miroslav; Hristova, Ivana; Hrivnac, Julius; Hryn'ova, Tetiana; Hsu, Catherine; Hsu, Pai-hsien Jennifer; Hsu, Shih-Chieh; Hu, Diedi; Hu, Xueye; Huang, Yanping; Hubacek, Zdenek; Hubaut, Fabrice; Huegging, Fabian; Huffman, Todd Brian; Hughes, Emlyn; Hughes, Gareth; Huhtinen, Mika; Hülsing, Tobias Alexander; Hurwitz, Martina; Huseynov, Nazim; Huston, Joey; Huth, John; Iacobucci, Giuseppe; Iakovidis, Georgios; Ibragimov, Iskander; Iconomidou-Fayard, Lydia; Ideal, Emma; Iengo, Paolo; Igonkina, Olga; Iizawa, Tomoya; Ikegami, Yoichi; Ikematsu, Katsumasa; Ikeno, Masahiro; Ilchenko, Iurii; Iliadis, Dimitrios; Ilic, Nikolina; Inamaru, Yuki; Ince, Tayfun; Ioannou, Pavlos; Iodice, Mauro; Iordanidou, Kalliopi; Ippolito, Valerio; Irles Quiles, Adrian; Isaksson, Charlie; Ishino, Masaya; Ishitsuka, Masaki; Ishmukhametov, Renat; Issever, Cigdem; Istin, Serhat; Iturbe Ponce, Julia Mariana; Iuppa, Roberto; Ivarsson, Jenny; Iwanski, Wieslaw; Iwasaki, Hiroyuki; Izen, Joseph; Izzo, Vincenzo; Jackson, Brett; Jackson, Matthew; Jackson, Paul; Jaekel, Martin; Jain, Vivek; Jakobs, Karl; Jakobsen, Sune; Jakoubek, Tomas; Jakubek, Jan; Jamin, David Olivier; Jana, Dilip; Jansen, Eric; Jansen, Hendrik; Janssen, Jens; Janus, Michel; Jarlskog, Göran; Javadov, Namig; Javůrek, Tomáš; Jeanty, Laura; Jejelava, Juansher; Jeng, Geng-yuan; Jennens, David; Jenni, Peter; Jentzsch, Jennifer; Jeske, Carl; Jézéquel, Stéphane; Ji, Haoshuang; Ji, Weina; Jia, Jiangyong; Jiang, Yi; Jimenez Belenguer, Marcos; Jin, Shan; Jinaru, Adam; Jinnouchi, Osamu; Joergensen, Morten Dam; Johansson, Erik; Johansson, Per; Johns, Kenneth; Jon-And, Kerstin; Jones, Graham; Jones, Roger; Jones, Tim; Jongmanns, Jan; Jorge, Pedro; Joshi, Kiran Daniel; Jovicevic, Jelena; Ju, Xiangyang; Jung, Christian; Jungst, Ralph Markus; Jussel, Patrick; Juste Rozas, Aurelio; Kaci, Mohammed; Kaczmarska, Anna; Kado, Marumi; Kagan, Harris; Kagan, Michael; Kajomovitz, Enrique; Kalderon, Charles William; Kama, Sami; Kamenshchikov, Andrey; Kanaya, Naoko; Kaneda, Michiru; Kaneti, Steven; Kantserov, Vadim; Kanzaki, Junichi; Kaplan, Benjamin; Kapliy, Anton; Kar, Deepak; Karakostas, Konstantinos; Karastathis, Nikolaos; Karnevskiy, Mikhail; Karpov, Sergey; Karpova, Zoya; Karthik, Krishnaiyengar; Kartvelishvili, Vakhtang; Karyukhin, Andrey; Kashif, Lashkar; Kasieczka, Gregor; Kass, Richard; Kastanas, Alex; Kataoka, Yousuke; Katre, Akshay; Katzy, Judith; Kaushik, Venkatesh; Kawagoe, Kiyotomo; Kawamoto, Tatsuo; Kawamura, Gen; Kazama, Shingo; Kazanin, Vassili; Kazarinov, Makhail; Keeler, Richard; Kehoe, Robert; Keil, Markus; Keller, John; Kempster, Jacob Julian; Keoshkerian, Houry; Kepka, Oldrich; Kerševan, Borut Paul; Kersten, Susanne; Kessoku, Kohei; Keung, Justin; Khalil-zada, Farkhad; Khandanyan, Hovhannes; Khanov, Alexander; Khodinov, Alexander; Khomich, Andrei; Khoo, Teng Jian; Khoriauli, Gia; Khoroshilov, Andrey; Khovanskiy, Valery; Khramov, Evgeniy; Khubua, Jemal; Kim, Hee Yeun; Kim, Hyeon Jin; Kim, Shinhong; Kimura, Naoki; Kind, Oliver; King, Barry; King, Matthew; King, Robert Steven Beaufoy; King, Samuel Burton; Kirk, Julie; Kiryunin, Andrey; Kishimoto, Tomoe; Kisielewska, Danuta; Kiss, Florian; Kittelmann, Thomas; Kiuchi, Kenji; Kladiva, Eduard; Klein, Max; Klein, Uta; Kleinknecht, Konrad; Klimek, Pawel; Klimentov, Alexei; Klingenberg, Reiner; Klinger, Joel Alexander; Klioutchnikova, Tatiana; Klok, Peter; Kluge, Eike-Erik; Kluit, Peter; Kluth, Stefan; Kneringer, Emmerich; Knoops, Edith; Knue, Andrea; Kobayashi, Dai; Kobayashi, Tomio; Kobel, Michael; Kocian, Martin; Kodys, Peter; Koevesarki, Peter; Koffas, Thomas; Koffeman, Els; Kogan, Lucy Anne; Kohlmann, Simon; Kohout, Zdenek; Kohriki, Takashi; Koi, Tatsumi; Kolanoski, Hermann; Koletsou, Iro; Koll, James; Komar, Aston; Komori, Yuto; Kondo, Takahiko; Kondrashova, Nataliia; Köneke, Karsten; König, Adriaan; König, Sebastian; Kono, Takanori; Konoplich, Rostislav; Konstantinidis, Nikolaos; Kopeliansky, Revital; Koperny, Stefan; Köpke, Lutz; Kopp, Anna Katharina; Korcyl, Krzysztof; Kordas, Kostantinos; Korn, Andreas; Korol, Aleksandr; Korolkov, Ilya; Korolkova, Elena; Korotkov, Vladislav; Kortner, Oliver; Kortner, Sandra; Kostyukhin, Vadim; Kotov, Vladislav; Kotwal, Ashutosh; Kourkoumelis, Christine; Kouskoura, Vasiliki; Koutsman, Alex; Kowalewski, Robert Victor; Kowalski, Tadeusz; Kozanecki, Witold; Kozhin, Anatoly; Kral, Vlastimil; Kramarenko, Viktor; Kramberger, Gregor; Krasnopevtsev, Dimitriy; Krasny, Mieczyslaw Witold; Krasznahorkay, Attila; Kraus, Jana; Kravchenko, Anton; Kreiss, Sven; Kretz, Moritz; Kretzschmar, Jan; Kreutzfeldt, Kristof; Krieger, Peter; Kroeninger, Kevin; Kroha, Hubert; Kroll, Joe; Kroseberg, Juergen; Krstic, Jelena; Kruchonak, Uladzimir; Krüger, Hans; Kruker, Tobias; Krumnack, Nils; Krumshteyn, Zinovii; Kruse, Amanda; Kruse, Mark; Kruskal, Michael; Kubota, Takashi; Kuday, Sinan; Kuehn, Susanne; Kugel, Andreas; Kuhl, Andrew; Kuhl, Thorsten; Kukhtin, Victor; Kulchitsky, Yuri; Kuleshov, Sergey; Kuna, Marine; Kunkle, Joshua; Kupco, Alexander; Kurashige, Hisaya; Kurochkin, Yurii; Kurumida, Rie; Kus, Vlastimil; Kuwertz, Emma Sian; Kuze, Masahiro; Kvita, Jiri; La Rosa, Alessandro; La Rotonda, Laura; Lacasta, Carlos; Lacava, Francesco; Lacey, James; Lacker, Heiko; Lacour, Didier; Lacuesta, Vicente Ramón; Ladygin, Evgueni; Lafaye, Remi; Laforge, Bertrand; Lagouri, Theodota; Lai, Stanley; Laier, Heiko; Lambourne, Luke; Lammers, Sabine; Lampen, Caleb; Lampl, Walter; Lançon, Eric; Landgraf, Ulrich; Landon, Murrough; Lang, Valerie Susanne; Lankford, Andrew; Lanni, Francesco; Lantzsch, Kerstin; Laplace, Sandrine; Lapoire, Cecile; Laporte, Jean-Francois; Lari, Tommaso; Lassnig, Mario; Laurelli, Paolo; Lavrijsen, Wim; Law, Alexander; Laycock, Paul; Le, Bao Tran; Le Dortz, Olivier; Le Guirriec, Emmanuel; Le Menedeu, Eve; LeCompte, Thomas; Ledroit-Guillon, Fabienne Agnes Marie; Lee, Claire Alexandra; Lee, Hurng-Chun; Lee, Jason; Lee, Shih-Chang; Lee, Lawrence; Lefebvre, Guillaume; Lefebvre, Michel; Legger, Federica; Leggett, Charles; Lehan, Allan; Lehmacher, Marc; Lehmann Miotto, Giovanna; Lei, Xiaowen; Leight, William Axel; Leisos, Antonios; Leister, Andrew Gerard; Leite, Marco Aurelio Lisboa; Leitner, Rupert; Lellouch, Daniel; Lemmer, Boris; Leney, Katharine; Lenz, Tatjana; Lenzen, Georg; Lenzi, Bruno; Leone, Robert; Leone, Sandra; Leonhardt, Kathrin; Leonidopoulos, Christos; Leontsinis, Stefanos; Leroy, Claude; Lester, Christopher; Lester, Christopher Michael; Levchenko, Mikhail; Levêque, Jessica; Levin, Daniel; Levinson, Lorne; Levy, Mark; Lewis, Adrian; Lewis, George; Leyko, Agnieszka; Leyton, Michael; Li, Bing; Li, Bo; Li, Haifeng; Li, Ho Ling; Li, Lei; Li, Liang; Li, Shu; Li, Yichen; Liang, Zhijun; Liao, Hongbo; Liberti, Barbara; Lichard, Peter; Lie, Ki; Liebal, Jessica; Liebig, Wolfgang; Limbach, Christian; Limosani, Antonio; Lin, Simon; Lin, Tai-Hua; Linde, Frank; Lindquist, Brian Edward; Linnemann, James; Lipeles, Elliot; Lipniacka, Anna; Lisovyi, Mykhailo; Liss, Tony; Lissauer, David; Lister, Alison; Litke, Alan; Liu, Bo; Liu, Dong; Liu, Jianbei; Liu, Kun; Liu, Lulu; Liu, Miaoyuan; Liu, Minghui; Liu, Yanwen; Livan, Michele; Livermore, Sarah; Lleres, Annick; Llorente Merino, Javier; Lloyd, Stephen; Lo Sterzo, Francesco; Lobodzinska, Ewelina; Loch, Peter; Lockman, William; Loddenkoetter, Thomas; Loebinger, Fred; Loevschall-Jensen, Ask Emil; Loginov, Andrey; Loh, Chang Wei; Lohse, Thomas; Lohwasser, Kristin; Lokajicek, Milos; Lombardo, Vincenzo Paolo; Long, Brian Alexander; Long, Jonathan; Long, Robin Eamonn; Lopes, Lourenco; Lopez Mateos, David; Lopez Paredes, Brais; Lopez Paz, Ivan; Lorenz, Jeanette; Lorenzo Martinez, Narei; Losada, Marta; Loscutoff, Peter; Lou, XinChou; Lounis, Abdenour; Love, Jeremy; Love, Peter; Lowe, Andrew; Lu, Feng; Lubatti, Henry; Luci, Claudio; Lucotte, Arnaud; Luehring, Frederick; Lukas, Wolfgang; Luminari, Lamberto; Lundberg, Olof; Lund-Jensen, Bengt; Lungwitz, Matthias; Lynn, David; Lysak, Roman; Lytken, Else; Ma, Hong; Ma, Lian Liang; Maccarrone, Giovanni; Macchiolo, Anna; Machado Miguens, Joana; Macina, Daniela; Madaffari, Daniele; Madar, Romain; Maddocks, Harvey Jonathan; Mader, Wolfgang; Madsen, Alexander; Maeno, Mayuko; Maeno, Tadashi; Magradze, Erekle; Mahboubi, Kambiz; Mahlstedt, Joern; Mahmoud, Sara; Maiani, Camilla; Maidantchik, Carmen; Maier, Andreas Alexander; Maio, Amélia; Majewski, Stephanie; Makida, Yasuhiro; Makovec, Nikola; Mal, Prolay; Malaescu, Bogdan; Malecki, Pawel; Maleev, Victor; Malek, Fairouz; Mallik, Usha; Malon, David; Malone, Caitlin; Maltezos, Stavros; Malyshev, Vladimir; Malyukov, Sergei; Mamuzic, Judita; Mandelli, Beatrice; Mandelli, Luciano; Mandić, Igor; Mandrysch, Rocco; Maneira, José; Manfredini, Alessandro; Manhaes de Andrade Filho, Luciano; Manjarres Ramos, Joany Andreina; Mann, Alexander; Manning, Peter; Manousakis-Katsikakis, Arkadios; Mansoulie, Bruno; Mantifel, Rodger; Mapelli, Livio; March, Luis; Marchand, Jean-Francois; Marchiori, Giovanni; Marcisovsky, Michal; Marino, Christopher; Marjanovic, Marija; Marques, Carlos; Marroquim, Fernando; Marsden, Stephen Philip; Marshall, Zach; Marti, Lukas Fritz; Marti-Garcia, Salvador; Martin, Brian; Martin, Brian Thomas; Martin, Tim; Martin, Victoria Jane; Martin dit Latour, Bertrand; Martinez, Homero; Martinez, Mario; Martin-Haugh, Stewart; Martyniuk, Alex; Marx, Marilyn; Marzano, Francesco; Marzin, Antoine; Masetti, Lucia; Mashimo, Tetsuro; Mashinistov, Ruslan; Masik, Jiri; Maslennikov, Alexey; Massa, Ignazio; Massol, Nicolas; Mastrandrea, Paolo; Mastroberardino, Anna; Masubuchi, Tatsuya; Mättig, Peter; Mattmann, Johannes; Maurer, Julien; Maxfield, Stephen; Maximov, Dmitriy; Mazini, Rachid; Mazzaferro, Luca; Mc Goldrick, Garrin; Mc Kee, Shawn Patrick; McCarn, Allison; McCarthy, Robert; McCarthy, Tom; McCubbin, Norman; McFarlane, Kenneth; Mcfayden, Josh; Mchedlidze, Gvantsa; McMahon, Steve; McPherson, Robert; Meade, Andrew; Mechnich, Joerg; Medinnis, Michael; Meehan, Samuel; Mehlhase, Sascha; Mehta, Andrew; Meier, Karlheinz; Meineck, Christian; Meirose, Bernhard; Melachrinos, Constantinos; Mellado Garcia, Bruce Rafael; Meloni, Federico; Mengarelli, Alberto; Menke, Sven; Meoni, Evelin; Mercurio, Kevin Michael; Mergelmeyer, Sebastian; Meric, Nicolas; Mermod, Philippe; Merola, Leonardo; Meroni, Chiara; Merritt, Frank; Merritt, Hayes; Messina, Andrea; Metcalfe, Jessica; Mete, Alaettin Serhan; Meyer, Carsten; Meyer, Christopher; Meyer, Jean-Pierre; Meyer, Jochen; Middleton, Robin; Migas, Sylwia; Mijović, Liza; Mikenberg, Giora; Mikestikova, Marcela; Mikuž, Marko; Milic, Adriana; Miller, David; Mills, Corrinne; Milov, Alexander; Milstead, David; Milstein, Dmitry; Minaenko, Andrey; Minashvili, Irakli; Mincer, Allen; Mindur, Bartosz; Mineev, Mikhail; Ming, Yao; Mir, Lluisa-Maria; Mirabelli, Giovanni; Mitani, Takashi; Mitrevski, Jovan; Mitsou, Vasiliki A; Mitsui, Shingo; Miucci, Antonio; Miyagawa, Paul; Mjörnmark, Jan-Ulf; Moa, Torbjoern; Mochizuki, Kazuya; Mohapatra, Soumya; Mohr, Wolfgang; Molander, Simon; Moles-Valls, Regina; Mönig, Klaus; Monini, Caterina; Monk, James; Monnier, Emmanuel; Montejo Berlingen, Javier; Monticelli, Fernando; Monzani, Simone; Moore, Roger; Moraes, Arthur; Morange, Nicolas; Moreno, Deywis; Moreno Llácer, María; Morettini, Paolo; Morgenstern, Marcus; Morii, Masahiro; Moritz, Sebastian; Morley, Anthony Keith; Mornacchi, Giuseppe; Morris, John; Morvaj, Ljiljana; Moser, Hans-Guenther; Mosidze, Maia; Moss, Josh; Motohashi, Kazuki; Mount, Richard; Mountricha, Eleni; Mouraviev, Sergei; Moyse, Edward; Muanza, Steve; Mudd, Richard; Mueller, Felix; Mueller, James; Mueller, Klemens; Mueller, Thibaut; Mueller, Timo; Muenstermann, Daniel; Munwes, Yonathan; Murillo Quijada, Javier Alberto; Murray, Bill; Musheghyan, Haykuhi; Musto, Elisa; Myagkov, Alexey; Myska, Miroslav; Nackenhorst, Olaf; Nadal, Jordi; Nagai, Koichi; Nagai, Ryo; Nagai, Yoshikazu; Nagano, Kunihiro; Nagarkar, Advait; Nagasaka, Yasushi; Nagel, Martin; Nairz, Armin Michael; Nakahama, Yu; Nakamura, Koji; Nakamura, Tomoaki; Nakano, Itsuo; Namasivayam, Harisankar; Nanava, Gizo; Narayan, Rohin; Nattermann, Till; Naumann, Thomas; Navarro, Gabriela; Nayyar, Ruchika; Neal, Homer; Nechaeva, Polina; Neep, Thomas James; Nef, Pascal Daniel; Negri, Andrea; Negri, Guido; Negrini, Matteo; Nektarijevic, Snezana; Nelson, Andrew; Nelson, Timothy Knight; Nemecek, Stanislav; Nemethy, Peter; Nepomuceno, Andre Asevedo; Nessi, Marzio; Neubauer, Mark; Neumann, Manuel; Neves, Ricardo; Nevski, Pavel; Newman, Paul; Nguyen, Duong Hai; Nickerson, Richard; Nicolaidou, Rosy; Nicquevert, Bertrand; Nielsen, Jason; Nikiforou, Nikiforos; Nikiforov, Andriy; Nikolaenko, Vladimir; Nikolic-Audit, Irena; Nikolics, Katalin; Nikolopoulos, Konstantinos; Nilsson, Paul; Ninomiya, Yoichi; Nisati, Aleandro; Nisius, Richard; Nobe, Takuya; Nodulman, Lawrence; Nomachi, Masaharu; Nomidis, Ioannis; Norberg, Scarlet; Nordberg, Markus; Novgorodova, Olga; Nowak, Sebastian; Nozaki, Mitsuaki; Nozka, Libor; Ntekas, Konstantinos; Nunes Hanninger, Guilherme; Nunnemann, Thomas; Nurse, Emily; Nuti, Francesco; O'Brien, Brendan Joseph; O'grady, Fionnbarr; O'Neil, Dugan; O'Shea, Val; Oakham, Gerald; Oberlack, Horst; Obermann, Theresa; Ocariz, Jose; Ochi, Atsuhiko; Ochoa, Ines; Oda, Susumu; Odaka, Shigeru; Ogren, Harold; Oh, Alexander; Oh, Seog; Ohm, Christian; Ohman, Henrik; Ohshima, Takayoshi; Okamura, Wataru; Okawa, Hideki; Okumura, Yasuyuki; Okuyama, Toyonobu; Olariu, Albert; Olchevski, Alexander; Olivares Pino, Sebastian Andres; Oliveira Damazio, Denis; Oliver Garcia, Elena; Olszewski, Andrzej; Olszowska, Jolanta; Onofre, António; Onyisi, Peter; Oram, Christopher; Oreglia, Mark; Oren, Yona; Orestano, Domizia; Orlando, Nicola; Oropeza Barrera, Cristina; Orr, Robert; Osculati, Bianca; Ospanov, Rustem; Otero y Garzon, Gustavo; Otono, Hidetoshi; Ouchrif, Mohamed; Ouellette, Eric; Ould-Saada, Farid; Ouraou, Ahmimed; Oussoren, Koen Pieter; Ouyang, Qun; Ovcharova, Ana; Owen, Mark; Ozcan, Veysi Erkcan; Ozturk, Nurcan; Pachal, Katherine; Pacheco Pages, Andres; Padilla Aranda, Cristobal; Pagáčová, Martina; Pagan Griso, Simone; Paganis, Efstathios; Pahl, Christoph; Paige, Frank; Pais, Preema; Pajchel, Katarina; Palacino, Gabriel; Palestini, Sandro; Palka, Marek; Pallin, Dominique; Palma, Alberto; Palmer, Jody; Pan, Yibin; Panagiotopoulou, Evgenia; Panduro Vazquez, William; Pani, Priscilla; Panikashvili, Natalia; Panitkin, Sergey; Pantea, Dan; Paolozzi, Lorenzo; Papadopoulou, Theodora; Papageorgiou, Konstantinos; Paramonov, Alexander; Paredes Hernandez, Daniela; Parker, Michael Andrew; Parodi, Fabrizio; Parsons, John; Parzefall, Ulrich; Pasqualucci, Enrico; Passaggio, Stefano; Passeri, Antonio; Pastore, Fernanda; Pastore, Francesca; Pásztor, Gabriella; Pataraia, Sophio; Patel, Nikhul; Pater, Joleen; Patricelli, Sergio; Pauly, Thilo; Pearce, James; Pedersen, Maiken; Pedraza Lopez, Sebastian; Pedro, Rute; Peleganchuk, Sergey; Pelikan, Daniel; Peng, Haiping; Penning, Bjoern; Penwell, John; Perepelitsa, Dennis; Perez Codina, Estel; Pérez García-Estañ, María Teresa; Perez Reale, Valeria; Perini, Laura; Pernegger, Heinz; Perrino, Roberto; Peschke, Richard; Peshekhonov, Vladimir; Peters, Krisztian; Peters, Yvonne; Petersen, Brian; Petersen, Troels; Petit, Elisabeth; Petridis, Andreas; Petridou, Chariclia; Petrolo, Emilio; Petrucci, Fabrizio; Pettersson, Nora Emilia; Pezoa, Raquel; Phillips, Peter William; Piacquadio, Giacinto; Pianori, Elisabetta; Picazio, Attilio; Piccaro, Elisa; Piccinini, Maurizio; Piegaia, Ricardo; Pignotti, David; Pilcher, James; Pilkington, Andrew; Pina, João Antonio; Pinamonti, Michele; Pinder, Alex; Pinfold, James; Pingel, Almut; Pinto, Belmiro; Pires, Sylvestre; Pitt, Michael; Pizio, Caterina; Plazak, Lukas; Pleier, Marc-Andre; Pleskot, Vojtech; Plotnikova, Elena; Plucinski, Pawel; Poddar, Sahill; Podlyski, Fabrice; Poettgen, Ruth; Poggioli, Luc; Pohl, David-leon; Pohl, Martin; Polesello, Giacomo; Policicchio, Antonio; Polifka, Richard; Polini, Alessandro; Pollard, Christopher Samuel; Polychronakos, Venetios; Pommès, Kathy; Pontecorvo, Ludovico; Pope, Bernard; Popeneciu, Gabriel Alexandru; Popovic, Dragan; Poppleton, Alan; Portell Bueso, Xavier; Pospisil, Stanislav; Potamianos, Karolos; Potrap, Igor; Potter, Christina; Potter, Christopher; Poulard, Gilbert; Poveda, Joaquin; Pozdnyakov, Valery; Pralavorio, Pascal; Pranko, Aliaksandr; Prasad, Srivas; Pravahan, Rishiraj; Prell, Soeren; Price, Darren; Price, Joe; Price, Lawrence; Prieur, Damien; Primavera, Margherita; Proissl, Manuel; Prokofiev, Kirill; Prokoshin, Fedor; Protopapadaki, Eftychia-sofia; Protopopescu, Serban; Proudfoot, James; Przybycien, Mariusz; Przysiezniak, Helenka; Ptacek, Elizabeth; Puddu, Daniele; Pueschel, Elisa; Puldon, David; Purohit, Milind; Puzo, Patrick; Qian, Jianming; Qin, Gang; Qin, Yang; Quadt, Arnulf; Quarrie, David; Quayle, William; Queitsch-Maitland, Michaela; Quilty, Donnchadha; Qureshi, Anum; Radeka, Veljko; Radescu, Voica; Radhakrishnan, Sooraj Krishnan; Radloff, Peter; Rados, Pere; Ragusa, Francesco; Rahal, Ghita; Rajagopalan, Srinivasan; Rammensee, Michael; Randle-Conde, Aidan Sean; Rangel-Smith, Camila; Rao, Kanury; Rauscher, Felix; Rave, Tobias Christian; Ravenscroft, Thomas; Raymond, Michel; Read, Alexander Lincoln; Readioff, Nathan Peter; Rebuzzi, Daniela; Redelbach, Andreas; Redlinger, George; Reece, Ryan; Reeves, Kendall; Rehnisch, Laura; Reisin, Hernan; Relich, Matthew; Rembser, Christoph; Ren, Huan; Ren, Zhongliang; Renaud, Adrien; Rescigno, Marco; Resconi, Silvia; Rezanova, Olga; Reznicek, Pavel; Rezvani, Reyhaneh; Richter, Robert; Ridel, Melissa; Rieck, Patrick; Rieger, Julia; Rijssenbeek, Michael; Rimoldi, Adele; Rinaldi, Lorenzo; Ritsch, Elmar; Riu, Imma; Rizatdinova, Flera; Rizvi, Eram; Robertson, Steven; Robichaud-Veronneau, Andree; Robinson, Dave; Robinson, James; Robson, Aidan; Roda, Chiara; Rodrigues, Luis; Roe, Shaun; Røhne, Ole; Rolli, Simona; Romaniouk, Anatoli; Romano, Marino; Romero Adam, Elena; Rompotis, Nikolaos; Roos, Lydia; Ros, Eduardo; Rosati, Stefano; Rosbach, Kilian; Rose, Matthew; Rosendahl, Peter Lundgaard; Rosenthal, Oliver; Rossetti, Valerio; Rossi, Elvira; Rossi, Leonardo Paolo; Rosten, Rachel; Rotaru, Marina; Roth, Itamar; Rothberg, Joseph; Rousseau, David; Royon, Christophe; Rozanov, Alexandre; Rozen, Yoram; Ruan, Xifeng; Rubbo, Francesco; Rubinskiy, Igor; Rud, Viacheslav; Rudolph, Christian; Rudolph, Matthew Scott; Rühr, Frederik; Ruiz-Martinez, Aranzazu; Rurikova, Zuzana; Rusakovich, Nikolai; Ruschke, Alexander; Rutherfoord, John; Ruthmann, Nils; Ryabov, Yury; Rybar, Martin; Rybkin, Grigori; Ryder, Nick; Saavedra, Aldo; Sacerdoti, Sabrina; Saddique, Asif; Sadeh, Iftach; Sadrozinski, Hartmut; Sadykov, Renat; Safai Tehrani, Francesco; Sakamoto, Hiroshi; Sakurai, Yuki; Salamanna, Giuseppe; Salamon, Andrea; Saleem, Muhammad; Salek, David; Sales De Bruin, Pedro Henrique; Salihagic, Denis; Salnikov, Andrei; Salt, José; Salvachua Ferrando, Belén; Salvatore, Daniela; Salvatore, Pasquale Fabrizio; Salvucci, Antonio; Salzburger, Andreas; Sampsonidis, Dimitrios; Sanchez, Arturo; Sánchez, Javier; Sanchez Martinez, Victoria; Sandaker, Heidi; Sandbach, Ruth Laura; Sander, Heinz Georg; Sanders, Michiel; Sandhoff, Marisa; Sandoval, Tanya; Sandoval, Carlos; Sandstroem, Rikard; Sankey, Dave; Sansoni, Andrea; Santoni, Claudio; Santonico, Rinaldo; Santos, Helena; Santoyo Castillo, Itzebelt; Sapp, Kevin; Sapronov, Andrey; Saraiva, João; Sarrazin, Bjorn; Sartisohn, Georg; Sasaki, Osamu; Sasaki, Yuichi; Sauvage, Gilles; Sauvan, Emmanuel; Savard, Pierre; Savu, Dan Octavian; Sawyer, Craig; Sawyer, Lee; Saxon, David; Saxon, James; Sbarra, Carla; Sbrizzi, Antonio; Scanlon, Tim; Scannicchio, Diana; Scarcella, Mark; Scarfone, Valerio; Schaarschmidt, Jana; Schacht, Peter; Schaefer, Douglas; Schaefer, Ralph; Schaepe, Steffen; Schaetzel, Sebastian; Schäfer, Uli; Schaffer, Arthur; Schaile, Dorothee; Schamberger, R. Dean; Scharf, Veit; Schegelsky, Valery; Scheirich, Daniel; Schernau, Michael; Scherzer, Max; Schiavi, Carlo; Schieck, Jochen; Schillo, Christian; Schioppa, Marco; Schlenker, Stefan; Schmidt, Evelyn; Schmieden, Kristof; Schmitt, Christian; Schmitt, Christopher; Schmitt, Sebastian; Schneider, Basil; Schnellbach, Yan Jie; Schnoor, Ulrike; Schoeffel, Laurent; Schoening, Andre; Schoenrock, Bradley Daniel; Schorlemmer, Andre Lukas; Schott, Matthias; Schouten, Doug; Schovancova, Jaroslava; Schramm, Steven; Schreyer, Manuel; Schroeder, Christian; Schuh, Natascha; Schultens, Martin Johannes; Schultz-Coulon, Hans-Christian; Schulz, Holger; Schumacher, Markus; Schumm, Bruce; Schune, Philippe; Schwanenberger, Christian; Schwartzman, Ariel; Schwegler, Philipp; Schwemling, Philippe; Schwienhorst, Reinhard; Schwindling, Jerome; Schwindt, Thomas; Schwoerer, Maud; Sciacca, Gianfranco; Scifo, Estelle; Sciolla, Gabriella; Scott, Bill; Scuri, Fabrizio; Scutti, Federico; Searcy, Jacob; Sedov, George; Sedykh, Evgeny; Seidel, Sally; Seiden, Abraham; Seifert, Frank; Seixas, José; Sekhniaidze, Givi; Sekula, Stephen; Selbach, Karoline Elfriede; Seliverstov, Dmitry; Sellers, Graham; Semprini-Cesari, Nicola; Serfon, Cedric; Serin, Laurent; Serkin, Leonid; Serre, Thomas; Seuster, Rolf; Severini, Horst; Sfiligoj, Tina; Sforza, Federico; Sfyrla, Anna; Shabalina, Elizaveta; Shamim, Mansoora; Shan, Lianyou; Shang, Ruo-yu; Shank, James; Shapiro, Marjorie; Shatalov, Pavel; Shaw, Kate; Shehu, Ciwake Yusufu; Sherwood, Peter; Shi, Liaoshan; Shimizu, Shima; Shimmin, Chase Owen; Shimojima, Makoto; Shiyakova, Mariya; Shmeleva, Alevtina; Shochet, Mel; Short, Daniel; Shrestha, Suyog; Shulga, Evgeny; Shupe, Michael; Shushkevich, Stanislav; Sicho, Petr; Sidiropoulou, Ourania; Sidorov, Dmitri; Sidoti, Antonio; Siegert, Frank; Sijacki, Djordje; Silva, José; Silver, Yiftah; Silverstein, Daniel; Silverstein, Samuel; Simak, Vladislav; Simard, Olivier; Simic, Ljiljana; Simion, Stefan; Simioni, Eduard; Simmons, Brinick; Simoniello, Rosa; Simonyan, Margar; Sinervo, Pekka; Sinev, Nikolai; Sipica, Valentin; Siragusa, Giovanni; Sircar, Anirvan; Sisakyan, Alexei; Sivoklokov, Serguei; Sjölin, Jörgen; Sjursen, Therese; Skottowe, Hugh Philip; Skovpen, Kirill; Skubic, Patrick; Slater, Mark; Slavicek, Tomas; Sliwa, Krzysztof; Smakhtin, Vladimir; Smart, Ben; Smestad, Lillian; Smirnov, Sergei; Smirnov, Yury; Smirnova, Lidia; Smirnova, Oxana; Smith, Kenway; Smizanska, Maria; Smolek, Karel; Snesarev, Andrei; Snidero, Giacomo; Snyder, Scott; Sobie, Randall; Socher, Felix; Soffer, Abner; Soh, Dart-yin; Solans, Carlos; Solar, Michael; Solc, Jaroslav; Soldatov, Evgeny; Soldevila, Urmila; Solfaroli Camillocci, Elena; Solodkov, Alexander; Soloshenko, Alexei; Solovyanov, Oleg; Solovyev, Victor; Sommer, Philip; Song, Hong Ye; Soni, Nitesh; Sood, Alexander; Sopczak, Andre; Sopko, Bruno; Sopko, Vit; Sorin, Veronica; Sosebee, Mark; Soualah, Rachik; Soueid, Paul; Soukharev, Andrey; South, David; Spagnolo, Stefania; Spanò, Francesco; Spearman, William Robert; Spettel, Fabian; Spighi, Roberto; Spigo, Giancarlo; Spousta, Martin; Spreitzer, Teresa; Spurlock, Barry; St Denis, Richard Dante; Staerz, Steffen; Stahlman, Jonathan; Stamen, Rainer; Stanecka, Ewa; Stanek, Robert; Stanescu, Cristian; Stanescu-Bellu, Madalina; Stanitzki, Marcel Michael; Stapnes, Steinar; Starchenko, Evgeny; Stark, Jan; Staroba, Pavel; Starovoitov, Pavel; Staszewski, Rafal; Stavina, Pavel; Steinberg, Peter; Stelzer, Bernd; Stelzer, Harald Joerg; Stelzer-Chilton, Oliver; Stenzel, Hasko; Stern, Sebastian; Stewart, Graeme; Stillings, Jan Andre; Stockton, Mark; Stoebe, Michael; Stoicea, Gabriel; Stolte, Philipp; Stonjek, Stefan; Stradling, Alden; Straessner, Arno; Stramaglia, Maria Elena; Strandberg, Jonas; Strandberg, Sara; Strandlie, Are; Strauss, Emanuel; Strauss, Michael; Strizenec, Pavol; Ströhmer, Raimund; Strom, David; Stroynowski, Ryszard; Stucci, Stefania Antonia; Stugu, Bjarne; Styles, Nicholas Adam; Su, Dong; Su, Jun; Subramania, Halasya Siva; Subramaniam, Rajivalochan; Succurro, Antonella; Sugaya, Yorihito; Suhr, Chad; Suk, Michal; Sulin, Vladimir; Sultansoy, Saleh; Sumida, Toshi; Sun, Xiaohu; Sundermann, Jan Erik; Suruliz, Kerim; Susinno, Giancarlo; Sutton, Mark; Suzuki, Yu; Svatos, Michal; Swedish, Stephen; Swiatlowski, Maximilian; Sykora, Ivan; Sykora, Tomas; Ta, Duc; Taccini, Cecilia; Tackmann, Kerstin; Taenzer, Joe; Taffard, Anyes; Tafirout, Reda; Taiblum, Nimrod; Takahashi, Yuta; Takai, Helio; Takashima, Ryuichi; Takeda, Hiroshi; Takeshita, Tohru; Takubo, Yosuke; Talby, Mossadek; Talyshev, Alexey; Tam, Jason; Tan, Kong Guan; Tanaka, Junichi; Tanaka, Reisaburo; Tanaka, Satoshi; Tanaka, Shuji; Tanasijczuk, Andres Jorge; Tannenwald, Benjamin Bordy; Tannoury, Nancy; Tapprogge, Stefan; Tarem, Shlomit; Tarrade, Fabien; Tartarelli, Giuseppe Francesco; Tas, Petr; Tasevsky, Marek; Tashiro, Takuya; Tassi, Enrico; Tavares Delgado, Ademar; Tayalati, Yahya; Taylor, Frank; Taylor, Geoffrey; Taylor, Wendy; Teischinger, Florian Alfred; Teixeira Dias Castanheira, Matilde; Teixeira-Dias, Pedro; Temming, Kim Katrin; Ten Kate, Herman; Teng, Ping-Kun; Teoh, Jia Jian; Terada, Susumu; Terashi, Koji; Terron, Juan; Terzo, Stefano; Testa, Marianna; Teuscher, Richard; Therhaag, Jan; Theveneaux-Pelzer, Timothée; Thomas, Juergen; Thomas-Wilsker, Joshuha; Thompson, Emily; Thompson, Paul; Thompson, Peter; Thompson, Stan; Thomsen, Lotte Ansgaard; Thomson, Evelyn; Thomson, Mark; Thong, Wai Meng; Thun, Rudolf; Tian, Feng; Tibbetts, Mark James; Tikhomirov, Vladimir; Tikhonov, Yury; Timoshenko, Sergey; Tiouchichine, Elodie; Tipton, Paul; Tisserant, Sylvain; Todorov, Theodore; Todorova-Nova, Sharka; Toggerson, Brokk; Tojo, Junji; Tokár, Stanislav; Tokushuku, Katsuo; Tollefson, Kirsten; Tomlinson, Lee; Tomoto, Makoto; Tompkins, Lauren; Toms, Konstantin; Topilin, Nikolai; Torrence, Eric; Torres, Heberth; Torró Pastor, Emma; Toth, Jozsef; Touchard, Francois; Tovey, Daniel; Tran, Huong Lan; Trefzger, Thomas; Tremblet, Louis; Tricoli, Alessandro; Trigger, Isabel Marian; Trincaz-Duvoid, Sophie; Tripiana, Martin; Triplett, Nathan; Trischuk, William; Trocmé, Benjamin; Troncon, Clara; Trottier-McDonald, Michel; Trovatelli, Monica; True, Patrick; Trzebinski, Maciej; Trzupek, Adam; Tsarouchas, Charilaos; Tseng, Jeffrey; Tsiareshka, Pavel; Tsionou, Dimitra; Tsipolitis, Georgios; Tsirintanis, Nikolaos; Tsiskaridze, Shota; Tsiskaridze, Vakhtang; Tskhadadze, Edisher; Tsukerman, Ilya; Tsulaia, Vakhtang; Tsuno, Soshi; Tsybychev, Dmitri; Tudorache, Alexandra; Tudorache, Valentina; Tuna, Alexander Naip; Tupputi, Salvatore; Turchikhin, Semen; Turecek, Daniel; Turk Cakir, Ilkay; Turra, Ruggero; Tuts, Michael; Tykhonov, Andrii; Tylmad, Maja; Tyndel, Mike; Uchida, Kirika; Ueda, Ikuo; Ueno, Ryuichi; Ughetto, Michael; Ugland, Maren; Uhlenbrock, Mathias; Ukegawa, Fumihiko; Unal, Guillaume; Undrus, Alexander; Unel, Gokhan; Ungaro, Francesca; Unno, Yoshinobu; Urbaniec, Dustin; Urquijo, Phillip; Usai, Giulio; Usanova, Anna; Vacavant, Laurent; Vacek, Vaclav; Vachon, Brigitte; Valencic, Nika; Valentinetti, Sara; Valero, Alberto; Valery, Loic; Valkar, Stefan; Valladolid Gallego, Eva; Vallecorsa, Sofia; Valls Ferrer, Juan Antonio; Van Den Wollenberg, Wouter; Van Der Deijl, Pieter; van der Geer, Rogier; van der Graaf, Harry; Van Der Leeuw, Robin; van der Ster, Daniel; van Eldik, Niels; van Gemmeren, Peter; Van Nieuwkoop, Jacobus; van Vulpen, Ivo; van Woerden, Marius Cornelis; Vanadia, Marco; Vandelli, Wainer; Vanguri, Rami; Vaniachine, Alexandre; Vankov, Peter; Vannucci, Francois; Vardanyan, Gagik; Vari, Riccardo; Varnes, Erich; Varol, Tulin; Varouchas, Dimitris; Vartapetian, Armen; Varvell, Kevin; Vazeille, Francois; Vazquez Schroeder, Tamara; Veatch, Jason; Veloso, Filipe; Veneziano, Stefano; Ventura, Andrea; Ventura, Daniel; Venturi, Manuela; Venturi, Nicola; Venturini, Alessio; Vercesi, Valerio; Verducci, Monica; Verkerke, Wouter; Vermeulen, Jos; Vest, Anja; Vetterli, Michel; Viazlo, Oleksandr; Vichou, Irene; Vickey, Trevor; Vickey Boeriu, Oana Elena; Viehhauser, Georg; Viel, Simon; Vigne, Ralph; Villa, Mauro; Villaplana Perez, Miguel; Vilucchi, Elisabetta; Vincter, Manuella; Vinogradov, Vladimir; Virzi, Joseph; Vivarelli, Iacopo; Vives Vaque, Francesc; Vlachos, Sotirios; Vladoiu, Dan; Vlasak, Michal; Vogel, Adrian; Vogel, Marcelo; Vokac, Petr; Volpi, Guido; Volpi, Matteo; von der Schmitt, Hans; von Radziewski, Holger; von Toerne, Eckhard; Vorobel, Vit; Vorobev, Konstantin; Vos, Marcel; Voss, Rudiger; Vossebeld, Joost; Vranjes, Nenad; Vranjes Milosavljevic, Marija; Vrba, Vaclav; Vreeswijk, Marcel; Vu Anh, Tuan; Vuillermet, Raphael; Vukotic, Ilija; Vykydal, Zdenek; Wagner, Peter; Wagner, Wolfgang; Wahlberg, Hernan; Wahrmund, Sebastian; Wakabayashi, Jun; Walder, James; Walker, Rodney; Walkowiak, Wolfgang; Wall, Richard; Waller, Peter; Walsh, Brian; Wang, Chao; Wang, Chiho; Wang, Fuquan; Wang, Haichen; Wang, Hulin; Wang, Jike; Wang, Jin; Wang, Kuhan; Wang, Rui; Wang, Song-Ming; Wang, Tan; Wang, Xiaoxiao; Wanotayaroj, Chaowaroj; Warburton, Andreas; Ward, Patricia; Wardrope, David Robert; Warsinsky, Markus; Washbrook, Andrew; Wasicki, Christoph; Watkins, Peter; Watson, Alan; Watson, Ian; Watson, Miriam; Watts, Gordon; Watts, Stephen; Waugh, Ben; Webb, Samuel; Weber, Michele; Weber, Stefan Wolf; Webster, Jordan S; Weidberg, Anthony; Weigell, Philipp; Weinert, Benjamin; Weingarten, Jens; Weiser, Christian; Weits, Hartger; Wells, Phillippa; Wenaus, Torre; Wendland, Dennis; Weng, Zhili; Wengler, Thorsten; Wenig, Siegfried; Wermes, Norbert; Werner, Matthias; Werner, Per; Wessels, Martin; Wetter, Jeffrey; Whalen, Kathleen; White, Andrew; White, Martin; White, Ryan; White, Sebastian; Whiteson, Daniel; Wicke, Daniel; Wickens, Fred; Wiedenmann, Werner; Wielers, Monika; Wienemann, Peter; Wiglesworth, Craig; Wiik-Fuchs, Liv Antje Mari; Wijeratne, Peter Alexander; Wildauer, Andreas; Wildt, Martin Andre; Wilkens, Henric George; Will, Jonas Zacharias; Williams, Hugh; Williams, Sarah; Willis, Christopher; Willocq, Stephane; Wilson, Alan; Wilson, John; Wingerter-Seez, Isabelle; Winklmeier, Frank; Winter, Benedict Tobias; Wittgen, Matthias; Wittig, Tobias; Wittkowski, Josephine; Wollstadt, Simon Jakob; Wolter, Marcin Wladyslaw; Wolters, Helmut; Wosiek, Barbara; Wotschack, Jorg; Woudstra, Martin; Wozniak, Krzysztof; Wright, Michael; Wu, Mengqing; Wu, Sau Lan; Wu, Xin; Wu, Yusheng; Wulf, Evan; Wyatt, Terry Richard; Wynne, Benjamin; Xella, Stefania; Xiao, Meng; Xu, Da; Xu, Lailin; Yabsley, Bruce; Yacoob, Sahal; Yamada, Miho; Yamaguchi, Hiroshi; Yamaguchi, Yohei; Yamamoto, Akira; Yamamoto, Kyoko; Yamamoto, Shimpei; Yamamura, Taiki; Yamanaka, Takashi; Yamauchi, Katsuya; Yamazaki, Yuji; Yan, Zhen; Yang, Haijun; Yang, Hongtao; Yang, Un-Ki; Yang, Yi; Yanush, Serguei; Yao, Liwen; Yao, Weiming; Yasu, Yoshiji; Yatsenko, Elena; Yau Wong, Kaven Henry; Ye, Jingbo; Ye, Shuwei; Yen, Andy L; Yildirim, Eda; Yilmaz, Metin; Yoosoofmiya, Reza; Yorita, Kohei; Yoshida, Rikutaro; Yoshihara, Keisuke; Young, Charles; Young, Christopher John; Youssef, Saul; Yu, David Ren-Hwa; Yu, Jaehoon; Yu, Jiaming; Yu, Jie; Yuan, Li; Yurkewicz, Adam; Yusuff, Imran; Zabinski, Bartlomiej; Zaidan, Remi; Zaitsev, Alexander; Zaman, Aungshuman; Zambito, Stefano; Zanello, Lucia; Zanzi, Daniele; Zeitnitz, Christian; Zeman, Martin; Zemla, Andrzej; Zengel, Keith; Zenin, Oleg; Ženiš, Tibor; Zerwas, Dirk; Zevi della Porta, Giovanni; Zhang, Dongliang; Zhang, Fangzhou; Zhang, Huaqiao; Zhang, Jinlong; Zhang, Lei; Zhang, Xueyao; Zhang, Zhiqing; Zhao, Zhengguo; Zhemchugov, Alexey; Zhong, Jiahang; Zhou, Bing; Zhou, Lei; Zhou, Ning; Zhu, Cheng Guang; Zhu, Hongbo; Zhu, Junjie; Zhu, Yingchun; Zhuang, Xuai; Zhukov, Konstantin; Zibell, Andre; Zieminska, Daria; Zimine, Nikolai; Zimmermann, Christoph; Zimmermann, Robert; Zimmermann, Simone; Zimmermann, Stephanie; Zinonos, Zinonas; Ziolkowski, Michael; Zobernig, Georg; Zoccoli, Antonio; zur Nedden, Martin; Zurzolo, Giovanni; Zutshi, Vishnu; Zwalinski, Lukasz

2014-09-15

A novel technique to identify and split clusters created by multiple charged particles in the ATLAS pixel detector using a set of artificial neural networks is presented. Such merged clusters are a common feature of tracks originating from highly energetic objects, such as jets. Neural networks are trained using Monte Carlo samples produced with a detailed detector simulation. This technique replaces the former clustering approach based on a connected component analysis and charge interpolation. The performance of the neural network splitting technique is quantified using data from proton-proton collisions at the LHC collected by the ATLAS detector in 2011 and from Monte Carlo simulations. This technique reduces the number of clusters shared between tracks in highly energetic jets by up to a factor of three. It also provides more precise position and error estimates of the clusters in both the transverse and longitudinal impact parameter resolution.

Gas pixel detectors

International Nuclear Information System (INIS)

Bellazzini, R.; Baldini, L.; Brez, A.; Cavalca, F.; Latronico, L.; Massai, M.M.; Minuti, M.; Omodei, N.; Pesce-Rollins, M.; Sgro, C.; Spandre, G.; Costa, E.; Soffitta, P.

2007-01-01

With the Gas Pixel Detector (GPD), the class of micro-pattern gas detectors has reached a complete integration between the gas amplification structure and the read-out electronics. To obtain this goal, three generations of application-specific integrated circuit of increased complexity and improved functionality has been designed and fabricated in deep sub-micron CMOS technology. This implementation has allowed manufacturing a monolithic device, which realizes, at the same time, the pixelized charge-collecting electrode and the amplifying, shaping and charge measuring front-end electronics of a GPD. A big step forward in terms of size and performances has been obtained in the last version of the 0.18 μm CMOS analog chip, where over a large active area of 15x15 mm 2 a very high channel density (470 pixels/mm 2 ) has been reached. On the top metal layer of the chip, 105,600 hexagonal pixels at 50 μm pitch have been patterned. The chip has customable self-trigger capability and includes a signal pre-processing function for the automatic localization of the event coordinates. In this way, by limiting the output signal to only those pixels belonging to the region of interest, it is possible to reduce significantly the read-out time and data volume. In-depth tests performed on a GPD built up by coupling this device to a fine pitch (50 μm) gas electron multiplier are reported. Matching of the gas amplification and read-out pitch has let to obtain optimal results. A possible application of this detector for X-ray polarimetry of astronomical sources is discussed

Automating dipole subtraction

Energy Technology Data Exchange (ETDEWEB)

Hasegawa, K.; Moch, S. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Uwer, P. [Karlsruhe Univ. (T.H.) (Germany). Inst. fuer Theoretische Teilchenphysik

2008-07-15

We report on automating the Catani-Seymour dipole subtraction which is a general procedure to treat infrared divergences in real emission processes at next-to-leading order in QCD. The automatization rests on three essential steps: the creation of the dipole terms, the calculation of the color linked squared Born matrix elements, and the evaluation of different helicity amplitudes. The routines have been tested for a number of complex processes, such as the real emission process gg{yields}t anti tggg. (orig.)

Automating dipole subtraction

International Nuclear Information System (INIS)

Hasegawa, K.; Moch, S.; Uwer, P.

2008-07-01

We report on automating the Catani-Seymour dipole subtraction which is a general procedure to treat infrared divergences in real emission processes at next-to-leading order in QCD. The automatization rests on three essential steps: the creation of the dipole terms, the calculation of the color linked squared Born matrix elements, and the evaluation of different helicity amplitudes. The routines have been tested for a number of complex processes, such as the real emission process gg→t anti tggg. (orig.)

Colourful FKS subtraction

CERN Document Server

Frixione, Stefano

2011-01-01

I formulate in a colour-friendly way the FKS method for the computation of QCD cross sections at the next-to-leading order accuracy. This is achieved through the definition of subtraction terms for squared matrix elements, constructed with single colour-dressed or pairs of colour-ordered amplitudes. The latter approach relies on the use of colour flows, is exact to all orders in $N$, and is thus particularly suited to being organized as a systematic expansion in 1/N.

Landform classification using a sub-pixel spatial attraction model to increase spatial resolution of digital elevation model (DEM

Directory of Open Access Journals (Sweden)

Marzieh Mokarrama

2018-04-01

Full Text Available The purpose of the present study is preparing a landform classification by using digital elevation model (DEM which has a high spatial resolution. To reach the mentioned aim, a sub-pixel spatial attraction model was used as a novel method for preparing DEM with a high spatial resolution in the north of Darab, Fars province, Iran. The sub-pixel attraction models convert the pixel into sub-pixels based on the neighboring pixels fraction values, which can only be attracted by a central pixel. Based on this approach, a mere maximum of eight neighboring pixels can be selected for calculating of the attraction value. In the mentioned model, other pixels are supposed to be far from the central pixel to receive any attraction. In the present study by using a sub-pixel attraction model, the spatial resolution of a DEM was increased. The design of the algorithm is accomplished by using a DEM with a spatial resolution of 30 m (the Advanced Space borne Thermal Emission and Reflection Radiometer; (ASTER and a 90 m (the Shuttle Radar Topography Mission; (SRTM. In the attraction model, scale factors of (S = 2, S = 3, and S = 4 with two neighboring methods of touching (T = 1 and quadrant (T = 2 are applied to the DEMs by using MATLAB software. The algorithm is evaluated by taking the best advantages of 487 sample points, which are measured by surveyors. The spatial attraction model with scale factor of (S = 2 gives better results compared to those scale factors which are greater than 2. Besides, the touching neighborhood method is turned to be more accurate than the quadrant method. In fact, dividing each pixel into more than two sub-pixels decreases the accuracy of the resulted DEM. On the other hand, in these cases DEM, is itself in charge of increasing the value of root-mean-square error (RMSE and shows that attraction models could not be used for S which is greater than 2. Thus considering results, the proposed model is highly capable of

Testing multistage gain and offset trimming in a single photon counting IC with a charge sharing elimination algorithm

International Nuclear Information System (INIS)

Krzyżanowska, A.; Gryboś, P.; Szczygieł, R.; Maj, P.

2015-01-01

Designing a hybrid pixel detector readout electronics operating in a single photon counting mode is a very challenging process, where many main parameters are optimized in parallel (e.g. gain, noise, and threshold dispersion). Additional requirements for a smaller pixel size with extended functionality push designers to use new deep sub-micron technologies. Minimizing the channel size is possible, however, with a decreased pixel size, the charge sharing effect becomes a more important issue. To overcome this problem, we designed an integrated circuit prototype produced in CMOS 40 nm technology, which has an extended functionality of a single pixel. A C8P1 algorithm for the charge sharing effect compensation was implemented. In the algorithm's first stage the charge is rebuilt in a signal rebuilt hub fed by the CSA (charge sensitive amplifier) outputs from four neighbouring pixels. Then, the pixel with the biggest amount of charge is chosen, after a comparison with all the adjacent ones. In order to process the data in such a complicated way, a certain architecture of a single channel was proposed, which allows for: ⋅ processing the signal with the possibility of total charge reconstruction (by connecting with the adjacent pixels), ⋅ a comparison of certain pixel amplitude to its 8 neighbours, ⋅ the extended testability of each block inside the channel to measure CSA gain dispersion, shaper gain dispersion, threshold dispersion (including the simultaneous generation of different pulse amplitudes from different pixels), ⋅ trimming all the necessary blocks for proper operation. We present a solution for multistage gain and offset trimming implemented in the IC prototype. It allows for minimization of the total charge extraction errors, minimization of threshold dispersion in the pixel matrix and minimization of errors of comparison of certain pixel pulse amplitudes with all its neighbours. The detailed architecture of a single channel is presented

ATLAS Pixel Detector Operational Experience

CERN Document Server

Di Girolamo, B; The ATLAS collaboration

2011-01-01

The ATLAS Pixel Detector is the innermost detector of the ATLAS experiment at the Large Hadron Collider at CERN, providing high-resolution measurements of charged particle tracks in the high radiation environment close to the collision region. This capability is vital for the identification and measurement of proper decay times of long-lived particles such as b-hadrons, and thus vital for the ATLAS physics program. The detector provides hermetic coverage with three cylindrical layers and three layers of forward and backward pixel detectors. It consists of approximately 80 million pixels that are individually read out via chips bump-bonded to 1744 n-in-n silicon substrates. In this talk, results from the successful operation of the Pixel Detector at the LHC will be presented, including monitoring, calibration procedures, timing optimization and detector performance. The detector performance is excellent: 96.9% of the pixels are operational, noise occupancy and hit efficiency exceed the design specification, an...

Optimization of dual-energy subtraction chest radiography by use of a direct-conversion flat-panel detector system.

Science.gov (United States)

Fukao, Mari; Kawamoto, Kiyosumi; Matsuzawa, Hiroaki; Honda, Osamu; Iwaki, Takeshi; Doi, Tsukasa

2015-01-01

We aimed to optimize the exposure conditions in the acquisition of soft-tissue images using dual-energy subtraction chest radiography with a direct-conversion flat-panel detector system. Two separate chest images were acquired at high- and low-energy exposures with standard or thick chest phantoms. The high-energy exposure was fixed at 120 kVp with the use of an auto-exposure control technique. For the low-energy exposure, the tube voltages and entrance surface doses ranged 40-80 kVp and 20-100 % of the dose required for high-energy exposure, respectively. Further, a repetitive processing algorithm was used for reduction of the image noise generated by the subtraction process. Seven radiology technicians ranked soft-tissue images, and these results were analyzed using the normalized-rank method. Images acquired at 60 kVp were of acceptable quality regardless of the entrance surface dose and phantom size. Using a repetitive processing algorithm, the minimum acceptable doses were reduced from 75 to 40 % for the standard phantom and to 50 % for the thick phantom. We determined that the optimum low-energy exposure was 60 kVp at 50 % of the dose required for the high-energy exposure. This allowed the simultaneous acquisition of standard radiographs and soft-tissue images at 1.5 times the dose required for a standard radiograph, which is significantly lower than the values reported previously.

Nonenhanced magnetic resonance angiography (MRA) of the calf arteries at 3 Tesla: intraindividual comparison of 3D flow-dependent subtractive MRA and 2D flow-independent non-subtractive MRA.

Science.gov (United States)

Knobloch, Gesine; Lauff, Marie-Teres; Hirsch, Sebastian; Schwenke, Carsten; Hamm, Bernd; Wagner, Moritz

2016-12-01

To prospectively compare 3D flow-dependent subtractive MRA vs. 2D flow-independent non-subtractive MRA for assessment of the calf arteries at 3 Tesla. Forty-two patients with peripheral arterial occlusive disease underwent nonenhanced MRA of calf arteries at 3 Tesla with 3D flow-dependent subtractive MRA (fast spin echo sequence; 3D-FSE-MRA) and 2D flow-independent non-subtractive MRA (balanced steady-state-free-precession sequence; 2D-bSSFP-MRA). Moreover, all patients underwent contrast-enhanced MRA (CE-MRA) as standard-of-reference. Two readers performed a per-segment evaluation for image quality (4 = excellent to 0 = non-diagnostic) and severity of stenosis. Image quality scores of 2D-bSSFP-MRA were significantly higher compared to 3D-FSE-MRA (medians across readers: 4 vs. 3; p Tesla with significantly higher image quality and diagnostic accuracy compared to 3D flow-dependent subtractive MRA (3D-FSE-MRA). • 2D flow-independent non-subtractive MRA (2D-bSSFP-MRA) is a robust NE-MRA technique at 3T • 2D-bSSFP-MRA outperforms 3D flow-dependent subtractive MRA (3D-FSE-MRA) as NE-MRA of calf arteries • 2D-bSSFP-MRA is a promising alternative to CE-MRA for calf PAOD evaluation.

Digital subtraction angiography (DSA)

International Nuclear Information System (INIS)

Ludwig, J.W.; Eikelboom, B.C.; Van Schaik, C.C.; Taams, A.J.; Teeuwen, C.

1985-01-01

Besides the non-invasive techniques, angiography remains essential. The disadvantages of angiography are the complexity of the procedure and the possibility of complications. Digital subtraction angiography (DSA) is a considerable improvement in the examination of vessels. In DSA, subtraction combined with enhancement of the signals allows the use of intravenous injection to obtain good images of the arteries. However, when the contrast material is supplied intravenously, a rather large amount of contrast material is necessary to obtain images of good quality. Quantities of 30-40 cc of contrast material are required. The advantage of the intravenous injection of contrast material rather than the use of a catheter to deliver the contrast material in loco is that it is almost non-invasive thus circumventing the complications caused by catheter manipulation in the arterial system. This makes it possible to apply this method on an out-patient basis. DSA can also be applied with intra-arterial selective injection of the contrast material. In this case, the strong enhancement with DSA allows the use of a small quantity of contrast material while still obtaining images of the vessels with good contrast definition

An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm

Directory of Open Access Journals (Sweden)

Yuping Hu

2014-01-01

Full Text Available An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack.

The Research and Application of SURF Algorithm Based on Feature Point Selection Algorithm

Directory of Open Access Journals (Sweden)

Zhang Fang Hu

2014-04-01

Full Text Available As the pixel information of depth image is derived from the distance information, when implementing SURF algorithm with KINECT sensor for static sign language recognition, there can be some mismatched pairs in palm area. This paper proposes a feature point selection algorithm, by filtering the SURF feature points step by step based on the number of feature points within adaptive radius r and the distance between the two points, it not only greatly improves the recognition rate, but also ensures the robustness under the environmental factors, such as skin color, illumination intensity, complex background, angle and scale changes. The experiment results show that the improved SURF algorithm can effectively improve the recognition rate, has a good robustness.

Subleading power corrections for N -jettiness subtractions

Science.gov (United States)

Moult, Ian; Rothen, Lorena; Stewart, Iain W.; Tackmann, Frank J.; Zhu, Hua Xing

2017-04-01

The N -jettiness observable TN provides a way of describing the leading singular behavior of the N -jet cross section in the τ =TN/Q →0 limit, where Q is a hard interaction scale. We consider subleading-power corrections in the τ ≪1 expansion, and employ soft-collinear effective theory to obtain analytic results for the dominant αsτ ln τ and αs2τ ln3τ subleading terms for thrust in e+e- collisions and 0-jettiness for q q ¯-initiated Drell-Yan-like processes at hadron colliders. These results can be used to significantly improve the numerical accuracy and stability of the N -jettiness subtraction technique for performing fixed-order calculations at next-to-leading order and next-to-next-to-leading order. They reduce the size of missing power corrections in the subtractions by an order of magnitude. We also point out that the precise definition of N -jettiness has an important impact on the size of the power corrections and thus the numerical accuracy of the subtractions. The sometimes employed definition of N -jettiness in the hadronic center-of-mass frame suffers from power corrections that grow exponentially with rapidity, causing the power expansion to deteriorate away from central rapidity. This degradation does not occur for the original N -jettiness definition, which explicitly accounts for the boost of the Born process relative to the frame of the hadronic collision, and has a well-behaved power expansion throughout the entire phase space. Integrated over rapidity, using this N -jettiness definition in the subtractions yields another order of magnitude improvement compared to employing the hadronic-frame definition.

Pixelated coatings and advanced IR coatings

Science.gov (United States)

Pradal, Fabien; Portier, Benjamin; Oussalah, Meihdi; Leplan, Hervé

2017-09-01

Reosc developed pixelated infrared coatings on detector. Reosc manufactured thick pixelated multilayer stacks on IR-focal plane arrays for bi-spectral imaging systems, demonstrating high filter performance, low crosstalk, and no deterioration of the device sensitivities. More recently, a 5-pixel filter matrix was designed and fabricated. Recent developments in pixelated coatings, shows that high performance infrared filters can be coated directly on detector for multispectral imaging. Next generation space instrument can benefit from this technology to reduce their weight and consumptions.

Fast algorithm for spectral processing with application to on-line welding quality assurance

Science.gov (United States)

Mirapeix, J.; Cobo, A.; Jaúregui, C.; López-Higuera, J. M.

2006-10-01

A new technique is presented in this paper for the analysis of welding process emission spectra to accurately estimate in real-time the plasma electronic temperature. The estimation of the electronic temperature of the plasma, through the analysis of the emission lines from multiple atomic species, may be used to monitor possible perturbations during the welding process. Unlike traditional techniques, which usually involve peak fitting to Voigt functions using the Levenberg-Marquardt recursive method, sub-pixel algorithms are used to more accurately estimate the central wavelength of the peaks. Three different sub-pixel algorithms will be analysed and compared, and it will be shown that the LPO (linear phase operator) sub-pixel algorithm is a better solution within the proposed system. Experimental tests during TIG-welding using a fibre optic to capture the arc light, together with a low cost CCD-based spectrometer, show that some typical defects associated with perturbations in the electron temperature can be easily detected and identified with this technique. A typical processing time for multiple peak analysis is less than 20 ms running on a conventional PC.

Physical principles of cardiac digital subtraction angiography

International Nuclear Information System (INIS)

Buonocore, E.; Pavlicek, W.

1986-01-01

Advances in the applications of computers with standard radiologic equipment have resulted in the development of electronic, or so-called ''film-less'' imaging. This technique, discussed by the authors, has become of particular value in the visualization of the central vascular system and has become known as digital subtraction angiography (DSA). Commercial products have become increasingly available and are capable of converting T.V. signals, obtained by conventional fluorography, to a computed array of digital values. Addition, subtraction, and averaging of this data, result in images with adequate signal-to-noise ratios that achieve detection of low concentrations of contrast media not possible with conventional screen film techniques. Computer subtraction of unnecessary background information improves the conspicuity of the opacified vessels to permit detection of vascular structures containing a concentration of no more than 1-3 percent of contrast media. This improved visualization is possible even with intravenous peripheral injections or reduced amounts of contrast media given intraarterially. With either method of contrast media administration, DSDA has become an excellent means of anatomic demonstration of the heart and great vessels with decreased morbidity and at lower cost

SU-D-201-06: Random Walk Algorithm Seed Localization Parameters in Lung Positron Emission Tomography (PET) Images

Energy Technology Data Exchange (ETDEWEB)

Soufi, M [Shahid Beheshti University, Tehran, Tehran (Iran, Islamic Republic of); Asl, A Kamali [Shahid Beheshti University, Tehran, Iran., Tehran, Tehran (Iran, Islamic Republic of); Geramifar, P [Shariati Hospital, Tehran, Iran., Tehran, Tehran (Iran, Islamic Republic of)

2015-06-15

Purpose: The objective of this study was to find the best seed localization parameters in random walk algorithm application to lung tumor delineation in Positron Emission Tomography (PET) images. Methods: PET images suffer from statistical noise and therefore tumor delineation in these images is a challenging task. Random walk algorithm, a graph based image segmentation technique, has reliable image noise robustness. Also its fast computation and fast editing characteristics make it powerful for clinical purposes. We implemented the random walk algorithm using MATLAB codes. The validation and verification of the algorithm have been done by 4D-NCAT phantom with spherical lung lesions in different diameters from 20 to 90 mm (with incremental steps of 10 mm) and different tumor to background ratios of 4:1 and 8:1. STIR (Software for Tomographic Image Reconstruction) has been applied to reconstruct the phantom PET images with different pixel sizes of 2×2×2 and 4×4×4 mm{sup 3}. For seed localization, we selected pixels with different maximum Standardized Uptake Value (SUVmax) percentages, at least (70%, 80%, 90% and 100%) SUVmax for foreground seeds and up to (20% to 55%, 5% increment) SUVmax for background seeds. Also, for investigation of algorithm performance on clinical data, 19 patients with lung tumor were studied. The resulted contours from algorithm have been compared with nuclear medicine expert manual contouring as ground truth. Results: Phantom and clinical lesion segmentation have shown that the best segmentation results obtained by selecting the pixels with at least 70% SUVmax as foreground seeds and pixels up to 30% SUVmax as background seeds respectively. The mean Dice Similarity Coefficient of 94% ± 5% (83% ± 6%) and mean Hausdorff Distance of 1 (2) pixels have been obtained for phantom (clinical) study. Conclusion: The accurate results of random walk algorithm in PET image segmentation assure its application for radiation treatment planning and

SU-D-201-06: Random Walk Algorithm Seed Localization Parameters in Lung Positron Emission Tomography (PET) Images

International Nuclear Information System (INIS)

Soufi, M; Asl, A Kamali; Geramifar, P

2015-01-01

Purpose: The objective of this study was to find the best seed localization parameters in random walk algorithm application to lung tumor delineation in Positron Emission Tomography (PET) images. Methods: PET images suffer from statistical noise and therefore tumor delineation in these images is a challenging task. Random walk algorithm, a graph based image segmentation technique, has reliable image noise robustness. Also its fast computation and fast editing characteristics make it powerful for clinical purposes. We implemented the random walk algorithm using MATLAB codes. The validation and verification of the algorithm have been done by 4D-NCAT phantom with spherical lung lesions in different diameters from 20 to 90 mm (with incremental steps of 10 mm) and different tumor to background ratios of 4:1 and 8:1. STIR (Software for Tomographic Image Reconstruction) has been applied to reconstruct the phantom PET images with different pixel sizes of 2×2×2 and 4×4×4 mm 3 . For seed localization, we selected pixels with different maximum Standardized Uptake Value (SUVmax) percentages, at least (70%, 80%, 90% and 100%) SUVmax for foreground seeds and up to (20% to 55%, 5% increment) SUVmax for background seeds. Also, for investigation of algorithm performance on clinical data, 19 patients with lung tumor were studied. The resulted contours from algorithm have been compared with nuclear medicine expert manual contouring as ground truth. Results: Phantom and clinical lesion segmentation have shown that the best segmentation results obtained by selecting the pixels with at least 70% SUVmax as foreground seeds and pixels up to 30% SUVmax as background seeds respectively. The mean Dice Similarity Coefficient of 94% ± 5% (83% ± 6%) and mean Hausdorff Distance of 1 (2) pixels have been obtained for phantom (clinical) study. Conclusion: The accurate results of random walk algorithm in PET image segmentation assure its application for radiation treatment planning and

Object Detection and Tracking using Modified Diamond Search Block Matching Motion Estimation Algorithm

Directory of Open Access Journals (Sweden)

Apurva Samdurkar

2018-06-01

Full Text Available Object tracking is one of the main fields within computer vision. Amongst various methods/ approaches for object detection and tracking, the background subtraction approach makes the detection of object easier. To the detected object, apply the proposed block matching algorithm for generating the motion vectors. The existing diamond search (DS and cross diamond search algorithms (CDS are studied and experiments are carried out on various standard video data sets and user defined data sets. Based on the study and analysis of these two existing algorithms a modified diamond search pattern (MDS algorithm is proposed using small diamond shape search pattern in initial step and large diamond shape (LDS in further steps for motion estimation. The initial search pattern consists of five points in small diamond shape pattern and gradually grows into a large diamond shape pattern, based on the point with minimum cost function. The algorithm ends with the small shape pattern at last. The proposed MDS algorithm finds the smaller motion vectors and fewer searching points than the existing DS and CDS algorithms. Further, object detection is carried out by using background subtraction approach and finally, MDS motion estimation algorithm is used for tracking the object in color video sequences. The experiments are carried out by using different video data sets containing a single object. The results are evaluated and compared by using the evaluation parameters like average searching points per frame and average computational time per frame. The experimental results show that the MDS performs better than DS and CDS on average search point and average computation time.

Adaptive local backlight dimming algorithm based on local histogram and image characteristics

DEFF Research Database (Denmark)

Nadernejad, Ehsan; Burini, Nino; Korhonen, Jari

2013-01-01

-off between power consumption and image quality preservation than the other algorithms representing the state of the art among feature based backlight algorithms. © (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.......Liquid Crystal Display (LCDs) with Light Emitting Diode (LED) backlight is a very popular display technology, used for instance in television sets, monitors and mobile phones. This paper presents a new backlight dimming algorithm that exploits the characteristics of the target image......, such as the local histograms and the average pixel intensity of each backlight segment, to reduce the power consumption of the backlight and enhance image quality. The local histogram of the pixels within each backlight segment is calculated and, based on this average, an adaptive quantile value is extracted...

A novel hybrid color image encryption algorithm using two complex chaotic systems

Science.gov (United States)

Wang, Leyuan; Song, Hongjun; Liu, Ping

2016-02-01

Based on complex Chen and complex Lorenz systems, a novel color image encryption algorithm is proposed. The larger chaotic ranges and more complex behaviors of complex chaotic systems, which compared with real chaotic systems could additionally enhance the security and enlarge key space of color image encryption. The encryption algorithm is comprised of three step processes. In the permutation process, the pixels of plain image are scrambled via two-dimensional and one-dimensional permutation processes among RGB channels individually. In the diffusion process, the exclusive-or (XOR for short) operation is employed to conceal pixels information. Finally, the mixing RGB channels are used to achieve a multilevel encryption. The security analysis and experimental simulations demonstrate that the proposed algorithm is large enough to resist the brute-force attack and has excellent encryption performance.

Digital image comparison by subtracting contextual transformations—percentile rank order differentiation

Science.gov (United States)

Wehde, M. E.

1995-01-01

The common method of digital image comparison by subtraction imposes various constraints on the image contents. Precise registration of images is required to assure proper evaluation of surface locations. The attribute being measured and the calibration and scaling of the sensor are also important to the validity and interpretability of the subtraction result. Influences of sensor gains and offsets complicate the subtraction process. The presence of any uniform systematic transformation component in one of two images to be compared distorts the subtraction results and requires analyst intervention to interpret or remove it. A new technique has been developed to overcome these constraints. Images to be compared are first transformed using the cumulative relative frequency as a transfer function. The transformed images represent the contextual relationship of each surface location with respect to all others within the image. The process of differentiating between the transformed images results in a percentile rank ordered difference. This process produces consistent terrain-change information even when the above requirements necessary for subtraction are relaxed. This technique may be valuable to an appropriately designed hierarchical terrain-monitoring methodology because it does not require human participation in the process.

Late iodine enhancement computed tomography with image subtraction for assessment of myocardial infarction

Energy Technology Data Exchange (ETDEWEB)

Tanabe, Yuki; Kido, Teruhito; Kurata, Akira; Kouchi, Takanori; Fukuyama, Naoki; Yokoi, Takahiro; Miyagawa, Masao; Mochizuki, Teruhito [Ehime University Graduate School of Medicine, Department of Radiology, Toon City, Ehime (Japan); Uetani, Teruyoshi [Department of Cardiology, Ehime University Graduate School of Medicine, Toon City, Ehime (Japan); Yamashita, Natsumi [National Hospital Organization Shikoku Cancer Center, Department of Clinical Biostatistics, Section of Cancer Prevention and Epidemiology, Clinical Research Center, Matsuyama City, Ehime (Japan)

2018-03-15

To evaluate the feasibility of image subtraction in late iodine enhancement CT (LIE-CT) for assessment of myocardial infarction (MI). A comprehensive cardiac CT protocol and late gadolinium enhancement MRI (LGE-MRI) was used to assess coronary artery disease in 27 patients. LIE-CT was performed after stress CT perfusion (CTP) and CT angiography. Subtraction LIE-CT was created by subtracting the mask volume of the left ventricle (LV) cavity from the original LIE-CT using CTP dataset. The %MI volume was quantified as the ratio of LIE to entire LV volume, and transmural extent (TME) of LIE was classified as 0%, 1-24%, 25-49%, 50-74% or 75-100%. These results were compared with LGE-MRI using the Spearman rank test, Bland-Altman method and chi-square test. One hundred twenty-five (29%) of 432 segments were positive on LGE-MRI. Correlation coefficients for original and subtraction LIE-CT to LGE-MRI were 0.79 and 0.85 for %MI volume. Concordances of the 5-point grading scale between original and subtraction LIE-CT with LGE-MRI were 75% and 84% for TME; concordance was significantly improved using the subtraction technique (p <0.05). Subtraction LIE-CT allowed more accurate assessment of MI extent than the original LIE-CT. (orig.)

Decoupling Subtraction Conserving Full Gauge Symmetries : Particles and Fields

OpenAIRE

Noriyasu, OHTSUBO; Hideo, MIYATA; Department of Phycics, Kanazawa Technical College; Department of Information Science, Kanazawa Institute of Technolgy

1984-01-01

A new subtraction scheme (^^^) which realizes the decoupling and conserves the symmetries of full gauge group simultaneously, is proposed. One particle irreducible Green's functions subtracted by ^^^ reveal the effective low energy symmetries at -p^2≪M^2 and the full symmetries at -p^2≫M^2, where M denotes a heavy mass. Also discussed are conditions in order to carry out ^^^ under two-loop approximation.

Pixels, Blocks of Pixels, and Polygons: Choosing a Spatial Unit for Thematic Accuracy Assessment

Science.gov (United States)

Pixels, polygons, and blocks of pixels are all potentially viable spatial assessment units for conducting an accuracy assessment. We develop a statistical population-based framework to examine how the spatial unit chosen affects the outcome of an accuracy assessment. The populati...

Studio di un algoritmo lineare di ricostruzione analogica della posizione per il rivelatore a pixel di ATLAS

CERN Document Server

Arelli-Maffioli, A; Troncon, C; Lari, T

2007-01-01

A detailed study of spatial resolution of Atlas pixel sensors prototypes was performed. Charge interpolation was used and allowed for a significant improvement with respect to digital resolution. A simplified algorithm for charge interpolation was developed. Its application to both unirradiated and irradiated sensors is presented and discussed.

CMS Pixel Detector Upgrade

CERN Document Server

INSPIRE-00038772

2011-01-01

The present Compact Muon Solenoid silicon pixel tracking system has been designed for a peak luminosity of 1034cm-2s-1 and total dose corresponding to two years of the Large Hadron Collider (LHC) operation. With the steady increase of the luminosity expected at the LHC, a new pixel detector with four barrel layers and three endcap disks is being designed. We will present the key points of the design: the new geometry, which minimizes the material budget and increases the tracking points, and the development of a fast digital readout architecture, which ensures readout efficiency even at high rate. The expected performances for tracking and vertexing of the new pixel detector are also addressed.

Advanced pixel architectures for scientific image sensors

CERN Document Server

Coath, R; Godbeer, A; Wilson, M; Turchetta, R

2009-01-01

We present recent developments from two projects targeting advanced pixel architectures for scientific applications. Results are reported from FORTIS, a sensor demonstrating variants on a 4T pixel architecture. The variants include differences in pixel and diode size, the in-pixel source follower transistor size and the capacitance of the readout node to optimise for low noise and sensitivity to small amounts of charge. Results are also reported from TPAC, a complex pixel architecture with ~160 transistors per pixel. Both sensors were manufactured in the 0.18μm INMAPS process, which includes a special deep p-well layer and fabrication on a high resistivity epitaxial layer for improved charge collection efficiency.

Gossip: Gaseous pixels

Science.gov (United States)

Koffeman, E. N.

2007-12-01

Several years ago a revolutionary miniature TPC was developed using a pixel chip with a Micromegas foil spanned over it. To overcome the mechanical stability problems and improve the positioning accuracy while spanning a foil on top of a small readout chip a process has been developed in which a Micromegas-like grid is applied on a CMOS wafer in a post-processing step. This aluminum grid is supported on insulating pillars that are created by etching after the grid has been made. The energy resolution (measured on the absorption of the X-rays from a 55Fe source) was remarkably good. Several geometries have since been tested and we now believe that a Gas On Slimmed Silicon Pixel chip' (Gossip) may be realized. The drift region of such a gaseous pixel detector would be reduced to a millimeter. Such a detector is potentially very radiation hard (SLHC vertexing) but aging and sparking must be eliminated.

Gossip: Gaseous pixels

Energy Technology Data Exchange (ETDEWEB)

Koffeman, E.N. [Nikhef, Kruislaan 409, 1098 SJ Amsterdam (Netherlands)], E-mail: d77@nikhef.nl

2007-12-01

Several years ago a revolutionary miniature TPC was developed using a pixel chip with a Micromegas foil spanned over it. To overcome the mechanical stability problems and improve the positioning accuracy while spanning a foil on top of a small readout chip a process has been developed in which a Micromegas-like grid is applied on a CMOS wafer in a post-processing step. This aluminum grid is supported on insulating pillars that are created by etching after the grid has been made. The energy resolution (measured on the absorption of the X-rays from a {sup 55}Fe source) was remarkably good. Several geometries have since been tested and we now believe that a Gas On Slimmed Silicon Pixel chip' (Gossip) may be realized. The drift region of such a gaseous pixel detector would be reduced to a millimeter. Such a detector is potentially very radiation hard (SLHC vertexing) but aging and sparking must be eliminated.

Gossip: Gaseous pixels

International Nuclear Information System (INIS)

Koffeman, E.N.

2007-01-01

Several years ago a revolutionary miniature TPC was developed using a pixel chip with a Micromegas foil spanned over it. To overcome the mechanical stability problems and improve the positioning accuracy while spanning a foil on top of a small readout chip a process has been developed in which a Micromegas-like grid is applied on a CMOS wafer in a post-processing step. This aluminum grid is supported on insulating pillars that are created by etching after the grid has been made. The energy resolution (measured on the absorption of the X-rays from a 55 Fe source) was remarkably good. Several geometries have since been tested and we now believe that a Gas On Slimmed Silicon Pixel chip' (Gossip) may be realized. The drift region of such a gaseous pixel detector would be reduced to a millimeter. Such a detector is potentially very radiation hard (SLHC vertexing) but aging and sparking must be eliminated

Gamma radiation damage in pixelated detector based on carbon nanotubes

International Nuclear Information System (INIS)

Leyva, A.; Pinnera, I.; Leyva, D.; Abreu, Y.; Cruz, C. M.

2013-01-01

The aim of this paper is to evaluate the possible gamma radiation damage in high pixelated based on multi-walled carbon nanotubes detectors, grown on two different substrata, when it is operating in aggressive radiational environments. The radiation damage in displacements per atom (dpa) terms were calculated using the MCCM algorithm, which takes into account the McKinley-Feshbach approach with the Kinchin-Pease approximation for the damage function. Was observed that with increasing of the gamma energy the displacement total number grows monotonically reaching values of 0.39 displacements for a 10 MeV incident photon. The profiles of point defects distributions inside the carbon nanotube pixel linearly rise with depth, increasing its slope with photon energy. In the 0.1 MeV - 10 MeV studied energy interval the electron contribution to the total displacement number become higher than the positron ones, reaching this last one a maximum value of 12% for the 10 MeV incident photons. Differences between the calculation results for the two used different substrata were not observed. (Author)

Pixel 2010: A résumé

CERN Document Server

Wermes, Norbert

2011-01-01

The Pixel 2010 conference focused on semiconductor pixel detectors for particle tracking/vertexing as well as for imaging, in particular for synchrotron light sources and XFELs. The big LHC hybrid pixel detectors have impressively started showing their capabilities. X-ray imaging detectors, also using the hybrid pixel technology, have greatly advanced the experimental possibilities for diffraction experiments. Monolithic or semi-monolithic devices like CMOS active pixels and DEPFET pixels have now reached a state such that complete vertex detectors for RHIC and superKEKB are being built with these technologies. Finally, new advances towards fully monolithic active pixel detectors, featuring full CMOS electronics merged with efficient signal charge collection, exploiting standard CMOS technologies, SOI and/or 3D integration, show the path for the future. This résumé attempts to extract the main statements of the results and developments presented at this conference.

Generalized pixel profiling and comparative segmentation with application to arteriovenous malformation segmentation.

Science.gov (United States)

Babin, D; Pižurica, A; Bellens, R; De Bock, J; Shang, Y; Goossens, B; Vansteenkiste, E; Philips, W

2012-07-01

Extraction of structural and geometric information from 3-D images of blood vessels is a well known and widely addressed segmentation problem. The segmentation of cerebral blood vessels is of great importance in diagnostic and clinical applications, with a special application in diagnostics and surgery on arteriovenous malformations (AVM). However, the techniques addressing the problem of the AVM inner structure segmentation are rare. In this work we present a novel method of pixel profiling with the application to segmentation of the 3-D angiography AVM images. Our algorithm stands out in situations with low resolution images and high variability of pixel intensity. Another advantage of our method is that the parameters are set automatically, which yields little manual user intervention. The results on phantoms and real data demonstrate its effectiveness and potentials for fine delineation of AVM structure. Copyright © 2012 Elsevier B.V. All rights reserved.

Development and characterization of diamond and 3D-silicon pixel detectors with ATLAS-pixel readout electronics

International Nuclear Information System (INIS)

Mathes, Markus

2008-12-01

Hybrid pixel detectors are used for particle tracking in the innermost layers of current high energy experiments like ATLAS. After the proposed luminosity upgrade of the LHC, they will have to survive very high radiation fluences of up to 10 16 particles per cm 2 per life time. New sensor concepts and materials are required, which promise to be more radiation tolerant than the currently used planar silicon sensors. Most prominent candidates are so-called 3D-silicon and single crystal or poly-crystalline diamond sensors. Using the ATLAS pixel electronics different detector prototypes with a pixel geometry of 400 x 50 μm 2 have been built. In particular three devices have been studied in detail: a 3D-silicon and a single crystal diamond detector with an active area of about 1 cm 2 and a poly-crystalline diamond detector of the same size as a current ATLAS pixel detector module (2 x 6 cm 2 ). To characterize the devices regarding their particle detection efficiency and spatial resolution, the charge collection inside a pixel cell as well as the charge sharing between adjacent pixels was studied using a high energy particle beam. (orig.)

Intravenous digital subtraction angiography of transplanted kidney artery

International Nuclear Information System (INIS)

Tessier, J.P; Teyssou, H.; Verdier, J.P.; Tison, E.; Meyblum, J.; Marchal, M.

1986-01-01

Results of 351 intravenous digital subtraction angiographs (AN) of transplanted kidneys emphasized reliability of this examination for detection of renal artery stenosis. A prospective study of 219 patients (188 interpretable AN) showed significant stenosis of grafted artery in 22% of cases: 17% of the 126 patients with normal blood pressure and 34% of the 62 cases of hypertension. Digital subtraction allows, with a single injection, assessment of renal artery, nephrogram and excretory cavities, but it is not a substitute for conventional intravenous urography 1 to 2 months after grafting [fr

Digital subtraction radiography in the study of the lacrimal system

International Nuclear Information System (INIS)

Falaschi, F.; Pieri, L.; Perri, G.; Signorini, G.; Genovese Ebert, F.

1988-01-01

The authors emphasize the usefulness of digital dacrycystography (DCG), as compared with various current technoques. Utilizing a radiographic unit equipped with a video-fluoroscopic system and interfaced to a digital video-processor, several digitalized images are acquired before, during and after the injection of contrast medium. Final images are obtained by subtraction of suitable pairs of source frames. Twenty-six patients affected by epiphora have been examined so far. In 21 cases digital subtraction DCG allowed an accurate visualization of the lacrimal system; in the other five patients the amount of information was acceptable. This methodology allows the assessment of both the normal anatomy of the lacrimal passages and their pathological patterns, such as obstructions, stenoses, fistulas, chronic dacrycystites, lacrimal stones. The examination is easy and quick to perform, with no discomfort for the patient. Digital subtraction DCG proves thus to be a very valuable technique thanks to its possible electronic elaboration - i.e. the subtraction and the magnification of images - to its better contrast resolution, and to the possibility it yields of dynamic studies under radioscopic control

Performance verification of the CMS Phase-1 Upgrade Pixel detector

Science.gov (United States)

Veszpremi, V.

2017-12-01

The CMS tracker consists of two tracking systems utilizing semiconductor technology: the inner pixel and the outer strip detectors. The tracker detectors occupy the volume around the beam interaction region between 3 cm and 110 cm in radius and up to 280 cm along the beam axis. The pixel detector consists of 124 million pixels, corresponding to about 2 m 2 total area. It plays a vital role in the seeding of the track reconstruction algorithms and in the reconstruction of primary interactions and secondary decay vertices. It is surrounded by the strip tracker with 10 million read-out channels, corresponding to 200 m 2 total area. The tracker is operated in a high-occupancy and high-radiation environment established by particle collisions in the LHC . The current strip detector continues to perform very well. The pixel detector that has been used in Run 1 and in the first half of Run 2 was, however, replaced with the so-called Phase-1 Upgrade detector. The new system is better suited to match the increased instantaneous luminosity the LHC would reach before 2023. It was built to operate at an instantaneous luminosity of around 2×1034 cm-2s-1. The detector's new layout has an additional inner layer with respect to the previous one; it allows for more efficient tracking with smaller fake rate at higher event pile-up. The paper focuses on the first results obtained during the commissioning of the new detector. It also includes challenges faced during the first data taking to reach the optimal measurement efficiency. Details will be given on the performance at high occupancy with respect to observables such as data-rate, hit reconstruction efficiency, and resolution.

A novel image encryption algorithm based on synchronized random bit generated in cascade-coupled chaotic semiconductor ring lasers

Science.gov (United States)

Li, Jiafu; Xiang, Shuiying; Wang, Haoning; Gong, Junkai; Wen, Aijun

2018-03-01

In this paper, a novel image encryption algorithm based on synchronization of physical random bit generated in a cascade-coupled semiconductor ring lasers (CCSRL) system is proposed, and the security analysis is performed. In both transmitter and receiver parts, the CCSRL system is a master-slave configuration consisting of a master semiconductor ring laser (M-SRL) with cross-feedback and a solitary SRL (S-SRL). The proposed image encryption algorithm includes image preprocessing based on conventional chaotic maps, pixel confusion based on control matrix extracted from physical random bit, and pixel diffusion based on random bit stream extracted from physical random bit. Firstly, the preprocessing method is used to eliminate the correlation between adjacent pixels. Secondly, physical random bit with verified randomness is generated based on chaos in the CCSRL system, and is used to simultaneously generate the control matrix and random bit stream. Finally, the control matrix and random bit stream are used for the encryption algorithm in order to change the position and the values of pixels, respectively. Simulation results and security analysis demonstrate that the proposed algorithm is effective and able to resist various typical attacks, and thus is an excellent candidate for secure image communication application.

Overview of the CMS Pixel Detector

CERN Document Server

Cerati, Giuseppe B

2008-01-01

The Compact Muon Solenoid Experiment (CMS) will start taking data at the Large Hadron Collider (LHC) in 2009. It will investigate the proton-proton collisions at $14~TeV$. A robust tracking combined with a precise vertex reconstruction is crucial to address the physics challenge of proton collisions at this energy. To this extent an all-silicon tracking system with very fine granularity has been built and now is in the final commissioning phase. It represents the largest silicon tracking detector ever built. The system is composed by an outer part, made of micro-strip detectors, and an inner one, made of pixel detectors. The pixel detector consists of three pixel barrel layers and two forward disks at each side of the interaction region. Each pixel sensor, both for the barrel and forward detectors, has $100 \\times 150$ $\\mu m^2$ cells for a total of 66 million pixels covering a total area of about $1~m^2$. The pixel detector will play a crucial role in the pattern recognition and the track reconstruction both...

Dead pixel replacement in LWIR microgrid polarimeters.

Science.gov (United States)

Ratliff, Bradley M; Tyo, J Scott; Boger, James K; Black, Wiley T; Bowers, David L; Fetrow, Matthew P

2007-06-11

LWIR imaging arrays are often affected by nonresponsive pixels, or "dead pixels." These dead pixels can severely degrade the quality of imagery and often have to be replaced before subsequent image processing and display of the imagery data. For LWIR arrays that are integrated with arrays of micropolarizers, the problem of dead pixels is amplified. Conventional dead pixel replacement (DPR) strategies cannot be employed since neighboring pixels are of different polarizations. In this paper we present two DPR schemes. The first is a modified nearest-neighbor replacement method. The second is a method based on redundancy in the polarization measurements.We find that the redundancy-based DPR scheme provides an order-of-magnitude better performance for typical LWIR polarimetric data.

Soccer player recognition by pixel classification in a hybrid color space

Science.gov (United States)

Vandenbroucke, Nicolas; Macaire, Ludovic; Postaire, Jack-Gerard

1997-08-01

Soccer is a very popular sport all over the world, Coaches and sport commentators need accurate information about soccer games, especially about the players behavior. These information can be gathered by inspectors who watch the soccer match and report manually the actions of the players involved in the principal phases of the game. Generally, these inspectors focus their attention on the few players standing near the ball and don't report about the motion of all the other players. So it seems desirable to design a system which automatically tracks all the players in real- time. That's why we propose to automatically track each player through the successive color images of the sequences acquired by a fixed color camera. Each player which is present in the image, is modelized by an active contour model or snake. When, during the soccer match, a player is hidden by another, the snakes which track these two players merge. So, it becomes impossible to track the players, except if the snakes are interactively re-initialized. Fortunately, in most cases, the two players don't belong to the same team. That is why we present an algorithm which recognizes the teams of the players by pixels representing the soccer ground which must be withdrawn before considering the players themselves. To eliminate these pixels, the color characteristics of the ground are determined interactively. In a second step, dealing with windows containing only one player of one team, the color features which yield the best discrimination between the two teams are selected. Thanks to these color features, the pixels associated to the players of the two teams form two separated clusters into a color space. In fact, there are many color representation systems and it's interesting to evaluate the features which provide the best separation between the two classes of pixels according to the players soccer suit. Finally, the classification process for image segmentation is based on the three most

Detection of intracranial aneurysms using three-dimensional multidetector-row CT angiography: Is bone subtraction necessary?

International Nuclear Information System (INIS)

Hwang, Seung Bae; Kwak, Hyo Sung; Han, Young Min; Chung, Gyung Ho

2011-01-01

Purpose: The aim of this study was to evaluate the usefulness of three-dimensional CT angiography (3D CTA) with bone subtraction in a comparison with 3D CTA without bone subtraction for the detection of intracranial aneurysms. Materials and methods: Among 337 consecutive patients who had intracranial aneurysms detected on 3D CTA, 170 patients who underwent digital subtraction angiography (DSA) were included in the study. CTA was performed with a 16-slice multidetector-row CT (MDCT) scanner. We created the 3D reconstruction images with and without bone subtraction by using the volume rendering technique. Three neuroradiologists in a blinded fashion interpreted both 3D CTA images with and without bone subtraction. The diagnostic accuracy of both techniques was evaluated using the alternative free-response receiver operating characteristic (ROC) analysis. The sensitivity and positive predictive value were also evaluated. Results: A total of 200 aneurysms (size: 2-23 mm) were detected in 170 patients. The area under the receiver operating characteristic curve (Az) for 3D CTA with bone subtraction (mean, Az = 0.933) was significantly higher than that for 3D CTA without bone subtraction (mean, Az = 0.879) for all observers (P < 0.05). The sensitivity of 3D CTA with bone subtraction for three observers was 90.0, 92.0 and 92.5%, respectively, while the sensitivity of 3D CTA without bone subtraction was 83.5, 83.5 and 87.5%, respectively. No significant difference in positive predictive value was observed between the two modalities. Conclusions: 3D CTA with bone subtraction showed significantly higher diagnostic accuracy for the detection of intracranial aneurysms as compared to 3D CTA without bone subtraction.

Incidence of ischemic lesions in diffusion-weighted imaging after transbrachial digital subtraction angiography

International Nuclear Information System (INIS)

Aschenbach, R.; Majeed, A.; Eger, C.; Basche, S.; Kerl, J.M.; Vogl, T.J.

2008-01-01

Purpose: to evaluate the frequency of ischemia after transbrachial digital subtraction angiography under ambulant conditions using diffusion-weighted imaging. Materials and methods: 200 patients were included in a prospective study design and received transbrachial digital subtraction angiography under ambulant conditions. Before and after digital subtraction angiography, diffusion-weighted imaging of the brain was performed. Results: in our study population no new lesions were found in diffusion-weighted imaging after digital subtraction angiography during the 3-hour window after angiography. One new lesion was found 3 days after angiography as a late onset complication. Therefore, the frequency of neurological complications is at the level of the confidence interval of 0 - 1.5%. Conclusion: the transbrachial approach under ambulant conditions is a safe method for digital subtraction angiography resulting in a low rate of ischemic lesions in diffusion-weighted imaging. (orig.)

Improved Steganographic Method Preserving Pixel-Value Differencing Histogram with Modulus Function

Directory of Open Access Journals (Sweden)

Heung-Kyu Lee

2010-01-01

Full Text Available We herein advance a secure steganographic algorithm that uses a turnover policy and a novel adjusting process. Although the method of Wang et al. uses Pixel-Value Differencing (PVD and their modulus function provides high capacity and good image quality, the embedding process causes a number of artifacts, such as abnormal increases and fluctuations in the PVD histogram, which may reveal the existence of the hidden message. In order to enhance the security of the algorithm, a turnover policy is used that prevents abnormal increases in the histogram values and a novel adjusting process is devised to remove the fluctuations at the border of the subrange in the PVD histogram. The proposed method therefore eliminates all the weaknesses of the PVD steganographic methods thus far proposed and guarantees secure communication. In the experiments described herein, the proposed algorithm is compared with other PVD steganographic algorithms by using well-known steganalysis techniques, such as RS-analysis, steganalysis for LSB matching, and histogram-based attacks. The results support our contention that the proposed method enhances security by keeping the PVD histogram similar to the cover, while also providing high embedding capacity and good imperceptibility to the naked eye.

Digital subtraction angiography in traumatology

International Nuclear Information System (INIS)

Steudel, A.; Harder, T.; Lackner, K.; Schneider, B.; Orellano, L.; Bonn Univ.; Bonn Univ.

1986-01-01

The methods, indications and results of digital subtraction angiography in traumatology are presented, based on 56 examinations. The different use of intravenous or intraarterial DSA will be discussed with respect to expanding and localisation of traumatic vascular injury. DSA is recommended as the method of choice for follow-up after vascular reconstructive procedure. (orig.) [de

Subtractive Structural Modification of Morpho Butterfly Wings.

Science.gov (United States)

Shen, Qingchen; He, Jiaqing; Ni, Mengtian; Song, Chengyi; Zhou, Lingye; Hu, Hang; Zhang, Ruoxi; Luo, Zhen; Wang, Ge; Tao, Peng; Deng, Tao; Shang, Wen

2015-11-11

Different from studies of butterfly wings through additive modification, this work for the first time studies the property change of butterfly wings through subtractive modification using oxygen plasma etching. The controlled modification of butterfly wings through such subtractive process results in gradual change of the optical properties, and helps the further understanding of structural optimization through natural evolution. The brilliant color of Morpho butterfly wings is originated from the hierarchical nanostructure on the wing scales. Such nanoarchitecture has attracted a lot of research effort, including the study of its optical properties, its potential use in sensing and infrared imaging, and also the use of such structure as template for the fabrication of high-performance photocatalytic materials. The controlled subtractive processes provide a new path to modify such nanoarchitecture and its optical property. Distinct from previous studies on the optical property of the Morpho wing structure, this study provides additional experimental evidence for the origination of the optical property of the natural butterfly wing scales. The study also offers a facile approach to generate new 3D nanostructures using butterfly wings as the templates and may lead to simpler structure models for large-scale man-made structures than those offered by original butterfly wings. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A New Profile Shape Matching Stereovision Algorithm for Real-time Human Pose and Hand Gesture Recognition

Directory of Open Access Journals (Sweden)

Dong Zhang

2014-02-01

Full Text Available This paper presents a new profile shape matching stereovision algorithm that is designed to extract 3D information in real time. This algorithm obtains 3D information by matching profile intensity shapes of each corresponding row of the stereo image pair. It detects the corresponding matching patterns of the intensity profile rather than the intensity values of individual pixels or pixels in a small neighbourhood. This approach reduces the effect of the intensity and colour variations caused by lighting differences. As with all real-time vision algorithms, there is always a trade-off between accuracy and processing speed. This algorithm achieves a balance between the two to produce accurate results for real-time applications. To demonstrate its performance, the proposed algorithm is tested for human pose and hand gesture recognition to control a smart phone and an entertainment system.

CMS Barrel Pixel Detector Overview

CERN Document Server

Kästli, H C; Erdmann, W; Gabathuler, K; Hörmann, C; Horisberger, Roland Paul; König, S; Kotlinski, D; Meier, B; Robmann, P; Rohe, T; Streuli, S

2007-01-01

The pixel detector is the innermost tracking device of the CMS experiment at the LHC. It is built from two independent sub devices, the pixel barrel and the end disks. The barrel consists of three concentric layers around the beam pipe with mean radii of 4.4, 7.3 and 10.2 cm. There are two end disks on each side of the interaction point at 34.5 cm and 46.5 cm. This article gives an overview of the pixel barrel detector, its mechanical support structure, electronics components, services and its expected performance.

Digital subtraction angiography: first 900 cases

International Nuclear Information System (INIS)

Rodgers, H.

1984-01-01

The diagnostic technique of digital subtraction angiography (DSA) is briefly outlined. The operational and technical experiences with a DR-960 DSA system used in the examination of the first 900 cases at St. Thomas' Hospital, London are described. (U.K.)

Correlation Wave-Front Sensing Algorithms for Shack-Hartmann-Based Adaptive Optics using a Point Source

International Nuclear Information System (INIS)

Poynee, L A

2003-01-01

Shack-Hartmann based Adaptive Optics system with a point-source reference normally use a wave-front sensing algorithm that estimates the centroid (center of mass) of the point-source image 'spot' to determine the wave-front slope. The centroiding algorithm suffers for several weaknesses. For a small number of pixels, the algorithm gain is dependent on spot size. The use of many pixels on the detector leads to significant propagation of read noise. Finally, background light or spot halo aberrations can skew results. In this paper an alternative algorithm that suffers from none of these problems is proposed: correlation of the spot with a ideal reference spot. The correlation method is derived and a theoretical analysis evaluates its performance in comparison with centroiding. Both simulation and data from real AO systems are used to illustrate the results. The correlation algorithm is more robust than centroiding, but requires more computation

CMS has a heart of pixels

CERN Multimedia

2003-01-01

In the immediate vicinity of the collision point, CMS will be equipped with pixel detectors consisting of no fewer than 50 million pixels measuring 150 microns along each side. Each of the pixels, which receive the signal, is connected to its own electronic circuit by a tiny sphere (seen here in the electron microscope image) measuring 15 to 20 microns in diameter.

Automatic optimal filament segmentation with sub-pixel accuracy using generalized linear models and B-spline level-sets.

Science.gov (United States)

Xiao, Xun; Geyer, Veikko F; Bowne-Anderson, Hugo; Howard, Jonathon; Sbalzarini, Ivo F

2016-08-01

Biological filaments, such as actin filaments, microtubules, and cilia, are often imaged using different light-microscopy techniques. Reconstructing the filament curve from the acquired images constitutes the filament segmentation problem. Since filaments have lower dimensionality than the image itself, there is an inherent trade-off between tracing the filament with sub-pixel accuracy and avoiding noise artifacts. Here, we present a globally optimal filament segmentation method based on B-spline vector level-sets and a generalized linear model for the pixel intensity statistics. We show that the resulting optimization problem is convex and can hence be solved with global optimality. We introduce a simple and efficient algorithm to compute such optimal filament segmentations, and provide an open-source implementation as an ImageJ/Fiji plugin. We further derive an information-theoretic lower bound on the filament segmentation error, quantifying how well an algorithm could possibly do given the information in the image. We show that our algorithm asymptotically reaches this bound in the spline coefficients. We validate our method in comprehensive benchmarks, compare with other methods, and show applications from fluorescence, phase-contrast, and dark-field microscopy. Copyright © 2016 The Authors. Published by Elsevier B.V. All rights reserved.

Development and characterization of diamond and 3D-silicon pixel detectors with ATLAS-pixel readout electronics

Energy Technology Data Exchange (ETDEWEB)

Mathes, Markus

2008-12-15

Hybrid pixel detectors are used for particle tracking in the innermost layers of current high energy experiments like ATLAS. After the proposed luminosity upgrade of the LHC, they will have to survive very high radiation fluences of up to 10{sup 16} particles per cm{sup 2} per life time. New sensor concepts and materials are required, which promise to be more radiation tolerant than the currently used planar silicon sensors. Most prominent candidates are so-called 3D-silicon and single crystal or poly-crystalline diamond sensors. Using the ATLAS pixel electronics different detector prototypes with a pixel geometry of 400 x 50 {mu}m{sup 2} have been built. In particular three devices have been studied in detail: a 3D-silicon and a single crystal diamond detector with an active area of about 1 cm{sup 2} and a poly-crystalline diamond detector of the same size as a current ATLAS pixel detector module (2 x 6 cm{sup 2}). To characterize the devices regarding their particle detection efficiency and spatial resolution, the charge collection inside a pixel cell as well as the charge sharing between adjacent pixels was studied using a high energy particle beam. (orig.)

A novel image encryption algorithm using chaos and reversible cellular automata

Science.gov (United States)

Wang, Xingyuan; Luan, Dapeng

2013-11-01

In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.

Comparison of multihardware parallel implementations for a phase unwrapping algorithm

Science.gov (United States)

Hernandez-Lopez, Francisco Javier; Rivera, Mariano; Salazar-Garibay, Adan; Legarda-Sáenz, Ricardo

2018-04-01

Phase unwrapping is an important problem in the areas of optical metrology, synthetic aperture radar (SAR) image analysis, and magnetic resonance imaging (MRI) analysis. These images are becoming larger in size and, particularly, the availability and need for processing of SAR and MRI data have increased significantly with the acquisition of remote sensing data and the popularization of magnetic resonators in clinical diagnosis. Therefore, it is important to develop faster and accurate phase unwrapping algorithms. We propose a parallel multigrid algorithm of a phase unwrapping method named accumulation of residual maps, which builds on a serial algorithm that consists of the minimization of a cost function; minimization achieved by means of a serial Gauss-Seidel kind algorithm. Our algorithm also optimizes the original cost function, but unlike the original work, our algorithm is a parallel Jacobi class with alternated minimizations. This strategy is known as the chessboard type, where red pixels can be updated in parallel at same iteration since they are independent. Similarly, black pixels can be updated in parallel in an alternating iteration. We present parallel implementations of our algorithm for different parallel multicore architecture such as CPU-multicore, Xeon Phi coprocessor, and Nvidia graphics processing unit. In all the cases, we obtain a superior performance of our parallel algorithm when compared with the original serial version. In addition, we present a detailed comparative performance of the developed parallel versions.

Thallium-201 and technetium-99m pertechnetate subtraction scintigraphy in patients with hyperparathyroidism

International Nuclear Information System (INIS)

Kuwashima, Shigeko; Koizumi, Mitsuru; Goto, Masafumi; Nomura, Toshiharu; Fujioka, Mutsuhisa; Watari, Tsutomu

1992-01-01

A reliable technique for detecting and localizing abnormal parathyroid tissue has been a persistent problem. We evaluated thallium-technetium (Tl/Tc) subtraction scintigraphy in 16 patients with clinical biochemical evidence of hyperparathyroidism prior to other diagnostic methods and surgery. Seven patients had surgery and were confirmed to have parathyroid adenoma or hyperplasia. The other methods included ultrasonography (US) in 6 patients, computed tomography (CT) in 10 patients, magnetic resonance imaging (MRI) in 8 patients, and bone scintigraphy in 7 patients. In patients who had several imaging modalities, the detection rate was significantly better for Tl/Tc subtraction scan than for US, CT or MRI. Bote scintigraphy, though not so sensitive as Tl/Tc subtraction studies, was an important tool for evaluating metabolic bone disorder including hyperparathyroidism and renal osteodystrophy. Thus, Tl/Tc subtraction scan is more useful for diagnosis when hyperparathyroidism is suspected if both Tl/Tc subtraction scan and bone scan are performed. The detectability depended on the mass size, and detection of abnormal glands was greater for adenoma than for hyperplasia. The results suggest that Tl/Tc subtraction scan is a simple, non-invasive and useful tool for locating parathyroid abnormality even when compared with MRI. (author)

Maximizing signal-to-noise ratio (SNR) in 3-D large bandgap semiconductor pixelated detectors in optimal and non-optimal filtering conditions

International Nuclear Information System (INIS)

Rodrigues, Miesher L.; Serra, Andre da S.; He, Zhong; Zhu, Yuefeng

2009-01-01

3-D pixelated semiconductor detectors are used in radiation detection applications requiring spectroscopic and imaging information from radiation sources. Reconstruction algorithms used to determine direction and energy of incoming gamma rays can be improved by reducing electronic noise and using optimum filtering techniques. Position information can be improved by achieving sub-pixel resolution. Electronic noise is the limiting factor. Achieving sub-pixel resolution - position of the interaction better than one pixel pitch - in 3-D pixelated semiconductor detectors is a challenging task due to the fast transient characteristics of these signals. This work addresses two fundamental questions: the first is to determine the optimum filter, while the second is to estimate the achievable sub-pixel resolution using this filter. It is shown that the matched filter is the optimum filter when applying the signal-to-noise ratio criteria. Also, non-optimum filters are studied. The framework of 3-D waveform simulation using the Shockley-Ramo Theorem and the Hecht Equation for electron and hole trapping is presented in this work. This waveform simulator can be used to analyze current detectors as well as explore new ideas and concepts in future work. Numerical simulations show that assuming an electronic noise of 3.3 keV it is possible to subdivide the pixel region into 5x5 sub-pixels. After analyzing these results, it is suggested that sub-pixel information can also improve energy resolution. Current noise levels present the major drawback to both achieve sub-pixel resolution as well as improve energy resolution below the current limits. (author)

Color Addition and Subtraction Apps

Science.gov (United States)

Ruiz, Frances; Ruiz, Michael J.

2015-01-01

Color addition and subtraction apps in HTML5 have been developed for students as an online hands-on experience so that they can more easily master principles introduced through traditional classroom demonstrations. The evolution of the additive RGB color model is traced through the early IBM color adapters so that students can proceed step by step…

Development of the Landsat Data Continuity Mission Cloud Cover Assessment Algorithms

Science.gov (United States)

Scaramuzza, Pat; Bouchard, M.A.; Dwyer, John L.

2012-01-01

The upcoming launch of the Operational Land Imager (OLI) will start the next era of the Landsat program. However, the Automated Cloud-Cover Assessment (CCA) (ACCA) algorithm used on Landsat 7 requires a thermal band and is thus not suited for OLI. There will be a thermal instrument on the Landsat Data Continuity Mission (LDCM)-the Thermal Infrared Sensor-which may not be available during all OLI collections. This illustrates a need for CCA for LDCM in the absence of thermal data. To research possibilities for full-resolution OLI cloud assessment, a global data set of 207 Landsat 7 scenes with manually generated cloud masks was created. It was used to evaluate the ACCA algorithm, showing that the algorithm correctly classified 79.9% of a standard test subset of 3.95 109 pixels. The data set was also used to develop and validate two successor algorithms for use with OLI data-one derived from an off-the-shelf machine learning package and one based on ACCA but enhanced by a simple neural network. These comprehensive CCA algorithms were shown to correctly classify pixels as cloudy or clear 88.5% and 89.7% of the time, respectively.

Charge sharing in silicon pixel detectors

CERN Document Server

Mathieson, K; Seller, P; Prydderch, M L; O'Shea, V; Bates, R L; Smith, K M; Rahman, M

2002-01-01

We used a pixellated hybrid silicon X-ray detector to study the effect of the sharing of generated charge between neighbouring pixels over a range of incident X-ray energies, 13-36 keV. The system is a room temperature, energy resolving detector with a Gaussian FWHM of 265 eV at 5.9 keV. Each pixel is 300 mu m square, 300 mu m deep and is bump bonded to matching read out electronics. The modelling packages MEDICI and MCNP were used to model the complete X-ray interaction and the subsequent charge transport. Using this software a model is developed which reproduces well the experimental results. The simulations are then altered to explore smaller pixel sizes and different X-ray energies. Charge sharing was observed experimentally to be 2% at 13 keV rising to 4.5% at 36 keV, for an energy threshold of 4 keV. The models predict that up to 50% of charge may be lost to the neighbouring pixels, for an X-ray energy of 36 keV, when the pixel size is reduced to 55 mu m.

Power corrections in the N-jettiness subtraction scheme

Energy Technology Data Exchange (ETDEWEB)

Boughezal, Radja [High Energy Physics Division, Argonne National Laboratory,Argonne, IL 60439 (United States); Liu, Xiaohui [Department of Physics, Beijing Normal University,Beijing, 100875 (China); Center of Advanced Quantum Studies, Beijing Normal University,Beijing, 100875 (China); Center for High-Energy Physics, Peking University,Beijing, 100871 (China); Maryland Center for Fundamental Physics, University of Maryland,College Park, MD 20742 (United States); Petriello, Frank [Department of Physics & Astronomy, Northwestern University,Evanston, IL 60208 (United States); High Energy Physics Division, Argonne National Laboratory,Argonne, IL 60439 (United States)

2017-03-30

We discuss the leading-logarithmic power corrections in the N-jettiness subtraction scheme for higher-order perturbative QCD calculations. We compute the next-to-leading order power corrections for an arbitrary N-jet process, and we explicitly calculate the power correction through next-to-next-to-leading order for color-singlet production for both qq̄ and gg initiated processes. Our results are compact and simple to implement numerically. Including the leading power correction in the N-jettiness subtraction scheme substantially improves its numerical efficiency. We discuss what features of our techniques extend to processes containing final-state jets.

A simple digital subtraction angiographic instrument

International Nuclear Information System (INIS)

Ando, Hiroshi; Kobayashi, Tsuyoshi; Imai, Yutaka; Yanagishita, Akira

1983-01-01

A digital subtraction angiographic instrument was manufactured using a conventional x-ray TV for gastrointestinal series and a computer for processing of nuclear medical data. The results of visualization of the aorta and its primary branches were reviewed with demonstrable cases. (Chiba, N.)

Summation and subtraction using a modified autoshaping procedure in pigeons.

Science.gov (United States)

Ploog, Bertram O

2008-06-01

A modified autoshaping paradigm (significantly different from those previously reported in the summation literature) was employed to allow for the simultaneous assessment of stimulus summation and subtraction in pigeons. The response requirements and the probability of food delivery were adjusted such that towards the end of training 12 of 48 trials ended in food delivery, the same proportion as under testing. Stimuli (outlines of squares of three sizes and colors: A, B, and C) were used that could be presented separately or in any combination of two or three stimuli. Twelve of the pigeons (summation groups) were trained with either A, B, and C or with AB, BC, and CA, and tested with ABC. The remaining 12 pigeons (subtraction groups) received training with ABC but were tested with A, B, and C or with AB, BC, and CA. These groups were further subdivided according to whether stimulus elements were presented either in a concentric or dispersed manner. Summation did not occur; subtraction occurred in the two concentric groups. For interpretation of the results, configural theory, the Rescorla-Wagner model, and the composite-stimulus control model were considered. The results suggest different mechanisms responsible for summation and subtraction.

MO-FG-204-05: Evaluation of a Novel Algorithm for Improved 4DCT Resolution

Energy Technology Data Exchange (ETDEWEB)

Glide-Hurst, C; Briceno, J; Chetty, I. J. [Henry Ford Health System, Detroit, MI (United States); Klahr, P [Philips Healthcare, Highland Heights, OH (United States)

2015-06-15

Purpose: Accurate tumor motion characterization is critical for increasing the therapeutic ratio of radiation therapy. To accommodate the divergent fan-beam geometry of the scanner, the current 4D-CT algorithm utilizes a larger temporal window to ensure that pixel values are valid throughout the entire FOV. To minimize the impact on temporal resolution, a cos{sup 2} weighting is employed. We propose a novel exponential weighting (“exponential”) 4DCT reconstruction algorithm that has a sharper slope and provides a more optimal temporal resolution. Methods: A respiratory motion platform translated a lung-mimicking Styrofoam slab with several high and low-contrast inserts 2 cm in the superior-inferior direction. Breathing rates (10–15 bpm) and couch pitch (0.06–0.1 A.U.) were varied to assess interplay between parameters. Multi-slice helical 4DCTs were acquired with 0.5 sec gantry rotation and data were reconstructed with cos{sup 2} and exponential weighting. Mean and standard deviation were calculated via region of interest analysis. Intensity profiles evaluated object boundaries. Retrospective raw data reconstructions were performed for both 4DCT algorithms for 3 liver and lung cancer patients. Image quality (temporal blurring/sharpness) and subtraction images were compared between reconstructions. Results: In the phantom, profile analysis revealed that sharper boundaries were obtained with exponential reconstructions at transitioning breathing phases (i.e. mid-inhale or mid-exhale). Reductions in full-width half maximum were ∼1 mm in the superior-inferior direction and appreciable sharpness could be observed in difference maps. This reduction also yielded a slight reduction in target volume between reconstruction algorithms. For patient cases, coronal views showed less blurring at object boundaries and local intensity differences near the tumor and diaphragm with exponential weighted reconstruction. Conclusion: Exponential weighted 4DCT offers potential

CVD diamond pixel detectors for LHC experiments

Energy Technology Data Exchange (ETDEWEB)

Wedenig, R.; Adam, W.; Bauer, C.; Berdermann, E.; Bergonzo, P.; Bogani, F.; Borchi, E.; Brambilla, A.; Bruzzi, M.; Colledani, C.; Conway, J.; Dabrowski, W.; Delpierre, P.; Deneuville, A.; Dulinski, W.; Eijk, B. van; Fallou, A.; Fizzotti, F.; Foulon, F.; Friedl, M.; Gan, K.K.; Gheeraert, E.; Grigoriev, E.; Hallewell, G.; Hall-Wilton, R.; Han, S.; Hartjes, F.; Hrubec, J.; Husson, D.; Kagan, H.; Kania, D.; Kaplon, J.; Karl, C.; Kass, R.; Knoepfle, K.T.; Krammer, M.; Logiudice, A.; Lu, R.; Manfredi, P.F.; Manfredotti, C.; Marshall, R.D.; Meier, D.; Mishina, M.; Oh, A.; Pan, L.S.; Palmieri, V.G.; Pernicka, M.; Peitz, A.; Pirollo, S.; Polesello, P.; Pretzl, K.; Procario, M.; Re, V.; Riester, J.L.; Roe, S.; Roff, D.; Rudge, A.; Runolfsson, O.; Russ, J.; Schnetzer, S.; Sciortino, S.; Speziali, V.; Stelzer, H.; Stone, R.; Suter, B.; Tapper, R.J.; Tesarek, R.; Trawick, M.; Trischuk, W.; Vittone, E.; Wagner, A.; Walsh, A.M.; Weilhammer, P.; White, C.; Zeuner, W.; Ziock, H.; Zoeller, M.; Blanquart, L.; Breugnion, P.; Charles, E.; Ciocio, A.; Clemens, J.C.; Dao, K.; Einsweiler, K.; Fasching, D.; Fischer, P.; Joshi, A.; Keil, M.; Klasen, V.; Kleinfelder, S.; Laugier, D.; Meuser, S.; Milgrome, O.; Mouthuy, T.; Richardson, J.; Sinervo, P.; Treis, J.; Wermes, N

1999-08-01

This paper reviews the development of CVD diamond pixel detectors. The preparation of the diamond pixel sensors for bump-bonding to the pixel readout electronics for the LHC and the results from beam tests carried out at CERN are described.

CVD diamond pixel detectors for LHC experiments

International Nuclear Information System (INIS)

Wedenig, R.; Adam, W.; Bauer, C.; Berdermann, E.; Bergonzo, P.; Bogani, F.; Borchi, E.; Brambilla, A.; Bruzzi, M.; Colledani, C.; Conway, J.; Dabrowski, W.; Delpierre, P.; Deneuville, A.; Dulinski, W.; Eijk, B. van; Fallou, A.; Fizzotti, F.; Foulon, F.; Friedl, M.; Gan, K.K.; Gheeraert, E.; Grigoriev, E.; Hallewell, G.; Hall-Wilton, R.; Han, S.; Hartjes, F.; Hrubec, J.; Husson, D.; Kagan, H.; Kania, D.; Kaplon, J.; Karl, C.; Kass, R.; Knoepfle, K.T.; Krammer, M.; Logiudice, A.; Lu, R.; Manfredi, P.F.; Manfredotti, C.; Marshall, R.D.; Meier, D.; Mishina, M.; Oh, A.; Pan, L.S.; Palmieri, V.G.; Pernicka, M.; Peitz, A.; Pirollo, S.; Polesello, P.; Pretzl, K.; Procario, M.; Re, V.; Riester, J.L.; Roe, S.; Roff, D.; Rudge, A.; Runolfsson, O.; Russ, J.; Schnetzer, S.; Sciortino, S.; Speziali, V.; Stelzer, H.; Stone, R.; Suter, B.; Tapper, R.J.; Tesarek, R.; Trawick, M.; Trischuk, W.; Vittone, E.; Wagner, A.; Walsh, A.M.; Weilhammer, P.; White, C.; Zeuner, W.; Ziock, H.; Zoeller, M.; Blanquart, L.; Breugnion, P.; Charles, E.; Ciocio, A.; Clemens, J.C.; Dao, K.; Einsweiler, K.; Fasching, D.; Fischer, P.; Joshi, A.; Keil, M.; Klasen, V.; Kleinfelder, S.; Laugier, D.; Meuser, S.; Milgrome, O.; Mouthuy, T.; Richardson, J.; Sinervo, P.; Treis, J.; Wermes, N.

1999-01-01

This paper reviews the development of CVD diamond pixel detectors. The preparation of the diamond pixel sensors for bump-bonding to the pixel readout electronics for the LHC and the results from beam tests carried out at CERN are described

Urban Image Classification: Per-Pixel Classifiers, Sub-Pixel Analysis, Object-Based Image Analysis, and Geospatial Methods. 10; Chapter

Science.gov (United States)

Myint, Soe W.; Mesev, Victor; Quattrochi, Dale; Wentz, Elizabeth A.

2013-01-01

Remote sensing methods used to generate base maps to analyze the urban environment rely predominantly on digital sensor data from space-borne platforms. This is due in part from new sources of high spatial resolution data covering the globe, a variety of multispectral and multitemporal sources, sophisticated statistical and geospatial methods, and compatibility with GIS data sources and methods. The goal of this chapter is to review the four groups of classification methods for digital sensor data from space-borne platforms; per-pixel, sub-pixel, object-based (spatial-based), and geospatial methods. Per-pixel methods are widely used methods that classify pixels into distinct categories based solely on the spectral and ancillary information within that pixel. They are used for simple calculations of environmental indices (e.g., NDVI) to sophisticated expert systems to assign urban land covers. Researchers recognize however, that even with the smallest pixel size the spectral information within a pixel is really a combination of multiple urban surfaces. Sub-pixel classification methods therefore aim to statistically quantify the mixture of surfaces to improve overall classification accuracy. While within pixel variations exist, there is also significant evidence that groups of nearby pixels have similar spectral information and therefore belong to the same classification category. Object-oriented methods have emerged that group pixels prior to classification based on spectral similarity and spatial proximity. Classification accuracy using object-based methods show significant success and promise for numerous urban 3 applications. Like the object-oriented methods that recognize the importance of spatial proximity, geospatial methods for urban mapping also utilize neighboring pixels in the classification process. The primary difference though is that geostatistical methods (e.g., spatial autocorrelation methods) are utilized during both the pre- and post

Appearance of the canine meninges in subtraction magnetic resonance images.

Science.gov (United States)

Lamb, Christopher R; Lam, Richard; Keenihan, Erin K; Frean, Stephen

2014-01-01

The canine meninges are not visible as discrete structures in noncontrast magnetic resonance (MR) images, and are incompletely visualized in T1-weighted, postgadolinium images, reportedly appearing as short, thin curvilinear segments with minimal enhancement. Subtraction imaging facilitates detection of enhancement of tissues, hence may increase the conspicuity of meninges. The aim of the present study was to describe qualitatively the appearance of canine meninges in subtraction MR images obtained using a dynamic technique. Images were reviewed of 10 consecutive dogs that had dynamic pre- and postgadolinium T1W imaging of the brain that was interpreted as normal, and had normal cerebrospinal fluid. Image-anatomic correlation was facilitated by dissection and histologic examination of two canine cadavers. Meningeal enhancement was relatively inconspicuous in postgadolinium T1-weighted images, but was clearly visible in subtraction images of all dogs. Enhancement was visible as faint, small-rounded foci compatible with vessels seen end on within the sulci, a series of larger rounded foci compatible with vessels of variable caliber on the dorsal aspect of the cerebral cortex, and a continuous thin zone of moderate enhancement around the brain. Superimposition of color-encoded subtraction images on pregadolinium T1- and T2-weighted images facilitated localization of the origin of enhancement, which appeared to be predominantly dural, with relatively few leptomeningeal structures visible. Dynamic subtraction MR imaging should be considered for inclusion in clinical brain MR protocols because of the possibility that its use may increase sensitivity for lesions affecting the meninges. © 2014 American College of Veterinary Radiology.

IR subtraction schemes. Integrating the counterterms at NNLO in QCD

Energy Technology Data Exchange (ETDEWEB)

Bolzoni, Paolo; Somogyi, Gabor

2010-06-15

We briefly review a subtraction scheme for computing radiative corrections to QCD jet cross sections that can be defined at any order in perturbation theory. Hereafter we discuss the computational methods used to evaluate analytically and numerically the integrated counterterms arising from such a subtraction scheme. Basically these methods the Mellin-Barnes (MB) representations technique together with the harmonic summation and the sector decomposition. (orig.)

IR subtraction schemes. Integrating the counterterms at NNLO in QCD

International Nuclear Information System (INIS)

Bolzoni, Paolo; Somogyi, Gabor

2010-06-01

We briefly review a subtraction scheme for computing radiative corrections to QCD jet cross sections that can be defined at any order in perturbation theory. Hereafter we discuss the computational methods used to evaluate analytically and numerically the integrated counterterms arising from such a subtraction scheme. Basically these methods the Mellin-Barnes (MB) representations technique together with the harmonic summation and the sector decomposition. (orig.)

Digital subtraction arthrography in preoperative evaluation of painful total hip arthroplasty

International Nuclear Information System (INIS)

Ginai, A.Z.; Biezen, F.C. van; Kint, P.A.M.; Oei, H.Y.; Hop, W.C.J.

1996-01-01

Digital subtraction arthrograms, scintigrams and plain radiographs of 70 consecutive patients who underwent revision hip arthroplasty were scored individually and in masked fashion for the presence or absence of features indicating loosening of femoral and/or acetabular components. The operative findings acted as the gold standard. Digital subtraction arthrography was best for predicting a loose acetabular component, while no significant additional predictive value was found for plain radiographs and scintigraphy. Digital subtraction arthrography was also the most important modality for predicting a loose femoral component, while the plain radiograph was of significant additional value and scintigraphy was of no additional value on multivariate analysis. (orig./MG)

CVD diamond pixel detectors for LHC experiments

CERN Document Server

Wedenig, R; Bauer, C; Berdermann, E; Bergonzo, P; Bogani, F; Borchi, E; Brambilla, A; Bruzzi, Mara; Colledani, C; Conway, J; Dabrowski, W; Delpierre, P A; Deneuville, A; Dulinski, W; van Eijk, B; Fallou, A; Fizzotti, F; Foulon, F; Friedl, M; Gan, K K; Gheeraert, E; Grigoriev, E; Hallewell, G D; Hall-Wilton, R; Han, S; Hartjes, F G; Hrubec, Josef; Husson, D; Kagan, H; Kania, D R; Kaplon, J; Karl, C; Kass, R; Knöpfle, K T; Krammer, Manfred; Lo Giudice, A; Lü, R; Manfredi, P F; Manfredotti, C; Marshall, R D; Meier, D; Mishina, M; Oh, A; Pan, L S; Palmieri, V G; Pernicka, Manfred; Peitz, A; Pirollo, S; Polesello, P; Pretzl, Klaus P; Procario, M; Re, V; Riester, J L; Roe, S; Roff, D G; Rudge, A; Runólfsson, O; Russ, J; Schnetzer, S R; Sciortino, S; Speziali, V; Stelzer, H; Stone, R; Suter, B; Tapper, R J; Tesarek, R J; Trawick, M L; Trischuk, W; Vittone, E; Wagner, A; Walsh, A M; Weilhammer, Peter; White, C; Zeuner, W; Ziock, H J; Zöller, M

1999-01-01

This paper reviews the development of CVD diamond pixel detectors. The preparation of the diamond pixel sensors for bump-bonding to the pixel readout electronics for the LHC and the results from beam tests carried out at CERN are described. (9 refs).

Mapping Electrical Crosstalk in Pixelated Sensor Arrays

Science.gov (United States)

Seshadri, Suresh (Inventor); Cole, David (Inventor); Smith, Roger M. (Inventor); Hancock, Bruce R. (Inventor)

2017-01-01

The effects of inter pixel capacitance in a pixilated array may be measured by first resetting all pixels in the array to a first voltage, where a first image is read out, followed by resetting only a subset of pixels in the array to a second voltage, where a second image is read out, where the difference in the first and second images provide information about the inter pixel capacitance. Other embodiments are described and claimed.

Operational Experience with the ATLAS Pixel Detector

CERN Document Server

Djama, Fares; The ATLAS collaboration

2017-01-01

Run 2 of the LHC collider sets new challenges to track and vertex reconstruction because of its higher energy, pileup and luminosity. The ATLAS tracking performance relies critically on the Pixel Detector. Therefore, in view of Run 2, the ATLAS collaboration has constructed the first 4-layer pixel detector in Particle Physics by installing a new pixel layer, called Insertable B-Layer (IBL). Operational experience and performance of the 4-layer Pixel Detector during Run 2 are presented.

Performance of a Real-time Multipurpose 2-Dimensional Clustering Algorithm Developed for the ATLAS Experiment

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00372074; The ATLAS collaboration; Sotiropoulou, Calliope Louisa; Annovi, Alberto; Kordas, Kostantinos

2016-01-01

In this paper the performance of the 2D pixel clustering algorithm developed for the Input Mezzanine card of the ATLAS Fast TracKer system is presented. Fast TracKer is an approved ATLAS upgrade that has the goal to provide a complete list of tracks to the ATLAS High Level Trigger for each level-1 accepted event, at up to 100 kHz event rate with a very small latency, in the order of 100µs. The Input Mezzanine card is the input stage of the Fast TracKer system. Its role is to receive data from the silicon detector and perform real time clustering, thus to reduce the amount of data propagated to the subsequent processing levels with minimal information loss. We focus on the most challenging component on the Input Mezzanine card, the 2D clustering algorithm executed on the pixel data. We compare two different implementations of the algorithm. The first is one called the ideal one which searches clusters of pixels in the whole silicon module at once and calculates the cluster centroids exploiting the whole avail...

Performance of a Real-time Multipurpose 2-Dimensional Clustering Algorithm Developed for the ATLAS Experiment

CERN Document Server

Gkaitatzis, Stamatios; The ATLAS collaboration

2016-01-01

In this paper the performance of the 2D pixel clustering algorithm developed for the Input Mezzanine card of the ATLAS Fast TracKer system is presented. Fast TracKer is an approved ATLAS upgrade that has the goal to provide a complete list of tracks to the ATLAS High Level Trigger for each level-1 accepted event, at up to 100 kHz event rate with a very small latency, in the order of 100 µs. The Input Mezzanine card is the input stage of the Fast TracKer system. Its role is to receive data from the silicon detector and perform real time clustering, thus to reduce the amount of data propagated to the subsequent processing levels with minimal information loss. We focus on the most challenging component on the Input Mezzanine card, the 2D clustering algorithm executed on the pixel data. We compare two different implementations of the algorithm. The first is one called the ideal one which searches clusters of pixels in the whole silicon module at once and calculates the cluster centroids exploiting the whole avai...

Compressive Video Recovery Using Block Match Multi-Frame Motion Estimation Based on Single Pixel Cameras

Directory of Open Access Journals (Sweden)

Sheng Bi

2016-03-01

Full Text Available Compressive sensing (CS theory has opened up new paths for the development of signal processing applications. Based on this theory, a novel single pixel camera architecture has been introduced to overcome the current limitations and challenges of traditional focal plane arrays. However, video quality based on this method is limited by existing acquisition and recovery methods, and the method also suffers from being time-consuming. In this paper, a multi-frame motion estimation algorithm is proposed in CS video to enhance the video quality. The proposed algorithm uses multiple frames to implement motion estimation. Experimental results show that using multi-frame motion estimation can improve the quality of recovered videos. To further reduce the motion estimation time, a block match algorithm is used to process motion estimation. Experiments demonstrate that using the block match algorithm can reduce motion estimation time by 30%.

3D temporal subtraction on multislice CT images using nonlinear warping technique

Science.gov (United States)

Ishida, Takayuki; Katsuragawa, Shigehiko; Kawashita, Ikuo; Kim, Hyounseop; Itai, Yoshinori; Awai, Kazuo; Li, Qiang; Doi, Kunio

2007-03-01

The detection of very subtle lesions and/or lesions overlapped with vessels on CT images is a time consuming and difficult task for radiologists. In this study, we have developed a 3D temporal subtraction method to enhance interval changes between previous and current multislice CT images based on a nonlinear image warping technique. Our method provides a subtraction CT image which is obtained by subtraction of a previous CT image from a current CT image. Reduction of misregistration artifacts is important in the temporal subtraction method. Therefore, our computerized method includes global and local image matching techniques for accurate registration of current and previous CT images. For global image matching, we selected the corresponding previous section image for each current section image by using 2D cross-correlation between a blurred low-resolution current CT image and a blurred previous CT image. For local image matching, we applied the 3D template matching technique with translation and rotation of volumes of interests (VOIs) which were selected in the current and the previous CT images. The local shift vector for each VOI pair was determined when the cross-correlation value became the maximum in the 3D template matching. The local shift vectors at all voxels were determined by interpolation of shift vectors of VOIs, and then the previous CT image was nonlinearly warped according to the shift vector for each voxel. Finally, the warped previous CT image was subtracted from the current CT image. The 3D temporal subtraction method was applied to 19 clinical cases. The normal background structures such as vessels, ribs, and heart were removed without large misregistration artifacts. Thus, interval changes due to lung diseases were clearly enhanced as white shadows on subtraction CT images.

Quantitative blood flow measurements in the small animal cardiopulmonary system using digital subtraction angiography

Energy Technology Data Exchange (ETDEWEB)

Lin Mingde; Marshall, Craig T.; Qi, Yi; Johnston, Samuel M.; Badea, Cristian T.; Piantadosi, Claude A.; Johnson, G. Allan [Department of Radiology, Center for In Vivo Microscopy and Department of Biomedical Engineering, Duke University Medical Center, Box 3302, Durham, North Carolina 27710 (United States); Division of Pulmonary and Critical Care Medicine and Center for Hyperbaric Medicine and Environmental Physiology, Duke University Medical Center, Box 3823, Durham, North Carolina 27710 (United States); Department of Radiology, Center for In Vivo Microscopy, Duke University Medical Center, Box 3302, Durham, North Carolina 27710 (United States); Department of Radiology, Center for In Vivo Microscopy and Department of Biomedical Engineering, Duke University Medical Center, Box 3302, Durham, North Carolina 27710 (United States); Department of Radiology, Center for In Vivo Microscopy, Duke University Medical Center, Box 3302, Durham, North Carolina 27710 (United States); Division of Pulmonary and Critical Care Medicine and Center for Hyperbaric Medicine and Environmental Physiology, Duke University Medical Center, Box 3823, Durham, North Carolina 27710 (United States); Department of Radiology, Center for In Vivo Microscopy and Department of Biomedical Engineering, Duke University Medical Center, Box 3302, Durham, North Carolina 27710 (United States)

2009-11-15

Purpose: The use of preclinical rodent models of disease continues to grow because these models help elucidate pathogenic mechanisms and provide robust test beds for drug development. Among the major anatomic and physiologic indicators of disease progression and genetic or drug modification of responses are measurements of blood vessel caliber and flow. Moreover, cardiopulmonary blood flow is a critical indicator of gas exchange. Current methods of measuring cardiopulmonary blood flow suffer from some or all of the following limitations--they produce relative values, are limited to global measurements, do not provide vasculature visualization, are not able to measure acute changes, are invasive, or require euthanasia. Methods: In this study, high-spatial and high-temporal resolution x-ray digital subtraction angiography (DSA) was used to obtain vasculature visualization, quantitative blood flow in absolute metrics (ml/min instead of arbitrary units or velocity), and relative blood volume dynamics from discrete regions of interest on a pixel-by-pixel basis (100x100 {mu}m{sup 2}). Results: A series of calibrations linked the DSA flow measurements to standard physiological measurement using thermodilution and Fick's method for cardiac output (CO), which in eight anesthetized Fischer-344 rats was found to be 37.0{+-}5.1 ml/min. Phantom experiments were conducted to calibrate the radiographic density to vessel thickness, allowing a link of DSA cardiac output measurements to cardiopulmonary blood flow measurements in discrete regions of interest. The scaling factor linking relative DSA cardiac output measurements to the Fick's absolute measurements was found to be 18.90xCO{sub DSA}=CO{sub Fick}. Conclusions: This calibrated DSA approach allows repeated simultaneous visualization of vasculature and measurement of blood flow dynamics on a regional level in the living rat.

Quantitative blood flow measurements in the small animal cardiopulmonary system using digital subtraction angiography

International Nuclear Information System (INIS)

Lin Mingde; Marshall, Craig T.; Qi, Yi; Johnston, Samuel M.; Badea, Cristian T.; Piantadosi, Claude A.; Johnson, G. Allan

2009-01-01

Purpose: The use of preclinical rodent models of disease continues to grow because these models help elucidate pathogenic mechanisms and provide robust test beds for drug development. Among the major anatomic and physiologic indicators of disease progression and genetic or drug modification of responses are measurements of blood vessel caliber and flow. Moreover, cardiopulmonary blood flow is a critical indicator of gas exchange. Current methods of measuring cardiopulmonary blood flow suffer from some or all of the following limitations--they produce relative values, are limited to global measurements, do not provide vasculature visualization, are not able to measure acute changes, are invasive, or require euthanasia. Methods: In this study, high-spatial and high-temporal resolution x-ray digital subtraction angiography (DSA) was used to obtain vasculature visualization, quantitative blood flow in absolute metrics (ml/min instead of arbitrary units or velocity), and relative blood volume dynamics from discrete regions of interest on a pixel-by-pixel basis (100x100 μm 2 ). Results: A series of calibrations linked the DSA flow measurements to standard physiological measurement using thermodilution and Fick's method for cardiac output (CO), which in eight anesthetized Fischer-344 rats was found to be 37.0±5.1 ml/min. Phantom experiments were conducted to calibrate the radiographic density to vessel thickness, allowing a link of DSA cardiac output measurements to cardiopulmonary blood flow measurements in discrete regions of interest. The scaling factor linking relative DSA cardiac output measurements to the Fick's absolute measurements was found to be 18.90xCO DSA =CO Fick . Conclusions: This calibrated DSA approach allows repeated simultaneous visualization of vasculature and measurement of blood flow dynamics on a regional level in the living rat.

The Use of Procedural Knowledge in Simple Addition and Subtraction Problems

Science.gov (United States)

Fayol, Michel; Thevenot, Catherine

2012-01-01

In a first experiment, adults were asked to solve one-digit additions, subtractions and multiplications. When the sign appeared 150 ms before the operands, addition and subtraction were solved faster than when the sign and the operands appeared simultaneously on screen. This priming effect was not observed for multiplication problems. A second…

[Quantitative image of bone mineral content--dual energy subtraction in a single exposure].

Science.gov (United States)

Katoh, T

1990-09-25

A dual energy subtraction system was constructed on an experimental basis for the quantitative image of bone mineral content. The system consists of a radiography system and an image processor. Two radiograms were taken with dual x-ray energy in a single exposure using an x-ray beam dichromized by a tin filter. In this system, a film cassette was used where a low speed film-screen system, a copper filter and a high speed film-screen system were layered on top of each other. The images were read by a microdensitometer and processed by a personal computer. The image processing included the corrections of the film characteristics and heterogeneity in the x-ray field, and the dual energy subtraction in which the effect of the high energy component of the dichromized beam on the tube side image was corrected. In order to determine the accuracy of the system, experiments using wedge phantoms made of mixtures of epoxy resin and bone mineral-equivalent materials in various fractions were performed for various tube potentials and film processing conditions. The results indicated that the relative precision of the system was within +/- 4% and that the propagation of the film noise was within +/- 11 mg/cm2 for the 0.2 mm pixels. The results also indicated that the system response was independent of the tube potential and the film processing condition. The bone mineral weight in each phalanx of the freshly dissected hand of a rhesus monkey was measured by this system and compared with the ash weight. The results showed an error of +/- 10%, slightly larger than that of phantom experiments, which is probably due to the effect of fat and the variation of focus-object distance. The air kerma in free air at the object was approximately 0.5 mGy for one exposure. The results indicate that this system is applicable to clinical use and provides useful information for evaluating a time-course of localized bone disease.

Temporal subtraction of chest radiographs compensating pose differences

Science.gov (United States)

von Berg, Jens; Dworzak, Jalda; Klinder, Tobias; Manke, Dirk; Kreth, Adrian; Lamecker, Hans; Zachow, Stefan; Lorenz, Cristian

2011-03-01

Temporal subtraction techniques using 2D image registration improve the detectability of interval changes from chest radiographs. Although such methods are well known for some time they are not widely used in radiologic practice. The reason is the occurrence of strong pose differences between two acquisitions with a time interval of months to years in between. Such strong perspective differences occur in a reasonable number of cases. They cannot be compensated by available image registration methods and thus mask interval changes to be undetectable. In this paper a method is proposed to estimate a 3D pose difference by the adaptation of a 3D rib cage model to both projections. The difference between both is then compensated for, thus producing a subtraction image with virtually no change in pose. The method generally assumes that no 3D image data is available from the patient. The accuracy of pose estimation is validated with chest phantom images acquired under controlled geometric conditions. A subtle interval change simulated by a piece of plastic foam attached to the phantom becomes visible in subtraction images generated with this technique even at strong angular pose differences like an anterior-posterior inclination of 13 degrees.

Metal artifact reduction in x-ray computed tomography by using analytical DBP-type algorithm

Science.gov (United States)

Wang, Zhen; Kudo, Hiroyuki

2012-03-01

This paper investigates a common metal artifacts problem in X-ray computed tomography (CT). The artifacts in reconstructed image may render image non-diagnostic because of inaccuracy beam hardening correction from high attenuation objects, satisfactory image could not be reconstructed from projections with missing or distorted data. In traditionally analytical metal artifact reduction (MAR) method, firstly subtract the metallic object part of projection data from the original obtained projection, secondly complete the subtracted part in original projection by using various interpolating method, thirdly reconstruction from the interpolated projection by filtered back-projection (FBP) algorithm. The interpolation error occurred during the second step can make unrealistic assumptions about the missing data, leading to DC shift artifact in the reconstructed images. We proposed a differentiated back-projection (DBP) type MAR method by instead of FBP algorithm with DBP algorithm in third step. In FBP algorithm the interpolated projection will be filtered on each projection view angle before back-projection, as a result the interpolation error is propagated to whole projection. However, the property of DBP algorithm provide a chance to do filter after the back-projection in a Hilbert filter direction, as a result the interpolation error affection would be reduce and there is expectation on improving quality of reconstructed images. In other word, if we choose the DBP algorithm instead of the FBP algorithm, less contaminated projection data with interpolation error would be used in reconstruction. A simulation study was performed to evaluate the proposed method using a given phantom.

Algorithms for contrast enhancement of electronic portal images

International Nuclear Information System (INIS)

Díez, S.; Sánchez, S.

2015-01-01

An implementation of two new automatized image processing algorithms for contrast enhancement of portal images is presented as suitable tools which facilitate the setup verification and visualization of patients during radiotherapy treatments. In the first algorithm, called Automatic Segmentation and Histogram Stretching (ASHS), the portal image is automatically segmented in two sub-images delimited by the conformed treatment beam: one image consisting of the imaged patient obtained directly from the radiation treatment field, and the second one is composed of the imaged patient outside it. By segmenting the original image, a histogram stretching can be independently performed and improved in both regions. The second algorithm involves a two-step process. In the first step, a Normalization to Local Mean (NLM), an inverse restoration filter is applied by dividing pixel by pixel a portal image by its blurred version. In the second step, named Lineally Combined Local Histogram Equalization (LCLHE), the contrast of the original image is strongly improved by a Local Contrast Enhancement (LCE) algorithm, revealing the anatomical structures of patients. The output image is lineally combined with a portal image of the patient. Finally the output images of the previous algorithms (NLM and LCLHE) are lineally combined, once again, in order to obtain a contrast enhanced image. These two algorithms have been tested on several portal images with great results. - Highlights: • Two Algorithms are implemented to improve the contrast of Electronic Portal Images. • The multi-leaf and conformed beam are automatically segmented into Portal Images. • Hidden anatomical and bony structures in portal images are revealed. • The task related to the patient setup verification is facilitated by the contrast enhancement then achieved.

LAI inversion algorithm based on directional reflectance kernels.

Science.gov (United States)

Tang, S; Chen, J M; Zhu, Q; Li, X; Chen, M; Sun, R; Zhou, Y; Deng, F; Xie, D

2007-11-01

Leaf area index (LAI) is an important ecological and environmental parameter. A new LAI algorithm is developed using the principles of ground LAI measurements based on canopy gap fraction. First, the relationship between LAI and gap fraction at various zenith angles is derived from the definition of LAI. Then, the directional gap fraction is acquired from a remote sensing bidirectional reflectance distribution function (BRDF) product. This acquisition is obtained by using a kernel driven model and a large-scale directional gap fraction algorithm. The algorithm has been applied to estimate a LAI distribution in China in mid-July 2002. The ground data acquired from two field experiments in Changbai Mountain and Qilian Mountain were used to validate the algorithm. To resolve the scale discrepancy between high resolution ground observations and low resolution remote sensing data, two TM images with a resolution approaching the size of ground plots were used to relate the coarse resolution LAI map to ground measurements. First, an empirical relationship between the measured LAI and a vegetation index was established. Next, a high resolution LAI map was generated using the relationship. The LAI value of a low resolution pixel was calculated from the area-weighted sum of high resolution LAIs composing the low resolution pixel. The results of this comparison showed that the inversion algorithm has an accuracy of 82%. Factors that may influence the accuracy are also discussed in this paper.

Estimating Daily Evapotranspiration Based on A Model of Evapotranspiration Fraction (EF) for Mixed Pixels

Science.gov (United States)

Xin, X.; Li, F.; Peng, Z.; Qinhuo, L.

2017-12-01

Land surface heterogeneities significantly affect the reliability and accuracy of remotely sensed evapotranspiration (ET), and it gets worse for lower resolution data. At the same time, temporal scale extrapolation of the instantaneous latent heat flux (LE) at satellite overpass time to daily ET are crucial for applications of such remote sensing product. The purpose of this paper is to propose a simple but efficient model for estimating daytime evapotranspiration considering heterogeneity of mixed pixels. In order to do so, an equation to calculate evapotranspiration fraction (EF) of mixed pixels was derived based on two key assumptions. Assumption 1: the available energy (AE) of each sub-pixel equals approximately to that of any other sub-pixels in the same mixed pixel within acceptable margin of bias, and as same as the AE of the mixed pixel. It's only for a simpification of the equation, and its uncertainties and resulted errors in estimated ET are very small. Assumption 2: EF of each sub-pixel equals to the EF of the nearest pure pixel(s) of same land cover type. This equation is supposed to be capable of correcting the spatial scale error of the mixed pixels EF and can be used to calculated daily ET with daily AE data.The model was applied to an artificial oasis in the midstream of Heihe River. HJ-1B satellite data were used to estimate the lumped fluxes at the scale of 300 m after resampling the 30-m resolution datasets to 300 m resolution, which was used to carry on the key step of the model. The results before and after correction were compare to each other and validated using site data of eddy-correlation systems. Results indicated that the new model is capable of improving accuracy of daily ET estimation relative to the lumped method. Validations at 12 sites of eddy-correlation systems for 9 days of HJ-1B overpass showed that the R² increased to 0.82 from 0.62; the RMSE decreased to 1.60 MJ/m² from 2.47MJ/m²; the MBE decreased from 1.92 MJ/m² to 1

GPU implementation of discrete particle swarm optimization algorithm for endmember extraction from hyperspectral image

Science.gov (United States)

Yu, Chaoyin; Yuan, Zhengwu; Wu, Yuanfeng

2017-10-01

Hyperspectral image unmixing is an important part of hyperspectral data analysis. The mixed pixel decomposition consists of two steps, endmember (the unique signatures of pure ground components) extraction and abundance (the proportion of each endmember in each pixel) estimation. Recently, a Discrete Particle Swarm Optimization algorithm (DPSO) was proposed for accurately extract endmembers with high optimal performance. However, the DPSO algorithm shows very high computational complexity, which makes the endmember extraction procedure very time consuming for hyperspectral image unmixing. Thus, in this paper, the DPSO endmember extraction algorithm was parallelized, implemented on the CUDA (GPU K20) platform, and evaluated by real hyperspectral remote sensing data. The experimental results show that with increasing the number of particles the parallelized version obtained much higher computing efficiency while maintain the same endmember exaction accuracy.

Tracking and b-tagging with pixel vertex detector in ATLAS experiment at LHC

International Nuclear Information System (INIS)

Vacavant, L.

1997-06-01

The capability of the ATLAS detector to tag b-jets is studied, using the impact parameter of charged tracks. High b-tagging performance is needed at LHC, especially during the first years of running, in order to see evidence of the Higgs boson if its mass lies between 80 and 120 GeV/c 2 . A pattern-recognition algorithm has been developed for this purpose, using a detailed simulation of the ATLAS inner detector. Track-finding starts from the pixel detector layers. A 'hyper-plane' concept allows the use of a simple tracking algorithm though the complex geometry. High track-finding efficiency and reconstruction quality ensure the discrimination of b-jets from other kinds of jets. After full simulation and reconstruction of H → bb-bar, H → gg, H → uu-bar, H → ss-bar and H → cc-bar events (m H = 100 GeV/c 2 ), the mean rejections achieved against non-b-jets for a 50% b-jet tagging efficiency are as follows: R g =39±5 R u = 60 ± 9 R s = 38 ± 5 R c = 9 ± 1 The analysis of data from the first radiation-hard pixel detector prototypes justifies the potential of these detectors for track-finding and high-precision impact parameter measurement at LHC. (author)

Fast and efficient search for MPEG-4 video using adjacent pixel intensity difference quantization histogram feature

Science.gov (United States)

Lee, Feifei; Kotani, Koji; Chen, Qiu; Ohmi, Tadahiro

2010-02-01

In this paper, a fast search algorithm for MPEG-4 video clips from video database is proposed. An adjacent pixel intensity difference quantization (APIDQ) histogram is utilized as the feature vector of VOP (video object plane), which had been reliably applied to human face recognition previously. Instead of fully decompressed video sequence, partially decoded data, namely DC sequence of the video object are extracted from the video sequence. Combined with active search, a temporal pruning algorithm, fast and robust video search can be realized. The proposed search algorithm has been evaluated by total 15 hours of video contained of TV programs such as drama, talk, news, etc. to search for given 200 MPEG-4 video clips which each length is 15 seconds. Experimental results show the proposed algorithm can detect the similar video clip in merely 80ms, and Equal Error Rate (ERR) of 2 % in drama and news categories are achieved, which are more accurately and robust than conventional fast video search algorithm.

Wilson expansion in the minimal subtraction scheme

International Nuclear Information System (INIS)

Smirnov, V.A.

1989-01-01

The small distance expansion of the product of composite fields is constructed for an arbitrary renormalization procedure of the type of minimal subtraction scheme. Coefficient functions of the expansion are expressed explicitly through the Green functions of composite fields. The expansion has the explicity finite form: the ultraviolet (UV) divergences of the coefficient functions and composite fields are removed by the initial renormalization procedure while the infrared (IR) divergences in massless diagrams with nonvanishing contribution into the coefficient functions are removed by the R-operation which is the IR part of the R-operation. The latter is the generalization of the dimensional renormalization in the case when both UV and IR divergences are present. To derive the expansion, a ''pre-subtracting operator'' is introduced and formulas of the counter-term technique are exploited

Developments of the ATLAS pixel detector

International Nuclear Information System (INIS)

Andreazza, Attilio

2004-01-01

The ATLAS silicon pixel detector is the innermost tracking device of the ATLAS experiment at the Large Hardon Collider, consisting of more than 1700 modules for a total sensitive area of about 1.7m2 and over 80 million pixel cells. The concept is a hybrid of front-end chips bump bonded to the pixel sensor. The elementary pixel cell has 50μmx400μm size, providing pulse height information via the time over threshold technique. Prototype devices with oxygenated silicon sensor and rad-hard electronics built in the IBM 0.25μm process have been tested and maintain good resolution, efficiency and timing performances even after receiving the design radiation damage of 1015neq/cm2

Global stereo matching algorithm based on disparity range estimation

Science.gov (United States)

Li, Jing; Zhao, Hong; Gu, Feifei

2017-09-01

The global stereo matching algorithms are of high accuracy for the estimation of disparity map, but the time-consuming in the optimization process still faces a curse, especially for the image pairs with high resolution and large baseline setting. To improve the computational efficiency of the global algorithms, a disparity range estimation scheme for the global stereo matching is proposed to estimate the disparity map of rectified stereo images in this paper. The projective geometry in a parallel binocular stereo vision is investigated to reveal a relationship between two disparities at each pixel in the rectified stereo images with different baselines, which can be used to quickly obtain a predicted disparity map in a long baseline setting estimated by that in the small one. Then, the drastically reduced disparity ranges at each pixel under a long baseline setting can be determined by the predicted disparity map. Furthermore, the disparity range estimation scheme is introduced into the graph cuts with expansion moves to estimate the precise disparity map, which can greatly save the cost of computing without loss of accuracy in the stereo matching, especially for the dense global stereo matching, compared to the traditional algorithm. Experimental results with the Middlebury stereo datasets are presented to demonstrate the validity and efficiency of the proposed algorithm.

Extended Traffic Crash Modelling through Precision and Response Time Using Fuzzy Clustering Algorithms Compared with Multi-layer Perceptron

Directory of Open Access Journals (Sweden)

Iman Aghayan

2012-11-01

Full Text Available This paper compares two fuzzy clustering algorithms – fuzzy subtractive clustering and fuzzy C-means clustering – to a multi-layer perceptron neural network for their ability to predict the severity of crash injuries and to estimate the response time on the traffic crash data. Four clustering algorithms – hierarchical, K-means, subtractive clustering, and fuzzy C-means clustering – were used to obtain the optimum number of clusters based on the mean silhouette coefficient and R-value before applying the fuzzy clustering algorithms. The best-fit algorithms were selected according to two criteria: precision (root mean square, R-value, mean absolute errors, and sum of square error and response time (t. The highest R-value was obtained for the multi-layer perceptron (0.89, demonstrating that the multi-layer perceptron had a high precision in traffic crash prediction among the prediction models, and that it was stable even in the presence of outliers and overlapping data. Meanwhile, in comparison with other prediction models, fuzzy subtractive clustering provided the lowest value for response time (0.284 second, 9.28 times faster than the time of multi-layer perceptron, meaning that it could lead to developing an on-line system for processing data from detectors and/or a real-time traffic database. The model can be extended through improvements based on additional data through induction procedure.

The DELPHI pixels

International Nuclear Information System (INIS)

Becks, K.H.; Brunet, J.M.

1997-01-01

To improve tracking in the very forward direction for running at LEP200, the angular acceptance of the DELPHI Vertex detector has been extended from 45 to 11 with respect to the beam axis. Pixel detector crowns cover the region between 25 and 13 . Due to very tight space and material thickness constraints it was necessary to develop new techniques (integrated busses in the detector substrate, high density layout on Kapton, etc.). About 1000 cm 2 of pixels are already installed and working in DELPHI. Techniques, tests and production of these detectors will be described, as well as the main problems encountered during this work. (orig.)

Image-based Proof of Work Algorithm for the Incentivization of Blockchain Archival of Interesting Images

OpenAIRE

Billings, Jake

2017-01-01

A new variation of blockchain proof of work algorithm is proposed to incentivize the timely execution of image processing algorithms. A sample image processing algorithm is proposed to determine interesting images using analysis of the entropy of pixel subsets within images. The efficacy of the image processing algorithm is examined using two small sets of training and test data. The interesting image algorithm is then integrated into a simplified blockchain mining proof of work algorithm bas...

Dynamic contrast-enhanced subtraction MR angiography in intracranial vascular abnormalities

International Nuclear Information System (INIS)

Takano, K.; Ono, H.; Utsunomiya, H.; Okazaki, M.; Tanaka, A.

1999-01-01

We present our clinical experience with dynamic contrast-enhanced MR angiography (MRA) with subtraction for assessing intracranial vascular abnormalities. Ten patients with various cerebrovascular disorders underwent dynamic contrast-enhanced MRA on a 1.0-T system. Thirty sections (2 mm) were acquired in 29-30 s. Maximum intensity projection images and subtracted source images were compared with those obtained by conventional angiography. In all cases, the presence or absence of abnormalities in the targeted vessels, as well as the morphology of the sagittal sinuses, was clearly visualized as in conventional angiography, without any obstructions such as hyperintense hematomas or thrombi, or intraluminal turbulence. Although the temporal and spatial resolutions with current hardware are insufficient, these preliminary results suggest that dynamic contrast-enhanced MRA with subtraction may be useful for assessing vascular lesions with hemorrhage or thrombus, and the dural sinuses. (orig.)

Improved Steganographic Method Preserving Pixel-Value Differencing Histogram with Modulus Function

Directory of Open Access Journals (Sweden)

Lee Hae-Yeoun

2010-01-01

Full Text Available Abstract We herein advance a secure steganographic algorithm that uses a turnover policy and a novel adjusting process. Although the method of Wang et al. uses Pixel-Value Differencing (PVD and their modulus function provides high capacity and good image quality, the embedding process causes a number of artifacts, such as abnormal increases and fluctuations in the PVD histogram, which may reveal the existence of the hidden message. In order to enhance the security of the algorithm, a turnover policy is used that prevents abnormal increases in the histogram values and a novel adjusting process is devised to remove the fluctuations at the border of the subrange in the PVD histogram. The proposed method therefore eliminates all the weaknesses of the PVD steganographic methods thus far proposed and guarantees secure communication. In the experiments described herein, the proposed algorithm is compared with other PVD steganographic algorithms by using well-known steganalysis techniques, such as RS-analysis, steganalysis for LSB matching, and histogram-based attacks. The results support our contention that the proposed method enhances security by keeping the PVD histogram similar to the cover, while also providing high embedding capacity and good imperceptibility to the naked eye.

Online correction of scanning probe microscopes with pixel accuracy

DEFF Research Database (Denmark)

Dirscherl, Kai

2000-01-01

of 10 nm and an opening angle of 30.0 °. Even atomic resolution can be achieved. The scan movement of the tip is not linear however. This is caused by the propelling device of the SPM for the scan motion - a piezoelectric ceramic. The two major non-linear responses o f the piezo to the applied control....... The algorithm typically contains 5 - 7 parameters which have to be calibrated manually. Still, non-linear errors remain in the order of 1-2%. One pixel in a 512x 512 image corresponds to 0.2% per direction. This goal of measurement accuracy i s reached with the algorithm developed in this thesis. Three...... different SPM are analyzed for their non-linearity. Two commercial tube sc anners are applied with a maximum scan range in x and y of 40.0 µm and 160.0 µm as well as one specially designed stack scanner with a maximum range of 5.0 µm. For the tube scanners, a 1-dimensional line pattern with a reference...

Spatial compression algorithm for the analysis of very large multivariate images

Science.gov (United States)

Keenan, Michael R [Albuquerque, NM

2008-07-15

A method for spatially compressing data sets enables the efficient analysis of very large multivariate images. The spatial compression algorithms use a wavelet transformation to map an image into a compressed image containing a smaller number of pixels that retain the original image's information content. Image analysis can then be performed on a compressed data matrix consisting of a reduced number of significant wavelet coefficients. Furthermore, a block algorithm can be used for performing common operations more efficiently. The spatial compression algorithms can be combined with spectral compression algorithms to provide further computational efficiencies.

A 256×256 low-light-level CMOS imaging sensor with digital CDS

Science.gov (United States)

Zou, Mei; Chen, Nan; Zhong, Shengyou; Li, Zhengfen; Zhang, Jicun; Yao, Li-bin

2016-10-01

In order to achieve high sensitivity for low-light-level CMOS image sensors (CIS), a capacitive transimpedance amplifier (CTIA) pixel circuit with a small integration capacitor is used. As the pixel and the column area are highly constrained, it is difficult to achieve analog correlated double sampling (CDS) to remove the noise for low-light-level CIS. So a digital CDS is adopted, which realizes the subtraction algorithm between the reset signal and pixel signal off-chip. The pixel reset noise and part of the column fixed-pattern noise (FPN) can be greatly reduced. A 256×256 CIS with CTIA array and digital CDS is implemented in the 0.35μm CMOS technology. The chip size is 7.7mm×6.75mm, and the pixel size is 15μm×15μm with a fill factor of 20.6%. The measured pixel noise is 24LSB with digital CDS in RMS value at dark condition, which shows 7.8× reduction compared to the image sensor without digital CDS. Running at 7fps, this low-light-level CIS can capture recognizable images with the illumination down to 0.1lux.

A temporal subtraction method for thoracic CT images based on generalized gradient vector flow

International Nuclear Information System (INIS)

Miyake, Noriaki; Kim, H.; Maeda, Shinya; Itai, Yoshinori; Tan, J.K.; Ishikawa, Seiji; Katsuragawa, Shigehiko

2010-01-01

A temporal subtraction image, which is obtained by subtraction of a previous image from a current one, can be used for enhancing interval changes (such as formation of new lesions and changes in existing abnormalities) on medical images by removing most of the normal structures. If image registration is incorrect, not only the interval changes but also the normal structures would be appeared as some artifacts on the temporal subtraction image. In a temporal subtraction technique for 2-D X-ray image, the effectiveness is shown through a lot of clinical evaluation experiments, and practical use is advancing. Moreover, the MDCT (Multi-Detector row Computed Tomography) can easily introduced on medical field, the development of a temporal subtraction for thoracic CT Images is expected. In our study, a temporal subtraction technique for thoracic CT Images is developed. As the technique, the vector fields are described by use of GGVF (Generalized Gradient Vector Flow) from the previous and current CT images. Afterwards, VOI (Volume of Interest) are set up on the previous and current CT image pairs. The shift vectors are calculated by using nearest neighbor matching of the vector fields in these VOIs. The search kernel on previous CT image is set up from the obtained shift vector. The previous CT voxel which resemble standard the current voxel is detected by voxel value and vector of the GGVF in the kernel. And, the previous CT image is transformed to the same coordinate of standard voxel. Finally, temporal subtraction image is made by subtraction of a warping image from a current one. To verify the proposal method, the result of application to 7 cases and the effectiveness are described. (author)

Change detection using landsat time series: A review of frequencies, preprocessing, algorithms, and applications

Science.gov (United States)

Zhu, Zhe

2017-08-01

The free and open access to all archived Landsat images in 2008 has completely changed the way of using Landsat data. Many novel change detection algorithms based on Landsat time series have been developed We present a comprehensive review of four important aspects of change detection studies based on Landsat time series, including frequencies, preprocessing, algorithms, and applications. We observed the trend that the more recent the study, the higher the frequency of Landsat time series used. We reviewed a series of image preprocessing steps, including atmospheric correction, cloud and cloud shadow detection, and composite/fusion/metrics techniques. We divided all change detection algorithms into six categories, including thresholding, differencing, segmentation, trajectory classification, statistical boundary, and regression. Within each category, six major characteristics of different algorithms, such as frequency, change index, univariate/multivariate, online/offline, abrupt/gradual change, and sub-pixel/pixel/spatial were analyzed. Moreover, some of the widely-used change detection algorithms were also discussed. Finally, we reviewed different change detection applications by dividing these applications into two categories, change target and change agent detection.

Influence of homeopathic treatment with comfrey on bone density around titanium implants: a digital subtraction radiography study in rats.

Science.gov (United States)

Sakakura, Celso Eduardo; Neto, Rubens Spin; Bellucci, Marina; Wenzel, Ann; Scaf, Gulnara; Marcantonio, Elcio

2008-06-01

The objective of this study was to evaluate the influence of homeopathic treatment with comfrey (Shymphytum officinalis 6CH) on radiographic bone density and area around titanium implants. Forty-eight rats were divided into two groups of 24 animals each: a control group (C) and a test group (SO). Each animal received one titanium micro-implant placed in the tibia. The animals in Group SO were subjected to 10 drops of comfrey 6CH per day mixed into their drinking water until the day of sacrifice. Eight animals of each group were sacrificed at 7, 14 and 28 days post-surgery, respectively. Standardized digital radiographs were obtained on the day of implant installation (baseline images) and on the day of sacrifice (final images). Digital subtraction of the two corresponding images was performed to evaluate changes in bone density and the area related to change around the implant between baseline and final images. Subtraction images demonstrated that a significant difference existed in mean shade of gray at 14 days post-surgery between Group SO (mean 175.3+/-14.4) and Group C (mean 146.2+/-5.2). Regarding the area in pixels corresponding to the bone gain in Group SO, the differences observed between the sacrifice periods and groups were only significant at 7 days sacrifice between Group SO (mean 171.2+/-21.9) and Group C (mean 64.5+/-60.4). Within the limits of this study, comfrey administration promotes an increase in radiographic bone density around titanium implants in the initial period of bone healing.

A Space Object Detection Algorithm using Fourier Domain Likelihood Ratio Test

Science.gov (United States)

Becker, D.; Cain, S.

Space object detection is of great importance in the highly dependent yet competitive and congested space domain. Detection algorithms employed play a crucial role in fulfilling the detection component in the situational awareness mission to detect, track, characterize and catalog unknown space objects. Many current space detection algorithms use a matched filter or a spatial correlator to make a detection decision at a single pixel point of a spatial image based on the assumption that the data follows a Gaussian distribution. This paper explores the potential for detection performance advantages when operating in the Fourier domain of long exposure images of small and/or dim space objects from ground based telescopes. A binary hypothesis test is developed based on the joint probability distribution function of the image under the hypothesis that an object is present and under the hypothesis that the image only contains background noise. The detection algorithm tests each pixel point of the Fourier transformed images to make the determination if an object is present based on the criteria threshold found in the likelihood ratio test. Using simulated data, the performance of the Fourier domain detection algorithm is compared to the current algorithm used in space situational awareness applications to evaluate its value.

Edge pixel response studies of edgeless silicon sensor technology for pixellated imaging detectors

Science.gov (United States)

Maneuski, D.; Bates, R.; Blue, A.; Buttar, C.; Doonan, K.; Eklund, L.; Gimenez, E. N.; Hynds, D.; Kachkanov, S.; Kalliopuska, J.; McMullen, T.; O'Shea, V.; Tartoni, N.; Plackett, R.; Vahanen, S.; Wraight, K.

2015-03-01

Silicon sensor technologies with reduced dead area at the sensor's perimeter are under development at a number of institutes. Several fabrication methods for sensors which are sensitive close to the physical edge of the device are under investigation utilising techniques such as active-edges, passivated edges and current-terminating rings. Such technologies offer the goal of a seamlessly tiled detection surface with minimum dead space between the individual modules. In order to quantify the performance of different geometries and different bulk and implant types, characterisation of several sensors fabricated using active-edge technology were performed at the B16 beam line of the Diamond Light Source. The sensors were fabricated by VTT and bump-bonded to Timepix ROICs. They were 100 and 200 μ m thick sensors, with the last pixel-to-edge distance of either 50 or 100 μ m. The sensors were fabricated as either n-on-n or n-on-p type devices. Using 15 keV monochromatic X-rays with a beam spot of 2.5 μ m, the performance at the outer edge and corners pixels of the sensors was evaluated at three bias voltages. The results indicate a significant change in the charge collection properties between the edge and 5th (up to 275 μ m) from edge pixel for the 200 μ m thick n-on-n sensor. The edge pixel performance of the 100 μ m thick n-on-p sensors is affected only for the last two pixels (up to 110 μ m) subject to biasing conditions. Imaging characteristics of all sensor types investigated are stable over time and the non-uniformities can be minimised by flat-field corrections. The results from the synchrotron tests combined with lab measurements are presented along with an explanation of the observed effects.

A Parallel FPGA Implementation for Real-Time 2D Pixel Clustering for the ATLAS Fast TracKer Processor

CERN Document Server

Sotiropoulou, C-L; The ATLAS collaboration; Annovi, A; Beretta, M; Kordas, K; Nikolaidis, S; Petridou, C; Volpi, G

2014-01-01

The parallel 2D pixel clustering FPGA implementation used for the input system of the ATLAS Fast TracKer (FTK) processor is presented. The input system for the FTK processor will receive data from the Pixel and micro-strip detectors from inner ATLAS read out drivers (RODs) at full rate, for total of 760Gbs, as sent by the RODs after level-1 triggers. Clustering serves two purposes, the first is to reduce the high rate of the received data before further processing, the second is to determine the cluster centroid to obtain the best spatial measurement. For the pixel detectors the clustering is implemented by using a 2D-clustering algorithm that takes advantage of a moving window technique to minimize the logic required for cluster identification. The cluster detection window size can be adjusted for optimizing the cluster identification process. Additionally, the implementation can be parallelized by instantiating multiple cores to identify different clusters independently thus exploiting more FPGA resources. ...

A Parallel FPGA Implementation for Real-Time 2D Pixel Clustering for the ATLAS Fast TracKer Processor

CERN Document Server

Sotiropoulou, C-L; The ATLAS collaboration; Annovi, A; Beretta, M; Kordas, K; Nikolaidis, S; Petridou, C; Volpi, G

2014-01-01

The parallel 2D pixel clustering FPGA implementation used for the input system of the ATLAS Fast TracKer (FTK) processor is presented. The input system for the FTK processor will receive data from the Pixel and micro-strip detectors from inner ATLAS read out drivers (RODs) at full rate, for total of 760Gbs, as sent by the RODs after level1 triggers. Clustering serves two purposes, the first is to reduce the high rate of the received data before further processing, the second is to determine the cluster centroid to obtain the best spatial measurement. For the pixel detectors the clustering is implemented by using a 2D-clustering algorithm that takes advantage of a moving window technique to minimize the logic required for cluster identification. The cluster detection window size can be adjusted for optimizing the cluster identification process. Additionally, the implementation can be parallelized by instantiating multiple cores to identify different clusters independently thus exploiting more FPGA resources. T...

Noise filtering algorithm for the MFTF-B computer based control system

International Nuclear Information System (INIS)

Minor, E.G.

1983-01-01

An algorithm to reduce the message traffic in the MFTF-B computer based control system is described. The algorithm filters analog inputs to the control system. Its purpose is to distinguish between changes in the inputs due to noise and changes due to significant variations in the quantity being monitored. Noise is rejected while significant changes are reported to the control system data base, thus keeping the data base updated with a minimum number of messages. The algorithm is memory efficient, requiring only four bytes of storage per analog channel, and computationally simple, requiring only subtraction and comparison. Quantitative analysis of the algorithm is presented for the case of additive Gaussian noise. It is shown that the algorithm is stable and tends toward the mean value of the monitored variable over a wide variety of additive noise distributions

Continuous-variable measurement-device-independent quantum key distribution with photon subtraction

Science.gov (United States)

Ma, Hong-Xin; Huang, Peng; Bai, Dong-Yun; Wang, Shi-Yu; Bao, Wan-Su; Zeng, Gui-Hua

2018-04-01

It has been found that non-Gaussian operations can be applied to increase and distill entanglement between Gaussian entangled states. We show the successful use of the non-Gaussian operation, in particular, photon subtraction operation, on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI-QKD) protocol. The proposed method can be implemented based on existing technologies. Security analysis shows that the photon subtraction operation can remarkably increase the maximal transmission distance of the CV-MDI-QKD protocol, which precisely make up for the shortcoming of the original CV-MDI-QKD protocol, and one-photon subtraction operation has the best performance. Moreover, the proposed protocol provides a feasible method for the experimental implementation of the CV-MDI-QKD protocol.

The ALICE Silicon Pixel Detector System (SPD)

CERN Document Server

Kluge, A; Antinori, Federico; Burns, M; Cali, I A; Campbell, M; Caselle, M; Ceresa, S; Dima, R; Elias, D; Fabris, D; Krivda, Marian; Librizzi, F; Manzari, Vito; Morel, M; Moretto, Sandra; Osmic, F; Pappalardo, G S; Pepato, Adriano; Pulvirenti, A; Riedler, P; Riggi, F; Santoro, R; Stefanini, G; Torcato De Matos, C; Turrisi, R; Tydesjo, H; Viesti, G; PH-EP

2007-01-01

The ALICE silicon pixel detector (SPD) comprises the two innermost layers of the ALICE inner tracker system. The SPD includes 120 detector modules (half-staves) each consisting of 10 ALICE pixel chips bump bonded to two silicon sensors and one multi-chip read-out module. Each pixel chip contains 8192 active cells, so that the total number of pixel cells in the SPD is ≈ 107. The on-detector read-out is based on a multi-chip-module containing 4 ASICs and an optical transceiver module. The constraints on material budget and detector module dimensions are very demanding.

Applying Statistical Mechanics to pixel detectors

International Nuclear Information System (INIS)

Pindo, Massimiliano

2002-01-01

Pixel detectors, being made of a large number of active cells of the same kind, can be considered as significant sets to which Statistical Mechanics variables and methods can be applied. By properly redefining well known statistical parameters in order to let them match the ones that actually characterize pixel detectors, an analysis of the way they work can be performed in a totally new perspective. A deeper understanding of pixel detectors is attained, helping in the evaluation and comparison of their intrinsic characteristics and performance

Digital subtraction radiography in the study of moving laryngeal structures

International Nuclear Information System (INIS)

Perri, G.; Falaschi, F.; Pieri, L.; Esposito, S.; Ursino, F.

1988-01-01

Digital subtraction radiography (DSR) was applied to the study of the larynx in 11 healthy subjects and 15 pathological cases. The method, consisting in the subtraction of images obtained at rest and during phonation or respiratory phases, allowed a clear definition of the normal moving structures - i.e. vocal cords, false cords, pyriform sinuses, thyroid cartilage. Moreover, several pathological conditions could be demonstrated. DSR asserts thus itself as a suitable technique in the functional evaluation of glottis

Intelligent error correction method applied on an active pixel sensor based star tracker

Science.gov (United States)

Schmidt, Uwe

2005-10-01

Star trackers are opto-electronic sensors used on-board of satellites for the autonomous inertial attitude determination. During the last years star trackers became more and more important in the field of the attitude and orbit control system (AOCS) sensors. High performance star trackers are based up today on charge coupled device (CCD) optical camera heads. The active pixel sensor (APS) technology, introduced in the early 90-ties, allows now the beneficial replacement of CCD detectors by APS detectors with respect to performance, reliability, power, mass and cost. The company's heritage in star tracker design started in the early 80-ties with the launch of the worldwide first fully autonomous star tracker system ASTRO1 to the Russian MIR space station. Jena-Optronik recently developed an active pixel sensor based autonomous star tracker "ASTRO APS" as successor of the CCD based star tracker product series ASTRO1, ASTRO5, ASTRO10 and ASTRO15. Key features of the APS detector technology are, a true xy-address random access, the multiple windowing read out and the on-chip signal processing including the analogue to digital conversion. These features can be used for robust star tracking at high slew rates and under worse conditions like stray light and solar flare induced single event upsets. A special algorithm have been developed to manage the typical APS detector error contributors like fixed pattern noise (FPN), dark signal non-uniformity (DSNU) and white spots. The algorithm works fully autonomous and adapts to e.g. increasing DSNU and up-coming white spots automatically without ground maintenance or re-calibration. In contrast to conventional correction methods the described algorithm does not need calibration data memory like full image sized calibration data sets. The application of the presented algorithm managing the typical APS detector error contributors is a key element for the design of star trackers for long term satellite applications like

A Region-Based GeneSIS Segmentation Algorithm for the Classification of Remotely Sensed Images

Directory of Open Access Journals (Sweden)

Stelios K. Mylonas

2015-03-01

Full Text Available This paper proposes an object-based segmentation/classification scheme for remotely sensed images, based on a novel variant of the recently proposed Genetic Sequential Image Segmentation (GeneSIS algorithm. GeneSIS segments the image in an iterative manner, whereby at each iteration a single object is extracted via a genetic-based object extraction algorithm. Contrary to the previous pixel-based GeneSIS where the candidate objects to be extracted were evaluated through the fuzzy content of their included pixels, in the newly developed region-based GeneSIS algorithm, a watershed-driven fine segmentation map is initially obtained from the original image, which serves as the basis for the forthcoming GeneSIS segmentation. Furthermore, in order to enhance the spatial search capabilities, we introduce a more descriptive encoding scheme in the object extraction algorithm, where the structural search modules are represented by polygonal shapes. Our objectives in the new framework are posed as follows: enhance the flexibility of the algorithm in extracting more flexible object shapes, assure high level classification accuracies, and reduce the execution time of the segmentation, while at the same time preserving all the inherent attributes of the GeneSIS approach. Finally, exploiting the inherent attribute of GeneSIS to produce multiple segmentations, we also propose two segmentation fusion schemes that operate on the ensemble of segmentations generated by GeneSIS. Our approaches are tested on an urban and two agricultural images. The results show that region-based GeneSIS has considerably lower computational demands compared to the pixel-based one. Furthermore, the suggested methods achieve higher classification accuracies and good segmentation maps compared to a series of existing algorithms.

Improvement and implementation for Canny edge detection algorithm

Science.gov (United States)

Yang, Tao; Qiu, Yue-hong

2015-07-01

Edge detection is necessary for image segmentation and pattern recognition. In this paper, an improved Canny edge detection approach is proposed due to the defect of traditional algorithm. A modified bilateral filter with a compensation function based on pixel intensity similarity judgment was used to smooth image instead of Gaussian filter, which could preserve edge feature and remove noise effectively. In order to solve the problems of sensitivity to the noise in gradient calculating, the algorithm used 4 directions gradient templates. Finally, Otsu algorithm adaptively obtain the dual-threshold. All of the algorithm simulated with OpenCV 2.4.0 library in the environments of vs2010, and through the experimental analysis, the improved algorithm has been proved to detect edge details more effectively and with more adaptability.

Half-unit weighted bilinear algorithm for image contrast enhancement in capsule endoscopy

Science.gov (United States)

Rukundo, Olivier

2018-04-01

This paper proposes a novel enhancement method based exclusively on the bilinear interpolation algorithm for capsule endoscopy images. The proposed method does not convert the original RBG image components to HSV or any other color space or model; instead, it processes directly RGB components. In each component, a group of four adjacent pixels and half-unit weight in the bilinear weighting function are used to calculate the average pixel value, identical for each pixel in that particular group. After calculations, groups of identical pixels are overlapped successively in horizontal and vertical directions to achieve a preliminary-enhanced image. The final-enhanced image is achieved by halving the sum of the original and preliminary-enhanced image pixels. Quantitative and qualitative experiments were conducted focusing on pairwise comparisons between original and enhanced images. Final-enhanced images have generally the best diagnostic quality and gave more details about the visibility of vessels and structures in capsule endoscopy images.

Pixelated CdZnTe drift detectors

DEFF Research Database (Denmark)

Kuvvetli, Irfan; Budtz-Jørgensen, Carl

2005-01-01

A technique, the so-called Drift Strip Method (DSM), for improving the CdZnTe detector energy response to hard X-rays and gamma-rays was applied as a pixel geometry. First tests have confirmed that this detector type provides excellent energy resolution and imaging performance. We specifically...... report on the performance of 3 mm thick prototype CZT drift pixel detectors fabricated using material from eV-products. We discuss issues associated with detector module performance. Characterization results obtained from several prototype drift pixel detectors are presented. Results of position...

A Novel Image Encryption Algorithm Based on a Fractional-Order Hyperchaotic System and DNA Computing

Directory of Open Access Journals (Sweden)

Taiyong Li

2017-01-01

Full Text Available In the era of the Internet, image encryption plays an important role in information security. Chaotic systems and DNA operations have been proven to be powerful for image encryption. To further enhance the security of image, in this paper, we propose a novel algorithm that combines the fractional-order hyperchaotic Lorenz system and DNA computing (FOHCLDNA for image encryption. Specifically, the algorithm consists of four parts: firstly, we use a fractional-order hyperchaotic Lorenz system to generate a pseudorandom sequence that will be utilized during the whole encryption process; secondly, a simple but effective diffusion scheme is performed to spread the little change in one pixel to all the other pixels; thirdly, the plain image is encoded by DNA rules and corresponding DNA operations are performed; finally, global permutation and 2D and 3D permutation are performed on pixels, bits, and acid bases. The extensive experimental results on eight publicly available testing images demonstrate that the encryption algorithm can achieve state-of-the-art performance in terms of security and robustness when compared with some existing methods, showing that the FOHCLDNA is promising for image encryption.

Edge Detection Algorithm Based on Fuzzy Logic Theory for a Local Vision System of Robocup Humanoid League

Directory of Open Access Journals (Sweden)

Andrea K. Perez-Hernandez

2013-06-01

Full Text Available At this paper we shown the development of an algorithm to perform edges extraction based on fuzzy logic theory. This method allows recognizing landmarks on the game field for Humanoid League of RoboCup. The proposed algorithm describes the creation of a fuzzy inference system that permit evaluate the existent relationship between image pixels, finding variations on grey levels of related neighbor pixels. Subsequently, it shows an implementation of OTSU method to binarize an image that was obtained from fuzzy process and so generate an image containing only extracted edges, validating the algorithm with Humanoid League images. Later, we analyze obtained results that evidence a good performance of algorithm, considering that this proposal only takes an extra 35% processing time that will be required by traditional methods, whereas extracted edges are 52% less noise susceptible.

Removal of arterial wall calcifications in CT angiography by local subtraction

International Nuclear Information System (INIS)

Straten, Marcel van; Venema, Henk W.; Streekstra, Geert J.; Reekers, Jim A.; Heeten, Gerard J. den; Grimbergen, Cornelis A.

2003-01-01

CT Angiography (CTA) is an established technique for the minimally invasive imaging of arteries. The technique of maximum intensity projection (MIP) is often used to get a comprehensive overview of the vascular anatomy. On a MIP, however, arterial wall calcifications may hinder the visualization of the arterial lumen. These calcifications are in direct contact with the contrast-enhanced blood, which makes removal difficult. We present a local subtraction method for the automatic removal of these calcifications. In our approach a second CT scan has to be made, prior to contrast injection. The calcifications in both scans are registered prior to subtraction to compensate for displacements in between the two scans. Local subtraction results are compared with results obtained by thresholding. The method was tested in a phantom and with data from four patients. The phantom represented an artery with different types of stenosis. Data were used from patients for which CTA of the renal arteries was performed. For two patients the electrocardiogram (ECG) was recorded during the CTA examination, making retrospective cardiac gated reconstructions possible. Both the phantom and the patient study showed that the local subtraction method is capable of removing calcifications and visualizing the residual lumen. In the patient study it appeared that some artifacts remained for higher pitch values. We conclude that the local subtraction method is less subjective and more accurate than thresholding. Best results are obtained by use of a small pitch, at the expense of the volume covered during a single breath hold

Nonenhanced magnetic resonance angiography (MRA) of the calf arteries at 3 Tesla: intraindividual comparison of 3D flow-dependent subtractive MRA and 2D flow-independent non-subtractive MRA

Energy Technology Data Exchange (ETDEWEB)

Knobloch, Gesine; Lauff, Marie-Teres; Hirsch, Sebastian; Hamm, Bernd; Wagner, Moritz [Charite - Universitaetsmedizin Berlin, Department of Radiology, Berlin (Germany); Schwenke, Carsten [SCO:SSiS Statistical Consulting, Berlin (Germany)

2016-12-15

To prospectively compare 3D flow-dependent subtractive MRA vs. 2D flow-independent non-subtractive MRA for assessment of the calf arteries at 3 Tesla. Forty-two patients with peripheral arterial occlusive disease underwent nonenhanced MRA of calf arteries at 3 Tesla with 3D flow-dependent subtractive MRA (fast spin echo sequence; 3D-FSE-MRA) and 2D flow-independent non-subtractive MRA (balanced steady-state-free-precession sequence; 2D-bSSFP-MRA). Moreover, all patients underwent contrast-enhanced MRA (CE-MRA) as standard-of-reference. Two readers performed a per-segment evaluation for image quality (4 = excellent to 0 = non-diagnostic) and severity of stenosis. Image quality scores of 2D-bSSFP-MRA were significantly higher compared to 3D-FSE-MRA (medians across readers: 4 vs. 3; p < 0.0001) with lower rates of non-diagnostic vessel segments on 2D-bSSFP-MRA (reader 1: <1 % vs. 15 %; reader 2: 1 % vs. 29 %; p < 0.05). Diagnostic performance of 2D-bSSFP-MRA and 3D-FSE-MRA across readers showed sensitivities of 89 % (214/240) vs. 70 % (168/240), p = 0.0153; specificities: 91 % (840/926) vs. 63 % (585/926), p < 0.0001; and diagnostic accuracies of 90 % (1054/1166) vs. 65 % (753/1166), p < 0.0001. 2D flow-independent non-subtractive MRA (2D-bSSFP-MRA) is a robust nonenhanced MRA technique for assessment of the calf arteries at 3 Tesla with significantly higher image quality and diagnostic accuracy compared to 3D flow-dependent subtractive MRA (3D-FSE-MRA). (orig.)

Digital subtraction angiography of carotid bifurcation

International Nuclear Information System (INIS)

Vries, A.R. de.

1984-01-01

This study demonstrates the reliability of digital subtraction angiography (DSA) by means of intra- and interobserver investigations as well as indicating the possibility of substituting catheterangiography by DSA in the diagnosis of carotid bifurcation. Whenever insufficient information is obtained from the combination of non-invasive investigation and DSA, a catheterangiogram will be necessary. (Auth.)

Digital subtraction angiography: myths and reality

International Nuclear Information System (INIS)

Levin, D.C.

1984-01-01

Some of the claims made about digital subtraction angiography (DSA) when it was first developed have turned out to be greatly exaggerated, and some members of the radiologic community have become disillusioned with its capabilities. The author discusses some of the limitations of DSA, and concludes that the advantages of DSA outweigh its limitations

ISPA (imaging silicon pixel array) experiment

CERN Multimedia

Patrice Loïez

2002-01-01

The bump-bonded silicon pixel detector, developed at CERN by the EP-MIC group, is shown here in its ceramic carrier. Both represent the ISPA-tube anode. The chip features between 1024 (called OMEGA-1) and 8196 (ALICE-1) active pixels.

Operational Experience with the ATLAS Pixel Detector

CERN Document Server

Djama, Fares; The ATLAS collaboration

2017-01-01

Run-2 of the LHC is providing new challenges to track and vertex reconstruction imposed by the higher collision energy, pileup and luminosity that are being delivered. The ATLAS tracking performance relies critically on the Pixel Detector, therefore, in view of Run-2 of LHC, the ATLAS experiment has constructed the first 4-layer Pixel detector in HEP, installing a new Pixel layer, also called Insertable B-Layer (IBL). Pixel detector was refurbished with a new service quarter panel to recover about 3% of defective modules lost during run-1 and an additional optical link per module was added to overcome in some layers the readout bandwidth limitation when LHC will exceed the nominal peak luminosity by almost a factor of 3. The key features and challenges met during the IBL project will be presented, as well as its operational experience and Pixel Detector performance in LHC.

The contribution of chemical shift imaging with digital subtracting images to the diagnosis of steatohepatitis

International Nuclear Information System (INIS)

Guo Xinghua; Wang Juanping; Zhang Chongjie; Zheng Guofang; Fan Ruiqiang; Zhu Sumei; Liu Qiwang

2006-01-01

Objective: To investigate the diagnosis value of chemical shift imaging with digital subtracting in steatohepatitis. Methods: The in-phase images were subtracted by the out-phase ones in 34 cases of steatohepatitis, and the CNR were measured on these subtracted images to estimate the steatosis of the liver. The relationship of CT grade of steatohepatitis and CNR from the subtracted images was analyzed to evaluate the relationship between CNR and the degree of hepatic steatosis. The sensitivity and specificity of the subtracting and eyeballing methods were compared with chi-square test. Results: On the subtracted images, the liver and spleen were seen nearly the same aspects as low signals, CNR=0.98±0.06, meanwhile the spongy vertebra and the subcutaneous or abdominal lipid were seen as obvious higher signals in 52 normal cases. On the 34 steatohepatitis, scattered high signals were seen in the liver, which made the signal of liver higher than that of spleen, CNR=3.25±0.91--14.35±6.10. There was positive correlation between CNR and CT grade in the 34 cases of steatohepatitis, r=0.893, P<0.01. The sensitivity and specificity of the subtracting method were 88.24% and 94. 23%, significantly higher than that of the eyeballing results, 32.35% and 80.77%, P<0.01 and P<0.05. Conclusion: Chemical shift imaging with digital subtracting is a sensitive, specific, objective method to diagnose steatohepatitis and it is of potential ability for quantitative diagnosis. (authors)

Evaluation of the minimum iodine concentration for contrast-enhanced subtraction mammography

International Nuclear Information System (INIS)

Baldelli, P; Bravin, A; Maggio, C Di; Gennaro, G; Sarnelli, A; Taibi, A; Gambaccini, M

2006-01-01

Early manifestation of breast cancer is often very subtle and is displayed in a complex and variable pattern of normal anatomy that may obscure the disease. The use of dual-energy techniques, that can remove the structural noise, and contrast media, that enhance the region surrounding the tumour, could help us to improve the detectability of the lesions. The aim of this work is to investigate the use of an iodine-based contrast medium in mammography with two different double exposure techniques: K-edge subtraction mammography and temporal subtraction mammography. Both techniques have been investigated by using an ideal source, like monochromatic beams produced at a synchrotron radiation facility and a clinical digital mammography system. A dedicated three-component phantom containing cavities filled with different iodine concentrations has been developed and used for measurements. For each technique, information about the minimum iodine concentration, which provides a significant enhancement of the detectability of the pathology by minimizing the risk due to high dose and high concentration of contrast medium, has been obtained. In particular, for cavities of 5 and 8 mm in diameter filled with iodine solutions, the minimum concentration needed to obtain a contrast-to-noise ratio of 5 with a mean glandular dose of 2 mGy has been calculated. The minimum concentrations estimated with monochromatic beams and K-edge subtraction mammography are 0.9 mg ml -1 and 1.34 mg ml -1 for the biggest and smallest details, respectively, while for temporal subtraction mammography they are 0.84 mg ml -1 and 1.31 mg ml -1 . With the conventional clinical system the minimum concentrations for the K-edge subtraction mammography are 4.13 mg ml -1 (8 mm diameter) and 5.75 mg ml -1 (5 mm diameter), while for the temporal subtraction mammography they are 1.01 mg ml -1 (8 mm diameter) and 1.57 mg ml -1 (5 mm diameter)

Operational Experience with the ATLAS Pixel Detector

CERN Document Server

Lantzsch, Kerstin; The ATLAS collaboration

2016-01-01

Run 2 of the LHC is providing new challenges to track and vertex reconstruction with higher energies, denser jets and higher rates. Therefore the ATLAS experiment has constructed the first 4-layer Pixel detector in HEP, installing a new Pixel layer, also called Insertable B-Layer (IBL). In addition the Pixel detector was refurbished with new service quarter panels to recover about 3% of defective modules lost during run 1 and a new optical readout system to readout the data at higher speed while reducing the occupancy when running with increased luminosity. The commissioning, operation and performance of the 4-layer Pixel Detector will be presented.

Sensitivity of Marine Warm Cloud Retrieval Statistics to Algorithm Choices: Examples from MODIS Collection 6

Science.gov (United States)

Platnick, Steven; Wind, Galina; Zhang, Zhibo; Ackerman, Steven A.; Maddux, Brent

2012-01-01

The optical and microphysical structure of warm boundary layer marine clouds is of fundamental importance for understanding a variety of cloud radiation and precipitation processes. With the advent of MODIS (Moderate Resolution Imaging Spectroradiometer) on the NASA EOS Terra and Aqua platforms, simultaneous global/daily 1km retrievals of cloud optical thickness and effective particle size are provided, as well as the derived water path. In addition, the cloud product (MOD06/MYD06 for MODIS Terra and Aqua, respectively) provides separate effective radii results using the l.6, 2.1, and 3.7 m spectral channels. Cloud retrieval statistics are highly sensitive to how a pixel identified as being "notclear" by a cloud mask (e.g., the MOD35/MYD35 product) is determined to be useful for an optical retrieval based on a 1-D cloud model. The Collection 5 MODIS retrieval algorithm removed pixels associated with cloud'edges as well as ocean pixels with partly cloudy elements in the 250m MODIS cloud mask - part of the so-called Clear Sky Restoral (CSR) algorithm. Collection 6 attempts retrievals for those two pixel populations, but allows a user to isolate or filter out the populations via CSR pixel-level Quality Assessment (QA) assignments. In this paper, using the preliminary Collection 6 MOD06 product, we present global and regional statistical results of marine warm cloud retrieval sensitivities to the cloud edge and 250m partly cloudy pixel populations. As expected, retrievals for these pixels are generally consistent with a breakdown of the ID cloud model. While optical thickness for these suspect pixel populations may have some utility for radiative studies, the retrievals should be used with extreme caution for process and microphysical studies.

Focal plane array with modular pixel array components for scalability

Science.gov (United States)

Kay, Randolph R; Campbell, David V; Shinde, Subhash L; Rienstra, Jeffrey L; Serkland, Darwin K; Holmes, Michael L

2014-12-09

A modular, scalable focal plane array is provided as an array of integrated circuit dice, wherein each die includes a given amount of modular pixel array circuitry. The array of dice effectively multiplies the amount of modular pixel array circuitry to produce a larger pixel array without increasing die size. Desired pixel pitch across the enlarged pixel array is preserved by forming die stacks with each pixel array circuitry die stacked on a separate die that contains the corresponding signal processing circuitry. Techniques for die stack interconnections and die stack placement are implemented to ensure that the desired pixel pitch is preserved across the enlarged pixel array.

[The backgroud sky subtraction around [OIII] line in LAMOST QSO spectra].

Science.gov (United States)

Shi, Zhi-Xin; Comte, Georges; Luo, A-Li; Tu, Liang-Ping; Zhao, Yong-Heng; Wu, Fu-Chao

2014-11-01

At present, most sky-subtraction methods focus on the full spectrum, not the particular location, especially for the backgroud sky around [OIII] line which is very important to low redshift quasars. A new method to precisely subtract sky lines in local region is proposed in the present paper, which sloves the problem that the width of Hβ-[OIII] line is effected by the backgroud sky subtraction. The exprimental results show that, for different redshift quasars, the spectral quality has been significantly improved using our method relative to the original batch program by LAMOST. It provides a complementary solution for the small part of LAMOST spectra which are not well handled by LAMOST 2D pipeline. Meanwhile, This method has been used in searching for candidates of double-peaked Active Galactic Nuclei.

Development of CD3 cell quantitation algorithms for renal allograft biopsy rejection assessment utilizing open source image analysis software.

Science.gov (United States)

Moon, Andres; Smith, Geoffrey H; Kong, Jun; Rogers, Thomas E; Ellis, Carla L; Farris, Alton B Brad

2018-02-01

Renal allograft rejection diagnosis depends on assessment of parameters such as interstitial inflammation; however, studies have shown interobserver variability regarding interstitial inflammation assessment. Since automated image analysis quantitation can be reproducible, we devised customized analysis methods for CD3+ T-cell staining density as a measure of rejection severity and compared them with established commercial methods along with visual assessment. Renal biopsy CD3 immunohistochemistry slides (n = 45), including renal allografts with various degrees of acute cellular rejection (ACR) were scanned for whole slide images (WSIs). Inflammation was quantitated in the WSIs using pathologist visual assessment, commercial algorithms (Aperio nuclear algorithm for CD3+ cells/mm 2 and Aperio positive pixel count algorithm), and customized open source algorithms developed in ImageJ with thresholding/positive pixel counting (custom CD3+%) and identification of pixels fulfilling "maxima" criteria for CD3 expression (custom CD3+ cells/mm 2 ). Based on visual inspections of "markup" images, CD3 quantitation algorithms produced adequate accuracy. Additionally, CD3 quantitation algorithms correlated between each other and also with visual assessment in a statistically significant manner (r = 0.44 to 0.94, p = 0.003 to algorithms presents salient correlations with established methods of CD3 quantitation. These analysis techniques are promising and highly customizable, providing a form of on-slide "flow cytometry" that can facilitate additional diagnostic accuracy in tissue-based assessments.

A multicenter evaluation of seven commercial ML-EM algorithms for SPECT image reconstruction using simulation data

International Nuclear Information System (INIS)

Matsumoto, Keiichi; Ohnishi, Hideo; Niida, Hideharu; Nishimura, Yoshihiro; Wada, Yasuhiro; Kida, Tetsuo

2003-01-01

The maximum likelihood expectation maximization (ML-EM) algorithm has become available as an alternative to filtered back projection in SPECT. The actual physical performance may be different depending on the manufacturer and model, because of differences in computational details. The purpose of this study was to investigate the characteristics of seven different types of ML-EM algorithms using simple simulation data. Seven ML-EM algorithm programs were used: Genie (GE), esoft (Siemens), HARP-III (Hitachi), GMS-5500UI (Toshiba), Pegasys (ADAC), ODYSSEY-FX (Marconi), and Windows-PC (original software). Projection data of a 2-pixel-wide line source in the center of the field of view were simulated without attenuation or scatter. Images were reconstructed with ML-EM by changing the number of iterations from 1 to 45 for each algorithm. Image quality was evaluated after a reconstruction using full width at half maximum (FWHM), full width at tenth maximum (FWTM), and the total counts of the reconstructed images. In the maximum number of iterations, the difference in the FWHM value was up to 1.5 pixels, and that of FWTM, no less than 2.0 pixels. The total counts of the reconstructed images in the initial few iterations were larger or smaller than the converged value depending on the initial values. Our results for the simplest simulation data suggest that each ML-EM algorithm itself provides a simulation image. We should keep in mind which algorithm is being used and its computational details, when physical and clinical usefulness are compared. (author)

Development of pixel detectors for SSC vertex tracking

International Nuclear Information System (INIS)

Kramer, G.; Shapiro, S.L.; Arens, J.F.; Jernigan, J.G.; Skubic, P.

1991-04-01

A description of hybrid PIN diode arrays and a readout architecture for their use as a vertex detector in the SSC environment is presented. Test results obtained with arrays having 256 x 256 pixels, each 30 μm square, are also presented. The development of a custom readout for the SSC will be discussed, which supports a mechanism for time stamping hit pixels, storing their xy coordinates, and storing the analog information within the pixel. The peripheral logic located on the array, permits the selection of those pixels containing interesting data and their coordinates to be selectively read out. This same logic also resolves ambiguous pixel ghost locations and controls the pixel neighbor read out necessary to achieve high spatial resolution. The thermal design of the vertex tracker and the proposed signal processing architecture will also be discussed. 5 refs., 13 figs., 3 tabs

Subtracting and Fitting Histograms using Profile Likelihood

CERN Document Server

D'Almeida, F M L

2008-01-01

It is known that many interesting signals expected at LHC are of unknown shape and strongly contaminated by background events. These signals will be dif cult to detect during the rst years of LHC operation due to the initial low luminosity. In this work, one presents a method of subtracting histograms based on the pro le likelihood function when the background is previously estimated by Monte Carlo events and one has low statistics. Estimators for the signal in each bin of the histogram difference are calculated so as limits for the signals with 68.3% of Con dence Level in a low statistics case when one has a exponential background and a Gaussian signal. The method can also be used to t histograms when the signal shape is known. Our results show a good performance and avoid the problem of negative values when subtracting histograms.

E-Beam Effects on CMOS Active Pixel Sensors

International Nuclear Information System (INIS)

Kang, Dong Ook; Jo, Gyu Seong; Kim, Hyeon Daek; Kim, Hyunk Taek; Kim, Jong Yeol; Kim, Chan Kyu

2011-01-01

Three different CMOS active pixel structures manufactured in a deep submicron process have been evaluated with electron beam. The devices were exposed to 1 MeV electron beam up to 5kGy. Dark current increased after E-beam irradiation differently at each pixel structure. Dark current change is dependent on CMOS pixel structures. CMOS image sensors are now good candidates in demanding applications such as medical image sensor, particle detection and space remote sensing. In these situations, CISs are exposed to high doses of radiation. In fact radiation is known to generate trapped charge in CMOS oxides. It can lead to threshold voltage shifts and current leakages in MOSFETs and dark current increase in photodiodes. We studied ionizing effects in three types of CMOS APSs fabricated by 0.25 CMOS process. The devices were irradiated by a Co 60 source up to 50kGy. All irradiation took place at room temperature. The dark current in the three different pixels exhibits increase with electron beam exposure. From the above figure, the change of dark current is dependent on the pixel structure. Double junction structure has shown relatively small increase of dark current after electron beam irradiation. The dark current in the three different pixels exhibits increase with electron beam exposure. The contribution of the total ionizing dose to the dark current increase is small here, since the devices were left unbiased during the electron beam irradiation. Radiation hardness in dependent on the pixel structures. Pixel2 is relatively vulnerable to radiation exposure. Pixel3 has radiation hardened structure

Shot Boundary Detection in Soccer Video using Twin-comparison Algorithm and Dominant Color Region

Directory of Open Access Journals (Sweden)

Matko Šarić

2008-06-01

Full Text Available The first step in generic video processing is temporal segmentation, i.e. shot boundary detection. Camera shot transitions can be either abrupt (e.g. cuts or gradual (e.g. fades, dissolves, wipes. Sports video is one of the most challenging domains for robust shot boundary detection. We proposed a shot boundary detection algorithm for soccer video based on the twin-comparison method and the absolute difference between frames in their ratios of dominant colored pixels to total number of pixels. With this approach the detection of gradual transitions is improved by decreasing the number of false positives caused by some camera operations. We also compared performances of our algorithm and the standard twin-comparison method.

Operational experience with the ATLAS Pixel Detector

CERN Document Server

Ince, T; The ATLAS collaboration

2012-01-01

The ATLAS Pixel Detector is the innermost element of the ATLAS experiment at the Large Hadron Collider at CERN, providing high-resolution measurements of charged particle tracks in the high radiation environment close to the collision region. This capability is vital for the identification and measurement of proper decay times of long-lived particles such as b-hadrons, and thus vital for the ATLAS physics program. The detector provides hermetic coverage with three cylindrical layers and three layers of forward and backward pixel detectors. It consists of approximately 80 million pixels that are individually read out via chips bump-bonded to 1744 n-in-n silicon substrates. In this paper, results from the successful operation of the Pixel Detector at the LHC will be presented, including monitoring, calibration procedures, timing optimization and detector performance. The detector performance is excellent: 96.2% of the pixels are operational, noise occupancy and hit efficiency exceed the design specification, an...

Operational experience of the ATLAS Pixel detector

CERN Document Server

Hirschbuehl, D; The ATLAS collaboration

2011-01-01

The ATLAS Pixel Detector is the innermost detector of the ATLAS experiment at the Large Hadron Collider at CERN, providing high-resolution measurements of charged particle tracks in the high radiation environment close to the collision region. This capability is vital for the identification and measurement of proper decay times of long-lived particles such as b-hadrons, and thus vital for the ATLAS physics program. The detector provides hermetic coverage with three cylindrical layers and three layers of forward and backward pixel detectors. It consists of approximately 80 million pixels that are individually read out via chips bump-bonded to 1744 n-in-n silicon substrates. In this talk, results from the successful operation of the Pixel Detector at the LHC will be presented, including monitoring, calibration procedures, timing optimization and detector performance. The detector performance is excellent: 97,5% of the pixels are operational, noise occupancy and hit efficiency exceed the design specification, an...

Operational experience of the ATLAS Pixel Detector

CERN Document Server

Marcisovsky, M; The ATLAS collaboration

2011-01-01

The ATLAS Pixel Detector is the innermost detector of the ATLAS experiment at the Large Hadron Collider at CERN, providing high-resolution measurements of charged particle tracks in the high radiation environment close to the collision region. This capability is vital for the identification and measurement of proper decay times of long-lived particles such as b-hadrons, and thus vital for the ATLAS physics program. The detector provides hermetic coverage with three cylindrical layers and three layers of forward and backward pixel detectors. It consists of approximately 80 million pixels that are individually read out via chips bump-bonded to 1744 n-in-n silicon substrates. In this talk, results from the successful operation of the Pixel Detector at the LHC will be presented, including monitoring, calibration procedures, timing optimization and detector performance. The detector performance is excellent: 97,5% of the pixels are operational, noise occupancy and hit efficiency exceed the design specification, an...

Estimation bias from using nonlinear Fourier plane correlators for sub-pixel image shift measurement and implications for the binary joint transform correlator

Science.gov (United States)

Grycewicz, Thomas J.; Florio, Christopher J.; Franz, Geoffrey A.; Robinson, Ross E.

2007-09-01

When using Fourier plane digital algorithms or an optical correlator to measure the correlation between digital images, interpolation by center-of-mass or quadratic estimation techniques can be used to estimate image displacement to the sub-pixel level. However, this can lead to a bias in the correlation measurement. This bias shifts the sub-pixel output measurement to be closer to the nearest pixel center than the actual location. The paper investigates the bias in the outputs of both digital and optical correlators, and proposes methods to minimize this effect. We use digital studies and optical implementations of the joint transform correlator to demonstrate optical registration with accuracies better than 0.1 pixels. We use both simulations of image shift and movies of a moving target as inputs. We demonstrate bias error for both center-of-mass and quadratic interpolation, and discuss the reasons that this bias is present. Finally, we suggest measures to reduce or eliminate the bias effects. We show that when sub-pixel bias is present, it can be eliminated by modifying the interpolation method. By removing the bias error, we improve registration accuracy by thirty percent.

Comparative study between rib imaging of DR dual energy subtraction technology and chest imaging

International Nuclear Information System (INIS)

Yu Jianming; Lei Ziqiao; Kong Xiangchuang

2006-01-01

Objective: To investigate the application value of DR dual energy subtraction technology in rib lesions. Methods: 200 patients were performed with chest DR dual energy subtraction, comparing the rib imaging between DR of thorax and chest imaging using ROC analysis. Results: Among the total of 200 patients, there are 50 cases of rib calcification, 7 cases of rib destruction, 22 cases of rib fracture. The calcification, destruction and fracture were displayed respectively by ribs below diaphragm and rib markings. The analytic parameter of rib imaging of DR dual energy subtraction Az is 0.9367, while that of rib imaging of chest Az is 0.6830. Conclusion: DR dual energy subtraction technology is superior to chest imaging in the displaying of rib lesion and ribs below diaphragm. (authors)

Subtraction of random coincidences in γ-ray spectroscopy: A new approach

International Nuclear Information System (INIS)

Pattabiraman, N.S.; Ghugre, S.S.; Basu, S.K.; Garg, U.; Ray, S.; Sinha, A.K.; Zhu, S.

2006-01-01

A new analytical method for estimation and subsequent subtraction of random coincidences has been developed. It utilizes the knowledge of the counts in the main diagonal of a background-subtracted symmetric data set for the estimation of the events originating from random coincidences. This procedure has been successfully applied to several data sets. It could be a valuable tool for low-fold data sets, especially for low-cross-section events

Building CMS Pixel Barrel Detectur Modules

CERN Document Server

König, S; Horisberger, R.; Meier, B.; Rohe, T.; Streuli, S.; Weber, R.; Kastli, H.Chr.; Erdmann, W.

2007-01-01

For the barrel part of the CMS pixel tracker about 800 silicon pixel detector modules are required. The modules are bump bonded, assembled and tested at the Paul Scherrer Institute. This article describes the experience acquired during the assembly of the first ~200 modules.

The Development of Geo-KOMPSAT-2A (GK-2A) Convective Initiation Algorithm over the Korea peninsular

Science.gov (United States)

Kim, H. S.; Chung, S. R.; Lee, B. I.; Baek, S.; Jeon, E.

2016-12-01

The rapid development of convection can bring heavy rainfall that suffers a great deal of damages to society as well as threatens human life. The high accurate forecast of the strong convection is essentially demanded to prevent those disasters from the severe weather. Since a geostationary satellite is the most suitable instrument for monitoring the single cloud's lifecycle from its formation to extinction, it has been attempted to capture the precursor signals of convection clouds by satellite. Keeping pace with the launch of Geo-KOMPSAT-2A (GK-2A) in 2018, we planned to produce convective initiation (CI) defined as the indicator of potential cloud objects to bring heavy precipitation within two hours. The CI algorithm for GK-2A is composed of four stages. The beginning is to subtract mature cloud pixels, a sort of convective cloud mask by visible (VIS) albedo and infrared (IR) brightness temperature thresholds. Then, the remained immature cloud pixels are clustered as a cloud object by watershed techniques. Each clustering object is undergone 'Interest Fields' tests for IR data that reflect cloud microphysical properties at the current and their temporal changes; the cloud depth, updraft strength and production of glaciations. All thresholds of 'Interest fields' were optimized for Korean-type convective clouds. Based on scores from tests, it is decided whether the cloud object would develop as a convective cell or not. Here we show the result of case study in this summer over the Korea peninsular by using Himawari-8 VIS and IR data. Radar echo and data were used for validation. This study suggests that CI products of GK-2A would contribute to enhance accuracy of the very short range forecast over the Korea peninsular.

A face recognition algorithm based on multiple individual discriminative models

DEFF Research Database (Denmark)

Fagertun, Jens; Gomez, David Delgado; Ersbøll, Bjarne Kjær

2005-01-01

Abstract—In this paper, a novel algorithm for facial recognition is proposed. The technique combines the color texture and geometrical configuration provided by face images. Landmarks and pixel intensities are used by Principal Component Analysis and Fisher Linear Discriminant Analysis to associate...

A method for subtraction of the extrarenal 'background' in dynamic 131I-hippurate renoscintigraphy

International Nuclear Information System (INIS)

Mlodkowska, E.; Liniecki, J.; Surma, M.

1979-01-01

Using a Toshiba GC-401 gamma camera with MDS computer Trinary a new method was developed for subtracting the extrarenal (extracanalicular) 'background' from the count rate recorded over the kidneys after intravenous administration of 131 I-hippurate. Mean subtraction factors of the 'blood' activity curve were calculated from a study of 27 patients who were given 51 Cr-HSA for purposes of conventional renography with 'background' subtraction. The values of the mean subtraction factors anti Fsub(R,L) for the right and left kidney, by which a blood count rate should be multiplied amounted to 0.86 +- 0.12 and 0.79 +- 0.13, respectively. A comparison of the coefficients of variation of the pure renal signal when mean vs. individually determined subtraction factors were used, and the verification of the method in unilaterally nephrectomized patients have demonstrated that determination of the factors, anti Fsub(R,L), for each patient individually is not required and sufficient precision can be obtained by using the method and factors reported in this study. (orig.) [de

Quantum noise properties of CT images with anatomical textured backgrounds across reconstruction algorithms: FBP and SAFIRE

Energy Technology Data Exchange (ETDEWEB)

Solomon, Justin, E-mail: justin.solomon@duke.edu [Carl E. Ravin Advanced Imaging Laboratories, Department of Radiology, Duke University Medical Center, Durham, North Carolina 27705 (United States); Samei, Ehsan [Carl E. Ravin Advanced Imaging Laboratories, Department of Radiology, Duke University Medical Center, Durham, North Carolina 27705 and Departments of Biomedical Engineering and Electrical and Computer Engineering, Pratt School of Engineering, Duke University, Durham, North Carolina 27705 (United States)

2014-09-15

Purpose: Quantum noise properties of CT images are generally assessed using simple geometric phantoms with uniform backgrounds. Such phantoms may be inadequate when assessing nonlinear reconstruction or postprocessing algorithms. The purpose of this study was to design anatomically informed textured phantoms and use the phantoms to assess quantum noise properties across two clinically available reconstruction algorithms, filtered back projection (FBP) and sinogram affirmed iterative reconstruction (SAFIRE). Methods: Two phantoms were designed to represent lung and soft-tissue textures. The lung phantom included intricate vessel-like structures along with embedded nodules (spherical, lobulated, and spiculated). The soft tissue phantom was designed based on a three-dimensional clustered lumpy background with included low-contrast lesions (spherical and anthropomorphic). The phantoms were built using rapid prototyping (3D printing) technology and, along with a uniform phantom of similar size, were imaged on a Siemens SOMATOM Definition Flash CT scanner and reconstructed with FBP and SAFIRE. Fifty repeated acquisitions were acquired for each background type and noise was assessed by estimating pixel-value statistics, such as standard deviation (i.e., noise magnitude), autocorrelation, and noise power spectrum. Noise stationarity was also assessed by examining the spatial distribution of noise magnitude. The noise properties were compared across background types and between the two reconstruction algorithms. Results: In FBP and SAFIRE images, noise was globally nonstationary for all phantoms. In FBP images of all phantoms, and in SAFIRE images of the uniform phantom, noise appeared to be locally stationary (within a reasonably small region of interest). Noise was locally nonstationary in SAFIRE images of the textured phantoms with edge pixels showing higher noise magnitude compared to pixels in more homogenous regions. For pixels in uniform regions, noise magnitude was

Quantum noise properties of CT images with anatomical textured backgrounds across reconstruction algorithms: FBP and SAFIRE

International Nuclear Information System (INIS)

Solomon, Justin; Samei, Ehsan

2014-01-01

Purpose: Quantum noise properties of CT images are generally assessed using simple geometric phantoms with uniform backgrounds. Such phantoms may be inadequate when assessing nonlinear reconstruction or postprocessing algorithms. The purpose of this study was to design anatomically informed textured phantoms and use the phantoms to assess quantum noise properties across two clinically available reconstruction algorithms, filtered back projection (FBP) and sinogram affirmed iterative reconstruction (SAFIRE). Methods: Two phantoms were designed to represent lung and soft-tissue textures. The lung phantom included intricate vessel-like structures along with embedded nodules (spherical, lobulated, and spiculated). The soft tissue phantom was designed based on a three-dimensional clustered lumpy background with included low-contrast lesions (spherical and anthropomorphic). The phantoms were built using rapid prototyping (3D printing) technology and, along with a uniform phantom of similar size, were imaged on a Siemens SOMATOM Definition Flash CT scanner and reconstructed with FBP and SAFIRE. Fifty repeated acquisitions were acquired for each background type and noise was assessed by estimating pixel-value statistics, such as standard deviation (i.e., noise magnitude), autocorrelation, and noise power spectrum. Noise stationarity was also assessed by examining the spatial distribution of noise magnitude. The noise properties were compared across background types and between the two reconstruction algorithms. Results: In FBP and SAFIRE images, noise was globally nonstationary for all phantoms. In FBP images of all phantoms, and in SAFIRE images of the uniform phantom, noise appeared to be locally stationary (within a reasonably small region of interest). Noise was locally nonstationary in SAFIRE images of the textured phantoms with edge pixels showing higher noise magnitude compared to pixels in more homogenous regions. For pixels in uniform regions, noise magnitude was

Charge Gain, Voltage Gain, and Node Capacitance of the SAPHIRA Detector Pixel by Pixel

Science.gov (United States)

Pastrana, Izabella M.; Hall, Donald N. B.; Baker, Ian M.; Jacobson, Shane M.; Goebel, Sean B.

2018-01-01

The University of Hawai`i Institute for Astronomy has partnered with Leonardo (formerly Selex) in the development of HgCdTe linear mode avalanche photodiode (L-APD) SAPHIRA detectors. The SAPHIRA (Selex Avalanche Photodiode High-speed Infra-Red Array) is ideally suited for photon-starved astronomical observations, particularly near infrared (NIR) adaptive optics (AO) wave-front sensing. I have measured the stability, and linearity with current, of a 1.7-um (10% spectral bandpass) infrared light emitting diode (IR LED) used to illuminate the SAPHIRA and have then utilized this source to determine the charge gain (in e-/ADU), voltage gain (in uV/ADU), and node capacitance (in fF) for each pixel of the 320x256@24um SAPHIRA. These have previously only been averages over some sub-array. Determined from the ratio of the temporal averaged signal level to variance under constant 1.7-um LED illumination, I present the charge gain pixel-by-pixel in a 64x64 sub-array at the center of the active area of the SAPHIRA (analyzed separately as four 32x32 sub-arrays) to be about 1.6 e-/ADU (σ=0.5 e-/ADU). Additionally, the standard technique of varying the pixel reset voltage (PRV) in 10 mV increments and recording output frames for the same 64x64 subarray found the voltage gain per pixel to be about 11.7 uV/ADU (σ=0.2 uV/ADU). Finally, node capacitance was found to be approximately 23 fF (σ=6 fF) utilizing the aforementioned charge and voltage gain measurements. I further discuss the linearity measurements of the 1.7-um LED used in the charge gain characterization procedure.

SU-E-J-218: Evaluation of CT Images Created Using a New Metal Artifact Reduction Reconstruction Algorithm for Radiation Therapy Treatment Planning

Energy Technology Data Exchange (ETDEWEB)

Niemkiewicz, J; Palmiotti, A; Miner, M; Stunja, L; Bergene, J [Lehigh Valley Health Network, Allentown, PA (United States)

2014-06-01

Purpose: Metal in patients creates streak artifacts in CT images. When used for radiation treatment planning, these artifacts make it difficult to identify internal structures and affects radiation dose calculations, which depend on HU numbers for inhomogeneity correction. This work quantitatively evaluates a new metal artifact reduction (MAR) CT image reconstruction algorithm (GE Healthcare CT-0521-04.13-EN-US DOC1381483) when metal is present. Methods: A Gammex Model 467 Tissue Characterization phantom was used. CT images were taken of this phantom on a GE Optima580RT CT scanner with and without steel and titanium plugs using both the standard and MAR reconstruction algorithms. HU values were compared pixel by pixel to determine if the MAR algorithm altered the HUs of normal tissues when no metal is present, and to evaluate the effect of using the MAR algorithm when metal is present. Also, CT images of patients with internal metal objects using standard and MAR reconstruction algorithms were compared. Results: Comparing the standard and MAR reconstructed images of the phantom without metal, 95.0% of pixels were within ±35 HU and 98.0% of pixels were within ±85 HU. Also, the MAR reconstruction algorithm showed significant improvement in maintaining HUs of non-metallic regions in the images taken of the phantom with metal. HU Gamma analysis (2%, 2mm) of metal vs. non-metal phantom imaging using standard reconstruction resulted in an 84.8% pass rate compared to 96.6% for the MAR reconstructed images. CT images of patients with metal show significant artifact reduction when reconstructed with the MAR algorithm. Conclusion: CT imaging using the MAR reconstruction algorithm provides improved visualization of internal anatomy and more accurate HUs when metal is present compared to the standard reconstruction algorithm. MAR reconstructed CT images provide qualitative and quantitative improvements over current reconstruction algorithms, thus improving radiation

SU-E-J-218: Evaluation of CT Images Created Using a New Metal Artifact Reduction Reconstruction Algorithm for Radiation Therapy Treatment Planning

International Nuclear Information System (INIS)

Niemkiewicz, J; Palmiotti, A; Miner, M; Stunja, L; Bergene, J

2014-01-01

Purpose: Metal in patients creates streak artifacts in CT images. When used for radiation treatment planning, these artifacts make it difficult to identify internal structures and affects radiation dose calculations, which depend on HU numbers for inhomogeneity correction. This work quantitatively evaluates a new metal artifact reduction (MAR) CT image reconstruction algorithm (GE Healthcare CT-0521-04.13-EN-US DOC1381483) when metal is present. Methods: A Gammex Model 467 Tissue Characterization phantom was used. CT images were taken of this phantom on a GE Optima580RT CT scanner with and without steel and titanium plugs using both the standard and MAR reconstruction algorithms. HU values were compared pixel by pixel to determine if the MAR algorithm altered the HUs of normal tissues when no metal is present, and to evaluate the effect of using the MAR algorithm when metal is present. Also, CT images of patients with internal metal objects using standard and MAR reconstruction algorithms were compared. Results: Comparing the standard and MAR reconstructed images of the phantom without metal, 95.0% of pixels were within ±35 HU and 98.0% of pixels were within ±85 HU. Also, the MAR reconstruction algorithm showed significant improvement in maintaining HUs of non-metallic regions in the images taken of the phantom with metal. HU Gamma analysis (2%, 2mm) of metal vs. non-metal phantom imaging using standard reconstruction resulted in an 84.8% pass rate compared to 96.6% for the MAR reconstructed images. CT images of patients with metal show significant artifact reduction when reconstructed with the MAR algorithm. Conclusion: CT imaging using the MAR reconstruction algorithm provides improved visualization of internal anatomy and more accurate HUs when metal is present compared to the standard reconstruction algorithm. MAR reconstructed CT images provide qualitative and quantitative improvements over current reconstruction algorithms, thus improving radiation

A novel ship CFAR detection algorithm based on adaptive parameter enhancement and wake-aided detection in SAR images

Science.gov (United States)

Meng, Siqi; Ren, Kan; Lu, Dongming; Gu, Guohua; Chen, Qian; Lu, Guojun

2018-03-01

Synthetic aperture radar (SAR) is an indispensable and useful method for marine monitoring. With the increase of SAR sensors, high resolution images can be acquired and contain more target structure information, such as more spatial details etc. This paper presents a novel adaptive parameter transform (APT) domain constant false alarm rate (CFAR) to highlight targets. The whole method is based on the APT domain value. Firstly, the image is mapped to the new transform domain by the algorithm. Secondly, the false candidate target pixels are screened out by the CFAR detector to highlight the target ships. Thirdly, the ship pixels are replaced by the homogeneous sea pixels. And then, the enhanced image is processed by Niblack algorithm to obtain the wake binary image. Finally, normalized Hough transform (NHT) is used to detect wakes in the binary image, as a verification of the presence of the ships. Experiments on real SAR images validate that the proposed transform does enhance the target structure and improve the contrast of the image. The algorithm has a good performance in the ship and ship wake detection.

The digital subtraction technique in lateral urethrocystography. Die laterale Urethrozystographie in digitaler Subtraktionstechnik

Energy Technology Data Exchange (ETDEWEB)

Wolf, K. (Radiologische Abt., Caritas-Krankenhaus, Bad Mergentheim (Germany)); Peterseim, H. (Frauenklinik, Caritas-Krankenhaus, Bad Mergentheim (Germany)); Grehn, S. (Radiologische Abt., Caritas-Krankenhaus, Bad Mergentheim (Germany))

1994-09-01

The first application of the digital subtraction technique to lateral urethrocystography is described. This methodology facilitates gynecological-urological operations by providing reliable investigation results and an unambiguous image interpretation. Methods and first experiences with the digital subtraction technique in gynecological-urological diagnosis are reported. (orig.)

Development and Characterization of Diamond and 3D-Silicon Pixel Detectors with ATLAS-Pixel Readout Electronics

CERN Document Server

Mathes, Markus

2008-01-01

Hybrid pixel detectors are used for particle tracking in the innermost layers of current high energy experiments like ATLAS. After the proposed luminosity upgrade of the LHC, they will have to survive very high radiation fluences of up to 10^16 particles per cm^2 per life time. New sensor concepts and materials are required, which promise to be more radiation tolerant than the currently used planar silicon sensors. Most prominent candidates are so-called 3D-silicon and single crystal or poly-crystalline diamond sensors. Using the ATLAS pixel electronics different detector prototypes with a pixel geometry of 400 × 50 um^2 have been built. In particular three devices have been studied in detail: a 3D-silicon and a single crystal diamond detector with an active area of about 1 cm^2 and a poly-crystalline diamond detector of the same size as a current ATLAS pixel detector module (2 × 6 cm^2). To characterize the devices regarding their particle detection efficiency and spatial resolution, the charge collection ...

Performance of the reconstruction algorithms of the FIRST experiment pixel sensors vertex detector

CERN Document Server

Rescigno, R; Juliani, D; Spiriti, E; Baudot, J; Abou-Haidar, Z; Agodi, C; Alvarez, M A G; Aumann, T; Battistoni, G; Bocci, A; Böhlen, T T; Boudard, A; Brunetti, A; Carpinelli, M; Cirrone, G A P; Cortes-Giraldo, M A; Cuttone, G; De Napoli, M; Durante, M; Gallardo, M I; Golosio, B; Iarocci, E; Iazzi, F; Ickert, G; Introzzi, R; Krimmer, J; Kurz, N; Labalme, M; Leifels, Y; Le Fevre, A; Leray, S; Marchetto, F; Monaco, V; Morone, M C; Oliva, P; Paoloni, A; Patera, V; Piersanti, L; Pleskac, R; Quesada, J M; Randazzo, N; Romano, F; Rossi, D; Rousseau, M; Sacchi, R; Sala, P; Sarti, A; Scheidenberger, C; Schuy, C; Sciubba, A; Sfienti, C; Simon, H; Sipala, V; Tropea, S; Vanstalle, M; Younis, H

2014-01-01

Hadrontherapy treatments use charged particles (e.g. protons and carbon ions) to treat tumors. During a therapeutic treatment with carbon ions, the beam undergoes nuclear fragmentation processes giving rise to significant yields of secondary charged particles. An accurate prediction of these production rates is necessary to estimate precisely the dose deposited into the tumours and the surrounding healthy tissues. Nowadays, a limited set of double differential carbon fragmentation cross-section is available. Experimental data are necessary to benchmark Monte Carlo simulations for their use in hadrontherapy. The purpose of the FIRST experiment is to study nuclear fragmentation processes of ions with kinetic energy in the range from 100 to 1000 MeV/u. Tracks are reconstructed using information from a pixel silicon detector based on the CMOS technology. The performances achieved using this device for hadrontherapy purpose are discussed. For each reconstruction step (clustering, tracking and vertexing), different...

Spectral Subtraction Approach for Interference Reduction of MIMO Channel Wireless Systems

Directory of Open Access Journals (Sweden)

Tomohiro Ono

2005-08-01

Full Text Available In this paper, a generalized spectral subtraction approach for reducing additive impulsive noise, narrowband signals, white Gaussian noise and DS-CDMA interferences in MIMO channel DS-CDMA wireless communication systems is investigated. The interference noise reduction or suppression is essential problem in wireless mobile communication systems to improve the quality of communication. The spectrum subtraction scheme is applied to the interference noise reduction problems for noisy MIMO channel systems. The interferences in space and time domain signals can effectively be suppressed by selecting threshold values, and the computational load with the FFT is not large. Further, the fading effects of channel are compensated by spectral modification with the spectral subtraction process. In the simulations, the effectiveness of the proposed methods for the MIMO channel DS-CDMA is shown to compare with the conventional MIMO channel DS-CDMA.

[Construction of forward and reverse subtracted cDNA libraries between muscle tissue of Meishan and Landrace pigs].

Science.gov (United States)

Xu, De-Quan; Zhang, Yi-Bing; Xiong, Yuan-Zhu; Gui, Jian-Fang; Jiang, Si-Wen; Su, Yu-Hong

2003-07-01

Using suppression subtractive hybridization (SSH) technique, forward and reverse subtracted cDNA libraries were constructed between Longissimus muscles from Meishan and Landrace pigs. A housekeeping gene, G3PDH, was used to estimate the efficiency of subtractive cDNA. In two cDNA libraries, G3PDH was subtracted very efficiently at appropriate 2(10) and 2(5) folds, respectively, indicating that some differentially expressed genes were also enriched at the same folds and the two subtractive cDNA libraries were very successful. A total of 709 and 673 positive clones were isolated from forward and reverse subtracted cDNA libraries, respectively. Analysis of PCR showed that most of all plasmids in the clones contained 150-750 bp inserts. The construction of subtractive cDNA libraries between muscle tissue from different pig breeds laid solid foundations for isolating and identifying the genes determining muscle growth and meat quality, which will be important to understand the mechanism of muscle growth, determination of meat quality and practice of molecular breeding.

Intraarterial digital subtraction angiography

International Nuclear Information System (INIS)

Davis, P.C.

1987-01-01

Digital subtraction angiography (DSA) refers to a radiographic technique of amplifying low levels of contrast from intravascular iodine into an acceptable image of vascular anatomy. Initial enthusiasm suggested that DSA using intravenous injections (IV-DSA) would eliminate most conventional film-screen angiographic studies. It was soon apparent, however, that IV-DSA examinations were often compromised in those patients who most needed a less invasive study. Indeed, only a 70 to 85 percent accuracy rate was achieved with IV-DSA, primarily due to motion artifact, poor cardiac output, overlap of pertinent vessels, and inability to resolve smaller vessels

On a gauge invariant subtraction scheme for massive quantum electrodynamics

International Nuclear Information System (INIS)

Abdalla, E.; Gomes, M.; Koeberle, R.

A momentum-space subtraction scheme for massive quantum electrodynamics is proposed which respects gauge invariance, in contrast to ordinary normal product techniques. As a consequence the dependence of Green functions on the ghost mass becomes very simple and formally gauge invariant normal products of degree up to four, when subtracted according to the proposed scheme, are automatically gauge invariant. As an aplication we discuss the proof of the Adler-Bardeen theorem. Zero mass limits can be taken for Green function after the integration over intermediate states has been carried out [pt

Digital subtraction arthrography of the hips and of the shoulders

International Nuclear Information System (INIS)

Fink, B.K.; Schedel, J.; Fink, U.; Hansen, M.; Hilbertz, T.; Hagena, F.W.

1991-01-01

In a study on 60 patients, it could be shown that very good results can be achieved in the region of the shoulder joint with the use of the digital subtraction technique and of digital image intensifier radiography. A further possibility of using the digital subtraction technique for proving endoprosthesis loosenings of the hip demonstrated its importance after a short time and has become a routine method in the meantime. These two examination techniques are displayed methodologically and their clinical possibilities of use are assessed in this contribution. (orig.)

Characterization of Pixel Sensors

CERN Document Server

Oliveira, Felipe Ferraz

2017-01-01

It was commissioned at CERN ATLAS pixel group a fluorescence setup for characterization of pixel sensors. The idea is to measure the energies of different targets to calibrate your sensor. It was measured four matrices (80, 95, 98 and 106) of the Investigator1 sensor with different deep PW using copper, iron and titanium as target materials. The matrix 80 has a higher gain (0.065 ± 0.002) and matrix 106 has a better energy resolution (0.05 ± 0.04). The noise of the setup is around 3.6 mV .

The discriminant pixel approach: a new tool for the rational interpretation of GCxGC-MS chromatograms.

Science.gov (United States)

Vial, Jérôme; Pezous, Benoît; Thiébaut, Didier; Sassiat, Patrick; Teillet, Béatrice; Cahours, Xavier; Rivals, Isabelle

2011-01-30

GCxGC is now recognized as the most suited analytical technique for the characterization of complex mixtures of volatile compounds; it is implemented worldwide in academic and industrial laboratories. However, in the frame of comprehensive analysis of non-target analytes, going beyond the visual examination of the color plots remains challenging for most users. We propose a strategy that aims at classifying chromatograms according to the chemical composition of the samples while determining the origin of the discrimination between different classes of samples: the discriminant pixel approach. After data pre-processing and time-alignment, the discriminatory power of each chromatogram pixel for a given class was defined as its correlation with the membership to this class. Using a peak finding algorithm, the most discriminant pixels were then linked to chromatographic peaks. Finally, crosschecking with mass spectrometry data enabled to establish relationships with compounds that could consequently be considered as candidate class markers. This strategy was applied to a large experimental data set of 145 GCxGC-MS chromatograms of tobacco extracts corresponding to three distinct classes of tobacco. Copyright © 2010 Elsevier B.V. All rights reserved.

Small Pixel Hybrid CMOS X-ray Detectors

Science.gov (United States)

Hull, Samuel; Bray, Evan; Burrows, David N.; Chattopadhyay, Tanmoy; Falcone, Abraham; Kern, Matthew; McQuaide, Maria; Wages, Mitchell

2018-01-01

Concepts for future space-based X-ray observatories call for a large effective area and high angular resolution instrument to enable precision X-ray astronomy at high redshift and low luminosity. Hybrid CMOS detectors are well suited for such high throughput instruments, and the Penn State X-ray detector lab, in collaboration with Teledyne Imaging Sensors, has recently developed new small pixel hybrid CMOS X-ray detectors. These prototype 128x128 pixel devices have 12.5 micron pixel pitch, 200 micron fully depleted depth, and include crosstalk eliminating CTIA amplifiers and in-pixel correlated double sampling (CDS) capability. We report on characteristics of these new detectors, including the best read noise ever measured for an X-ray hybrid CMOS detector, 5.67 e- (RMS).

Subtraction imaging of the ECG gated cardiac CT

Energy Technology Data Exchange (ETDEWEB)

Tanegashima, K.; Fukui, M.; Hyodo, H.

1987-05-01

The subtracting manipulation of contrast-enhanced gated cardiac CT (GCCT) images was experimentally studied with TCT 60A - 30 type (Toshiba) for clinical use, thereby reducing the amount of contrast medium (CM). Initially the optimum relationship between the concentration of CM and its injected velocity was determined using the model of resected canine hearts and in actual dogs. The emphasized good-subtracted images were obtained when the difference of CT values was approximately 40 H.U. between cardiac cavity and myocardium. Such condition was feasible in the use of 25 % Diatrizoic acid and its injected velocity of 0.02 ml/kg/sec. Finally the reduction of the amount of CM by 1/3 became possible in clinical settings. The method is applicable to multi-slice GCCT in various heart diseases.

Bayesian aerosol retrieval algorithm for MODIS AOD retrieval over land

Science.gov (United States)

Lipponen, Antti; Mielonen, Tero; Pitkänen, Mikko R. A.; Levy, Robert C.; Sawyer, Virginia R.; Romakkaniemi, Sami; Kolehmainen, Ville; Arola, Antti

2018-03-01

We have developed a Bayesian aerosol retrieval (BAR) algorithm for the retrieval of aerosol optical depth (AOD) over land from the Moderate Resolution Imaging Spectroradiometer (MODIS). In the BAR algorithm, we simultaneously retrieve all dark land pixels in a granule, utilize spatial correlation models for the unknown aerosol parameters, use a statistical prior model for the surface reflectance, and take into account the uncertainties due to fixed aerosol models. The retrieved parameters are total AOD at 0.55 µm, fine-mode fraction (FMF), and surface reflectances at four different wavelengths (0.47, 0.55, 0.64, and 2.1 µm). The accuracy of the new algorithm is evaluated by comparing the AOD retrievals to Aerosol Robotic Network (AERONET) AOD. The results show that the BAR significantly improves the accuracy of AOD retrievals over the operational Dark Target (DT) algorithm. A reduction of about 29 % in the AOD root mean square error and decrease of about 80 % in the median bias of AOD were found globally when the BAR was used instead of the DT algorithm. Furthermore, the fraction of AOD retrievals inside the ±(0.05+15 %) expected error envelope increased from 55 to 76 %. In addition to retrieving the values of AOD, FMF, and surface reflectance, the BAR also gives pixel-level posterior uncertainty estimates for the retrieved parameters. The BAR algorithm always results in physical, non-negative AOD values, and the average computation time for a single granule was less than a minute on a modern personal computer.

LISe pixel detector for neutron imaging

Energy Technology Data Exchange (ETDEWEB)

Herrera, Elan; Hamm, Daniel [Department of Nuclear Engineering, University of Tennessee, Knoxville, TN (United States); Wiggins, Brenden [Technology Development, Y-12 National Security Complex, Oak Ridge, TN (United States); Department of Physics and Astronomy, Vanderbilt University, Nashville, TN (United States); Milburn, Rob [Department of Nuclear Engineering, University of Tennessee, Knoxville, TN (United States); Burger, Arnold [Department of Physics and Astronomy, Vanderbilt University, Nashville, TN (United States); Department of Life and Physical Sciences, Fisk University, Nashville, TN (United States); Bilheux, Hassina [Chemical and Engineering Materials Division, Oak Ridge National Laboratory, Oak Ridge, TN (United States); Santodonato, Louis [Instrument and Source Division, Oak Ridge National Laboratory, Oak Ridge National Laboratory, Oak Ridge, TN (United States); Chvala, Ondrej [Department of Nuclear Engineering, University of Tennessee, Knoxville, TN (United States); Stowe, Ashley [Department of Nuclear Engineering, University of Tennessee, Knoxville, TN (United States); Technology Development, Y-12 National Security Complex, Oak Ridge, TN (United States); Department of Physics and Astronomy, Vanderbilt University, Nashville, TN (United States); Lukosi, Eric, E-mail: elukosi@utk.edu [Department of Nuclear Engineering, University of Tennessee, Knoxville, TN (United States)

2016-10-11

Semiconducting lithium indium diselenide, {sup 6}LiInSe{sub 2} or LISe, has promising characteristics for neutron detection applications. The 95% isotopic enrichment of {sup 6}Li results in a highly efficient thermal neutron-sensitive material. In this study, we report on a proof-of-principle investigation of a semiconducting LISe pixel detector to demonstrate its potential as an efficient neutron imager. The LISe pixel detector had a 4×4 of pixels with a 550 µm pitch on a 5×5×0.56 mm{sup 3} LISe substrate. An experimentally verified spatial resolution of 300 µm was observed utilizing a super-sampling technique.

Pixel-by-pixel mean transit time without deconvolution.

Science.gov (United States)

Dobbeleir, Andre A; Piepsz, Amy; Ham, Hamphrey R

2008-04-01