The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] range images(2hit)

1-2hit
  • Weight Optimization for Multiple Image Integration and Its Applications

    Ryo MATSUOKA  Tomohiro YAMAUCHI  Tatsuya BABA  Masahiro OKUDA  

     
    PAPER-Image Processing and Video Processing

      Pubricized:
    2015/10/06
      Vol:
    E99-D No:1
      Page(s):
    228-235

    We propose an image restoration technique that uses multiple image integration. The detail of the dark area when acquiring a dark scene is often deteriorated by sensor noise. Simple image integration inherently has the capability of reducing random noises, but it is especially insufficient in scenes that have a dark area. We introduce a novel image integration technique that optimizes the weights for the integration. We find the optimal weight map by solving a convex optimization problem for the weight optimization. Additionally, we apply the proposed weight optimization scheme to a single-image super-resolution problem, where we slightly modify the weight optimization problem to estimate the high-resolution image from a single low-resolution one. We use some of our experimental results to show that the weight optimization significantly improves the denoising and super-resolution performances.

  • Finding Line Segments with Tabu Search

    Concettina GUERRA  Valerio PASCUCCI  

     
    LETTER

      Vol:
    E84-D No:12
      Page(s):
    1739-1744

    The problem of detecting straight lines arises frequently in image processing and computer vision. Here we consider the problem of extracting lines from range images and more generally from sets of three-dimensional (3D) points. The problem is stated as follows. Given a set Γ of points in 3D space and a non-negative constant , determine the line that is at a distance at most ε from the maximal number of points of . The extraction of multiple lines is achieved iteratively by performing this best line detection and removing at each iteration the points that are close to the line found. We consider two approaches to solve the problem. The first is a simple approach that selects the best line among a randomly chosen subset of lines each defined by a pair of edge points. The second approach, based on tabu search, explores a larger set of candidate lines thus obtaining a better fit of the lines to the points. We present experimental results on different types of three-dimensional data (i) range images of polyhedral objects (ii) secondary structures (helices and strands) of large molecules.