Results 241 to 250 of about 216,940 (284)

Dense image matching: Comparisons and analyses

2013 Digital Heritage International Congress (DigitalHeritage), 2013
The paper presents a critical review and analysis of dense image matching algorithms. The analyzed algorithms stay in the commercial as well open-source domains. The employed datasets include scenes pictured in terrestrial and aerial blocks, acquired with convergent and parallel-axis images and different scales.
Remondino F, Spera M G, Nocerino E, Menna F, Nex F, Gonizzi Barsanti S   +5 more
openaire   +4 more sources

Achieving efficient dense matching for uncalibrated images

IEEE International Conference on Image Processing 2005, 2005
This paper presents a new method to achieve fast dense matching in a pair of uncalibrated images. Classical area-based dense matching methods suffer from the high computational time resulting from intensive correlation calculations during the search/selection process.
B. Boufama, K. Ghanem
openaire   +1 more source

Research on CUDA-based image parallel dense matching

2013 Chinese Automation Congress, 2013
By analyzing the computer burden of image dense matching and the characteristic of Graphic Processor Unit(GPU) parallel computing mode, we designed a new solution of image parallel dense matching based on CUDA. We adopted the coarse-to-fine strategy, firstly implemented the pixel level normalized cross-correlation(NCC) matching method on CUDA; and then
Zhu Zunshang, Ge Zhen, Chen Shengyi, Sun Xiaoliang, Shang Yang   +4 more
openaire   +1 more source

A Hybrid Dense Matching Method for Satellite Images

Advanced Materials Research, 2013
To solve the dense matching problem for stereoscopic satellite images, a hybrid matching scheme integrating multiple methods is proposed. This scheme utilizes two types of matching element including grid points and edge points. First the geometrically constrained cross-correlation (GC3) method is used to extract matching grids.
Sheng Hua Teng, Ning Yang
openaire   +1 more source

Comparison of dense matching algorithms in noisy image

SPIE Proceedings, 2010
In this paper, we compare two correlation techniques for dense matching used in image corresponding problem, namely, the Sum of Squared Difference (SSD) and Normalized Cross Correlation (NCC). Both algorithms look for part of the image that matches a template based on intensity information. The window of the template is of Voronoi size, according to
Manassanan Srikham, Charnchai Pluempitiwiriyawej, Thitiporn Chanwimaluang   +2 more
openaire   +1 more source

Dense matching for multi-scale images by propagation

Multimedia Tools and Applications, 2018
This article puts forward a new algorithm of dense matching between two images of the same scene, not necessarily stereoscopic and which can be of different scales. This algorithm is based on points of interest identified by a multi-scale detector and later matched according to a very high threshold to keep only the most reliable points.
Mohammed Laraqui, Abderrahim Saaidi, Ali Mouhib, Mustapha Abarkan   +3 more
openaire   +1 more source

Complementing TLS Point Clouds by Dense Image Matching

International Journal of Heritage in the Digital Era, 2013
The complementation of terrestrial laser scanning (TLS) by photogrammetric acquisition techniques enables the exploitation of two different measurement principles. TLS with distance measurements can be used for acquiring large-scale point clouds at medium range distances, while image-based surface reconstruction methods enable flexible acquisition ...
Wassim Moussa, Konrad Wenzel, Mathias Rothermel, Mohammed Abdel-Wahab, Dieter Fritsch   +4 more
openaire   +1 more source

Intrinsic Images for Dense Stereo Matching with Occlusions

2000
Stereo correspondence is a central issue in computer vision. The traditional approach involves extracting image features, establishing correspondences based on photometric and geometric criteria and finally, determine a dense disparity field by interpolation. In this context, occlusions are considered as undesirable artifacts and often ignored.
César Silva, José Santos-Victor
openaire   +1 more source

Homography based quasi-dense match propagation for fisheye images

2010 Sixth International Conference on Natural Computation, 2010
Most of the quasi-dense matching algorithms are designed for general scene structures. In reality, there are many man-made objects in the scene, such as for example buildings and furniture which include many planar regions. For this case, plane induced homography is a useful tool for matching.
Xiaoming Li, Xixi Qin, Jing Li, Yuanyuan Xu   +3 more
openaire   +1 more source