High Quality Offset Printing An Evolutionary Approach
|
|
- Byron Armstrong
- 5 years ago
- Views:
Transcription
1 High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany Ralf Salomon Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany ABSTRAT Print media are still very imortant for everyone's daily life. urrent efforts are concerned with the alication of the wellestablished offset-rinting technology to other media, articularly cardboards, which require some substantial adatations. To this end, this aer roosed a new secific re-rocessing stage. This re-rocessing stage can be configured by several arameters. This aer otimizes these arameter settings by using evolution strategies. It turns out that this otimization reduces the required energy and the number of wrongly generated ixels by about 15%, resectively. ategories and Subject Descritors J.7 [omuter Alications]: omuter in other Systems Industrial control, Process control. General Terms Algorithms, Performance, Design, Economics, Reliability Keywords Image rocessing, evolutionary algorithms, industrial alication 1. INTRODUTION Print media, such as newsaers, journals, books, and flyers, are still imortant information sources in everyday life. These media are the result of a well-established rinting rocess in which a rinting machine uses a rinting late to distribute liquid color onto the actual media, i.e., aer. In this rocess, the rinting content, i.e., letters, symbols, and grahics, is encoded on the rinting late's surface in form of a hysical structure. This structure consists of reverses and dots, with the latter being the means to bring the color onto the aer. This rocess is widely known as offset rinting, and sketched in Figure 1. Every age requires a age-secific rinting late, which is generally reared in three stes. First, a steel or aluminum late, covered with some light-sensitive olymeric material, is brought into another machine, called a setter, which is deicted in Figure 2. Then, the setter's exosing unit transfers the age's content onto the rinting late's surface. This content is normally stored as a digital image, which is a collection of individual ixels, on a (host) comuter. During the exosure, the olymeric material changes its hysical roerties: those areas that are exosed to light hardens, the others not. Finally, a subsequent chemical rocess removes the nothardened material such that later on, the exosed areas are able to transfer the liquid color. It might be mentioned here that some setters utilize laser light, others ultraviolet light with a wave length of about 360nm to 450nm. Due to the rinting late's size and the required resolution, the image cannot be transferred in a monolithic form. Rather, as is illustrated in Figure 3, the image is divided into stries. In stateof-the-art setters, an entire strie is rocessed by moving the exosure head from left to right or vice versa. During these movements, the image data is loaded and aroriately shifted line by line through the head's otical system (see, also, Aendix A). For regular rint media, such as aer, the offset rinting rocess is well established. Since offset rinting is of high quality and cost effective, current efforts try to also utilize it for other material, such as cardboard, wall aers, and the like. These new materials, however, are characterized by a much higher roughness, which in turn requires substantial modifications of the rinting late, called flexo rinting late: In order to ensure highquality rints, the difference between the rinting late's dots and reverses has to be much more ronounced. This in turn imoses new roblems to the exosing rocess: the main roblems are, as Section 2 discusses, that the rinting late s dots lack hysical stability and that the image runs out of focus due to the olymeric material's thickness. The exosing rocess is defined by several arameters, including the light's intensity, the exosure time, and the oint of focus. rinting late dot reverse Permission to make digital or hard coies of all or art of this work for ersonal or classroom use is granted without fee rovided that coies are not made or distributed for rofit or commercial advantage and that coies bear this notice and the full citation on the first age. To coy otherwise, or reublish, to ost on servers or to redistribute to lists, requires rior secific ermission and/or a fee. GEO 07, July 7 11, 2007, London, England, United Kingdom. oyright 2007 AM /07/ $5.00. ink disenser rint material (aer, cardboard, etc.) Figure 1: Simlified rint rocess
2 exosure head bearing rinting late late holder terminal Figure 2: The UV-Setter, courtesy of Punch Grahix Preress Germany, Ltd. In order to alleviate the roblems mentioned above, Section 3 rooses an image rerocessing method that rocesses images the same way the visual system of mammals does. This neuralnetwork-based aroach is defined by a set of arameters, called connections. With resect to the rinting's quality, these arameters are highly deendent on each other, and multi modal by their very nature. Therefore, Section 4 alies evolution strategies to evolve them. The results, as resented in Section 5, indicate that the roosed aroach leads a homogenous distribution of the light's energy, and therefore, a high rinting quality. Furthermore, otimally evolved arameter sets may reduce the exosing time by about 15%. Section 6 concludes this aer with a brief discussion. 2. PROBLEM DESRIPTION As has been mentioned in the introduction, flexo rinting lates are characterized by a significantly increased thickness of the light-sensitive olymeric material. This thickness means that the exosing light has to travel a longer distance through this material. Along this distance, the light diverges, since it has reviously assed a lens system (see, also, Aendix A). The roblem is that flexo lates cannot neglect this light divergence; rather, they have to deal with and comensate for it. Because the light diverges along its way through the olymeric material, a blob has varying diameters along the z-axis. This effect is illustrated in Figure 4, which shows four cross-sections along the z-axis. The increased size of the exosed area leads to two different effects. First: Due to the increased size of a blob in the bottom layers of the late, the energy er unit area decreases. In order to have enough energy to roerly harden the olymeric material, the total amount of light energy has to be increased. Due to mechanical constraints, this can be achieved only by slowing down the exosure rocess. This comensation, however, contradicts economical demands, which desire the rocess to be as fast as ossible. Second: an increased amount of global light energy also widens a ixels size at the to layer (light ixels are circles, rinting ixels are squares). This degrades the rinting quality significantly, because surious ixels may aear on the rinting material, In this aer, the term surious ixel refers to ixels that aear on the rint media, even though they are not in the data file. In summary, in order for single (isolated) ixels to roerly aear on the rinting late, the light energy has to be increased, which leads to other roblematic effects, e.g., surious ixels. In contrast to very thin rinting lates for regular aer material, flexo lates suffer from these effects and thus have to comensate for them. 3. THE PROPOSED APPROAH Section 2 has discussed that flexo rinting lates have to coe with certain exosure roblems. From a technical oint of view, the rearation of a rinting late can be seen as an image rocessing task in which a digital image is brought onto a hysical late. surface level moving directions image rocessing system exosed area unexosed area rintig late sensitive to UV-light Figure 3: Illustration of an exosing rocess base level Figure 4: Widening of a single, freestanding ixel (blue border)
3 Neuronal Network central ixel energy values original image different energy rocessing values for each ixel (all ixels rocessed) Figure 5: the neural network aroach The aroach resented in this aer inserts an image rerocessing stage that is executed during or rior to the exosure of the late (see, also, Section 6). The design of this rerocessing stage draws some insiration from how the mammalian visual system rocesses images: for every ixel, the brain alies local filters all of them having the same structure and rocessing the ixel's neighborhood [7]. This visual system oerates highly arallel, fault tolerant and reliable, and adative by its very nature. Thus, the aroached roosed here is called neurally rerocessed rinting late or NP³ for short throughout this aer. Figure 5 illustrates that like the biological visual system, NP³ considers a virtual neuron for every ixel. This neuron senses its corresonding image data, called the central ixel, as well as the ixel's neighborhood, which might be of 3x3 or 5x5 in size. This neuron calculates the ixel's exosure I from the image data P as follows: I = w (1) P with w denoting a connection weight or strength. Since all ixels are handled in the same way, all neurons and thus all connections w are identical. The roosed aroach seems rather simle and straightforward. However, the connections w are not indeendent of each other. Because of the light's divergence, every ixel also influences its neighbors by injecting some light energy to them. This in turn affects the determination of otimal values for the connections w. Both the strength and the number of influenced ixels deend on the chosen light geometry as is illustrated in Figure METHODS AND SIMULATION This section describes the evolutionary aroach, defines the fitness function, and sketches the simulation environment used for the exeriments. The evolutionary aroach: Because the arameters w are real-valued, exhibit significant eistatic interaction, and are multi-modal with resect to the fitness function 1, this aer uses evolution strategies [4] for the otimization of the connections w. 1 These roerties have been observed by reliminary exeriments that have involved classical steeest-descent methods. neighbour ixel energy values satial energy distribution Figure 6: Exosure settings Evolution strategies in general are a member of the class of heuristic oulation-based search rocedures known as evolutionary algorithms that incororate random variation and selection. Evolutionary algorithms rovide a framework that mainly consists of genetic algorithms [1], evolutionary rogramming [2], [3], and evolution strategies [5]. A genetic algorithm maintains a oulation of µ individuals, also called arents. In each generation, it generates λ offsring by coying randomly selected arents and alying variation oerators, such as mutation and recombination. It then assigns a fitness value (defined by a fitness or objective function) to each offsring. Deending on their fitness, each offsring is given a secific survival robability. Unless otherwise stated, this aer has used a (1+5)-evolution strategy, since the ertinent literature [4] indicates that this configuration of the number of arents and offsring yields the highest sequential fitness. The chosen notation also indicates that the arent of the next generation is selected from union of the current offsring and the revious arents. In addition, the chosen evolution strategies have also emloyed a ste size adatation. Furthermore, this aer considers rather small oulation sizes, since the ractical fitness evaluation is a very time-consuming rocess. It should be mentioned here that the evolutionary algorithm initializes its oulation members with w (i!=4) = 0 and w 4 = 8.5, which reresents the conditions without the rerocessing stage. The fitness function: The goal of the evolutionary rocess is to evolve a weight matrix, such that all ixels aear as given in the digital data file: that is, for black ixels the total light energy has to be above a threshold T, such that it withstands the chemical rocess; and obviously for white ixels, the total light energy has to be below this threshold. Mathematically, the fitness F for a single ixel is calculated as follows: 2 ( T E ) E > T; = 1 3 5( E T ) E < T; = 1 = 3 5( E T ) E > T; = 0 2 ( E) E < T; = 0 F (2)
4 with T denoting the threshold value, E denoting the energy value of Pixel and denoting the current state of ixel in that way that 1 constitutes a black ixel and 0 constitutes a white ixel, resectively. The offset 100 has been introduced in order to ronounce correctly exosed ixels. For illustration uroses, Figure 7 deicts the two cases, i.e., black and white ixels, of F. Then, the fitness function F sums the individual contributions F overall ixels P as follows: F = P F = 1. (3) Simulation environment: Because the evaluation of every fitness value by means of rearing a hysical rinting late is way too costly and time consuming, this aer has used a hysically lausible simulation software. This simulation software allows for the rocessing of arbitrarily configured test images, rovides the user with an aroriate grahical user interface, and suorts the setting off all relevant arameters, such as oulation sizes, lighting conditions, late arameters, etc. For the exeriments reorted in this aer, the simulation software has used the test image shown in Figure 8. In order to yield a recise evaluation, the simulation subdivides every ixel into 3x3 subixels. This way, the simulation software accounts for the fact that a light ixel is of circular geometry, whereas the image data contains square-shaed ixels. An examle is illustrated in Figure 6. The Figure also shows that the simulator treats the light beams as fine-grained normally distributed values. It can be seen that the Gaussian-shaed light beams account for the effect of overlaing ixels in a natural way. 5. RESULTS In order to asses the quality of the NP³ aroach roosed in this aer, this section also considers rinting lates that are exosed in the usual way, that is without any further rerocessing Fitness function Figure 8: Test image For the chosen test image, Figure 9 shows how the fitness evolves over time. It can be seen that in comarison to the standard exosure rocess, the evolution strategies reduce the fitness values (actually, error values) by about 60%. Figure 11 shows how the imroved fitness affects the rinting late. It can be seen that in comarison to the standard exosure rocedure, shown in Figure 12, the evolved rerocessing stage has significantly reduced number of surious ixels. For resentation uroses, Figure 10 shows two corresonding blow us. Already in this very small subfigure, the evolutionary algorithm has reduced the number of wrongly exosed ixels (red) from 32 to three. In addition, the rerocessing stage significantly reduces the total amount of the light energy by about 12%. Furthermore, the energy is much more homogeneously distributed, which has additional advantages for the hoto/chemical rocess, which is, however, beyond the scoe of this aer. It might be argued that other configurations than the chosen (1+5)-evolution strategy might yield better or worse erformance in terms of the exerimentation time. However, this question is not in the focus of this aer; rather, the goal is to achieve suerior solutions by alying evolutionary algorithms, because standard aroaches yielded solutions with limited utility. Furthermore, it might be mentioned again that with resect to hysical validations, the oulation sizes have to be small fitness value over 150 generations Fitness value =0 =1 fitness value Energy value generation Figure 7: Fitness function Figure 9: Fitness rogress
5 Figure 10: Exosed lates (detail view) 6. DISUSSION This aer has resented an alication from the area of offset rinting. The core of this alication is a machine that transfers a digital image onto a rinting late, which is being finished in a subsequent chemical rocess. Due to economical reasons, current develoments try to also utilize offset rinting to other media, such as cardboards. These media, however, are characterized by other hysical roerties, and thus require a modified exosure rocess. Since the direct usage of the image data leads to the generation of ixels that are actually not in the image data (surious ixels), this aer has roosed a rerocessing ste, called neurally rerocessed rinting late, that yields significant imrovements over state-of-the-art, rather standard exosing rocedures. These achievements are significant from an economical as well as quality-of-rinting oint of view. urrent develoments are integrating these otimizations into available market roducts. In the current aroach, the otimal values for the (virtual) connection weights w deend on the actual image data. This will require an additional, very short adatation hase for every new image. Even though this adatation can be executed offline, i.e., on a searate comuter, it can be considered a flaw of the current aroach. Therefore, further research will be dedicated to the develoment of an enhanced rerocessing stage in which the otimal arameter settings do not deend on the actual image content. Figure 12: lassical exosed rinting late Furthermore, future research will be develoing a custom-made hardware design, which will be based on state-of-the-art fieldrogrammable gate arrays (FPGAs) [6]. The exected advantage will be that both the adatation and the actual rerocessing can be done on the fly during the rearation of the rinting late. 7. AKNOWLEDGMENTS The authors gratefully thank Dr. Horst Steat, managing director at Punch Grahix Preress Germany Ltd. and John Hedde, director of research and develoment at Punch Grahix Preress Germany Ltd., for roviding the existing technology and the excellent cooeration. This research was suorted in art by the German federal ministry of education and research, grant number 03i4919B. 8. REFERENES [1] D.B. Fogel. Evolutionary omutation: Toward a New Philosohy of Machine Learning Intelligence. IEEE Press, NJ, [2] L.J. Fogel, Autonomous Automata. Industrial Research, 4:14-19, [3] D.E. Goldberg. Genetic Algorithms in Search, Otimization and Machine Learning. Addison-Wesley, Reading, MA, [4] I. Rechenberg, Evolutionsstrategie. Frommann-Holzboog, Stuttgart, [5] H.-P. Schwefel. Evolution and Otimum Seeking. John Wiley and Sons, NY [6] R. Joost, R. Salomon. Hardware-Software o-design in Practice: A ase Study in Image Processing, In Proceedings of the 32 nd Annual onference of the IEEE Industrial Electronics Society (IEON), Paris, France, Nov [7] D. Hubel. Eye, Brain, and Vision (Scientific American Library, No 22), W. H. Freeman, Figure 11: NP³
6 9. APPENDIX A Figure 13 shows the lens system of the UV setter used in this aer. A key feature of this articular lens system is the digital mirror device (DMD 2 ), which emloys 1024*768 individually controllable, tiny mirrors. An attached hardware controller switches every single mirror on and off according to the resent image data. The DMD is thus able to individually control the exosure of every single ixel. Figure 13: Otical system of the UV-Setter, courtesy of Punch Grahix Preress Germany, Ltd. 2 The DMD is manufactured by Texas Instruments Incororated
High Quality Offset Printing An Evolutionary Approach
High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany +49 381 498 7272 ralf.joost@uni-rostock.de
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 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 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 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 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 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 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 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 informationEfficient Processing of Top-k Dominating Queries on Multi-Dimensional Data
Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of
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 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 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 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 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 informationFigure 8.1: Home age taken from the examle health education site (htt:// Setember 14, 2001). 201
200 Chater 8 Alying the Web Interface Profiles: Examle Web Site Assessment 8.1 Introduction This chater describes the use of the rofiles develoed in Chater 6 to assess and imrove the quality of an examle
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 informationA BICRITERION STEINER TREE PROBLEM ON GRAPH. Mirko VUJO[EVI], Milan STANOJEVI] 1. INTRODUCTION
Yugoslav Journal of Oerations Research (00), umber, 5- A BICRITERIO STEIER TREE PROBLEM O GRAPH Mirko VUJO[EVI], Milan STAOJEVI] Laboratory for Oerational Research, Faculty of Organizational Sciences 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 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 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 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 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 informationReal Time Compression of Triangle Mesh Connectivity
Real Time Comression of Triangle Mesh Connectivity Stefan Gumhold, Wolfgang Straßer WSI/GRIS University of Tübingen Abstract In this aer we introduce a new comressed reresentation for the connectivity
More informationUse of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes
Use of Multivariate Statistical Analysis in the Modelling of Chromatograhic Processes Simon Edwards-Parton 1, Nigel itchener-hooker 1, Nina hornhill 2, Daniel Bracewell 1, John Lidell 3 Abstract his aer
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 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 informationA DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans
Available online at htt://ijdea.srbiau.ac.ir Int. J. Data Enveloment Analysis (ISSN 2345-458X) Vol.5, No.2, Year 2017 Article ID IJDEA-00422, 12 ages Research Article International Journal of Data Enveloment
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 informationAn Indexing Framework for Structured P2P Systems
An Indexing Framework for Structured P2P Systems Adina Crainiceanu Prakash Linga Ashwin Machanavajjhala Johannes Gehrke Carl Lagoze Jayavel Shanmugasundaram Deartment of Comuter Science, Cornell University
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 informationBuilding Better Nurse Scheduling Algorithms
Building Better Nurse Scheduling Algorithms Annals of Oerations Research, 128, 159-177, 2004. Dr Uwe Aickelin Dr Paul White School of Comuter Science University of the West of England University of Nottingham
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 informationBlind Separation of Permuted Alias Image Base on Four-phase-difference and Differential Evolution
Sensors & Transducers, Vol. 63, Issue, January 204,. 90-95 Sensors & Transducers 204 by IFSA Publishing, S. L. htt://www.sensorsortal.com lind Searation of Permuted Alias Image ase on Four-hase-difference
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 informationJ. Parallel Distrib. Comput.
J. Parallel Distrib. Comut. 71 (2011) 288 301 Contents lists available at ScienceDirect J. Parallel Distrib. Comut. journal homeage: www.elsevier.com/locate/jdc Quality of security adatation in arallel
More informationSingle character type identification
Single character tye identification Yefeng Zheng*, Changsong Liu, Xiaoqing Ding Deartment of Electronic Engineering, Tsinghua University Beijing 100084, P.R. China ABSTRACT Different character recognition
More informationarxiv: v1 [cs.mm] 18 Jan 2016
Lossless Intra Coding in with 3-ta Filters Saeed R. Alvar a, Fatih Kamisli a a Deartment of Electrical and Electronics Engineering, Middle East Technical University, Turkey arxiv:1601.04473v1 [cs.mm] 18
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 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 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 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 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 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 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 informationS16-02, URL:
Self Introduction A/Prof ay Seng Chuan el: Email: scitaysc@nus.edu.sg Office: S-0, Dean s s Office at Level URL: htt://www.hysics.nus.edu.sg/~hytaysc I was a rogrammer from to. I have been working in NUS
More informationBlock Recycling Schemes and Their Cost-based Optimization in NAND Flash Memory Based Storage System
Block Recycling Schemes and Their Cost-based Otimization in NAND Flash Memory Based Storage System Jongmin Lee School of Comuter Science University of Seoul jmlee@uos.ac.kr Sunghoon Kim Center for the
More informationFast Distributed Process Creation with the XMOS XS1 Architecture
Communicating Process Architectures 20 P.H. Welch et al. (Eds.) IOS Press, 20 c 20 The authors and IOS Press. All rights reserved. Fast Distributed Process Creation with the XMOS XS Architecture James
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
An Interactive Programming Method for Solving the Multile Criteria Problem Author(s): Stanley Zionts and Jyrki Wallenius Source: Management Science, Vol. 22, No. 6 (Feb., 1976),. 652-663 Published by:
More informationCS 229 Final Project: Single Image Depth Estimation From Predicted Semantic Labels
CS 229 Final Project: Single Image Deth Estimation From Predicted Semantic Labels Beyang Liu beyangl@cs.stanford.edu Stehen Gould sgould@stanford.edu Prof. Dahne Koller koller@cs.stanford.edu December
More informationStopping Criteria for a Constrained Single-Objective Particle Swarm Optimization Algorithm
Informatica 3 (27) 5 59 5 Stoing Criteria for a Constrained Single-Objective Particle Swarm Otimization Algorithm Karin Zielinski and Rainer Laur Institute for Electromagnetic Theory and Microelectronics,
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 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 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 informationSupport Vector Machines for Face Authentication
Suort Vector Machines for Face Authentication K Jonsson 1 2, J Kittler 1,YPLi 1 and J Matas 1 2 1 CVSSP, University of Surrey Guildford, Surrey GU2 5XH, United Kingdom 2 CMP, Czech Technical University
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 informationPREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS
PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS Kevin Miller, Vivian Lin, and Rui Zhang Grou ID: 5 1. INTRODUCTION The roblem we are trying to solve is redicting future links or recovering missing links
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 informationParametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique
Parametric Otimization in WEDM of WC-Co Comosite by Neuro-Genetic Technique P. Saha*, P. Saha, and S. K. Pal Abstract The resent work does a multi-objective otimization in wire electro-discharge machining
More informationMulti-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case
Multi-robot SLAM with Unknown Initial Corresondence: The Robot Rendezvous Case Xun S. Zhou and Stergios I. Roumeliotis Deartment of Comuter Science & Engineering, University of Minnesota, Minneaolis, MN
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 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 Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform
RESEARCH ARTICLE OPEN ACCESS A Method to Detere End-Points ofstraight Lines Detected Using the Hough Transform Gideon Kanji Damaryam Federal University, Lokoja, PMB 1154, Lokoja, Nigeria. Abstract The
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 informationA Morphological LiDAR Points Cloud Filtering Method based on GPGPU
A Morhological LiDAR Points Cloud Filtering Method based on GPGPU Shuo Li 1, Hui Wang 1, Qiuhe Ma 1 and Xuan Zha 2 1 Zhengzhou Institute of Surveying & Maing, No.66, Longhai Middle Road, Zhengzhou, China
More informationTracking Multiple Targets Using a Particle Filter Representation of the Joint Multitarget Probability Density
Tracing Multile Targets Using a Particle Filter Reresentation of the Joint Multitarget Probability Density Chris Kreucher, Keith Kastella, Alfred Hero This wor was suorted by United States Air Force contract
More informationLabel-Guided Graph Exploration by a Finite Automaton
Label-Guided Grah Exloration by a Finite Automaton REUVEN COHEN Boston University, USA PIERRE FRAIGNIAUD CNRS and Université Paris Diderot - Paris 7, France DAVID ILCINKAS CNRS and Université Bordeaux
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 informationThe Anubis Service. Paul Murray Internet Systems and Storage Laboratory HP Laboratories Bristol HPL June 8, 2005*
The Anubis Service Paul Murray Internet Systems and Storage Laboratory HP Laboratories Bristol HPL-2005-72 June 8, 2005* timed model, state monitoring, failure detection, network artition Anubis is a fully
More informationSensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s
Sensitivity two stage EOQ model 1 Sensitivity of multi-roduct two-stage economic lotsizing models and their deendency on change-over and roduct cost ratio s Frank Van den broecke, El-Houssaine Aghezzaf,
More informationConstrained Path Optimisation for Underground Mine Layout
Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground
More informationCollective communication: theory, practice, and experience
CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Comutat.: Pract. Exer. 2007; 19:1749 1783 Published online 5 July 2007 in Wiley InterScience (www.interscience.wiley.com)..1206 Collective
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 Efficient and Highly Accurate Technique for Periodic Planar Scanner Calibration with the Antenna Under Test in Situ
An Efficient and Highly Accurate echnique for Periodic Planar Scanner Calibration with the Antenna Under est in Situ Scott Pierce I echnologies 1125 Satellite Boulevard, Suite 100 Suwanee, Georgia 30024
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 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 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 informationDecoding-Workload-Aware Video Encoding
Decoding-Workload-Aware Video Encoding Yicheng Huang, Guangming Hong, Vu An Tran and Ye Wang Deartment of Comuter Science ational University of Singaore Law Link, Singaore 117590 Reulic of Singaore {huangyic,
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 informationComplexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks
Journal of Comuting and Information Technology - CIT 8, 2000, 1, 1 12 1 Comlexity Issues on Designing Tridiagonal Solvers on 2-Dimensional Mesh Interconnection Networks Eunice E. Santos Deartment of Electrical
More informationModel-Based Annotation of Online Handwritten Datasets
Model-Based Annotation of Online Handwritten Datasets Anand Kumar, A. Balasubramanian, Anoo Namboodiri and C.V. Jawahar Center for Visual Information Technology, International Institute of Information
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 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 informationApplying subclustering and L p distance in Weighted K-Means with distributed centroid
Alying subclustering and L distance in Weighted K-Means with distributed centroid Renato Cordeiro de Amorim a,, Vladimir Makarenkov b a School of Comuting, University of Hertfordshire, College Lane, AL10
More informationMULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung
MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT Jian Zhao and Sen-ching S. Cheung University of Kentucky Center for Visualization and Virtual Environment 1 Quality Street, Suite
More informationVisualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries
Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Qi Tian, Baback Moghaddam 2 and Thomas S. Huang Beckman Institute, University of Illinois, Urbana-Chamaign, IL 680,
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 informationImplementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching
Imlementation of Evolvable Fuzzy Hardware for Packet Scheduling Through Online Context Switching Ju Hui Li, eng Hiot Lim and Qi Cao School of EEE, Block S Nanyang Technological University Singaore 639798
More informationAn Efficient Video Program Delivery algorithm in Tree Networks*
3rd International Symosium on Parallel Architectures, Algorithms and Programming An Efficient Video Program Delivery algorithm in Tree Networks* Fenghang Yin 1 Hong Shen 1,2,** 1 Deartment of Comuter Science,
More informationA STUDY ON CALIBRATION OF DIGITAL CAMERA
A STUDY ON CALIBRATION OF DIGITAL CAMERA Ryuji Matsuoka a, *, Kiyonari Fukue a, Kohei Cho a, Haruhisa Shimoda a, Yoshiaki Matsumae a, Kenji Hongo b, Seiju Fujiwara b a Tokai University Research & Information
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 informationSignature File Hierarchies and Signature Graphs: a New Index Method for Object-Oriented Databases
Signature File Hierarchies and Signature Grahs: a New Index Method for Object-Oriented Databases Yangjun Chen* and Yibin Chen Det. of Business Comuting University of Winnieg, Manitoba, Canada R3B 2E9 ABSTRACT
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 informationImprove Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes Λ
Imrove Precategorized Collection Retrieval by Using Suervised Term Weighting Schemes Λ Ying Zhao and George Karyis University of Minnesota, Deartment of Comuter Science Minneaolis, MN 55455 Abstract The
More informationEvaluation of Metaheuristics for Robust Graph Coloring Problem
Proceedings of the Federated Conference on Comuter Science and Information Systems. 519 524 DOI: 10.15439/2015F293 ACSIS, Vol. 5 Evaluation of Metaheuristics for Robust Grah Coloring Problem Zbigniew Kokosiński
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 informationAdaptive Location Constraint Processing
Adative Location Constraint Processing Zhengdao Xu and Hans-Arno Jacobsen University of Toronto zhengdao@cs.toronto.edu, jacobsen@eecg.toronto.edu ABSTRACT An imortant roblem for many location-based alications
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 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 informationA GPU Heterogeneous Cluster Scheduling Model for Preventing Temperature Heat Island
A GPU Heterogeneous Cluster Scheduling Model for Preventing Temerature Heat Island Yun-Peng CAO 1,2,a and Hai-Feng WANG 1,2 1 School of Information Science and Engineering, Linyi University, Linyi Shandong,
More information