Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
|
|
- Eleanor Lewis
- 5 years ago
- Views:
Transcription
1 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical Engineering, Taiyuan University of Technology, Taiyuan , China. Abstract: An active research topic in coputer vision and graphics is developing algoriths that can reconstruct the 3D surface of curved objects fro line drawings. There are a nuber of algoriths have been dedicated to solve this proble, but they can t solve this proble when the geoetric structure of a curved object becoes coplex. This paper proposes a novel approach to reconstructing a coplex curved 3D object fro single 2D line drawings. Our approach has three steps: (1) decoposing a coplex line drawing into several sipler line drawings and transforing the into polyhedron; (2) reconstructing the 3D wirefrae of curved object fro these sipler line drawings and generating the curved faces; (3) cobining the 3D objects into the coplete objects. A nuber of exaples are given to deonstrate the ability of our approach to successfully perfor reconstruction of curved objects which are ore coplex than previous ethods. Key words: 3D reconstruction; line drawings; coplex curved objects 1 Introduction Line labeling [1-2] is one of the earliest ethod which is used to reconstruct 3D object fro single line drawing, it focuses on seeking a series of labels fro a line drawing without hidden lines. A nuber of ethods that discusses line labeling have been proposed. Methods of 3D reconstruction fro wirefrae odels try to reconstruct a 3D object fro its ultiple orthographic projections [3], there are ore inforation in three orthographic views for the reconstruction of objects than in a single projected view. There have been any papers for reconstructing polyhedral objects fro single-view line drawings [4-6]. However, the ethods they use are all for reconstruction of line drawings of planar objects. Although the research of 3D reconstruction of curved objects is very few, soe works [7-9] do try to cope with this proble. In reference [7] and [8],their works concentrate on architectural odeling where the lines are ostly straight, and they can only deal with siple curved objects. Without the help of user, both can not deterine caera paraeters and for a odel. In reference [9],the work propose a progressive ethod for reconstructing objects with siple curved faces. It's liitation is that it needs the pronounced angular trends of the edges of objects. Copared with these approaches, our ethod can autoatically reconstruct coplex curved solid objects. 2 Assuptions Line drawings is in a generic view where all the edges and vertices of the object are visible, and it is the parallel projection of a wirefrae anifold. All the faces and internal faces of the anifold that a line drawing represents are available. A curved edge in a line drawing is the projection of a 3D planar curve. 3 Decoposition of the coplex line drawing and transforation This section discusses how to decopose a coplex line drawing along the internal faces and transfor the into polyhedrons. The algorith is as follows: Algorith 1. Partition along an internal face. Let f be an internal face, F(f )={f i } i=1 be the set of all the real faces connected to f, and E(f )={e i } i=1 be the set of all the n edges connected to f. We can verify that all separations satisfy conditions as follows:1 Each face connected to f is contained either by F 0 (f ) or F 1 (f ). Two faces that share an edge connected to f always appear in the sae face set F 0 (f ) or F 1 (f ). Above all, we set F 0 (f ), F 1 (f ), Corresponding author: Dong Lijun, Feale, Ph.D, Professor, E-ail: dlj_lq@163.co.
2 14 Coputer Aided Drafting, Design and Manufacturing (CADDM), Vol.26, o.2, Jun E 0 (f ) and E 1 (f ) to be epty sets, and put all the real faces connected to f into F 1 (f ), then reove any one face fro F 1 (f ) and put it into F 0 (f ). 2 If one real face in F 1 (f ) and another real face in F 0 (f ) share an edge connected to f,we reove the face in F 1 (f ), put it into F 0 (f ), and repeat the above steps until all the faces in F 1 (f ) be tested. 3 We put all the edges that are connected to f and in the faces in F 0 (f ) into E 0 (f ), and put all the edges that are connected to f and in the faces in F 1 (f ) into E 1 (f ). Fro Fig.1, we give an exaple of the separation of the line drawing. (a) Fig. 1 (a) f 1, f 2 and f 3 are three internal faces which we used to separate a line drawing; (b) Decoposition along f 1, f 2 and f 3 in (a). (b) There are two propositions [10] show that the decoposition along an internal face is unique, and after the decoposition, the generating line drawing still represent a anifold. Proposition 1. The separation along an internal face of a line drawing representing a anifold exists and is unique. Proposition 2. After the decoposition along an internal face, the line drawing still represents a anifold. Algorith 1 actually achieved the purpose of the partition along an internal face f. The algorith is run repeatedly until all the internal faces have been separated. An iportant step is to transfor a line drawing with curved edges into a polyhedron. When there is only one curve between two vertices, the curve is transfored into a straight line that passes through the two vertices. When there is ore than one curved edge between two vertices, in this case, we first find a singular point in a curve and then replace the curve with two straight lines (Fig.2). Fig. 2 Transforing a line drawing into a polyhedron. 4 3D reconstruction and generating the curved faces As we assue a line drawing to be a parallel or near parallel projection of a 3D object. The x-coordinate and y-coordinate of each vertex have already been derived, and only the z-coordinate has to be obtained. Let C(k) be a 3D curve described in the paraeterized for:
3 Sun Yanling et al., 3D Reconstruction of Coplex Curved Objects fro Line Drawings 15 C(k)=(x(k), y(k), z(k)) T the 2D parallel projection of C(k) is siply C (k) = (x(k), y(k)) T. 2D curve C (k)=(x(k), y(k)) T and the coordinate of endpoint P 0 =(x 0, y 0, z 0 ) T in 3D curve C(k) are given, As long as we find the unit noral vector n=(n x, n y, n z ) T of the plane the 3D curve C(k) lies on, we can get the z-coordinates of the curve by: z(k)=z 0 (n x (x(k) x 0 )+n y (y(k) y 0 ))/n z We use an optiization-based approach to reconstruct the 3D wirefrae of the curved object. There are eight regularities are applied to the reconstruction: iniizing the standard deviation of angles in the reconstructed object (α 1 ), face planarity (α 2 ), corner orthogonality (α 3 ), line parallelis (α 4 ), face perpendicularity (α 5 ), curve concavity (α 6 ), curve parallelis (α 7 ) and isoetry (α 8 ). The objective function to be optiized is defined as: n 1 2 M i i i=1 f( z, z,, z, n, n,, n )= where λ 1 8 are weighting factors, z 1 are the depths of all the vertices of a line drawing, and n 1 M are the unit noral vectors of the M planes. We iniize f using the ethod presented in reference [11]. After reconstructing the 3D wirefrae fro sipler line drawings, we use Bezier and Coons patches [12] to generate curved faces with three or four edges. Let P(a, b), 0 a, b 1, be a curved patch, P(0, b), P(1, b), P(a, 0), and P(a, 1) are its four curving boundary. We can obtain the approxiation of P(a, b) by: P ( a, b)=(1 a) P( a, b) ap(1, b) (1 b) P( a,0) bp( a,1) (1 a) bp(0, 1) a(1 b) P(1, 0) (1 a)(1 b) P(0, 0) abp(1,1) where P (a, b) is a Coons patch, which pass through four boundary curves and four corners of P(a, b) exactly once. After obtaining the Coons patch, we use a sae ethod to get the control points D i,j of the Bezier n patch P(a, b)= Di, jbi, n( a) Bj, ( b) by: i 0 j 0 i i j j D = 1 D D 1 D D n n i j i j 1 1 D0,0 1 D0, n n i j i j 1 Dn,0 Dn, n n i, j 0, j n, j i,0 i, where D 0,j, D n,j, D i, 0, and D i,, 0 i n, 0 j, are four known control points of the boundaries. 5 Cobining 3D objects We cobine all the 3D objects along the internal faces of the original line drawing. Let f be an internal face shared by two 3D object O x and O y, and z x1, z x2,, z x and z y1, z y2,, z y are the depths of vertices on the internal face f in O x and O y, respectively. μ i which eans the depth and standard deviations σ i of f are defined as: 1 i = zij, i=x, y j=1 1 =, i=x, y 2 z i ij i j=1 We odify the depths of all the vertices of O x by: y z xi = y zxi x, i =1,2,, Finally, we cobine O x and O y by: x zxi zbi z xi = z yi =, i=1, 2,, 2 where zx 1, z x2,, z x and z y1, z y2,, z y are odifiedvertex depths of f in O x and O y, respectively. We erge O x and O y by forcing the to be sae. 6 Conclusion In this paper, we have proposed a novel ethod to reconstructing a coplex curved 3D object fro single 2D line drawings. Our strategy is to : 1 divide a coplex line drawing into sipler ones along the internal faces and transfor the into the line drawings of polyhedrons; 2 reconstruct the 3D wirefrae fro these sipler line drawings and generate the curved faces with Bezier patches and triangular eshes; 3 erge the 3D objects into a coplete object. A nuber of exaples indicate the success of our approach (Fig.3). Fig.3 displays soe of results. we give each input line drawing separation result and their transfored line drawings and the final 3D reconstruction result displayed in two views. We use different colors to distinguish different faces. Fro Fig.3, we can find that our approach successfully separates the line drawings and handle 3D reconstruction of coplex curved object. It is worth entioning that soe of the results in Fig.3 are ore coplex than the
4 16 Coputer Aided Drafting, Design and Manufacturing (CADDM), Vol.26, o.2, Jun objects given in the previous papers for 3D reconstruction of curved objects fro single line drawings. The coputational tie of our algorith varies with different line drawings, depending on the coplexity of the. For those in Fig.3, it ranges fro 0.8 s to 78 s. Aong the three steps, Step 3 take alost all the coputational tie. The previous approaches of 3D reconstruction of curved objects fro single line drawings [7-9] need huan interaction and can only perfor siple 3D curved objects. In contrast, our ethod can handle coplex curved objects autoatically. Our future work includes finding a better fine-tuning schee and developing ore regularities for curved object reconstruction. Fig. 3 Several line drawings and their separation, their transfored line drawings and the final 3D object by reconstruction. References [1] [2] [3] [4] [5] [6] Gao M T, Chu J, Dong L J. A review on interpretation of line drawings [J]. Journal of Engineering Graphics, 2006, 27(5): Cooper M. The Interpretation of line drawings with contrast failure and shadows [J]. International Journal of Coputer Vision, 2001, 43(2): Liu J, Cao L, Li Z, et al. Plane-based optiization for 3d object reconstruction fro single line drawings [J]. IEEE Trans. Pattern Analysis and Machine Intelligence, 2008, 30(2): Cao L, Liu J, Tang X. What the back of the object looks like: 3D reconstruction fro line drawings without hidden lines [J]. IEEE Trans. Pattern Analysis and Machine Intelligence, 2008, 30(2): Chen Y, Liu J, Tang X. A divide-and-conquer approach to 3D object reconstruction fro line drawings [J]. Coputer Vision, 2007, 14(21): 1-8. Lee Y T, Fang F. 3D reconstruction of polyhedral objects fro single parallel projections using cubic corner [J]. Coputer Aided Design, 2011, 43(8): [7] Chen X, Kang S, Xu Y, et al. Sketching reality: Realistic interpretation of architectural designs [J]. ACM Transactions on Graphics, 2008, 27(2): [8] Lee S, Feng D, Gooch B. Autoatic construction of 3D odels fro architectural line drawings [C]//. Syposiu on Interactive 3D Graphics, Redwood City. ew York: ACM Press, 2008: [9] Masry M, Kang D, Lipson H. A freehand sketching interface for progressive construction of 3d objects [J]. Coputers and Graphics, 2005, 29(4): [10] Chen Y, Liu J. Reconstructing 3D anifold object fro line drawings based on a divide-and-conquer approach [D]. Hong Kong: The Chinese University of Hong Kong, [11] Chen Y, Liu J Z. A divide-and-conquer approach to 3D object reconstruction fro line drawings [J]. Coputer Vision, 2007, 14(21): 1-8. [12] Wang Y Z, Chen Y, Liu J Z, et al. 3D reconstruction of curved objects fro single 2d line drawings [C]//
5 Sun Yanling et al., 3D Reconstruction of Coplex Curved Objects fro Line Drawings 17 Coputer Vision and Pattern Recognition, IEEE Conference on. ew York: IEEE Press, 2009: Sun Yanling currently a graduate student at Taiyuan University of Technology and ajoring in Mechanical Engineering. His research fields are engineering graphics and coputer-aided design. Dong Lijun is currently a professor of College of Mechanical Engineering, University. Taiyuan University of Technology. Her research interests include Coputer Graphics and Coputer Vision. She received the Ph.D ajoring in ME degrees fro orthwestern Polytechnical University in 2005.
TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationAn Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints
519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka
More informationNovel Image Representation and Description Technique using Density Histogram of Feature Points
Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos
More informationThe Internal Conflict of a Belief Function
The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More information3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search
436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min
More informationIMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco
IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of
More informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationReconstruction of Time Series using Optimal Ordering of ICA Components
Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationWavelets for Computer Graphics: A Primer Part 1
Wavelets for Coputer Graphics: A Prier Part Eric J. Stollnitz Tony D. DeRose David H. Salesin University of Washington Introduction Wavelets are a atheatical tool for hierarchically decoposing functions.
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationA wireless sensor network for visual detection and classification of intrusions
A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang
More informationDesign Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems
Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationGeometric Constraint Solver using Multivariate Rational Spline Functions
Geoetric onstraint Solver using Multivariate ational Spline Functions Gershon Elber Departent of oputer Science Technion srael nstitute of Technology Haifa 3000 srael E-ail: gershon@cstechnionacil Myung-Soo
More informationShape Optimization of Quad Mesh Elements
Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face
More informationMultipath Selection and Channel Assignment in Wireless Mesh Networks
Multipath Selection and Channel Assignent in Wireless Mesh Networs Soo-young Jang and Chae Y. Lee Dept. of Industrial and Systes Engineering, KAIST, 373-1 Kusung-dong, Taejon, Korea Tel: +82-42-350-5916,
More informationO-Snap: Optimization-Based Snapping for Modeling Architecture
O-Snap: Optiization-Based Snapping for Modeling Architecture MURAT ARIKAN Vienna University of Technology MICHAEL SCHWÄRZLER VRVis Research Center SIMON FLÖRY and MICHAEL WIMMER Vienna University of Technology
More informationData & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More information(Geometric) Camera Calibration
(Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First
More informationPOSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang
IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationλ-harmonious Graph Colouring Lauren DeDieu
λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex
More informationOptimal Route Queries with Arbitrary Order Constraints
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More informationA Study of the Relationship Between Support Vector Machine and Gabriel Graph
A Study of the Relationship Between Support Vector Machine and Gabriel Graph Wan Zhang and Irwin King {wzhang, king}@cse.cuhk.edu.hk Departent of Coputer Science & Engineering The Chinese University of
More informationINTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES
INTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES Dehua Xie 1, Shuaicheng Liu 1, Kaio Lin 2, Shuyuan Zhu 1, and Bing Zeng 1 1 School of Electronic Engineering, University of Electronic Science and Technology
More informationOptimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model
1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of
More informationGalois Homomorphic Fractal Approach for the Recognition of Emotion
Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,
More informationInvestigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationMirror Localization for a Catadioptric Imaging System by Projecting Parallel Lights
2007 IEEE International Conference on Robotics and Autoation Roa, Italy, 10-14 April 2007 FrC2.5 Mirror Localization for a Catadioptric Iaging Syste by Projecting Parallel Lights Ryusuke Sagawa, Nobuya
More informationEffective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion
Effective Tracking of the Players and Ball in Indoor Soccer Gaes in the Presence of Occlusion Soudeh Kasiri-Bidhendi and Reza Safabakhsh Airkabir Univerisity of Technology, Tehran, Iran {kasiri, safa}@aut.ac.ir
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationHomework 1. An Introduction to Neural Networks
Hoework An Introduction to Neural Networks -785: Introduction to Deep Learning Spring 09 OUT: January 4, 09 DUE: February 6, 09, :59 PM Start Here Collaboration policy: You are expected to coply with the
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationShort Papers. Location- and Density-Based Hierarchical Clustering Using Similarity Analysis 1 INTRODUCTION
IEEE TRASACTIOS O PATTER AALYSIS AD MACHIE ITELLIGECE, VOL. 20, O. 9, SEPTEMBER 1998 1011 Short Papers Location- and Density-Based Hierarchical Clustering Using Siilarity Analysis Peter Bacsy and arendra
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationEfficient Estimation of Inclusion Coefficient using HyperLogLog Sketches
Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S
COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes
More informationVerifying the structure and behavior in UML/OCL models using satisfiability solvers
IET Cyber-Physical Systes: Theory & Applications Review Article Verifying the structure and behavior in UML/OCL odels using satisfiability solvers ISSN 2398-3396 Received on 20th October 2016 Revised on
More informationMULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou
MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi
More informationA High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of
More informationStructural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.
Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationEfficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning
Efficient Constraint Evaluation Algoriths for Hierarchical Next-Best-View Planning Ko-Li Low National University of Singapore lowl@cop.nus.edu.sg Anselo Lastra University of North Carolina at Chapel Hill
More information3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric
More informationRapid Prototyping and Optimization based on Conceptual Specification for Fuzzy Applications
Rapid Prototyping and Optiization based on Conceptual Specification for Fuzzy Applications Chantana Chantrapornchai Michael Sheliga Sissades Tongsia Edwin H.-M. Sha Research report: TR-98-4 Dept. of Coputer
More informationELEN : Project Progress Report. Second Order Delay Computation for RC networks with Non-Tree Topology
ELEN 689-603: Project Progress eport Second Order Delay Coputation for C networks wi Non-Tree Topology ajeshwary Tayade 000 07 573 //003 PDF created wi pdffactory trial version www.pdffactory.co : Introduction
More informationGuillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for
Guillotine subdivisions approxiate polygonal subdivisions: Part III { Faster polynoial-tie approxiation schees for geoetric network optiization Joseph S. B. Mitchell y April 19, 1997; Last revision: May
More informationA Discrete Spring Model to Generate Fair Curves and Surfaces
A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa
More informationIN many interactive multimedia streaming applications, such
840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior
More informationA Periodic Dynamic Load Balancing Method
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation
More informationDETC2002/DAC DECOMPOSITION-BASED ASSEMBLY SYNTHESIS FOR IN-PROCESS DIMENSIONAL ADJUSTABILITY. Proceedings of DETC 02
Proceedings of DETC 0 ASME 00 Design Engineering Technical Conferences and Coputer and Inforation in Engineering Conference Montreal, Canada, Septeber 9-October, 00 DETC00/DAC-08 DECOMPOSITION-BASED ASSEMBLY
More informationNews Events Clustering Method Based on Staging Incremental Single-Pass Technique
News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationG045 3D Multiple Attenuation and Depth Imaging of Ocean Bottom Seismic Data
G045 3D Multiple Attenuation and Depth Iaging of Ocean Botto Seisic Data J. Mispel* (StatoilHydro ASA), B. Arntsen (StatoilHydro ASA), A. Kritski (StatoilHydro ASA), L. Aundsen (StatoilHydro ASA), M. Thopson
More informationMing-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University
Rapid Constructions of Circular-Orbit Pinhole SPECT Iaging Syste Matrices by Gaussian Interpolation Method Cobined with Geoetric Paraeter Estiations (GIMGPE Ming-Wei Lee, Wei-Tso Lin, Yu-Ching Ni, Meei-Ling
More informationFeature Selection to Relate Words and Images
The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationImprove Peer Cooperation using Social Networks
Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More informationAn Architecture for a Distributed Deductive Database System
IEEE TENCON '93 / B eih An Architecture for a Distributed Deductive Database Syste M. K. Mohania N. L. Sarda bept. of Coputer Science and Engineering, Indian Institute of Technology, Bobay 400 076, INDIA
More informationQuantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation
Quantitative Coparison of Sinc-Approxiating Kernels for Medical Iage Interpolation Erik H. W. Meijering, Wiro J. Niessen, Josien P. W. Plui, Max A. Viergever Iage Sciences Institute, Utrecht University
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More information3D Reconstruction for Rendering
3D Reconstruction for Rendering Topic in Iage-Based Modeling and Rendering CSE9 J00 Lecture 6 This lecture [DTM96] Paul E. Debevec, Caillo J. Talor, Jitendra Malik, Modeling and Rendering Architecture
More informationRECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS
RECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS AWNI ITRADAT Assistant Professor, Departent of Coputer Engineering, Faculty of Engineering, Hasheite University, P.O. Box 15459,
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationData-driven Hybrid Caching in Hierarchical Edge Cache Networks
Data-driven Hybrid Caching in Hierarchical Edge Cache Networks Abstract Hierarchical cache networks are increasingly deployed to facilitate high-throughput and low-latency content delivery to end users.
More informationCalculation of the blocking factor in heliostat fields
Available online at www.sciencedirect.co ScienceDirect Energy Procedia 57 (014 ) 91 300 013 ISES Solar World Congress Calculation of the blocking factor in heliostat fields Mustafa E. Elayeb a *, Rajab
More informationDeterministic Voting in Distributed Systems Using Error-Correcting Codes
IEEE TRASACTIOS O PARALLEL AD DISTRIBUTED SYSTEMS, VOL. 9, O. 8, AUGUST 1998 813 Deterinistic Voting in Distributed Systes Using Error-Correcting Codes Lihao Xu and Jehoshua Bruck, Senior Meber, IEEE Abstract
More informationFeature-Centric Evaluation for Efficient Cascaded Object Detection
IEEE Conference on Coputer Vision and Pattern (CVPR, 2004 Feature-Centric Evaluation for Efficient Cascaded Object Detection Henry Schneideran 1 Robotics Institute Carnegie Mellon University Pittsburgh,
More informationWeeks 1 3 Weeks 4 6 Unit/Topic Number and Operations in Base 10
Weeks 1 3 Weeks 4 6 Unit/Topic Nuber and Operations in Base 10 FLOYD COUNTY SCHOOLS CURRICULUM RESOURCES Building a Better Future for Every Child - Every Day! Suer 2013 Subject Content: Math Grade 3rd
More informationMAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer
MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer Departent of Coputer Science and Engineering University of South Florida Tapa, FL 33620 Abstract -- The
More informationPROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS WITH A SINGLE LASER RANGE FINDER
nd International Congress of Mechanical Engineering (COBEM 3) Noveber 3-7, 3, Ribeirão Preto, SP, Brazil Copyright 3 by ABCM PROBABILISTIC LOCALIZATION AND MAPPING OF MOBILE ROBOTS IN INDOOR ENVIRONMENTS
More informationCassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards
Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationA GRAPH-PLANARIZATION ALGORITHM AND ITS APPLICATION TO RANDOM GRAPHS
A GRAPH-PLANARIZATION ALGORITHM AND ITS APPLICATION TO RANDOM GRAPHS T. Ozawa and H. Takahashi Departent of Electrical Engineering Faculty of Engineering, Kyoto University Kyoto, Japan 606 Abstract. In
More informationResearch on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm
roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,
More informationCLUSTERING OF AE SIGNAL AMPLITUDES BY MEANS OF FUZZY C-MEANS ALGORITHM
The 12 th International Conference of the Slovenian Society for Non-Destructive Testing»Application of Conteporary Non-Destructive Testing in Engineering«Septeber 4-6, 213, Portorož, Slovenia More info
More informationA Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada
More informationApproximate String Matching with Reduced Alphabet
Approxiate String Matching with Reduced Alphabet Leena Salela 1 and Jora Tarhio 2 1 University of Helsinki, Departent of Coputer Science leena.salela@cs.helsinki.fi 2 Aalto University Deptartent of Coputer
More informationHIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES
HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES Benjain Lehann*, Konstantinos Siantidis*, Dieter Kraus** *ATLAS ELEKTRONIK GbH Sebaldsbrücker Heerstraße 235 D-28309 Breen, GERMANY Eail: benjain.lehann@atlas-elektronik.co
More informationData Acquisition of Obstacle Shapes for Fish Robots
Proceedings of the 2nd WEA International Conference on Dynaical ystes and Control, Bucharest, oania, October -17, 6 Data Acquisition of Obstacle hapes for Fish obots EUNG Y. NA, DAEJUNG HIN, JIN Y. KIM,
More informationMGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor
International Journal of Coputer Theory and Engineering, Vol 5, No, February 0 MGS-SIFT: A New Illuination Invariant Feature Based on SIFT Descriptor Reza Javanard Alitappeh and Fariborz Mahoudi Abstract
More informationReal-Time Detection of Invisible Spreaders
Real-Tie Detection of Invisible Spreaders MyungKeun Yoon Shigang Chen Departent of Coputer & Inforation Science & Engineering University of Florida, Gainesville, FL 3, USA {yoon, sgchen}@cise.ufl.edu Abstract
More informationSimulated Sensor Reading. Heading. Y [m] local minimum ; m. local maximum ; M. discontinuity ; D. connection ; c X [m]
Localization based on Visibility Sectors using Range Sensors Sooyong Lee y Nancy. Aato Jaes Fellers Departent of Coputer Science Texas A& University College Station, TX 7784 fsooyong,aato,jpf938g@cs.tau.edu
More informationWavelet. Coefficients. Fmicros() (micros) Wavelet. Wavelet Coefficients. Fmasses() (masses) Wavelet Coefficients (stellate) Fstellate()
Enhanceent via Fusion of Maographic Features Iztok oren y, Andrew Laine z, and Fred Taylor y y Dept. of Electrical and Coputer Engineering z Center for Bioedical Engineering University of Florida, Gainesville,
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationLeveraging Relevance Cues for Improved Spoken Document Retrieval
Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,
More information