Fast image mosaicing based on histograms

Akihiro Mori, Seiichi Uchida

Research output: Contribution to journalArticle

Abstract

This paper introduces a fast image mosaicing technique that does not require costly search on image domain (e.g., pixel-to-pixel correspondence search on the image domain) and the iterative optimization (e.g., gradient-based optimization, iterative optimization, and random optimization) of geometric transformation parameter. The proposed technique is organized in a two-step manner. At both steps, histograms are fully utilized for high computational efficiency. At the first step, a histogram of pixel feature values is utilized to detect pairs of pixels with the same rare feature values as candidates of corresponding pixel pairs. At the second step, a histogram of transformation parameter values is utilized to determine the most reliable transformation parameter value. Experimental results showed that the proposed technique can provide reasonable mosaicing results in most cases with very feasible computations.

Original languageEnglish
Pages (from-to)2701-2708
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE91-D
Issue number11
DOIs
Publication statusPublished - Nov 2008

Fingerprint

Pixels
Computational efficiency

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Fast image mosaicing based on histograms. / Mori, Akihiro; Uchida, Seiichi.

In: IEICE Transactions on Information and Systems, Vol. E91-D, No. 11, 11.2008, p. 2701-2708.

Research output: Contribution to journalArticle

@article{d725825ed6344a0e8c7faca227344e14,
title = "Fast image mosaicing based on histograms",
abstract = "This paper introduces a fast image mosaicing technique that does not require costly search on image domain (e.g., pixel-to-pixel correspondence search on the image domain) and the iterative optimization (e.g., gradient-based optimization, iterative optimization, and random optimization) of geometric transformation parameter. The proposed technique is organized in a two-step manner. At both steps, histograms are fully utilized for high computational efficiency. At the first step, a histogram of pixel feature values is utilized to detect pairs of pixels with the same rare feature values as candidates of corresponding pixel pairs. At the second step, a histogram of transformation parameter values is utilized to determine the most reliable transformation parameter value. Experimental results showed that the proposed technique can provide reasonable mosaicing results in most cases with very feasible computations.",
author = "Akihiro Mori and Seiichi Uchida",
year = "2008",
month = "11",
doi = "10.1093/ietisy/e91-d.11.2701",
language = "English",
volume = "E91-D",
pages = "2701--2708",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "11",

}

TY - JOUR

T1 - Fast image mosaicing based on histograms

AU - Mori, Akihiro

AU - Uchida, Seiichi

PY - 2008/11

Y1 - 2008/11

N2 - This paper introduces a fast image mosaicing technique that does not require costly search on image domain (e.g., pixel-to-pixel correspondence search on the image domain) and the iterative optimization (e.g., gradient-based optimization, iterative optimization, and random optimization) of geometric transformation parameter. The proposed technique is organized in a two-step manner. At both steps, histograms are fully utilized for high computational efficiency. At the first step, a histogram of pixel feature values is utilized to detect pairs of pixels with the same rare feature values as candidates of corresponding pixel pairs. At the second step, a histogram of transformation parameter values is utilized to determine the most reliable transformation parameter value. Experimental results showed that the proposed technique can provide reasonable mosaicing results in most cases with very feasible computations.

AB - This paper introduces a fast image mosaicing technique that does not require costly search on image domain (e.g., pixel-to-pixel correspondence search on the image domain) and the iterative optimization (e.g., gradient-based optimization, iterative optimization, and random optimization) of geometric transformation parameter. The proposed technique is organized in a two-step manner. At both steps, histograms are fully utilized for high computational efficiency. At the first step, a histogram of pixel feature values is utilized to detect pairs of pixels with the same rare feature values as candidates of corresponding pixel pairs. At the second step, a histogram of transformation parameter values is utilized to determine the most reliable transformation parameter value. Experimental results showed that the proposed technique can provide reasonable mosaicing results in most cases with very feasible computations.

UR - http://www.scopus.com/inward/record.url?scp=68849106099&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68849106099&partnerID=8YFLogxK

U2 - 10.1093/ietisy/e91-d.11.2701

DO - 10.1093/ietisy/e91-d.11.2701

M3 - Article

AN - SCOPUS:68849106099

VL - E91-D

SP - 2701

EP - 2708

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 11

ER -