Results 31 to 40 of about 3,209,428 (350)

A new diamond search algorithm for fast block matching motion estimation

open access: yesConference Advance Technology, 1997
Based on the analysis of certain existing fast block matching algorithms (BMAs) and study of motion vector distributions of real-world image sequences, a new diamond search (DS) algorithm for fast block matching motion estimation is proposed in this ...
Sha Zhu, K. Ma
semanticscholar   +1 more source

Block Matching for Ontologies [PDF]

open access: yes, 2006
Ontology matching is a crucial task to enable interoperation between Web applications using different but related ontologies. Today, most of the ontology matching techniques are targeted to find 1:1 mappings. However, block mappings are in fact more pervasive.
Wei Hu, Yuzhong Qu
openaire   +1 more source

Online matching with blocked input [PDF]

open access: yesInformation Processing Letters, 1991
In this paper, we examine the problem of "blocked online bipartite matching". This problem is similar to the online matching problem except that the vertices arrive in blocks instead of one at a time. Previously studied problems exist as special cases of this problem; the case where each block contains only a single vertex is the standard online ...
Ming-Yang Kao, Stephen R. Tate
openaire   +2 more sources

Point-to-Block Matching in Depth Estimation

open access: yesCSRN, 2021
In this paper, the novel correspondence search method called point-to-block matching was proposed. Recently, in many proposed multimedia systems, depth estimation is performed on compressed input views. To address this problem and increase the quality of such depth maps, in the proposal, a point in a view is not compared simply with a point in another
Magdalena Woźniak   +2 more
openaire   +2 more sources

Attention Concatenation Volume for Accurate and Efficient Stereo Matching [PDF]

open access: yesComputer Vision and Pattern Recognition, 2022
Stereo matching is a fundamental building block for many vision and robotics applications. An informative and concise cost volume representation is vital for stereo matching of high accuracy and efficiency.
Gangwei Xu   +3 more
semanticscholar   +1 more source

Hyperspectral Image Classification Using Similarity Measurements-Based Deep Recurrent Neural Networks

open access: yesRemote Sensing, 2019
Classification is a common objective when analyzing hyperspectral images, where each pixel is assigned to a predefined label. Deep learning-based algorithms have been introduced in the remote-sensing community successfully in the past decade and have ...
Andong Ma   +3 more
doaj   +1 more source

A FAST MORPHING-BASED INTERPOLATION FOR MEDICAL IMAGES: APPLICATION TO CONFORMAL RADIOTHERAPY

open access: yesImage Analysis and Stereology, 2011
A method is presented for fast interpolation between medical images. The method is intended for both slice and projective interpolation. It allows offline interpolation between neighboring slices in tomographic data.
Hussein Atoui   +2 more
doaj   +1 more source

An algorithm for matching original experimental records based on improved CDC

open access: yesShenzhen Daxue xuebao. Ligong ban, 2022
Aiming at the problems such as long time and occasional errors in the generation process of the current laboratory test report, we present an automatic capture technology of general original experimental records based on fence factor.
CAI Yina   +7 more
doaj   +1 more source

Method of airborne SAR image match integrating multi-information for block adjustment [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015
For the automation of SAR image Block Adjustment, this paper proposed a method of SAR image matching integrating multiinformation. It takes full advantage of SAR image geometric information, feature information, gray-related information and external ...
S. C. Yang   +3 more
doaj   +1 more source

Block-to-Block Distribution Matching

open access: yes, 2013
In this work, binary block-to-block distribution matching is considered. m independent and uniformly distributed bits are mapped to n output bits resembling a target product distribution. A rate R is called achieved by a sequence of encoder-decoder pairs, if for m,n to infinity, (1) m/n approaches R, (2) the informational divergence per bit of the ...
Böcherer, Georg, Amjad, Rana Ali
openaire   +2 more sources

Home - About - Disclaimer - Privacy