scholarly journals Fusion of Multispectral and Panchromatic Images via Local Geometrical Similarity

2018 ◽  
Vol 25 (2) ◽  
1994 ◽  
Vol 8 (2) ◽  
pp. 211-220 ◽  
Author(s):  
Laura Belvisi ◽  
Gianpaolo Bravi ◽  
Carlo Scolastico ◽  
Anna Vulpetti ◽  
Aldo Salimbeni ◽  
...  

GEOMATICA ◽  
2015 ◽  
Vol 69 (4) ◽  
pp. 385-394
Author(s):  
Zhanlong Chen ◽  
Yongyang Xu ◽  
Liang Wu

With the rotation, translation and scaling invariance, etc. it is difficult to measure the similarity between GIS planar elements. To describe the graphics precisely, according to the number of shortest paths where vertices occur, we define the “vertex betweenness;” this measures the importance of each vertex in a graph. The higher the vertex betweenness, the more important vertex becomes. We propose a contour fea ture points extraction method, where Fourier descriptors are used. We normalize the first n order factors of Fourier descriptors, on the basis of similarity between polygons, which is obtained by comparing the cosine values for every two vectors. The experiment is operated on two different data scales, 1:50 000 and 1:250 000. Combined with analysis of impact factors during similarity measurement, the experiment results show that the contour feature points extraction method can effectively measure the geometrical similarity between GIS planar elements.


2010 ◽  
Vol 17 (4) ◽  
pp. 1185-1195 ◽  
Author(s):  
Sasa Dekic ◽  
Predrag Osmokrovic ◽  
Milos Vujisic ◽  
Koviljka Stankovic

Author(s):  
A Sardashti ◽  
HM Daniali ◽  
SM Varedi-Koulaei

This paper presents a novel methodology for path generation synthesis of the four-bar mechanism. A new objective function for the path generation synthesis problem, namely, the Geometrical Similarity Error Function (GSEF), is introduced. Indeed, GSEF assesses the similarity between generated and desired paths, and its number of design variables is less than those in the other synthesis methods. Then, using an Innovative Adaptive Algorithm (IAA), some operators are utilized for matching two similar paths. GSEF-IAA methodology has some significant advantages over the reported synthesis methods. The method is fast, takes much less CPU time, and saves a large amount of computer memory. Four path generation problems are solved using GSEF-IAA, and the results are compared with those of previous methods using some well-known optimization algorithms to demonstrate the efficiency of GSEF-IAA methodology.


2008 ◽  
Vol 6 ◽  
pp. 150-155
Author(s):  
A.R. Urakov ◽  
A.A. Gordeev ◽  
S.S. Porechny

Self-similar (at preservation of geometrical similarity of borders) solutions of non-stationary Hele-Shaw problems in connection to an electrochemical shaping are considered. The problem of a flow about an arch of a circle on which the border condition for Zhukovsky’s function has the form similar to a boundary condition of a self-similar problem is used for the solution.


Sign in / Sign up

Export Citation Format

Share Document