Earthenware Reconstruction Based on the Shape Similarity among Potsherds
|
|
- Hillary Garrett
- 6 years ago
- Views:
Transcription
1 Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya , Jaan 2 Toyota National College of Technology, 2-1 Eisei-cho, Toyota , Jaan (Received August 13, 2000; Acceted January 29, 2001) Keywords: Earthenware Reconstruction, Pattern Analysis, Comuter Grahics, Grahical Visualization Abstract. This aer rooses an earthenware reconstruction system, which can automatically reconstruct some earthenware from numerous given otsherds in two dimensional grayscale images. The system suoses that given otsherds are thin and moderately flat and small. Some earthenware having three dimensional shae, such as crocks, can be reconstructed by the system within the suosition. The system erforms earthenware reconstruction through two hases. At the first hase, otsherds are joining automatically in two dimensions. An efficient joint detection algorithm is roosed at the hase. At the second hase, three dimensional shae is recovered by adequate three dimensional transformation. In this aer, some exerimental results of reconstruction from numerous otsherds are also reorted. 1. Introduction In the field of archaeology, the shae of earthenware offers significant knowledge of not only the era when it is used, but also ancestor s life style and cultural interchange. Thus, it is very imortant to reconstruct earthenware from excavated otsherds. Reconstruction of earthenware, however, is attended with difficulties, due to a numerous excavation of otsherds, weathering and lack of arts. The reconstruction, therefore, imoses a heavy task on archaeologists, and a numerous earthenware has not been reconstructed yet. In order to reduce the task of the reconstruction, we have develoed a system, which can automatically reconstruct earthenware from given otsherds by KANOH (2000). In general, earthenware should be reconstructed in three dimensions, because otsherds have three dimensional shae. We are taking our stand on that some earthenware shaed in three dimensions can be reconstructed from otsherds in two dimensional images, if the earthenware consists of numerous otsherds, and if each of the otsherds is adequately small. In this aer, at the beginning of this research, we suose that otsherds, whose character in shae are restricted to thin and moderately flat and small (e.g., see Fig. 1), are given, and we consider reconstructing earthenware from the otsherds in two dimensional 77
2 78 M. KANOH et al. Fig. 1. Images of otsherds. grayscale. In this aer, firstly as techniques for reconstruction in two dimensions, we roose a method for detection of salient feature and calculation of salient value from contours of otsherds, and then roose an efficient joint detection algorithm considering comlexity of contours. We then move on to a method for recovering three dimensional shae. We have imlemented an earthenware reconstruction system with the roosed algorithm and method, and shown good erformance in reconstruction of a cylindrical clay figurine (called ento-haniwa in Jaanese), in addition to flat objects, such as lates, otlids, flat arts of earthenware, and so on. 2. System Overview The section gives a brief descrition of our earthenware reconstruction system executable on Windows PC. A full detail of the system is given in the later sections. Figure 2 shows an overview of the system. The system has two hases: ieces-joining hase and shae-recovery hase. In our system, given numerous otsherds are reconstructed into some earthenware through the two hase with the following rocedures. Phase 1: ieces-joining 1) Detection of contours The system detects contours from inut images of otsherds. In the rocedure, we adot the g-snake model roosed by LAI and CHIN (1993, 1995), which can extract a contour of any object from an observational image.
3 Earthenware Reconstruction Based on the Shae Similarity among Potsherds 79 Fig. 2. An overview of the earthenware reconstruction system. 2) Detection of salient oints Each of contours is divided into some exanded curves called sub-contour by the salient oints in the rocedure. These sub-contours are candidates for joints. 3) Joint detection For each sub-contour, salient value is calculated, and then, for all airs of subcontours, similarities are evaluated by the salient values. The most similar air is selected after that. 4) Joint If the similarity of selected air satisfies some condition, two otsherds having these sub-contours are joined. The system executes the iterations of series of rocedures 3) and 4), and finally, oututs some lane images of reconstructed earthenware. Phase 2: shae-recovery 5) Checking the ossibility In this rocedure, the lane images generated at the above hase are checked about the ossibility of three dimensional shae recovery. Once some images ass the check, the system roceeds to the next rocedure with the images; otherwise the system terminates with the lane images of reconstructed earthenware. 6) Recovery of the three dimensional shae The system recovers three dimensional shae of the earthenware from the lane images with adequate three dimensional transformation. After this hase, the system oututs three dimensional images of reconstructed earthenware. 3. Detection of Salient Points Contours detected from given otsherds should be divided into sub-contours by salient oints. In our system, the sub-contours are considered candidates for joint, and the shae of sub-contour is utilized as a criterion for joint detection. Accordingly, dividing contours is imortant in terms of erformance of the system.
4 80 M. KANOH et al. Fig. 3. Contours of otsherds. Fig. 4. Divided contours by salient oints. Paying attention to reconstructed earthenware, a contour of a otsherd is almost divided into joints by salient oints such that the oints become vertexes constructing a olygon which aroximates the contour with as few vertexes as ossible. We, therefore, adot ROSENFELD and JOHNSTON (1973) s method for detecting salient oints having above roerty. Figure 4 shows the result of detecting salient oints from contours shown in Fig Joint Detection 4.1. Salient value We give the P-tye Fourier descritors roosed by UESAKA (1985, 1986) to salient values for shae of sub-contours. Using the descritors, we evaluate similarity between two
5 Earthenware Reconstruction Based on the Shae Similarity among Potsherds 81 sub-contours. The descritors are reresented by the Fourier transform of curves and characterized as follows: It is alicable to exanded curves. Two endoints of a reroduced curve always corresond to two endoints of the original one, resectively. Information about a certain shae of an original curve is concentrated in low frequency range. A Curve is reresented by only the angular function. In earthenware reconstruction, the shae of a sub-contour is not comletely equal to the shae of its joining air because of weathering and so on. The P-tye Fourier descritors are, therefore, alicable to joint detection. A salient value c N (k) of a sub-contour c is calculated by low-ass sectrum with cut frequency N of Fourier transformation as follows: c N n 1 1 ( k)= ω() i ex ( j2πik / n) k = N,..., N, 1 n i= 0 ( ) () where ω(i) is the P-tye exression of c and n is an enough large natural number. For more recise, lease refer to UESAKA (1985, 1986). Using the salient value, similarity ε a,b (φ) between sub-contour a and b can be evaluated by the following equation: N 2 ( )= ( ) ( ) ( ) ( = ) ( ) εab, φ an k ex jφ bn k φ 0,..., 2π, 2 k= N where a N (k) and b N (k) denote the low-ass sectrums of P-tye Fourier descritors of a and b, resectively Shae similarity The P-tye Fourier descritors are invariant under translations, and changes of the scale. Rotations of an original curve are reresented by the descritors multilied by ex(jφ). It follows from Eq. (2) that b becomes more similar to a when ε a,b (φ) gets nearer to zero. It also follows that ε a,b (φ) = 0 when the shae of b is comletely equivalent to the shae of a. In our system, we, therefore, define the shae similarity between a and b by the following equation: ss( a, b)= min 1 φ εab,. φ ( ) () 3 The above salient value and similarity are also adoted by the existent work in HORI (1999).
6 82 M. KANOH et al JDID In our system, an efficient joint detection algorithm considering comlexity of contours, JDID roosed by KANOH (2000), is imlemented. The algorithm reduces comutational cost of joint detection drastically, therefore numerous otsherds can be reconstructed at once. For a contour, the algorithm considers some contours aroximating it by different recision, shae-recision, and suitably selects one aroximation for calculating shae similarity by comlexity of the contour. For each sub-contour c, the algorithm considers sequential lines s(c)s with case that shae-recision s S = 0,..., s S (shown in Fig. 5), where s S is uer bound of shaerecision. It should be noticed that for all c, s(c) can aroximate c more accurately with case that s S is higher. Here, s i (c) denotes the sequential line of sub-contour c with its shae-recision s S = i. Figure 6 shows an outline of search trees constructed by JDID. The search begins at the lowest shae-recision. In the figure, the leftmost tree, for examle, shows joint detection from two otsherds A and B. The leftmost branch in the tree, for examle, shows Fig. 5. Sequential lines with different shae-recisions. Fig. 6. An outline of search trees constructed by JDID.
7 Earthenware Reconstruction Based on the Shae Similarity among Potsherds 83 a comarison of shae between two sub-contours a 1 and b 1 in A and B resectively. In the branch, a node at the deth of i (i > 0) has two sequential lines s i 1 (a 1 ) and s i 1 (b 2 ). A node at the deeer deth has sequential lines with their higher shae-recision. The search roceeds in the breadth-first manner with iterative deeening (KORF, 1985a, b). Node exansion at the deth of i behaves intuitively as follows: i) calculate shae similarity ss(s i 1 (a), s i 1 (b)), and then judge whether the air is a joint or not, ii) from the above judgment, delete nodes containing inconsistent airs (see nodes marked with in Fig. 6), iii) go on in either of following three ways according to the number of remaining nodes at the same deth: zero: one: terminate the search in failure, terminate the search in success, and detect the air of sub-contours in the node as joint, more than one: generate a descendant node, which contains air (s i (a), s i (b)) of subcontours, with their shae-recision s S = i. The search iterates the above node exansion in breadth-first manner with successively heightening shae-recision. In the last of this section, let us discuss the of JDID for our earthenware reconstruction system. Although there generally exists more than one joint air in given otsherds, JDID detects only one joint air at once. In other words, our system erforms reconstruction of earthenware by executing JDID successively for each ste of joining. At one ste, JDID dose not consider global evaluation (i.e., considering not all combination of sub-contours for all stes of joining) for selection of the most similar air, but considers local evaluation (i.e., considering all combination of sub-contours at the one ste). Earthenware reconstructed by our system, thus, cannot always have an otimal combination of joint airs, while the most similar air selected by JDID is the best in each ste, that is, our system finds quasiotimal solution. Considering global evaluation for selection causes that earthenware reconstruction becomes a NP-hard roblem, and it is almost imossible to roose an otimal algorithm which can solve the roblem in adequate execution time. JDID, therefore, aims to detect a air efficiently, which can be adequate joint air for earthenware reconstruction. For more recise about JDID algorithm, lease refer to KANOH (2000). 5. Three Dimensional Shae Recovery In this section, we describe a technique for shae-recovery hase in our system: recovery of three dimensional shae from lane images of earthenware reconstructed at ieces-joining hase (see Sec. 2). In general, earthenware having solid shae should be reconstructed from otsherds reresented in three dimensions. The technique is an attemt for our system to reconstruct earthenware, having solid shae, from two dimensional images of its otsherds. In our system, it should be noticed that all inut otsherds have character restricted in shae: thin and moderately flat and small. In shae-recovery hase, by two rocedures, a lane image of reconstructed earthenware is transformed into a three dimensional image reresenting solid shae of the earthenware. The rocedures are described briefly in the following sections.
8 84 M. KANOH et al Checking the ossibility This rocedure checks the lane image about the ossibility of three dimensional shae recovery. The check is whether a contour of the lane image contains any joint air of sub-contours and the air is configurationally consistent, or not. The rocedure can be done efficiently by utilizing our roosed JDID algorithm. If some joint air is found, the lane image is cognizable as a figure to which a solid object is develoed Recovery of the three dimensional shae In this rocedure, the system recovers three dimensional shae of the earthenware from the develoment figure with adequate three dimensional transformation. By the transformation, a develoment figure behaves intuitively as follows. Firstly, the airs in the figure detected by the above rocedure are joined, and the figure has one closed-sace constructed in three dimensions. And then, the figure is gradually modified so that the volume of its closed-sace becomes the largest. In case that the figure is to grow into cylinder shae or cone shae (such like a aer cu), the transformation can achieve drastic efficiency by means of some geometrical characteristics. The secialized transformation is shown in Aendix. 6. Exerimental Results We have imlemented earthenware reconstruction system in C++ on a PentiumIII 500 MHz running Windows PC. We have also made some exeriments of earthenware reconstruction from excavated otsherds. This section shows two reresentative exeriments verifying effectiveness of our system; one is for efficiency in ieces-joining hase, and another is for erformance of shae-recovery hase. In the exeriments, arameters for our system, N = 5 and n = 64 2 i, where i is a value of shae-recision Efficiency in ieces joining In order to verify efficiency of ieces-joining hase, we have given 35 otsherds shown in Fig. 1 to our system. Figure 7 shows earthenware reconstructed by our system. In this articular examle, the result indicates that our system can correctly and comletely reconstruct 8 ieces of earthenware from given otsherds. We have, moreover for effectiveness of JDID, comared execution time of our system with a naive system, by changing the number of otsherds. In the naive system, joint detection is executed with shae-recision fixed on the uer bound. Figure 8 shows the exerimental results. The solid line in the figure shows the runtime by our system, while the broken line is those by the naive system. The results indicates that our system embedded with JDID becomes faster than the naive system as the number of otsherds increases. Our system, for examle of 35 otsherds shown in Fig. 1, takes (sec.) to erform all reconstruction, and the execution time is about 7.6 times faster than naive system Performance of three dimensional shae recovery We have also made an exeriment for recovery of three dimensional shae of cylindrical clay figurines. Our aim of this exeriment is to ascertain that our system can correctly recover the three dimensional shae from given otsherds. This exeriment,
9 Earthenware Reconstruction Based on the Shae Similarity among Potsherds 85 Fig. 7. Outut images. Fig. 8. Exerimental results. therefore, requires a comlete set of otsherds, which can show the erfect shae of reconstructed earthenware in advance. We, thus, took hotograhs* of a figurine reconstructed by archaeologists, and made inut images of otsherds by croing the hotograhs along their contours. After the above manner, 39 otsherds shown in Fig. 9 are inutted to our system. *At the shooting, the figurine is settled on a turntable aligned lumb in the face of a camera, and hotograhs are taken from the whole direction.
10 86 M. KANOH et al. Fig. 9. Inut images. Fig. 10. An outut image. Figure 10 shows the result of ieces-joining hase for the otsherds. Figures 11 and 12 show the result of three dimensional shae recovery from the lane image in Fig. 10. In this articular examle, the result shows satisfactory erformance as three dimensional shae recovery. 7. Conclusion In this aer, we roosed an earthenware reconstruction system, which can automatically reconstruct earthenware from given otsherds. As methods for imroving the system erformance, we roosed an efficient joint detection algorithm (JDID) considering comlexity of contours, and imlemented a method of recovering three
11 Earthenware Reconstruction Based on the Shae Similarity among Potsherds 87 Fig. 11. The three dimensional image of a reconstructed figurine. Fig. 12. The three dimensional image of a reconstructed figurine (another angle). dimensional shae of reconstructed earthenware. We also made some exeriments on reconstructing many excavated otsherds, and reorted two reresentative results. One result shows high erformance of correct and comlete ieces joining with JDID. Another indicates satisfactory erformance as three dimensional shae recovery of a cylindrical clay figurine. In general, it is difficult to imlement an efficient, accurate and robust three dimensional transformation which can recover the solid shae from an arbitrary develoment figure. We have, resently, considered an energy minimization method as a key strategy to solve the above roblem, and we will introduce the method into our earthenware reconstruction system in forthcoming aers.
12 88 M. KANOH et al. We are grateful to Nagoya City Miharashidai Archaeological Museum for excavated otsherds. This work was funded in art by Grant-in-Aid for Scientific Research Program of Jaan Society for the Promotion of Science. Aendix: Three Dimensional Shae Recovery Using Geometrical Characteristic A develoment figure can be transformed into cylinder shae or circular cone shae (such like a aer cu) by the following three dimensional coordinate transformation. Let c and d be sub-contours included in the develoment figure, and let (c, d) be a joint air of sub-contours detected from the develoment figure. Further let (v c1, v d1 ) and (v c2, v d2 ) be airs of corresonding endoints of c and d when c and d are joined, resectively (see Fig. A1). Firstly, the develoment figure is rotated on an x-y orthogonal coordinate system, such that a straight line which connects v c1 and v d1 becomes arallel to x-axis. And then, transformed shae from the figure are refigured as either a cylinder or a circular cone by the following condition. a cylinder: a circular cone: ( vc1vd1 vc2vd2 ) < α vc1vd1 ( vc1vd1 vc2vd2 ) α, v v c1 d1 ( A1) where α is a arameter. Secondly, any oints in the develoment figure are maed onto the three dimensional coordinate system. Let be an arbitrary oint in the develoment figure laid out above, and Fig. A1. Two tyes of ceveloment figure which is alicable to the efficient transformation method.
13 Earthenware Reconstruction Based on the Shae Similarity among Potsherds 89 let the coordinates of be (x, y ). Further let be an arbitrary oint in an orthogonal three dimensional coordinate system, and let the coordinates of be (x, y, z ). Then, is maed onto by either of the following two ways. The case of a cylinder: x y z v v c1 d1 = cos( φ ) 2π = y v v c1 d1 = ( φ ) 2π sin, ( A2) where φ is determined by the following formula: φ 2πx =. ( A3) v v c1 d1 The case of a circular cone: x y z = r cos( φ ) = l = r sin ( φ ), ( A4) where l, r and φ are determined as follows: l = o, ( A5) c r φ lθ 2π, = ( A6 ) 2πθ = ( ) Θ, A7 where o c is the center of a circle including arc vc1vd1, and Θ be an center angle of vc v and θ denotes the angle between x-axis and o c. 1 d1,
14 90 M. KANOH et al. REFERENCES HORI, K., IMAI, M. and OGASAWARA, T. (1999) Joint detection for otsherds of broken earthenware, Proceedings of Comuter Vision and Pattern Recognition 99, 2, KANOH, M., KATO, S. and ITOH, H. (2000) Efficient joint detection considering comlexity of contours, The 6th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2000), KORF, R. E. (1985a) Deth-first iterative-deeening: An otimal admissible tree search, Artif. Intell., 27, KORF, R. E. (1985b) Iterative-deeening-A*: An otimal admissible tree search, in Proc. of the 9th IJCAI, LAI, K. F. and CHIN, L. (1993) On regularization, formulation, and initialization of the active contour models (snakes), Asian Conference on Comuter Vision, LAI, K. F. and CHIN, L. (1995) Deformable contours: Modeling and extraction, IEEE Trans. Pattern Analysis and Machine Intelligence, 17, No. 11, ROSENFELD, A. and JOHNSTON, E. (1973) Angle detection on digital curves, IEEE Transactions on Comuters, 22, UESAKA, Y. (1985) Sectral analysis and comlexity of form, Proceedings of the 8th Symosium on Alied Functional Analysis, UESAKA, Y. (1986) Sectral analysis of form based on Fourier descritors, Science on Form, Proceedings of the 1st International Symosium for Science on Form,
An Earthenware Reconstruction System Considering Color Pattern and Shape Similarities
Original Paper Forma, 19, 413 425, 2004 An Earthenware Reconstruction System Considering Color Pattern and Shape Similarities Syogo YASUHARA 1, Shohei KATO 1 *, Satoshi KATO 2 and Hidenori ITOH 1 1 Nagoya
More informationStereo Disparity Estimation in Moment Space
Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University
More informationEfficient Parallel Hierarchical Clustering
Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore
More informationAn Efficient Coding Method for Coding Region-of-Interest Locations in AVS2
An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China
More informationAUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.
inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.
More informationLearning Motion Patterns in Crowded Scenes Using Motion Flow Field
Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical
More informationShort Papers. Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution 1 INTRODUCTION
466 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE VOL 2 NO 5 MAY 999 Short Paers Symmetry Detection by Generalized Comlex (GC) Moments: A Close-Form Solution Dinggang Shen Horace HS I
More informationSensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network
1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann
More informationRobust Motion Estimation for Video Sequences Based on Phase-Only Correlation
Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Loy Hui Chien and Takafumi Aoki Graduate School of Information Sciences Tohoku University Aoba-yama 5, Sendai, 98-8579, Jaan
More informationA Model-Adaptable MOSFET Parameter Extraction System
A Model-Adatable MOSFET Parameter Extraction System Masaki Kondo Hidetoshi Onodera Keikichi Tamaru Deartment of Electronics Faculty of Engineering, Kyoto University Kyoto 66-1, JAPAN Tel: +81-7-73-313
More informationMATHEMATICAL MODELING OF COMPLEX MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT
MATHEMATICAL MODELING OF COMPLE MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT V.N. Nesterov JSC Samara Electromechanical Plant, Samara, Russia Abstract. The rovisions of the concet of a multi-comonent
More informationA Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems
A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems Cheng-Yuan Chang and I-Lun Tseng Deartment of Comuter Science and Engineering Yuan Ze University,
More informationLecture 2: Fixed-Radius Near Neighbors and Geometric Basics
structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric
More informationLecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)
Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual
More informationPerception of Shape from Shading
1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk
More informationImproved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties
Imroved heuristics for the single machine scheduling roblem with linear early and quadratic tardy enalties Jorge M. S. Valente* LIAAD INESC Porto LA, Faculdade de Economia, Universidade do Porto Postal
More informationCENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE
CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE Petra Surynková Charles University in Prague, Faculty of Mathematics and Physics, Sokolovská 83,
More informationFace Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern
Face Recognition Based on Wavelet Transform and Adative Local Binary Pattern Abdallah Mohamed 1,2, and Roman Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville, Louisville,
More informationA Novel Iris Segmentation Method for Hand-Held Capture Device
A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,
More information3D Surface Simplification Based on Extended Shape Operator
3D Surface Simlification Based on Extended Shae Oerator JUI-LIG TSEG, YU-HSUA LI Deartment of Comuter Science and Information Engineering, Deartment and Institute of Electrical Engineering Minghsin University
More informationFace Recognition Using Legendre Moments
Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,
More informationCross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,
CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter
More informationMatlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems
Matlab Virtual Reality Simulations for otimizations and raid rototying of flexible lines systems VAMVU PETRE, BARBU CAMELIA, POP MARIA Deartment of Automation, Comuters, Electrical Engineering and Energetics
More informationAn Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal
International Journal of Information and Electronics Engineering, Vol. 1, No. 1, July 011 An Efficient VLSI Architecture for Adative Rank Order Filter for Image Noise Removal M. C Hanumantharaju, M. Ravishankar,
More informationSubmission. Verifying Properties Using Sequential ATPG
Verifying Proerties Using Sequential ATPG Jacob A. Abraham and Vivekananda M. Vedula Comuter Engineering Research Center The University of Texas at Austin Austin, TX 78712 jaa, vivek @cerc.utexas.edu Daniel
More informationAUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY
AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com
More informationUPDATING ALGORITHMS FOR CONSTRAINT DELAUNAY TIN
UPDATING ALGORITMS FOR CONSTRAINT DELAUNAY TIN WU LiXin a,b WANG YanBing a, c a Institute for GIS/RS/GPS & Subsidence Engineering Research, China Uni Mining & Technology, Beijing, China, 100083 - awulixin@263.net,
More informationA CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH
A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu
More informationIMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model
IMS Network Deloyment Cost Otimization Based on Flow-Based Traffic Model Jie Xiao, Changcheng Huang and James Yan Deartment of Systems and Comuter Engineering, Carleton University, Ottawa, Canada {jiexiao,
More informationVehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments
Proceedings of 0 4th International Conference on Machine Learning and Comuting IPCSIT vol. 5 (0) (0) IACSIT Press, Singaore Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments
More informationSKIN CANCER LESION CLASSIFICATION USING LBP BASED HYBRID CLASSIFIER
DOI: htt://dx.doi.org/10.26483/ijarcs.v8i7.4469 Volume 8, No. 7, July August 2017 International Journal of Advanced Research in Comuter Science RESEARCH PAPER Available Online at www.ijarcs.info ISSN No.
More informationSwift Template Matching Based on Equivalent Histogram
Swift emlate Matching ased on Equivalent istogram Wangsheng Yu, Xiaohua ian, Zhiqiang ou * elecommunications Engineering Institute Air Force Engineering University Xi an, PR China *corresonding author:
More informationGEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER
GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,
More informationEVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM
EVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM R.S. Radovanovic*, W.F. Teskey*, N.N. Al-Hanbali** *University of Calgary, Canada Deartment of Geomatics Engineering rsradova@ucalgary.ca
More informationA NN Image Classification Method Driven by the Mixed Fitness Function
Comuter and Information Science November, 2009 A NN Image Classification Method Driven by the Mixed Fitness Function Shan Gai, Peng Liu, Jiafeng Liu & Xianglong Tang School of Comuter Science and Technology,
More informationSpace-efficient Region Filling in Raster Graphics
"The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich
More informationUsing Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification
Using Rational Numbers and Parallel Comuting to Efficiently Avoid Round-off Errors on Ma Simlification Maurício G. Grui 1, Salles V. G. de Magalhães 1,2, Marcus V. A. Andrade 1, W. Randolh Franklin 2,
More informationDirected File Transfer Scheduling
Directed File Transfer Scheduling Weizhen Mao Deartment of Comuter Science The College of William and Mary Williamsburg, Virginia 387-8795 wm@cs.wm.edu Abstract The file transfer scheduling roblem was
More informationCMSC 425: Lecture 16 Motion Planning: Basic Concepts
: Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).
More informationEquality-Based Translation Validator for LLVM
Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented
More informationRobust Real Time Pattern Matching using Bayesian Sequential Hypothesis Testing
Robust Real Time Pattern Matching using Bayesian Sequential Hyothesis Testing Ofir Pele and Michael Werman Abstract This aer describes a method for robust real time attern matching. We first introduce
More informationDevelopment of an automated detection system for microcalcifications on mammograms by using the higher-order autocorrelation features
Develoment of an automated detection system for microcalcifications on mammograms by using the higher-order autocorrelation features Y. Ohe, N. Shinohara, T. Hara, H. Fujita, T. Endo *, T. Iwase ** Deartment
More informationRandomized algorithms: Two examples and Yao s Minimax Principle
Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum
More informationA Texture Based Matching Approach for Automated Assembly of Puzzles
A Texture Based Matching Aroach for Automated Assembly of Puzzles Mahmut amil Saırolu 1, Aytül Erçil Sabancı University 1 msagiroglu@su.sabanciuniv.edu, aytulercil@sabanciuniv.edu Abstract The uzzle assembly
More information2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image
-D Fir Filter Design And Its Alications In Removing Imulse Noise In Digital Image Nguyen Thi Huyen Linh 1, Luong Ngoc Minh, Tran Dinh Dung 3 1 Faculty of Electronic and Electrical Engineering, Hung Yen
More informationSPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1
SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin, Mohammad Ali Masnadi-Shirazi 1 1. Shiraz University, Shiraz, Iran,. Sabanci University, Istanbul, Turkey ssamadi@shirazu.ac.ir,
More informationExperiments on Patent Retrieval at NTCIR-4 Workshop
Working Notes of NTCIR-4, Tokyo, 2-4 June 2004 Exeriments on Patent Retrieval at NTCIR-4 Worksho Hironori Takeuchi Λ Naohiko Uramoto Λy Koichi Takeda Λ Λ Tokyo Research Laboratory, IBM Research y National
More informationTheoretical Analysis of Graphcut Textures
Theoretical Analysis o Grahcut Textures Xuejie Qin Yee-Hong Yang {xu yang}@cs.ualberta.ca Deartment o omuting Science University o Alberta Abstract Since the aer was ublished in SIGGRAPH 2003 the grahcut
More informationAn empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs
An emirical analysis of looy belief roagation in three toologies: grids, small-world networks and random grahs R. Santana, A. Mendiburu and J. A. Lozano Intelligent Systems Grou Deartment of Comuter Science
More informationLecture 8: Orthogonal Range Searching
CPS234 Comutational Geometry Setember 22nd, 2005 Lecture 8: Orthogonal Range Searching Lecturer: Pankaj K. Agarwal Scribe: Mason F. Matthews 8.1 Range Searching The general roblem of range searching is
More informationWavelet Based Statistical Adapted Local Binary Patterns for Recognizing Avatar Faces
Wavelet Based Statistical Adated Local Binary atterns for Recognizing Avatar Faces Abdallah A. Mohamed 1, 2 and Roman V. Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville,
More informationAn improved algorithm for Hausdorff Voronoi diagram for non-crossing sets
An imroved algorithm for Hausdorff Voronoi diagram for non-crossing sets Frank Dehne, Anil Maheshwari and Ryan Taylor May 26, 2006 Abstract We resent an imroved algorithm for building a Hausdorff Voronoi
More informationConvex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101
Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is
More informationExtracting Optimal Paths from Roadmaps for Motion Planning
Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu
More informationBayesian Oil Spill Segmentation of SAR Images via Graph Cuts 1
Bayesian Oil Sill Segmentation of SAR Images via Grah Cuts 1 Sónia Pelizzari and José M. Bioucas-Dias Instituto de Telecomunicações, I.S.T., TULisbon,Lisboa, Portugal sonia@lx.it.t, bioucas@lx.it.t Abstract.
More informationCALCULATION METHOD OF MILLING CONTACT AREA FOR BALL-END MILLING TOOL WITH TOOL INCLINATION ANGLE
U.P.B. Sci. Bull., Series D, Vol. 76, Iss. 3, 214 ISSN 1454-2358 CALCULATION METHOD OF MILLING CONTACT AREA FOR BALL-END MILLING TOOL WITH TOOL INCLINATION ANGLE Yishu HAO 1, Guoqing TANG 2, Meng ZHANG
More informationAUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH
AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH A. Prokos 1, G. Karras 1, E. Petsa 2 1 Deartment of Surveying, National Technical University of Athens (NTUA),
More informationSPITFIRE: Scalable Parallel Algorithms for Test Set Partitioned Fault Simulation
To aear in IEEE VLSI Test Symosium, 1997 SITFIRE: Scalable arallel Algorithms for Test Set artitioned Fault Simulation Dili Krishnaswamy y Elizabeth M. Rudnick y Janak H. atel y rithviraj Banerjee z y
More informationTexture Mapping with Vector Graphics: A Nested Mipmapping Solution
Texture Maing with Vector Grahics: A Nested Mimaing Solution Wei Zhang Yonggao Yang Song Xing Det. of Comuter Science Det. of Comuter Science Det. of Information Systems Prairie View A&M University Prairie
More informationEfficient Sequence Generator Mining and its Application in Classification
Efficient Sequence Generator Mining and its Alication in Classification Chuancong Gao, Jianyong Wang 2, Yukai He 3 and Lizhu Zhou 4 Tsinghua University, Beijing 0084, China {gaocc07, heyk05 3 }@mails.tsinghua.edu.cn,
More informationPrivacy Preserving Moving KNN Queries
Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,
More information10. Parallel Methods for Data Sorting
10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting... 1 10.1. Parallelizing Princiles... 10.. Scaling Parallel Comutations... 10.3. Bubble Sort...3 10.3.1. Sequential Algorithm...3
More informationOMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications
OMNI: An Efficient Overlay Multicast Infrastructure for Real-time Alications Suman Banerjee, Christoher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller Abstract We consider an overlay architecture
More informationMultipoint Filtering with Local Polynomial Approximation and Range Guidance
Multioint Filtering with Local Polynomial Aroximation and Range Guidance Xiao Tan, Changming Sun, and Tuan D. Pham The University of New South Wales, Canberra, ACT 2600, Australia CSIRO Comutational Informatics,
More informationA New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism
A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan Key Laboratory of Comuter System and Architecture Institute
More informationEfficient stereo vision for obstacle detection and AGV Navigation
Efficient stereo vision for obstacle detection and AGV Navigation Rita Cucchiara, Emanuele Perini, Giuliano Pistoni Diartimento di Ingegneria dell informazione, University of Modena and Reggio Emilia,
More informationFolded Structures Satisfying Multiple Conditions
Journal of Information Processing Vol.5 No.4 1 10 (Oct. 017) [DOI: 1197/isjji.5.1] Regular Paer Folded Structures Satisfying Multile Conditions Erik D. Demaine 1,a) Jason S. Ku 1,b) Received: November
More informationImproving Trust Estimates in Planning Domains with Rare Failure Events
Imroving Trust Estimates in Planning Domains with Rare Failure Events Colin M. Potts and Kurt D. Krebsbach Det. of Mathematics and Comuter Science Lawrence University Aleton, Wisconsin 54911 USA {colin.m.otts,
More informationDistributed Estimation from Relative Measurements in Sensor Networks
Distributed Estimation from Relative Measurements in Sensor Networks #Prabir Barooah and João P. Hesanha Abstract We consider the roblem of estimating vectorvalued variables from noisy relative measurements.
More informationDepth Estimation for 2D to 3D Football Video Conversion
International Research Journal of Alied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 6 (4): 475-480 Science Exlorer ublications Deth Estimation for 2D to 3D Football
More informationGrouping of Patches in Progressive Radiosity
Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate
More informationAN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY
AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY Andrew Lam 1, Steven J.E. Wilton 1, Phili Leong 2, Wayne Luk 3 1 Elec. and Com. Engineering 2 Comuter Science
More informationInteractive Image Segmentation
Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).
More informationPatterned Wafer Segmentation
atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of
More informationSource-to-Source Code Generation Based on Pattern Matching and Dynamic Programming
Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Weimin Chen, Volker Turau TR-93-047 August, 1993 Abstract This aer introduces a new technique for source-to-source code
More informationDetection of Occluded Face Image using Mean Based Weight Matrix and Support Vector Machine
Journal of Comuter Science 8 (7): 1184-1190, 2012 ISSN 1549-3636 2012 Science Publications Detection of Occluded Face Image using Mean Based Weight Matrix and Suort Vector Machine 1 G. Nirmala Priya and
More informationCross products Line segments The convex combination of two distinct points p
CHAPTER Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter
More informationInvariant Descriptors and Classifiers Combination for Recognition of Isolated Printed Tifinagh Characters
IJACSA Secial Issue on Selected aers from Third international symosium on Automatic Amazigh rocessing (SITACAM 3) Invariant Descritors and Classifiers Combination for Recognition of Isolated rinted Tifinagh
More informationsplit split (a) (b) split split (c) (d)
International Journal of Foundations of Comuter Science c World Scientic Publishing Comany ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES JIE WU Deartment of Comuter Science and Engineering
More informationMulticast in Wormhole-Switched Torus Networks using Edge-Disjoint Spanning Trees 1
Multicast in Wormhole-Switched Torus Networks using Edge-Disjoint Sanning Trees 1 Honge Wang y and Douglas M. Blough z y Myricom Inc., 325 N. Santa Anita Ave., Arcadia, CA 916, z School of Electrical and
More informationGraph Cut Matching In Computer Vision
Grah Cut Matching In Comuter Vision Toby Collins (s0455374@sms.ed.ac.uk) February 2004 Introduction Many of the roblems that arise in early vision can be naturally exressed in terms of energy minimization.
More informationImproved Image Super-Resolution by Support Vector Regression
Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort
More informationShape from Second-bounce of Light Transport
Shae from Second-bounce of Light Transort Siying Liu 1, Tian-Tsong Ng 1, and Yasuyuki Matsushita 2 1 Institute for Infocomm Research Singaore 2 Microsoft Research Asia Abstract. This aer describes a method
More informationConstrained Empty-Rectangle Delaunay Graphs
CCCG 2015, Kingston, Ontario, August 10 12, 2015 Constrained Emty-Rectangle Delaunay Grahs Prosenjit Bose Jean-Lou De Carufel André van Renssen Abstract Given an arbitrary convex shae C, a set P of oints
More informationPivot Selection for Dimension Reduction Using Annealing by Increasing Resampling *
ivot Selection for Dimension Reduction Using Annealing by Increasing Resamling * Yasunobu Imamura 1, Naoya Higuchi 1, Tetsuji Kuboyama 2, Kouichi Hirata 1 and Takeshi Shinohara 1 1 Kyushu Institute of
More informationIntroduction to Parallel Algorithms
CS 1762 Fall, 2011 1 Introduction to Parallel Algorithms Introduction to Parallel Algorithms ECE 1762 Algorithms and Data Structures Fall Semester, 2011 1 Preliminaries Since the early 1990s, there has
More informationShuigeng Zhou. May 18, 2016 School of Computer Science Fudan University
Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions
More informationTOPP Probing of Network Links with Large Independent Latencies
TOPP Probing of Network Links with Large Indeendent Latencies M. Hosseinour, M. J. Tunnicliffe Faculty of Comuting, Information ystems and Mathematics, Kingston University, Kingston-on-Thames, urrey, KT1
More informationAuto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4
Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4 M. Gajbe a A. Canning, b L-W. Wang, b J. Shalf, b H. Wasserman, b and R. Vuduc, a a Georgia Institute of Technology,
More informationEE678 Application Presentation Content Based Image Retrieval Using Wavelets
EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective
More informationModified Bloom filter for high performance hybrid NoSQL systems
odified Bloom filter for high erformance hybrid NoSQL systems A.B.Vavrenyuk, N.P.Vasilyev, V.V.akarov, K.A.atyukhin,..Rovnyagin, A.A.Skitev National Research Nuclear University EPhI (oscow Engineering
More informationAn accurate and fast point-to-plane registration technique
Pattern Recognition Letters 24 (23) 2967 2976 www.elsevier.com/locate/atrec An accurate and fast oint-to-lane registration technique Soon-Yong Park *, Murali Subbarao Deartment of Electrical and Comuter
More informationWeight Co-occurrence based Integrated Color and Intensity Matrix for CBIR
Weight Co-occurrence based Integrated Color and Intensity Matrix for CBIR Megha Agarwal, 2R.P. Maheshwari Indian Institute of Technology Roorkee 247667, Uttarakhand, India meghagarwal29@gmail.com, 2rmaheshwari@gmail.com
More informationSelecting Discriminative Binary Patterns for a Local Feature
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 3 Sofia 015 rint ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-015-0044 Selecting Discriminative Binary atterns
More information521493S Computer Graphics Exercise 3 (Chapters 6-8)
521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of
More informationA simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect
A simulated Linear Mixture Model to Imrove Classification Accuracy of Satellite Data Utilizing Degradation of Atmosheric Effect W.M Elmahboub Mathematics Deartment, School of Science, Hamton University
More informationAN INTEGER LINEAR MODEL FOR GENERAL ARC ROUTING PROBLEMS
AN INTEGER LINEAR MODEL FOR GENERAL ARC ROUTING PROBLEMS Philie LACOMME, Christian PRINS, Wahiba RAMDANE-CHERIF Université de Technologie de Troyes, Laboratoire d Otimisation des Systèmes Industriels (LOSI)
More informationLeak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method
ITB J. Eng. Sci. Vol. 39 B, No. 1, 007, 1-19 1 Leak Detection Modeling and Simulation for Oil Pieline with Artificial Intelligence Method Pudjo Sukarno 1, Kuntjoro Adji Sidarto, Amoranto Trisnobudi 3,
More informationDiscrete shading of three-dimensional objects from medial axis transform
Pattern Recognition Letters 20 (1999) 1533±1544 www.elsevier.nl/locate/atrec Discrete shading of three-dimensional objects from medial axis transform Jayanta Mukherjee a, *, M. Aswatha Kumar b, B.N. Chatterji
More informationlevel 0 level 1 level 2 level 3
Communication-Ecient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram? Mohamadou Diallo 1, Afonso Ferreira 2 and Andrew Rau-Chalin 3 1 LIMOS, IFMA, Camus des C zeaux,
More information