| Yaniv | R&D |
| Experience | Resumé | Summer 98 | Spring 98 | Summer 97 | Summer 96 |
| Abstract | Algorithm | Warp | References |
|
Panoramic Image Mosaics, by Yaniv Inbar 4/18/98 - 6/5/98 |
| Algorithm |
We construct a panoramic image mosaic by pasting together a sequence of photographs taken by a regular digital camera from the same position but in different directions. When the alignment process is completed, ideally we would a fully immerse environment in which one can "look" in any direction and see the parts of the images that were in that direction.
Our general motivation is to have an automatic alignment scheme, that is one which needs no user input. To accomplish this, we first need to construct an error function that estimates how well a given alignment of images matches the images in their region of overlap. As in the paper, we associate each image with a rotational mosaic, that is warping matrix that transforms the image into an image on the unit sphere in the current computed direction. Assuming a significant overlap between the two warped images being considered (say at least 25% of the area of an image), the error function is then computed as the sum of squared differences (SSD) between the intensities of overlapping pixels in each warped image. Unfortunately SSD minimization is a difficult problem because it would be too time-consuming to test every possible transformation (unless you do something clever e.g. [Gleicher97]). The approach we've taken is to first apply a Taylor approximation of the differences in image intensities on the update parameter on the warping matrix. The details of the mathematics are given in the paper, but we end up using Cholesky decomposition to solve a system of linear equations with a special property. Several improvements to the process are implemented. We speed up the process of computing the coefficients of the linear equations by a path-based alignment process which assumes that the Jacobian is constant over a small pixel region. To improve the stability of the numerical computation, instead of using general warping matrices as past literature has done, the novel approach taken by the authors is to only allow 3-D rotation matrices, which makes sense in the the specific context of image alignment. This requires knowing the focal length, which can be estimated using the general warping technique, or simply be given by the user. Lately, the authors of the paper have designed an algorithm to improve the estimate of the focal length by updating the current focal length as the computation of mosaic proceeds. The authors have designed numerous additional algorithms to improve the alignment process since the SIGGRAPH'97 paper this project was based on. For instance, a global alignment process is designed to align all of the images in the panoramic sequence at the same time, thus imrpoving the global quality of the resulting mosaic substantially. Also, a local alignment process is designed to avoid artifacts such as "ghosting" in which the images are globally aligned well but certain small features are noticebly misaligned resulting in seeing a ghost image of the feature in the final image mosaic. Essentailly, an automatic feature matching technique on a local scale is introduced that alters the global rotation matrix slightly towards a better match for each pixel region. In conclusion, the authors have made substantial progress towards automatic panoramic image mosaic creation.
|
Results
|
Results have been highly unsatisfactory for me. The most difficult part of the research is identifying whether low-level results are reasonable. The general warping matrix do not have an easily identifyable interpretation, though the 3-D reotation matrices improve that a little. In fact, my poor results may well have been a result of some bug. That disclaimer given, I can say that matrix values seem to diverge from a reasonable result quickly in the general matrix case. Often in the case where the camera movement from image to image was a simple horizontal rotation, the warp would quickly diverge into a highly skewed image that had no chance of ever aligning. This was the case even if the initial warp guess was really close to correct. I suspect the "local" alignment scheme developed more recently by the authors would improve results tremendously.
| |