Reconstruction of objects containing circular cross-sections Zoltán Kiss Supervisor: Attila Kuba Ph.D. University of Szeged, Hungary,

Slides:



Advertisements
Similar presentations
Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Advertisements

An Image Filtering Technique for SPIDER Visible Tomography N. Fonnesu M. Agostini, M. Brombin, R.Pasqualotto, G.Serianni 3rd PhD Event- York- 24th-26th.
A Crash Course in Radio Astronomy and Interferometry: 4
A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
CHAPTER 8 A NNEALING- T YPE A LGORITHMS Organization of chapter in ISSO –Introduction to simulated annealing –Simulated annealing algorithm Basic algorithm.
Image Denoising using Locally Learned Dictionaries Priyam Chatterjee Peyman Milanfar Dept. of Electrical Engineering University of California, Santa Cruz.
Claudia Lizet Navarro Hernández PhD Student Supervisor: Professor S.P.Banks April 2004 Monash University Australia April 2004 The University of Sheffield.
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 3.
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 4.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Task Assignment and Transaction Clustering Heuristics.
Zoë Abrams, Ashish Goel, Serge Plotkin Stanford University Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
1 Cluster Quality in Track Fitting for the ATLAS CSC Detector David Primor 1, Nir Amram 1, Erez Etzion 1, Giora Mikenberg 2, Hagit Messer 1 1. Tel Aviv.
Part 3 Vector Quantization and Mixture Density Model CSE717, SPRING 2008 CUBS, Univ at Buffalo.
RELAXED ORDERED-SUBSETS ALGORITHM FOR IMAGE RESTORATION OF CONFOCAL MICROSCOPY Saowapak Sotthivirat and Jeffrey A. Fessler University of Michigan, Ann.
Theoretical & Industrial Design of Aerofoils P M V Subbarao Professor Mechanical Engineering Department An Objective Invention ……
tomos = slice, graphein = to write
Nonlinear Stochastic Programming by the Monte-Carlo method Lecture 4 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO.
Advanced Image Processing Image Relaxation – Restoration and Feature Extraction 02/02/10.
Elements of the Heuristic Approach
Gamma Knife Surgery and Region Covering Aaron Epel.
Problem 1 Given a high-resolution computer image of a map of an irregularly shaped lake with several islands, determine the water surface area. Assume.
ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission ( ) Wiener Filtering Derivation Comments Re-sampling and Re-sizing 1D  2D 10/5/06.
By Saparila Worokinasih
Computational Stochastic Optimization: Bridging communities October 25, 2012 Warren Powell CASTLE Laboratory Princeton University
1 Discrete Tomography and Its Applications in Medical Imaging* Attila Kuba Department of Image Processing and Computer Graphics University of Szeged *This.
Computer Vision - Restoration Hanyang University Jong-Il Park.
Travel-time Tomography For High Contrast Media based on Sparse Data Yenting Lin Signal and Image Processing Institute Department of Electrical Engineering.
Australian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN Monte Carlo Optimization to Solve a Two-Dimensional Inverse Heat.
Generative Topographic Mapping in Life Science Jong Youl Choi School of Informatics and Computing Pervasive Technology Institute Indiana University
17 th Summer School on Image Processing Debrecen, Hungary 2009.
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
Optimal Selection of ATE Frequencies for Test Time Reduction Using Aperiodic Clock Sindhu Gunasekar Vishwani D. Agrawal.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
Generative Topographic Mapping by Deterministic Annealing Jong Youl Choi, Judy Qiu, Marlon Pierce, and Geoffrey Fox School of Informatics and Computing.
Medical Image Analysis Image Reconstruction Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
1 Simulated Annealing Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Operated by Los Alamos National Security, LLC for the U.S. Department of Energy’s NNSA U N C L A S S I F I E D Slide 1 Practical Considerations for Analysis.
EEG/MEG source reconstruction
Eli Baransky & Gal Itzhak. Basic Model The pulse shape is known (usually gaussian), if we limit ourselves to work In G(f)’s support, then we can calibrate.
CS654: Digital Image Analysis
8-1 Chapter 8: Image Restoration Image enhancement: Overlook degradation processes, deal with images intuitively Image restoration: Known degradation processes;
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Project 11: Determining the Intrinsic Dimensionality of a Distribution Okke Formsma, Nicolas Roussis and Per Løwenborg.
CS270 Project Overview Maximum Planar Subgraph Danyel Fisher Jason Hong Greg Lawrence Jimmy Lin.
WELCOME TO IHEP. RF Phase Control for BEPCII Linac Accelerator Wenchun Gao.
Written by Changhyun, SON Chapter 5. Introduction to Design Optimization - 1 PART II Design Optimization.
ISP and Egress Path Selection for Multihomed Networks Amogh Dhamdhere, Constantine Dovrolis Networking and Telecommunications Group Georgia Institute of.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Disc Covering Problem with Application to Digital Halftoning Tetsuo Asano School of Information Science, JAIST Japan Advanced Institute of Science and.
Emission Discrete Tomography and Optimization Problems Attila Kuba Department of Image Processing and Computer Graphics University of Szeged.
Computed tomography. Formation of a CT image Data acquisitionImage reconstruction Image display, manipulation Storage, communication And recording.
Heuristic Optimization Methods
The Johns Hopkins University
Degradation/Restoration Model
Recursive Identification of Switched ARX Hybrid Models: Exponential Convergence and Persistence of Excitation René Vidal National ICT Australia Brian D.O.Anderson.
Work-in-Progress: Wireless Network Reconfiguration for Control Systems
CS475 3D Game Development Level Of Detail Nodes (LOD)
Discrete Tomography Péter Balázs Department of Image Processing and
3D reconstruction from 2D images: Discrete tomography
5-8 December, Batumi - Georgia
Instructor :Dr. Aamer Iqbal Bhatti
Ch4: Backpropagation (BP)
SSIP 2008 Binary Tomography
Area Coverage Problem Optimization by (local) Search
Ch4: Backpropagation (BP)
Presentation transcript:

Reconstruction of objects containing circular cross-sections Zoltán Kiss Supervisor: Attila Kuba Ph.D. University of Szeged, Hungary, Department of Applied Informatics SSIP 2003 Lajos Rodek

The encountered problem Nondestructive substance examinationNondestructive substance examination Neutron mappingNeutron mapping Using few projections (acquisition is time consuming and expensive)Using few projections (acquisition is time consuming and expensive) Result of a classic method A cross-section to be reconstructed TomographyTomography Draft structure of the 3D object

Reconstruction of 3D objects Discrete tomographyDiscrete tomography Input: few projections (2-4)Input: few projections (2-4) a priori information:a priori information: –geometrical structure (spheres) –range (attenuation coefficients) Output: 3D modelOutput: 3D model

Reduction to 2D Subproblem: reconstruction of 2D cross- sectionsSubproblem: reconstruction of 2D cross- sections Assumptions:Assumptions: –known number of circles –at most four different substances

Acquisition of projections Given: projections (p), directions, number of beamsGiven: projections (p), directions, number of beams Unknown: F, implicit parametric function to be reconstructed (4- valued)Unknown: F, implicit parametric function to be reconstructed (4- valued) Projection:Projection:

Parametres of F Number of circlesNumber of circles Attenuation coefficientsAttenuation coefficients RadiiRadii CentresCentres Restrictions:Restrictions: –disjointness –minimal & maximal radii –circles are within the ring

Mathematical description Given: few projections with known number of circles & beamsGiven: few projections with known number of circles & beams Sought solution: configuration of parametres, which determines a function having projections of the best approximation of input data (p)Sought solution: configuration of parametres, which determines a function having projections of the best approximation of input data (p)

Difficulties Switching componentsSwitching components Superposition of projectionsSuperposition of projections Noisy input dataNoisy input data

Implemented algorithm Considered as optimization problemConsidered as optimization problem Iteratively looking for a global optimum by random modification of parametres from an initial configurationIteratively looking for a global optimum by random modification of parametres from an initial configuration

Choosing a new configuration Adjustment of radius, centre or attenuation coef. of one of the circles, in agreement with the restrictions Adjustment of radius, centre or attenuation coef. of one of the circles, in agreement with the restrictions radius centre attenuation coefficient

Optimization Random choice of a new configurationRandom choice of a new configuration If, will be acceptedIf, will be accepted Else choosing anotherElse choosing another Termination, if or no better solution is found in a certain number of iteration stepsTermination, if or no better solution is found in a certain number of iteration steps Objective function:Objective function:

Simulated annealing Fundaments: thermodynamic cooling processFundaments: thermodynamic cooling process Boltzmann-distribution:Boltzmann-distribution: If, will be accepted in accordance with (1)If, will be accepted in accordance with (1) (1)

Simulation studies

Initial conf. Reconstructed conf. Difference Real conf. 2 projs 3 projs 4 projs Effects of changing the number of projections using 2, 3 & 4 noiseless projections

Effects of noise Additive noise of uniform distribution 0% 5% 10% 20% 0% 5% 10% 20%

Results from noisy projections Real conf. Initial conf. Difference Reconstructed conf. using 4 projections, in case of 5, 20 & 40% of noise 5% 20% 40% Noise

Results on real measurements

Encountered problems on real data Precessing axis of revolutionPrecessing axis of revolution Distorted, noisy projectionsDistorted, noisy projections Low resolutionLow resolution Too few quantization levelsToo few quantization levels Attenuation coefs are unknown  they should be estimated automaticallyAttenuation coefs are unknown  they should be estimated automatically

Data from Berliner Hahn-Meitner Institut Result of convolution backprojection from 60 projections Result of our method from 4 projections seen above 0000 45  90  135 

Summary A new reconstruction method has been implemented based on real physical measurements:A new reconstruction method has been implemented based on real physical measurements: –the effects of increasing the number of circles, projections & the amount of noise have been examined Good results may be achieved from 4 projections even in case of greater amount of noiseGood results may be achieved from 4 projections even in case of greater amount of noise Future plans:Future plans: –extension to 3D –deformable models

References A. Kuba, L. Ruskó, Z. Kiss, L. Rodek, E. Balogh, S. Zopf, A. Tanács: Preliminary Results in Discrete Tomography Applied for Neutron Tomography, COST Meeting on Neutron Radiography, Loughborogh, England, A. Kuba, L. Ruskó, L. Rodek, Z. Kiss: Preliminary Studies of Discrete Tomography in Neutron Imaging, IEEE Trans. on Nuclear Sciences, submitted A. Kuba, L. Ruskó, L. Rodek, Z. Kiss: Application of Discrete Tomography in Neutron Imaging, Proc. of 7th World Conference on Neutron Radiography, Rome, Italy, 2002., accepted Kiss Z., Kuba A., Rodek L.: Körmetszeteket tartalmazó tárgyak rekonstrukciója néhány vetületből, KÉPAF Konferencia kiadvány, Domaszék, Hungary Homepage of DIRECT :