Recently Wo zniak & Stanek (1996) proposed a new method to investigate interstellar extinction, based on two band photometry, which uses red clump stars as a means to construct the reddening curve. I apply this method to the color-magnitude diagrams obtained by the Optical Gravitational Lensing Experiment (OGLE) to construct an extinction map of (40 0) 2 region of Baade's Window, with resolutio...

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

A window-based stereo matching, which matches pixel values within a window between two images, produces a dense disparity map, and as a result, constructs a dense depth structure. Many algorithms of the window-based stereo matching have been proposed. The conventional algorithms, however, face a trade-off between accuracies of the disparity map in disparity continuity and discontinuity regions ...

The SOVA and the log-MAP are commonly used in turbo decoding. In this paper, we propose to modify the sliding window MAP-algorithm in [5] to reduce the computational delay even further. We compare the simulation performance of this low latency log-MAP algorithm with the sliding window log-MAP. We also estimate the VLSI implementation complexities of the SOVA, the log-MAP and the proposed low la...

The Self-Organizing Map (SOM) can be used in implementing relevance feedback in an information retrieval system. In our approach, the map surface is convolved with a window function in order to spread the responses given by a human user for the seen data items. In this paper, a number of window functions with different sizes are compared in spreading positive and negative relevance information ...

In the theory of inverse systems, in order to study the properties of a space X or a map f : X → Y between spaces, one expands X to an inverse system X or expands f to a map f : X → Y between the inverse systems, and then work on X or f . In this paper, we define approximate injectivity (resp., surjectivity) for approximate maps, and show that a map f : X → Y between compact metric spaces is in...

Stereo correspondence mapping is the fundamental problem to achieve human like vision capabilities to machines and robots. Many local and global algorithms have been reported in literature in the last decade. Window-based cost aggregation methods for solving the correspondence problem have attracted researches as it can be implemented in real time using parallel processors. In this paper a new ...