Finding corresponding edges is considered being the most difficult part of edge-based stereo matching algorithms. Usually, correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on epipolar line and maximum disparity. Reduction of search region can increase performances of the matching process, in the context of execution...

The exact positioning of patients during radiotherapy is essential for high precision treatment. Before each session, the patient must be accurately placed within the treatment device. The analysis of megavoltage X-ray images, portal images, can help to control this patient positioning. The particular problem of electronic portal imaging devices however, is that they provide imagery with extrem...

We provide a new family of Kk-free pseudorandom graphs with edge density Θ(n−1/(k−1)), matching recent construction due to Bishnoi, Ihringer and Pepe [2]. As in the former result, idea is use large subgraphs polarity graphs, which are defined over finite field Fq. While their required q be odd, we will give first power 2.

Edge detection is an important field in image processing. The purpose of image’s edge Detection is image segmentation, data compression, well matching such as image reconstruction and so on. Images to be compressed are first differentiated and edge information is extracted by investigation of the histogram of small non-overlapping blocks of the differential image. The image is classified into v...

In this paper a novel method for computing the radiation pattern and also the input impedance of a planar rectangular micro-strip antenna array with consideration of mutual coupling and mutual impedance is presented. Each two triangles with a common edge make an Edge element or RWG. Any such edge element is considered as an infinitesimal dipole. The electrical currents over each dipole can be c...

Let G be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subsetX ofG is feasible if there exists two perfect matchingsM1 andM2 such that |M1∩X| 6≡ |M2∩X| (mod 2). Lukot’ka and Rollová proved that an edge subset X of a regular bipartite graph is not feasible if and only if X is switching-equivalent to ∅, and they further ask whether a non-feasible set of a ...

In order to estimate rock joint parameters, such as strikes and dips which geologists often inspect on site andlor calculate through 3D joint surface recognition by use of stereo-photo system, an image processing algorithm of joint set modeling which simply simulates their interpretation is designed. Comparing resultant parameters in Schmidt-net diagrams, it is confirmed that the algorithm base...