CENTER-POINT MODEL OF DEFORMABLE SURFACE
|
|
- Jeffrey Jones
- 6 years ago
- Views:
Transcription
1 CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D image i preented. Mobility of each node, element compoing the urface, i contrained in the model to one direction. Alo an original formula for image influence computation i propoed. The model aim at algorithm implification and reduction of computational time needed for egmentation of 3D imaging data acquired from magnetic reonance or computer tomography canner. egmentation; deformable urface; center-point model 1. INTRODUCTION Medical imaging technique together with computerized image analyi revolutionized medicine. They have become important tool in medical diagnoi urgical planning and urgical imulation. One of important image analyi operation i egmentation: a election of image fragment repreenting object of tudy uch a an anatomical organ, it ditinguihable part or pathological entity. In many cae thee object are oval and differ from urrounding with phyical propertie uch a hardne or water content. Medical imaging technique meaure uch phyical propertie and preent them a a 2D or a 3D image, where the meaurement i uually repreented by gray-cale intenity. Therefore, image region related to uch object differ from the background with their intenity. The center-point model (CPM) of deformable urface i deigned with thi kind of image in mind. The CPM aim at computational implification of egmentation algorithm baed on deformable model and reducing computational time needed for egmentation of 3D image.
2 2 Piotr M. Szczypinki 2. MODEL STRUCTURE Deformable model for egmentation of digital image uually comprie node. Neighboring node are connected to form dicrete curve 1 or urface 2, 3. Image analyi uing deformable model i a proce of iteration called matching proce which ytematically diplace node and deform the model tructure to fit a boundary of object of interet. Uual implementation of deformab1e model 1 aume that each node i aigned vector of coordinate in the pace of the invetigated image. In contrat to thi idea, CPM node i aigned to fixed half-line 4. Half-line originate from an arbitrary choen center point, are radiantly arranged and emi-equally paced around thi point. Thu, the poition of every node i given by it ditance r from center point. (a) (b) (c) (d) Figure 1. Teelation of center-point model of deformable urface: icoahedron (a), firt ubdiviion of icoahedron face (b), dual meh with three-connected node (c), half-line defining direction of node movement in center-point model Teelation of CPM urface i baed on ubdiviion of icoahedron face (figure 1.a). An icoahedron ha a regular tructure in an Euclidean 3D pace. It ha 12 vertice, where each vertex i connected to five other vertice forming 20 equilateral triangular face. Conecutive ubdiviion of triangular face of icoahedron 2 into maller triangle (figure 1.b) increae the number and denity of node or vertice. Every new vertex formed in thi way i connected to ix other vertice, while the original 12 vertice remain five-connected. However, alo a dual (complementary) form of a meh (figure 1.c), in which all the node are three-connected, may be applied. The center of reultant meh tructure i placed at the coordinate of an arbitrary choen center-point. The half-line contraining the node movement begin in the center-point and contain one of the meh vertice (figure 1.d). Chooing the right number of ubdiviion and the number of node i computation time v. final reult reolution tradeoff. For application of MRI data egmentation node eem adequate.
3 CENTER-POINT MODEL OF DEFORMABLE SURFACE 3 3. MATCHING PROCESS The node ha to be puhed toward deired poition near the egmentation boundary. For thi reaon, an image influence vector i computed according to local propertie of the image at node poition. On the other hand, moothne of deformable model mut be retained, which i atified by modeling tenion within urface. The deformable model matching i a proce of ucceive node diplacement intended for finding location where balance between image influence and internal tenion i obtained. The following three ubection decribe the approach implemented in CPM. 3.1 Image Influence In the current approache node are uually attracted with large image gradient magnitude. Hence, initial poition of a deformable urface hould be relatively cloe to the deired olution, i.e. within range of the gradient magnitude function lope. Thi problem i partly olved in a balloon model 6 where ome preure force inflate the model and make it grow until it node reach location of high gradient magnitude. Unfortunately, if the intenity gradient of the boundary i mall the balloon will grow without topping at all. Moreover, balloon model are vulnerable to image artifact and noie, which can caue them to fold and bend incorrectly (figure 2.a). (a) (b) (c) Figure 2. Example of magnetic reonance imaging data egmentation with balloon model (α=0.02, β=0.001, ξ=0.02, τ=16, i=80) (a), center-point model and linear formula of tenion computation (α=0.05, β=0, ξ=0.08, τ=16, i=25) (b), center-point model and formula of tenion computation with linear and cubic component (α=0.05, β=0.001, ξ=0.08, τ=16, i=25) (c) Let u aume that an object of interet differ from the image background with it brightne intenity and that ome threhold value of intenity can be found, which roughly eparate the object from it urrounding. Therefore, a imple formula of image influence force can be applied: ( I r ) f = ξ ) τ (
4 4 Piotr M. Szczypinki where ξ i a coefficient defining magnitude and turn of image influence force, I(r ) i an image intenity at coordinate of a node and τ i the image intenity threhold. If the object i brighter than the image background, parameter ξ hould be poitive, otherwie negative. Thi way, force f p puhe the node outide when the node i inide the object and pull inide otherwie. (a) (b) (c) (d) (e) (f) (g) Figure 3. Phae of magnetic reonance data egmentation proce with center-point model: cro-ection through input data (a), model initialized inide the object of interet (b), intermediate phae of matching proce (c), reult of cerebrum egmentation (ξ=0.06, τ=44, α=0.05, β=0.001, i=250) (d), initialization of urface urrounding the object (e), intermediate phae (f) and reult of egmentation (α=0.05, β=0.001, ξ=0.08, τ=16, i=25) (g) Conequently, there i no need for computation of an image gradient, which uually require coniderable computation time. Furthermore, the urface can be initialized in two way: inide the object, to grow jut like in balloon model, or it can urround the object at firt and then hrink and tighten around it. Thi property i quite ueful when two different object, one inide another, are to be egmented (figure 3). 3.2 Tenion Tenion i uually modeled by mean of the thin-plate energy function 2, 5 or by the linear low-pa filtering of node coordinate vector. In either cae, the effective tenion force influencing the node i a linear function of the node coordinate and coordinate of it neighbor.
5 CENTER-POINT MODEL OF DEFORMABLE SURFACE 5 Unfortunately, when applying the linear function for tenion computation, ome node tend to top on local and trong image diturbance, uch a MRI artifact. Eventually, they produce pike protruding from elewhere-mooth urface (figure 2.b). To avoid uch an effect, a nonlinear cubic component i added to the tenion force formula. Still, the formula i imple and reult in a reduction of computational time. The combined formula i: g = α n N n N r n rn n N r β r n N 3 The equation conit of a linear and a cubic component, where N i a neighborhood of node. The bracketed part i a difference between average coordinate of node within the neighborhood and coordinate of node itelf. If an individual node i topped on ome image diturbance and it tay far from neighboring node, the nonlinear component caue neighboring node to pull it out much tronger than the linear component alone would do (compare figure 2.b and 2.c). 3.3 Node diplacement For implicity the following equation for computation of node diplacement i applied in CPM. An index i refer to dicrete time. ( i+ 1) ( i) ( i) ( i) = r + g f r + 4. RESULTS The CPM of deformable urface wa teted on biomedical image repreenting human head. Data wa acquired from a MRI canner. Reult preented in figure 2.d and 2.g are obtained with CPM compoed of 1524 node. The proce of egmentation require 25 to 250 iteration (120 m 1.2 uing a PC with an Intel Centrino MT 1.6 GHz proceor). The input data are compried of 64 human head cro-ection, 256x256 pixel each, with 256 gray level and ratio of voxel dimenion 1:1:2. The CPM wa compared with a balloon model. Tenion force in a balloon model i computed with the ame equation a propoed for CPM, with a coordinate r ubtituted by vector of 3D pace coordinate. Alo
6 6 Piotr M. Szczypinki image influence force i computed the ame way a for CPM. The direction of the force influencing the node i pecified by average of normal vector of face including thi node. It turned out that CPM i at leat 20 time fater then the implemented balloon model. The reaon i not only higher number of equation to be computed per iteration but alo a requirement of decreaing image influence parameter ξ (uually time) to prevent urface from undeired folding over (figure 2.a). 5. SUMMARY AND CONCLUSIONS The problem of urface matching in CPM i reduced from 3D pace to 1D pace. In addition, the image influence formula i implified. Conequently, the model i more efficient in comparion with model baed on gradient computation. The weaknee of CPM are a prior need for knowledge on approximate center of volume to be egmented and limited complexity of hape that can be attained. Although the model i not limited to convex hape and ome concave hape can be egmented, the bet reult are obtained for oval object. However, in uch cae CPM can be ueful for preliminary, rough egmentation providing valuable initialization data for other model producing more precie reult. REFERENCES 1. M. Ka, A. Witkin, D. Terauzopoulo, Snake: Active Contour Model, Int. J. of Computer Viion, vol. 1, no. 4, 1988, pp T. McInerney, D. Terauzopoulo, A Dynamic Finite Element Surface Model for Segmentation and Tracking in Multidimenional Medical Image with Application to Cardiac 4D Image Analyi, Computerized Medical Imaging and Graphic, vol. 19, no. 1, 1995, pp T. McInerney, D. Terauzopoulo, Topology Adaptive Deformable Surface for Medical Image Volume Segmentation, IEEE Tran. on Medical Imaging, vol. 18, no. 10, October 1999, pp P. Szczypinki, P. Strumillo, Application of an Active Contour Model for Extraction of Fuzzy and Broken Image Edge, Machine Graphic & Viion, vol.5, no.4, 1996, pp W. Neuenchwander, P. Fua, O. Kuebler, From Ziplock Snake to Velcro Surface, Automatic Extraction of Man Made Object from Aerial and Space Image, Monte Verita, 1995 Birkhaeuer Verlag Bael, pp L. D. Cohen, On Active Contour Model and Balloon, CVGIP: Image Undertanding, vol. 17, no. 2, March 1991, pp
Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationMotivation: Level Sets. Input Data Noisy. Easy Case Use Marching Cubes. Intensity Varies. Non-uniform Exposure. Roger Crawfis
Level Set Motivation: Roger Crawfi Slide collected from: Fan Ding, Charle Dyer, Donald Tanguay and Roger Crawfi 4/24/2003 R. Crawfi, Ohio State Univ. 109 Eay Cae Ue Marching Cube Input Data Noiy 4/24/2003
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationGray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:
Faculty of Informatic Eötvö Loránd Univerity Budapet, Hungary Lecture : Intenity Tranformation Image enhancement by point proceing Spatial domain and frequency domain method Baic Algorithm for Digital
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationImage Morphing Using Deformation Techniques
Image Morphing Uing Deformation Technique Seung-Yong Lee, Kyung-Yong Chwa, Jame Hahn, and Sung Yong Shin Department of Computer Science Korea Advanced Intitute of Science and Technology 373-1 Kuong-dong
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationHandling Degenerate Cases in Exact Geodesic Computation on Triangle Meshes
The Viual Computer manucript. (will be inerted b the editor) Yong-Jin Liu Qian-Yi Zhou Shi-Min Hu Degenerate Cae in Eact Geodeic Computation on Triangle Mehe Abtract The computation of eact geodeic on
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationAbhijeet Shinde 1 and Sachin Ruikar 2
N e a r e t N e i g h b o r a n d I n t e r p o l a t i o n B a e d S u p e r - R e o l u t i o n Nearet Neighbor and Interpolation Baed Super-Reolution Abhijeet Shinde 1 and Sachin Ruikar 2 1,2 Department
More informationAnisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationx y z Design variable positions A
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2001 00:1{7 [Verion: 2000/03/22 v1.0] A tabilied peudo-hell approach for urface parametriation in CFD deign problem O. Soto,R.Lohner
More informationAnalysis of Surface Wave Propagation Based on the Thin Layered Element Method
ABSTACT : Analyi of Surface Wave Propagation Baed on the Thin ayered Element Method H. AKAGAWA 1 and S. AKAI 1 Engineer, Technical Centre, Oyo Corporation, Ibaraki, Japan Profeor, Graduate School of Engineering,
More informationINTERIOR FLOW SIMULATION OF SUCTION CHAMBERS FOR HLFC PROFILES
DocumentID: 340066 INTERIOR FLOW SIMULATION OF SUCTION CHAMBERS FOR HLFC PROFILES H. Lüdeke, DLR, Intitut für Aerodynamik und Strömungtechnik, Lilienthalplatz 7, 38108 Braunchweig, Germany Abtract For
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationStress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling
Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More informationAlgorithmic Discrete Mathematics 4. Exercise Sheet
Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate
More informationImplementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost
Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationNUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE
4th International Conference on Earthquake Engineering Taipei, Taiwan October 12-13, 2006 Paper No. 183 NUMERICAL MODELING ON THE DAMPING CONTROL OF TLD STRUCTURE Han jun 1, Li Yingmin 2, Liu Liping 3,
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationUNIAXIAL COMPRESSION TEST AND STRESS WAVE PROPAGATION MODELLING USING SPH
Fifth International Conference on CFD in the Proce Indutrie CSIRO, Melbourne, Autralia - December UNIAXIAL COMPRESSION TEST AND STRESS WAVE PROPAGATION MODELLING USING SPH Rajarhi DAS and Paul W. CLEARY
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationOn the Use of Shadows in Stance Recovery
On the Ue of Shadow in Stance Recovery Alfred M. Brucktein, 1 Robert J. Holt, 1 Yve D. Jean, 2 Arun N. Netravali 1 1 Bell Laboratorie, Lucent Technologie, Murray Hill, NJ 094 2 Avaya Communication, Murray
More informationNew DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index
New DSP to meaure acoutic efficiency of road barrier. Part 2: Sound Inulation Index LAMBERTO TRONCHIN 1, KRISTIAN FABBRI 1, JELENA VASILJEVIC 2 1 DIENCA CIARM, Univerity of Bologna, Italy 2 Univerity of
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationDevelopment of an atmospheric climate model with self-adapting grid and physics
Intitute of Phyic Publihing Journal of Phyic: Conference Serie 16 (2005) 353 357 doi:10.1088/1742-6596/16/1/049 SciDAC 2005 Development of an atmopheric climate model with elf-adapting grid and phyic Joyce
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationMirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery
Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco
More informationResearch on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function
016 Sith International Conference on Intrumentation & Meaurement Computer Communication and Control Reearch on Star Image Noie Filtering Baed on Diffuion Model of Regularization Influence Function SunJianming
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationAUTOMATED CALIBRATION OF FEM MODELS USING LIDAR POINT CLOUDS
The International Archive of the Photogrammetry, Remote Sening and Spatial Information Science, Volume XLII-, 08 ISPRS TC II Mid-term Sympoium Toward Photogrammetry 00, 4 7 June 08, Riva del Garda, Italy
More informationDark-field Tomography: Modeling and Reconstruction
Dark-field Tomography: Modeling and Recontruction W. Cong, F. Pfeiffer, M. Bech, O. Bunk, C. David, and G. Wang Abtract: Dark-field image are formed by mall-angle cattering of x-ray photon. The mall-angle
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationMap-based Adaptive Foothold Planning for Unstructured Terrain Walking
21 IEEE International Conference on Robotic and Automation Anchorage Convention Ditrict May 3-8, 21, Anchorage, Alaka, USA Map-baed Adaptive Foothold Planning for Untructured Terrain Walking Dominik Belter,
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationIntroduction to PET Image Reconstruction. Tomographic Imaging. Projection Imaging. PET Image Reconstruction 11/6/07
Introduction to PET Image Recontruction Adam Aleio Nuclear Medicine Lecture Imaging Reearch Laboratory Diviion of Nuclear Medicine Univerity of Wahington Fall 2007 http://dept.wahington.edu/nucmed/irl/education.html
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationKINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL
KINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL Raffaele Di Laora Univerity of Napoli Parthenope raffaele.dilaora@uniparthenope.it Emmanouil Rovithi Intitute of Engineering Seimology and
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationLocating Brain Tumors from MR Imagery Using Symmetry
ocating rain Tumor from M magery Uing Symmetry Nilanjan ay aidya Nath Saha and Matthew obert Graham rown {nray1 baidya mbrown}@cualbertaca epartment of Computing Science Univerity of lberta Canada btract
More informationGrowing Networks Through Random Walks Without Restarts
Growing Network Through Random Walk Without Retart Bernardo Amorim, Daniel Figueiredo, Giulio Iacobelli, Giovanni Neglia To cite thi verion: Bernardo Amorim, Daniel Figueiredo, Giulio Iacobelli, Giovanni
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationBayesian segmentation for damage image using MRF prior
Bayeian egmentation for damage image uing MRF prior G. Li 1, F.G. Yuan 1, R. Haftka and N. H. Kim 1 Department of Mechanical and Aeropace Engineering, North arolina State Univerity, Raleigh, N, 7695-791,
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationSnakes with topology control
The Viual Computer manucript No. (will be inerted by the editor) Snake with topology control Stephan Bichoff, Leif P. Kobbelt RWTH Aachen, Lehrtuhl für Informatik VIII, 52056 Aachen, Germany e-mail: {bichoff
More informationDesign of a Stewart Platform for General Machining Using Magnetic Bearings
eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationVariable Resolution Discretization in the Joint Space
Variable Reolution Dicretization in the Joint Space Chritopher K. Monon, David Wingate, and Kevin D. Seppi {c,wingated,keppi}@c.byu.edu Computer Science, Brigham Young Univerity Todd S. Peteron peterto@uvc.edu
More information4. GEOMETRY OF CONSIDERED PRESSURE VESSELS
BULETIN ŞTIINŢIFIC, Seria C, Volumul XXIII, Facicola: Mecanică, Tribologie, Tehnologia Contrucţiilor de Maşini STRESS ANALYSES OF CYLINDRICAL VESSEL WITH CHANGEABLE HEAD GEOMETRY Dražan Kozak1, Ivan Samardžić2,
More informationCOLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL
XI International Conference on Computational Platicity. Fundamental and Application COMPLAS XI E. Oñate, D.R.J. Owen, D. Peric and B. Suárez (Ed) COLLAGEN ORIENTATION AND WAVINESS WITHIN THE VEIN WALL
More informationCERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu
CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationComputer Aided Drafting, Design and Manufacturing Volume 25, Number 3, September 2015, Page 10
Computer Aided Drafting, Deign and Manufacturing Volume 5, umber 3, September 015, Page 10 CADDM Reearch of atural Geture Recognition and Interactive Technology Compatible with YCbCr and SV Color Space
More informationResource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks
Reource Allocation in Multi-Radio Multi-Channel Multi-Hop Wirele Network Technical Report (July 2007) Simone Merlin, Nitin Vaidya, Michele Zorzi Padova Univerity, DEI, Padova, Italy; Univerity of Illinoi
More informationEVen though remarkable progress has been made in
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Dene Semantic 3D Recontruction Chritian Häne, Chritopher Zach, Andrea Cohen, and Marc Pollefey, Fellow, IEEE Abtract Both image egmentation
More informationAll in-focus View Synthesis from Under-Sampled Light Fields
ICAT 2003 December 3-5, Tokyo, Japan All in-focu View Synthei from Under-Sampled Light Field Keita Takahahi,AkiraKubota and Takehi Naemura TheUniverityofTokyo Carnegie Mellon Univerity 7-3-1, Hongo, Bunkyo-ku,
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More information