Essays about: "graph matching"

Showing result 16 - 20 of 21 essays containing the words graph matching.

  1. 16. Object Oriented Design Pattern Extraction From Java Source Code

    University essay from Institutionen för informationsteknologi

    Author : Rupesh Acharya; [2013]
    Keywords : ;

    Abstract : In case of software architecture reconstruction, design pattern detection plays a vital role since its presence reflects the point of design decision. Currently most of the studied approaches only focus on the Gang of Four (GOF) design patterns so those tools are not flexible enough to identify other proprietary pattern instances. READ MORE

  3. 17. Program Dependence Graph Generation and Analysis for Source Code Plagiarism Detection

    University essay from Institutionen för datavetenskap; Tekniska högskolan

    Author : Niklas Holma; [2012]
    Keywords : plagiarism; program dependence graph;

    Abstract : Systems and tools that finds similarities among essays and reports are widely used by todays universities and schools to detect plagiarism. Such tools are however insufficient when used for source code comparisons since they are fragile to the most simplest forms of diguises. READ MORE

  4. 18. AIG Rewriting Using 5-Input Cuts

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Nan Li; [2011]
    Keywords : ;

    Abstract : Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This thesis presents an And-Inverter graph based rewriting algorithm using 5-input cuts. READ MORE

  5. 19. Modern Stereo Correspondence Algorithms : Investigation and Evaluation

    University essay from Informationskodning

    Author : Anders Olofsson; [2010]
    Keywords : stereo correspondence; stereo matching; cost function; cost aggregation; image segmentation; plane fitting; RANSAC; graph cuts; belief propagation; disparity; depth estimation;

    Abstract : Many different approaches have been taken towards solving the stereo correspondence problem and great progress has been made within the field during the last decade. This is mainly thanks to newly evolved global optimization techniques and better ways to compute pixel dissimilarity between views. READ MORE

  6. 20. A character-recognition system for Hangeul

    University essay from Lunds universitet/Språkteknologi

    Author : Johan Sageryd; [2009]
    Keywords : graph matching; graph thinning; Hangeul; Korean; character recognition; Technology and Engineering; Languages and Literatures;

    Abstract : This work presents a rule-based character-recognition system for the Korean script, Hangeul. An input raster image representing one Korean character (Hangeul syllable) is thinned down to a skeleton, and the individual lines extracted. READ MORE