2010
DOI: 10.2197/ipsjtcva.2.1
|View full text |Cite
|
Sign up to set email alerts
|

Full Pixel Matching between Images for Non-linear Registration of Objects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…The visible image is constructed by a visible light sensor by capturing different reflections of light from different object surfaces, while the thermal infrared image is constructed by an infrared sensor by capturing the difference in infrared thermal radiation intensity of different parts of natural objects [2], [3], [4], [5], [6]. The large differences between visible and thermal infrared images pose a very significant challenge for template matching schemes, whereas most existing template matching methods rely on linear, monotonic, or functionally constrained matching rules [29], [30], [31]. Special algorithms are required for template matching between heterogeneous images.…”
Section: Introductionmentioning
confidence: 99%
“…The visible image is constructed by a visible light sensor by capturing different reflections of light from different object surfaces, while the thermal infrared image is constructed by an infrared sensor by capturing the difference in infrared thermal radiation intensity of different parts of natural objects [2], [3], [4], [5], [6]. The large differences between visible and thermal infrared images pose a very significant challenge for template matching schemes, whereas most existing template matching methods rely on linear, monotonic, or functionally constrained matching rules [29], [30], [31]. Special algorithms are required for template matching between heterogeneous images.…”
Section: Introductionmentioning
confidence: 99%
“…The main difference between these studies is the definition of the cost function; The 2D-DP focuses on finding the mapping between two images with a pre-defined cost function, while the likelihood of 2-D HMMs is defined between an input image and the distribution which is estimated from multiple training images. Although some efficient approximation algorithms have been proposed for the 2D-DP problem [13]- [16], they still need high complicated costs and prior knowledge to determine the cost function is required for representing an accurate elastic matching dependently on image variations.…”
Section: Introductionmentioning
confidence: 99%