Search

In computer science, digital image processing is the use of computer algorithms to perform image processing on digital images. The Image processing as a subgroup or background of digital signal processing has many advantages over analog image processing. The Digital image processing allows the use of a wide range of algorithms for input data and avoids problems such as noise accumulation and signal distortion during the processing process. Because images are defined in two dimensions (perhaps more than two dimensions), image processing can be formatted into multi-dimensional systems. In this paper an effective Mathematical morphology model was proposed to enhance the quality of images. In this mode, the image is pre-processed and then the gradient is changed using a mathematical image system. Then, the edges are detected by the margin detection method based on the statistical data. This method removes the shadow contours caused by the lights, directly separates the boundaries of the objects and has an impact on the background noise suppression.

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs produced by a computer to solve big problems require more time, so, this paper suggests an algorithm that can be useful in better performance of the known algorithms such as Branch and Bound. The proposed study aims to improve the performance of the branch and bound (BB) algorithm in solving QAP problems. The findings show that the proposed method enables the BB algorithm to produce an optimal solution in the minimum amount of time.

In this paper we present a parametric visualization software used to assist the teaching of the Network Primal Simplex Algorithm for the assignment problem (AP). The assignment problem is a special case of the balanced transportation problem. The main functions of the algorithm and design techniques are also presented. Through this process, we aim to underline the importance and necessity of using such educational methods in order to improve the teaching of Computer Algorithms.