A sufficient condition for spiral cone beam long object imaging via backprojection
|
|
- Elizabeth Owens
- 5 years ago
- Views:
Transcription
1 A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral scan is analysed. Based on the reslt a sfficient condition for the spiral scan long object problem employing backprojection is formlated. By making se of the sfficient condition a general class of exact, backprojection based reconstrction algorithms for spiral scan cone beam CT is developed which are capable of reconstrcting a sectional ROI of the long object withot contamination from overlaying materials sing spiral scan cone beam data irradiating the particlar ROI and its immediate vicinity only. Also, at each sorce position the minimm size of the region on the detector plane reqired for 3D backprojection is redced, which in term brings abot redction in the amont of 3D backprojection comptation. I. D filtering and masking Spiral scan compted tomography with large area detectors is of increasing interest for rapidly scanning spacios volmes. As the cone angle increases the artifacts generated in the reconstrcted images by the approximate reconstrction algorithms will become more and more serios, and exact reconstrction algorithms are reqired. It is known that if the spiral path is long enogh so that every plane intersecting the object also intersects the spiral path, the object can be reconstrcted. For long objects, however, it is highly desirable to scan only the portion of the object that is of interest, for the sake of redction in scan time as well as radiation protection of the patient in medical imaging. However, as a conseqence of the divergent natre of the X-ray cone-beams different regions of the object are correlated. To reconstrct only a region-of-interest (ROI) from a spiral scan which covers the particlar ROI and its immediate vicinity only poses a challenge for the imaging commnity. This is referred to as the long object problem in the literatre. The first soltion to the long object problem in spiral cone beam CT is the Radon space driven (spiral + circles) algorithm reported in [1,]. A key part of the reconstrction algorithm is the data-combination techniqe in which the radial Radon derivative for each plane intersecting the ROI is obtained by combining the partial reslts compted from the cone beam data at the varios sorce positions that the plane intersects. The method is illstrated in Figre 1 which represents a plane Q intersecting the ROI and the scan path. Since the partial planes do not overlap and together they completely cover the portion of plane Q that lies within the ROI, the Radon derivative for plane Q can be obtained exactly by smming the Radon derivatives for the partial planes. From Figre 1 it is evident that the portions of the object otside the ROI do not need to be irradiated. Therefore dring scanning collimators can be sed to block off radiation from reaching those portions. Restricting the cone beam projection data to the appropriate anglar range for data combination can be accomplished by a masking process. The mask consists of a top crve and a bottom crve formed by projecting on the detector the spiral trn above and the trn below from the crrent sorce position. It can be easily seen that sch masking procedre corresponds exactly to the anglar range bond by the prior and the sbseqent sorce positions as indicated in Figre 1. We shall refer to this mask as the datacombination mask. For a flat detector located at the rotation axis sch that the line connecting the sorce to the detector origin is normal to the
2 Projection of the spiral trn above v ROI Projection of the spiral trn below Figre 1. A typical integration plane covering the ROI defined by the sorce positions. Other integration planes may have more or less spiral scan path intersections, and may not intersect either the top or the bottom circle scan paths. detector plane, the eqation for the top crve for the spiral scan is given by: h 1 v = tan 1 + π R R h 1 R v = π + tan 1 + π R 0 < 0 (1) where and v are the Cartesian coordinate axes of the detector with the v axis coinciding with the rotation axis, R is the radis of the spiral, and h is the distance between adjacent spiral trns (the pitch). The bottom crve is the reflection of the top crve abot the origin, i.e. (,v) -> (-,-v). The shape of the spiral mask is shown in Figre. The figre assmes right-handed spiral rotation. Figre. The mask on the flat detector which defines the desired partial plane for Radon derivative comptation. For any plane of integration, the portion of its intersection line with the detector within the mask is the desired partial plane. In the backprojection version of the (spiral + circles) algorithm [3], the masked cone beam data are D filtered and then 3D backprojected. The D filtering is carried ot in different manners for different parts of the cone beam data: the data inside the mask are line-by-line ramp filtered in the direction of the projected scan path direction, whereas those on the mask bondary are processed with a D filter which incldes D backprojection at all angles on the detector plane. By virte of the Radon inversion formla the D backprojection operation shold be extended to the entire detector plane extended to infinity; in practice it is extended to the extent sfficient to cover the entire ROI. Throgh the line-by-line ramp filtering in the direction of the projected scan path direction the data inside the mask bondary only affect a localized portion of the reconstrction volme. On the other hand the data on the mask bondary affect the entire ROI becase of the long range of the D backprojection. This long range correlation cased by the mask bondary data is the crx of the long object problem employing backprojection driven algorithms.
3 II. Spiral scan long object problem Recently a nmber of approaches solving the long object problem with only the spiral scan appeared in the literatre. In the virtal circle (VC) method reported by Kdo et al [4] it is fond that by tilizing the niqe property of the PI lines [5], removing the circles in the (spiral + circles) algorithm contaminates only a localized portion at each end of the ROI, and ths the remaining portion of the ROI can still be reconstrcted withot contamination from overlaying materials. In the zero bondary (ZB) method reported by Defrise et al [6], the niqe property of the PI lines is also tilized to remove the long range correlation between different regions of the object cased by the data on the mask bondary. In the local ROI (LR) method developed by Saer et al [7] and later implemented by Schaller et al [8], de-correlation between different regions of the object is achieved on the φ-planes, which are the planes which contain the z axis in the Radon space. Sbseqently the backprojection version of the local ROI method was developed by Tam [9] and implemented by Laritsch et al [10]. Unlike the (spiral + circles) algorithm, with only spiral scan it is necessary to scan some portions of the object adjacent to the ROI in order to reconstrct the ROI withot contamination; the spiral path reqired beyond the ROI is referred to as overscan in the literatre. For comparison the overscan for the (spiral + circles) algorithm is zero. All approaches are theoretically exact soltions to the long object problem. However, even among the backprojection driven algorithms very different methodologies are employed in reconstrcting the ROI withot contamination, and the overscan reqired by each algorithm is sbstantially different from the others. It is not apparent that the three methods have any featres in common. III. A sfficient condition In this paper a sfficient condition for backprojection driven image reconstrction algorithms for the long object problem with spiral scan is derived. The analysis is based on the analysis of the response of a point object enclosed inside the spiral path. It is fond that the spport of the contribtion to the reconstrction volme from the cone beam data on the mask bondary becomes localized when certain condition is satisfied. Each mask bondary data point corresponds to a PI line, as illstrated in Figre 3, which intersects two sorce positions. At each of the sorce positions the mask bondary data point, after some processing, is D backprojected along each line intersecting the data point, and then 3D backprojected onto the 3D backprojection planes defined by the sorce position and each D backprojection line throgh the data point. Ths each 3D backprojection plane intersects the line connecting the sorce position and the data point, which is the PI line corresponding to the data point. Since the sorce positions that acqire the mask bondary data point have the same PI line, it follows that the sorce positions have the same set of 3D backprojection planes when processing the data point. Consider a fixed mask bondary data point. If for each 3D backprojection plane the data point is processed, which incldes filtering and 3D backprojection, to the same extent at the sorce positions that acqire the data point, then the spport of the contribtion to the reconstrction volme from the data point can be shown to be localized. The minimm size of the region on the detector plane reqired for D backprojection and the sbseqent 3D backprojection for these mask bondary data can be prescribed sing projective geometry, and is fond to be smaller than the minimm size according to crrent nderstanding, viz. the size reqired to cover the entire ROI. The extent to which the detector size is redced depends on the spiral pitch, and is sbstantial for small pitch. The redction in the detector size is important for the redction in the amont of 3D backprojection comptation. Among the three above-mentioned long object
4 backprojection driven reconstrction algorithms, the VC method and the backprojection LR method are fond to satisfy the sfficient condition, bt not the ZB method. Based on the sfficient condition a general class of exact, backprojection driven reconstrction algorithms for long object imaging in spiral scan cone beam CT is developed. It is fond that the VC method is a special case of this class of algorithms. Figre 3 Mask bondary data and the corresponding sorce positions on the PI lines. IV. References X-ray sorce 1. K.C. Tam, Helical and circle scan region of interest compterized tomography, US. Patent 5,463,666, Oct 31, K.C. Tam, S. Samarasekera, and F. Saer, Exact Cone Beam CT with A Spiral Scan, Phys. Med. Biol., 43, pp , K.C. Tam, B. Ladendorf, F. Saer, G. Laritsch, and A. Steinmetz, Backprojection spiral scan region-of-interest cone beam CT, Proc. SPIE Medical Imaging 1999: Physics of Medical Imaging, pp , H. Kdo, F. Noo, and M. Defrise, Qasiexact reconstrction for long-object problem in helical cone-beam tomography, Proceedings of the 1999 International Meeting on Flly Three-Dimensional Image Reconstrction in Radiology and Nclear Medicine, pp , P. E. Danielsson, P. Edholm, J. Eriksson, M. Seger, Towards exact 3D-reconstrction for helical cone-beam scanning of long objects. A new detector arrangement and a new completeness condition. Proceedings of the 1997 International Meeting on Flly Three- Dimensional Image Reconstrction in Radiology and Nclear Medicine, pp , M. Defrise, F. Noo, and H. Kdo, A soltion to the long-object problem in helical conebeam tomography, Phys. Med. Biol., 45, pp , F. Saer, S. Samarasekera, and K.C. Tam, Practical cone-beam image reconstrction sing local regions-of-interest, U.S. patent 6,009,14, December 8, S. Schaller, F. Noo, F. Saer. K. C. Tam, G. Laritsch, and T. Flohr. "Exact Radon rebinning algorithms sing local regions-of-interest for helical cone-beam CT," Proceedings of the 1999 International Meeting on Flly Three-dimensional Image Reconstrction in Radiology and Nclear Medicine, pp.11-14, K.C. Tam, Exact local regions-of-interest reconstrction in spiral cone-beam filteredbackprojection CT: theory, Proc. of SPIE Medical Imaging Conf., vol. 3979, pp , G. Laritsch, K. C. Tam, K. Sorbelle, and S. Schaller, Exact Local Regions-of-Interest in Spiral Cone-Beam Filtered-Backprojection CT: nmerical implementation and first image reslts, Proc. of SPIE Medical Imaging Conf., 3979, pp , 000.
5
Optimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationImprovement of Efficiency and Flexibility in Multi-slice Helical CT
J. Shanghai Jiaotong Univ. (Sci.), 2008, 13(4): 408 412 DOI: 10.1007/s12204-008-0408-x Improvement of Efficiency and Flexibility in Multi-slice Helical CT SUN Wen-wu 1 ( ), CHEN Si-ping 2 ( ), ZHUANG Tian-ge
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationObject Pose from a Single Image
Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationMETAPOST and the FIIT Logo
METAPOST and the FIIT Logo Matej KOŠÍK Slovak University of Technology Faclty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia kosik@fiit.stba.sk 1 The Tools Abstract.
More informationAlliances and Bisection Width for Planar Graphs
Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.
More informationDiscrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX
More informationAn approximate cone beam reconstruction algorithm for gantry-tilted CT
An approximate cone beam reconstruction algorithm for gantry-tilted CT Ming Yan a, Cishen Zhang ab, Hongzhu Liang a a School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore;
More informationAdvanced single slice rebinning in cone beam spiral CT: Theoretical considerations and medical applications
Advanced single slice rebinning in cone beam spiral CT: Theoretical considerations and medical applications Marc Kachelrieß a, Stefan Schaller b and Willi A. Kalender a a Institute of Medical Physics,
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationCompound Catadioptric Stereo Sensor for Omnidirectional Object Detection
Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationSeismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia
Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Colmbia SUMMARY Approximate message passing (AMP) is a comptationally
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationFeldkamp-type image reconstruction from equiangular data
Journal of X-Ray Science and Technology 9 (2001) 113 120 113 IOS Press Feldkamp-type image reconstruction from equiangular data Ben Wang a, Hong Liu b, Shiying Zhao c and Ge Wang d a Department of Elec.
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationEFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th
EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES Crtis D. Mobley and Lydia Sndman Seqoia Scientific, Inc. th 15317 NE 90 Street Redmond, WA 98052 USA mobley@seqoiasci.com phone: 425-867-2464
More informationMulti-slice CT Image Reconstruction Jiang Hsieh, Ph.D.
Multi-slice CT Image Reconstruction Jiang Hsieh, Ph.D. Applied Science Laboratory, GE Healthcare Technologies 1 Image Generation Reconstruction of images from projections. textbook reconstruction advanced
More informationTri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
Tri-Edge-Connectivity Agmentation for Planar Straight Line Graphs Marwan Al-Jbeh 1, Mashhood Ishaqe 1, Kristóf Rédei 1, Diane L. Sovaine 1, and Csaba D. Tóth 1,2 1 Department of Compter Science, Tfts University,
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationPara-catadioptric camera auto-calibration from epipolar geometry
CENTER FOR MACHINE PERCEPTION CZECH TECHNICAL UNIVERSITY Para-catadioptric camera ato-calibration from epipolar geometry Branislav Mičšík and Tomáš Pajdla micsb1@cmp.felk.cvt.cz, pajdla@cmp.felk.cvt.cz
More informationDynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un
Dynamic Maintenance of Majority Information in Constant Time per Update? Gdmnd S. Frandsen and Sven Skym BRICS 1 Department of Compter Science, University of arhs, Ny Mnkegade, DK-8000 arhs C, Denmark
More informationArtifact analysis of approximate helical cone-beam CT reconstruction algorithms
Artifact analysis of approximate helical cone-beam CT reconstruction algorithms Th. Köhler, a) R. Proksa, C. Bontus, and M. Grass Philips Research Laboratories, Sector Technical Systems, Roentgenstrasse
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationA Backprojection-Filtration Algorithm for Nonstandard. Spiral Cone-beam CT with an N-PI Window
A Backprojection-Filtration Algorithm for Nonstandard Spiral Cone-beam CT with an N-PI Window Hengyong Yu, Yangbo Ye,, Shiying Zhao, Ge Wang, CT/Micro-CT Laboratory, Department of Radiology, Department
More informationRECENTLY, biomedical imaging applications of
1190 IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 24, NO. 9, SEPTEMBER 2005 A General Exact Reconstruction for Cone-Beam CT via Backprojection-Filtration Yangbo Ye*, Shiying Zhao, Hengyong Yu, Ge Wang, Fellow,
More informationDiscrete Estimation of Data Completeness for 3D Scan Trajectories with Detector Offset
Discrete Estimation of Data Completeness for 3D Scan Trajectories with Detector Offset Andreas Maier 1, Patrick Kugler 2, Günter Lauritsch 2, Joachim Hornegger 1 1 Pattern Recognition Lab and SAOT Erlangen,
More informationImage Reconstruction 3 Fully 3D Reconstruction
Image Reconstruction 3 Fully 3D Reconstruction Thomas Bortfeld Massachusetts General Hospital, Radiation Oncology, HMS HST.S14, February 25, 2013 Thomas Bortfeld (MGH, HMS, Rad. Onc.) Image Reconstruction
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationScaling Calibration in the ATRACT Algorithm
Scaling Calibration in the ATRACT Algorithm Yan Xia 1, Andreas Maier 1, Frank Dennerlein 2, Hannes G. Hofmann 1, Joachim Hornegger 1,3 1 Pattern Recognition Lab (LME), Friedrich-Alexander-University Erlangen-Nuremberg,
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More informationarxiv: v1 [cs.cg] 27 Nov 2015
On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca
More informationA GENERIC MODEL OF A BASE-ISOLATED BUILDING
Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes
More informationThe effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems
The effectiveness of PIES comparing to FEM and BEM for 3D elasticit problems A. Boltc, E. Zienik, K. Sersen Faclt of Mathematics and Compter Science, Universit of Bialstok, Sosnowa 64, 15-887 Bialstok,
More informationA Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks
Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,
More informationLast lecture: finishing up Chapter 22
Last lectre: finishing p Chapter 22 Hygens principle consider each point on a wavefront to be sorce of secondary spherical wavelets that propagate at the speed of the wave at a later time t, new wavefront
More informationConstructing Multiple Light Multicast Trees in WDM Optical Networks
Constrcting Mltiple Light Mlticast Trees in WDM Optical Networks Weifa Liang Department of Compter Science Astralian National University Canberra ACT 0200 Astralia wliang@csaneda Abstract Mlticast roting
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationThe Intersection of Two Ringed Surfaces and Some Related Problems
Graphical Models 63, 8 44 001) doi:10.1006/gmod.001.0553, available online at http://www.idealibrary.com on The Intersection of Two Ringed Srfaces and Some Related Problems Hee-Seok Heo and Sng Je Hong
More informationHigh-order 3D FEM of Prostate Needle Insertion Forces
High-order 3D FEM of Prostate Needle Insertion Forces Anitha Priya Krishnan Department of Biomedical Engineering University of Rochester 6 Elmwood Avene Rochester NY 464 ankrishn@bme.rochester.ed Walter
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationTriangle-Free Planar Graphs as Segments Intersection Graphs
Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationGEAR SHAPED CUTTER A PROFILING METHOD DEVELOPED IN GRAPHICAL FORM
HE ANNALS OF DUNAEA DE JOS UNIVESIY OF GALAI FASCICLE V, ECHNOLOGIES IN MACHINE BUILDING, ISSN - 4566, 05 GEA SHAPED CUE A POFILING MEHOD DEVELOPED IN GAPHICAL FOM Nicşor BAOIU, Virgil Gabriel EODO, Camelia
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationMethod to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot
Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationDIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES
DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal
More informationStereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection
Stereo Matching and 3D Visalization for Gamma-Ray Cargo Inspection Zhigang Zh *ab, Y-Chi H bc a Department of Compter Science, The City College of New York, New York, NY 3 b Department of Compter Science,
More informationTESTING OF THE CIRCLE AND LINE ALGORITHM IN THE SETTING OF MICRO-CT
SCA2016-080 1/7 TESTING OF THE CIRCLE AND LINE ALGORITHM IN THE SETTING OF MICRO-CT Alexander Katsevich 1, 2 and Michael Frenkel 1 1 itomography Corp., 2 University of Central Florida (UCF) This paper
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationA RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA
A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA Mei Zho*, Ling-li Tang, Chan-rong Li, Zhi Peng, Jing-mei Li Academy of Opto-Electronics, Chinese Academy of Sciences, No.9, Dengzhang
More informationLayered Light Field Reconstruction for Defocus Blur
Layered Light Field Reconstrction for Defocs Blr KARTHIK VAIDYANATHAN, JACOB MUNKBERG, PETRIK CLARBERG and MARCO SALVI Intel Corporation We present a novel algorithm for reconstrcting high qality defocs
More information3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH
3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH Pablo d Angelo and Christian Wöhler DaimlerChrysler Research and Technology, Machine Perception
More informationMaximum Weight Independent Sets in an Infinite Plane
Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking
More informationTheoretically-exact CT-reconstruction from experimental data
Theoretically-exact CT-reconstruction from experimental data T Varslot, A Kingston, G Myers, A Sheppard Dept. Applied Mathematics Research School of Physics and Engineering Australian National University
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationChapter 2: Finite Difference Approximations
Chapter : Finite Difference Approximations.) Introdction The first chapter introdced s to several of the different kinds of partial differential eqations (PDEs) that govern the evoltion of physical systems.
More informationProf. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:
EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationMETAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY
VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia
More informationPavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationInteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:
Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela
More informationTemporal Light Field Reconstruction for Rendering Distribution Effects
Temporal Light Field Reconstrction for Rendering Distribtion Effects Jaakko Lehtinen NVIDIA Research PBRT, 16 spp, 403 s Timo Aila NVIDIA Research Jiawen Chen MIT CSAIL PBRT, 256 spp, 6426 s Samli Laine
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationCost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks
Cost Based Local Forwarding Transmission Schemes for Two-hop Celllar Networks Zhenggang Zhao, Xming Fang, Yan Long, Xiaopeng H, Ye Zhao Key Lab of Information Coding & Transmission Sothwest Jiaotong University,
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationConstructing and Comparing User Mobility Profiles for Location-based Services
Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,
More informationHistory Slicing: Assisting Code-Evolution Tasks
History Slicing: Assisting Code-Evoltion Tasks Francisco Servant Department of Informatics University of California, Irvine Irvine, CA, U.S.A. 92697-3440 fservant@ics.ci.ed James A. Jones Department of
More informationEstimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function
Proceedings 999 IEEE Conf. on Compter Vision and Pattern Recognition, pp. 87-9 Estimating Model Parameters and Bondaries By Minimiing a Joint, Robst Objective Fnction Charles V. Stewart Kishore Bbna Amitha
More informationComputer User s Guide 4.0
Compter User s Gide 4.0 2001 Glenn A. Miller, All rights reserved 2 The SASSI Compter User s Gide 4.0 Table of Contents Chapter 1 Introdction...3 Chapter 2 Installation and Start Up...5 System Reqirements
More informationIoT-Cloud Service Optimization in Next Generation Smart Environments
1 IoT-Clod Service Optimization in Next Generation Smart Environments Marc Barcelo, Alejandro Correa, Jaime Llorca, Antonia M. Tlino, Jose Lopez Vicario, Antoni Morell Universidad Atonoma de Barcelona,
More informationGeometric studies on variable radius spiral cone-beam scanning
Geometric studies on variable radius spiral cone-beam scanning Yangbo Ye a) Jiehua Zhu Department of Mathematics, The University of Iowa, Iowa City, Iowa 52242 Ge Wang Department of Radiology, The University
More informationSuitability of a new alignment correction method for industrial CT
Suitability of a new alignment correction method for industrial CT Matthias Elter 1, Nicole Maass 1, Peter Koch 2 1 Siemens AG, Healthcare Sector, Erlangen, Germany, e-mail: matthias.elter@siemens.com,
More information[1] Hopcroft, J., D. Joseph and S. Whitesides, Movement problems for twodimensional
Acknoledgement. The athors thank Bill Lenhart for interesting discssions on the recongration of rlers. References [1] Hopcroft, J., D. Joseph and S. Whitesides, Moement problems for todimensional linkages,
More informationNETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS
ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French
More informationA Frequency-optimized Discontinuous Formulation for Wave Propagation Problems
th Flid Dynamics Conference and Ehibit 8 Jne - Jly, Chicago, Illinois AIAA -55 A Freqency-optimized Discontinos Formlation for Wave Propagation Problems Yi Li and Z. J. Wang Department of Aerospace Engineering
More informationIntroduction to Medical Imaging. Cone-Beam CT. Klaus Mueller. Computer Science Department Stony Brook University
Introduction to Medical Imaging Cone-Beam CT Klaus Mueller Computer Science Department Stony Brook University Introduction Available cone-beam reconstruction methods: exact approximate algebraic Our discussion:
More informationSecure Biometric-Based Authentication for Cloud Computing
Secre Biometric-Based Athentication for Clod Compting Kok-Seng Wong * and Myng Ho Kim School of Compter Science and Engineering, Soongsil University, Sangdo-Dong Dongjak-G, 156-743 Seol Korea {kswong,kmh}@ss.ac.kr
More informationOCIS codes: ( ) Microscopy; ( ) Partial coherence in imaging; ( ) Image reconstruction techniques
Sparsity based sb-wavelength imaging with partially incoherent light via qadratic compressed sensing Yoav Shechtman 1, Yonina C. Eldar, Alexander Szameit 1 and Mordechai Segev 1 1 Physics Department and
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationThis chapter is based on the following sources, which are all recommended reading:
Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter
More informationFactors Influencing Performance of Firefly and Particle Swarm Optimization Algorithms
Factors Inflencing Performance of Firefly and Particle Swarm Optimization Algorithms Damanjeet Kar, UIET, Panjab University, Chandigarh Abstract In this paper, two natre inspired meta heristic approaches
More informationCIRCULAR scanning trajectory has been widely used in
IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 25, NO. 7, JULY 2006 869 Region of Interest Reconstruction From Truncated Data in Circular Cone-Beam CT Lifeng Yu, Yu Zou, Emil Y. Sidky, Charles A. Pelizzari,
More informationTAKING THE PULSE OF ICT IN HEALTHCARE
ICT TODAY THE OFFICIAL TRADE JOURNAL OF BICSI Janary/Febrary 2016 Volme 37, Nmber 1 TAKING THE PULSE OF ICT IN HEALTHCARE + PLUS + High-Power PoE + Using HDBaseT in AV Design for Schools + Focs on Wireless
More informationEUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name)
Volme X, No. 0X, 200X, X XX Web site: http://www.aimsciences.org EUCLIDEAN SKELETONS USING CLOSEST POINTS Songting Lo Department of Mathematics, University of California, Irvine Irvine, CA 92697-3875,
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More information