Method of optimization of the fundamental matrix by technique speeded up robust features application of different stress images

<span>The purpose of determining the fundamental matrix (F) is to define the epipolar geometry and to relate two 2D images of the same scene or video series to find the 3D scenes. The problem we address in this work is the estimation of the localization error and the processing time. We start by comparing the following feature extraction techniques: Harris, features from accelerated segment test (FAST), scale invariant feature transform (SIFT) and speed-up robust features (SURF) with respect to the number of detected points and correct matches by different changes in images. Then, we merged the best chosen by the objective function, which groups the descriptors by different regions in order to calculate ‘F’. Then, we applied the standardized eight-point algorithm which also automatically eliminates the outliers to find the optimal solution ‘F’. The test of our optimization approach is applied on the real images with different scene variations. Our simulation results provided good results in terms of accuracy and the computation time of ‘F’ does not exceed 900 ms, as well as the projection error of maximum 1 pixel, regardless of the modification.</span>

A binary particle swarm optimization approach for power system security enhancement

Improvement of power system security manages the errand of making healing move against conceivable system overloads in the framework following the events of contingencies. Generation re-dispatching is answer for the evacuation of line overloads. The issue is the minimization of different goals viz. minimization of fuel cost, minimization of line loadings and minimization of overall severity index. Binary particle swarm optimization (BPSO) method was utilized to take care of optimal power flow issue with different targets under system contingencies. The inspiration to introduce BPSO gets from the way that, in rivalry with other meta-heuristics, BPSO has demonstrated to be a champ by and large, putting a technique as a genuine alternative when one needs to take care of a complex optimization problem. The positioning is assessed utilizing fuzzy logic. Simulation Results on IEEE-14 and IEEE-30 bus systems are presented with different objectives.

Computational Object-Wrapping Rope Nets

Wrapping objects using ropes is a common practice in our daily life. However, it is difficult to design and tie ropes on a 3D object with complex topology and geometry features while ensuring wrapping security and easy operation. In this article, we propose to compute a rope net that can tightly wrap around various 3D shapes. Our computed rope net not only immobilizes the object but also maintains the load balance during lifting. Based on the key observation that if every knot of the net has four adjacent curve edges, then only a single rope is needed to construct the entire net. We reformulate the rope net computation problem into a constrained curve network optimization. We propose a discrete-continuous optimization approach, where the topological constraints are satisfied in the discrete phase and the geometrical goals are achieved in the continuous stage. We also develop a hoist planning to pick anchor points so that the rope net equally distributes the load during hoisting. Furthermore, we simulate the wrapping process and use it to guide the physical rope net construction process. We demonstrate the effectiveness of our method on 3D objects with varying geometric and topological complexity. In addition, we conduct physical experiments to demonstrate the practicability of our method.