3 research outputs found

    Improved wolf algorithm on document images detection using optimum mean technique

    Get PDF
    Detection text from handwriting in historical documents provides high-level features for the challenging problem of handwriting recognition. Such handwriting often contains noise, faint or incomplete strokes, strokes with gaps, and competing lines when embedded in a table or form, making it unsuitable for local line following algorithms or associated binarization schemes. In this paper, a proposed method based on the optimum threshold value and namely as the Optimum Mean method was presented. Besides, Wolf method unsuccessful in order to detect the thin text in the non-uniform input image. However, the proposed method was suggested to overcome the Wolf method problem by suggesting a maximum threshold value using optimum mean. Based on the calculation, the proposed method obtained a higher F-measure (74.53), PSNR (14.77) and lowest NRM (0.11) compared to the Wolf method. In conclusion, the proposed method successful and effective to solve the wolf problem by producing a high-quality output image

    A Review on Recent T-way Combinatorial Testing Strategy

    No full text
    T-way combinatorial testing aims to generate a smaller test suite size. The purpose of t-way combinatorial testing is to overcome exhaustive testing. Although many existing strategies have been developed for t-way combinatorial testing, study in this area is encouraging as it falls under NP-hard optimization problem. This paper focuses on the analysis of existing algorithms or tools for the past seven years. Taxonomy of combinatorial testing is proposed to ease the analysis. 20 algorithms or tools were analysed based on strategy approach, search technique, supported interaction and year published. 2015 was the most active year in which researchers developed t-way algorithms or tools. OTAT strategy and metaheuristic search technique are the most encouraging research areas for t-way combinatorial testing. There is a slight difference in the type of interaction support. However, uniform strength is the most utilized form of interaction from 2010 to the first quarter of 2017

    A Review on Recent T-way Combinatorial Testing Strategy

    No full text
    T-way combinatorial testing aims to generate a smaller test suite size. The purpose of t-way combinatorial testing is to overcome exhaustive testing. Although many existing strategies have been developed for t-way combinatorial testing, study in this area is encouraging as it falls under NP-hard optimization problem. This paper focuses on the analysis of existing algorithms or tools for the past seven years. Taxonomy of combinatorial testing is proposed to ease the analysis. 20 algorithms or tools were analysed based on strategy approach, search technique, supported interaction and year published. 2015 was the most active year in which researchers developed t-way algorithms or tools. OTAT strategy and metaheuristic search technique are the most encouraging research areas for t-way combinatorial testing. There is a slight difference in the type of interaction support. However, uniform strength is the most utilized form of interaction from 2010 to the first quarter of 2017
    corecore