# Patent

## Title
Automatic adjustment of images using a homography

## Abstract

Techniques and apparatus for automatic upright adjustment of digital images. An automatic upright adjustment technique is described that may provide an automated approach for straightening up slanted features in an input image to improve its perceptual quality. This correction may be referred to as upright adjustment. A set of criteria based on human perception may be used in the upright adjustment. A reprojection technique that implements an optimization framework is described that yields an optimal homography for adjustment based on the criteria and adjusts the image according to new camera parameters generated by the optimization. An optimization-based camera calibration technique is described that simultaneously estimates vanishing lines and points as well as camera parameters for an image; the calibration technique may, for example, be used to generate estimates of camera parameters and vanishing points and lines that are input to the reprojection technique.

## Background
RELATED APPLICATIONS
This application is a continuation of and claims priority to U.S. patent application Ser. No. 13/871,521 filed Apr. 26, 2013 entitled “Automatic Adjustment of Images using a Homography,” the disclosure of which is incorporated by reference herein in its entirety. The U.S. patent application Ser. No. 13/871,521 claims priority under 35 U.S.C. Section 119(e) to U.S. Provisional Patent Application No. 61/639,721, filed Apr. 27, 2012, and titled “Methods and Apparatus for Automatic Upright Adjustment of Digital Images,” the disclosure of which is hereby incorporated by reference in its entirety.


BACKGROUND
Images (whether digital images or conventional film images) captured by photographers often contain perspective distortions. In particular, man-made structures often appear to be distorted in photos captured by casual photographers, as the scene layout often conflicts with expectations of human perception. For instance, when capturing an image of a skyscraper, the building in the image may be skewed and therefore not appear to be straight up. This may be due to the viewpoint being physically constrained, and therefore capturing an image or images from the best viewpoint is not possible. In these cases, a user (photographer, artist, etc.) may want to apply perspective distortion correction to improve the original digital or digitized image to make it appear as if the scene was captured from a better viewpoint. However, this kind of distortion is difficult to fix manually for at least the reason that perspective distortion correction involves three-dimensional (3D) rotation.
SUMMARY
Techniques involving automatic upright adjustment of images are described. Upright adjustment techniques may provide an automated approach for straightening up slanted man-made structures (or other features such as natural features that are relatively straight, such as trees and horizons) in an input image to improve its perceptual quality. This correction may be referred to as upright adjustment. A set of criteria is described for upright adjustment based on human perception studies. In addition, an optimization framework is described which yields an optimal homography for adjustment. Further, an optimization-based camera calibration technique is described that performs favorably when compared to conventional techniques, and that enables implementations of the automatic upright adjustment techniques to work reliably for a wide variety of images.
Implementations may provide an automatic system for upright adjustment of images that may leverage several criteria for quantitatively measuring the perceived quality of man-made structures or other image features. Following the criteria, a reprojection technique may implement an energy minimization framework that computes an optimal homography to minimize the perceived distortion of slanted structures and other image features. In addition, camera calibration techniques may be employed to simultaneously estimate vanishing lines and points as well as camera parameters that is more accurate and robust than conventional techniques, and may be used to generate estimates of camera parameters and vanishing points and lines that may, for example, be input to the reprojection technique.
Implementations of the automatic upright adjustment technique may handle at least some natural scenes as well as scenes of man-made features. The implementations may work reliably on a wide range of images without involving user interaction.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 shows various examples of upright adjustment of images, according to at least some implementations.
FIG. 2 is a high-level flowchart of the automatic upright adjustment technique, according to at least some implementations.
FIG. 3 is a flowchart of a reprojection technique, according to at least some implementations.
FIG. 4 is a flowchart of a camera calibration technique, according to at least some implementations.
FIG. 5 illustrates Perkin's law.
FIGS. 6A and 6B illustrate results of a corner point extraction technique, according to at least some implementations.
FIGS. 7A and 7B illustrate detecting curved edge pixels, according to at least some implementations.
FIGS. 8A through 8C illustrate adjustment of a photo with large camera rotations, according to at least some implementations.
FIGS. 9A through 9C illustrate perspective distortion control, according to at least some implementations.
FIGS. 10A through 10D illustrate the process of the camera calibration technique, according to at least some implementations.
FIGS. 11A and 11B compare results of an implementation of the automatic upright adjustment technique with manually generated results.
FIG. 12 compares results of an implementation of the automatic upright adjustment technique with images captured using a tilt-shift lens.
FIGS. 13A and 13B illustrates cropping of an adjusted image, according to at least some implementations.
FIGS. 14A through 14C compare results of an implementation of the automatic upright adjustment technique to results of a conventional rectification technique.
FIGS. 15A and 15B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 16A and 16B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 17A and 17B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 18A and 18B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 19A and 19B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 20A and 20B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 21A and 21B illustrate results of an implementation of the automatic upright adjustment technique.
FIGS. 22A and 22B illustrate results of an implementation of the automatic upright adjustment technique.
FIG. 22C illustrates examples of Manhattan and Atlanta world assumptions.
FIG. 23 illustrates example module or modules that may implement an automatic upright adjustment technique, according to at least some implementations.
FIG. 24 illustrates an example computer system that may be used in implementations.



While the techniques are described herein by way of example for several implementations and illustrative drawings, those skilled in the art will recognize that the invention is not limited to the implementations or drawings described. It should be understood, that the drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention. The headings used herein are for organizational purposes only and are not meant to be used to limit the scope of the description. As used throughout this application, the word “may” is used in a permissive sense (i.e., meaning having the potential to), rather than the mandatory sense (i.e., meaning must). Similarly, the words “include”, “including”, and “includes” mean including, but not limited to.
DETAILED DESCRIPTION
Overview
A large portion of consumer photos contain man-made structures, such as urban scenes with buildings and streets, and indoor scenes with walls and furniture. However, photographing these structures properly is not an easy task. Photos taken by amateur photographers often contain slanted buildings, walls, and horizon lines due to improper camera rotations, as shown in the left column of FIG. 1.
The human visual system (referred to herein as human perception, or perception) generally expects tall man-made structures and some other features that may appear in some scenes to be straight-up, and horizon lines to be parallel to the eye level. Conflicts with this system may lead the viewer to a feeling of discomfort when looking at a photo containing slanted (not vertical) structures or other features such as tilted (not horizontal) horizons.
Accordingly, automatic image adjustment techniques are described. For example, an automatic adjustment technique may leverage a single homography to correct a photo under a uniform depth assumption for a scene. A homography may be used to describe a relationship between an image and a scene, such as describe a relationship of a viewpoint of the image to the scene. Therefore, the homography in this example may be used to adjust an image to increase consistency with expectations of human perception.
For example, implementations of an automatic upright adjustment technique are described that may provide an automated approach for straightening up slanted or titled man-made structures and natural features that are expected to be relatively straight such as trees and horizons in an input image to improve its perceptual quality. This correction may be referred to as upright adjustment. A set of criteria based on human perception studies is described that are applied during the upright adjustment. The homography may be calculated in a variety of ways, such as through use of an optimization framework that is configured to yield an optimal homography for adjustment according to the criteria.
Implementations of the automatic adjustment techniques may also be used to adjust the perspective of an input image to improve its visual quality. In at least some implementations, to achieve this, a set of criteria is defined based on perception theories. An optimization framework may be applied for measuring and adjusting the perspective according to the criteria. In at least some implementations, additional constraints may be incorporated to avoid perspective distortions on features such as faces or circles. In addition to applications for adjusting still photos, implementations may be adapted to adjust video frames and thus images may be used to refer to either instance.
Additionally, camera calibration techniques are described. The camera calibration techniques may be used to describe characteristics of an image. These characteristics may then be used as a basis to adjust the image as above. For example, the camera calibration techniques may be used to estimate vanishing lines and points as well as camera parameters in conjunction with each other, i.e., simultaneously. These estimates may then be used as part of the homography above to transform the image based on human perception based criteria to achieve visually plausible results. Further discussion of camera calibration techniques may be found in relation to the camera calibration section below.
In the following detailed description, numerous specific details are set forth to provide a thorough understanding of claimed subject matter. However, it will be understood by those skilled in the art that claimed subject matter may be practiced without these specific details. In other instances, techniques, apparatuses or systems that would be known by one of ordinary skill have not been described in detail so as not to obscure claimed subject matter.
Some portions of the detailed description which follow are presented in terms of algorithms or symbolic representations of operations on binary digital signals stored within a memory of a specific apparatus or special purpose computing device or platform. In the context of this particular specification, the term specific apparatus or the like includes a general purpose computer once it is programmed to perform particular functions pursuant to instructions from program software. Algorithmic descriptions or symbolic representations are examples of techniques used by those of ordinary skill in the signal processing or related arts to convey the substance of their work to others skilled in the art. An algorithm is here, and is generally, considered to be a self-consistent sequence of operations or similar signal processing leading to a desired result. In this context, operations or processing involve physical manipulation of physical quantities. Typically, although not necessarily, such quantities may take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared or otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to such signals as bits, data, values, elements, symbols, characters, terms, numbers, numerals or the like. It should be understood, however, that all of these or similar terms are to be associated with appropriate physical quantities and are merely convenient labels. Unless specifically stated otherwise, as apparent from the following discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing,” “computing,” “calculating,” “determining” or the like refer to actions or processes of a specific apparatus, such as a special purpose computer or a similar special purpose electronic computing device. In the context of this specification, therefore, a special purpose computer or a similar special purpose electronic computing device is capable of manipulating or transforming signals, typically represented as physical electronic or magnetic quantities within memories, registers, or other information storage devices, transmission devices, or display devices of the special purpose computer or similar special purpose electronic computing device.
Implementation Example
FIG. 1 shows various examples of upright adjustment of images according to at least some implementations of the automatic upright adjustment techniques. The left column shows the original images, while the right column shows the resulting images generated according to an implementation of the upright adjustment technique described herein. The top two images (a) show an urban building scene from the street level, the second two images (b) show a planar board, the next two images (c) show an indoor restaurant scene, the next two images (d) show an aerial urban scene, and the last two images (e) show a natural scene with mountains and trees.
Assuming the depth variations of the scene relative to its distance from the camera are small, correcting a slanted structure involves a 3D rotation of the image plane. This correction may be referred to as upright adjustment, since it is used to make manmade (or other) structures appear “straight up” as expected by human perception. Similar corrections have been known as keystoning and perspective correction, which can be achieved by manually warping the image using conventional digital image processing tools, or during capture using a special Tilt Shift lens. However, the target domain of these tools typically involves facades of buildings, while implementations of the upright adjustment technique do not explicitly assume specific types of objects in the scene. In addition, manual correction may involve special skills and become tedious when used to process dozens or hundreds of photos.
Implementations may provide an automatic system for upright adjustment of photos that includes, but is not limited to, the following:

    
    
        several criteria for quantitatively measuring the perceived quality of man-made structures or other image features, based on previous studies on human perception;
        following the criteria, an energy minimization framework that computes an optimal homography that can effectively minimize the perceived distortion of slanted structures and other image features; and
        a camera calibration technique which simultaneously estimates vanishing lines and points as well as camera parameters, and is more accurate and robust than conventional techniques.
    
    


Implementations of the automatic upright adjustment technique may handle at least some natural scenes as well as scenes of man-made features (see the last two images (e) in FIG. 1 for an example). Implementations may also work reliably on a wide range of images without user interaction.
Automatic Adjustment Technique
FIG. 2 is a high-level flowchart depicting an automatic adjustment technique, according to at least some implementations. As indicated at 100, a low-level line detection technique may be applied to an input image (or to each image in an input set of images, such as the frames of a video sequence) to detect lines and edges in the image. Any of various techniques may be used. As indicated at 110, a camera calibration technique that takes at least the line segments as input may be used to estimate vanishing points and lines, as well as other camera parameters. An optimization-based robust camera calibration technique that may be used in at least some implementations to simultaneously estimate vanishing points and lines, as well as camera parameters, is described later in this document.
As indicated at 120, a reprojection is performed according to the camera parameters and vanishing points and lines to effectively perform the upright adjustment. A reprojection model may be used that implies re-shooting of the rectified scene using another camera placed at a possibly different position with novel orientation. In at least some implementations, this new camera may also be allowed to have different focal lengths in horizontal and vertical directions. An energy minimization or optimization framework that computes an optimal homography that can effectively minimize the perceived distortion of slanted structures and other image features is described that may be used in estimating a new camera used in performing the reprojection. As described above, the homography describes a relationship between two images of a same planar surface, such as different perspectives of the image scene. Therefore, the homography in this example may be used to adjust a viewpoint of a scene in an image to be consistent with expectations of human perception. The energy minimization framework may consider several criteria for quantitatively measuring the perceived quality of man-made structures and other image features based on observations about human perception.
As indicated at 130, the resulting adjusted image may optionally be cropped. Cropping may be performed automatically or manually. FIGS. 13A and 13B illustrate cropping of an adjusted image, according to at least some implementations. FIG. 13A shows an adjusted image generated according to an implementation of the automatic upright adjustment technique, and FIG. 13B shows a crop taken from the image of FIG. 13A.
FIG. 3 is a flowchart of a reprojection technique for correcting an image of a scene such as a digital or digitized photograph so that features that should appear substantially vertical and/or horizontal according to human perception are adjusted, according to at least some implementations. The flowchart of FIG. 3 provides details of element 120 of FIG. 2, according to at least some implementations. As indicated at 200, intrinsic camera parameters, such as focal length and center of projection (e.g., an intrinsic parameter matrix “K”) and 3D rotation information (e.g., 3D rotation matrix “R”) and vanishing points and lines (e.g., Manhattan directions “M”) for an image of a scene may be obtained i.e. the major line structures of the scene are aligned to the “x,” “y,” and “z” directions in three dimensions. For example, a rectangular building may be assumed to be oriented following the principal directions of the world.
The camera parameters, 3D rotation information, and vanishing point information may collectively be referred to as original camera information. In at least some implementations, the vanishing points and lines, as well as camera parameters and rotation, may be estimated by an optimization-based, robust camera calibration technique that may be used to simultaneously estimate the vanishing points and lines and the camera parameters and rotation, as described later in this document. However, in some implementations, the vanishing points and lines, camera parameters, and/or 3D rotation may be otherwise estimated and/or obtained. Given the input information, the technique computes a homography that can be applied to the input image to effectively minimize the perceived distortion of slanted or tilted man-made structures and other image features in the image.
Human perception criteria that quantitatively measure the perceived quality of man-made structures or other image features may be used in computing the homography. In at least some implementations, to compute the homography, new camera information that may be used in reprojecting the image is computed. In at least some implementations, to compute the new camera information, an energy function containing energy terms based on the human perception criteria may be minimized to estimate new intrinsic camera parameters and a new 3D rotation for the image, as indicated at 210. The energy function may be initialized according to the original camera information obtained at element 200. Criteria based on human perception that may be used as energy terms to constrain the optimization are described in the section titled Criteria. Mathematical formulations of these criteria are described in the subsection titled Energy terms of the section titled Adjustment Optimization framework. In at least some implementations, the energy function may be minimized subject to a constraint on perspective distortion. In at least some implementations, the energy function may be minimized subject to a constraint on image distortion implemented as one of the energy terms, to minimize distortion of features such as circles and human figures and faces. Other energy terms may include, but are not limited to, a picture-frame alignment energy term and an eye-level alignment energy term. As indicated at 220, the image may then be reprojected according to a homography. In at least some implementations, the homography may be defined by a reprojection model (see Equation (A2)) that incorporates the original camera parameters and 3D rotation (K and R in Equation (A2)) and the new camera parameters and 3D rotation (K1 and R1 in Equation (A2)) computed at element 210 to the original image. In at least some implementations, the reprojection model further incorporates a translation (t1 in Equation (A2)).
Applying the homography to the image may be conceptually viewed as re-capturing the scene using another camera placed at a possibly different position with a new orientation. In at least some implementations, this new camera may also be allowed to have different focal lengths in horizontal and vertical directions. In at least some implementation, a constraint may be applied when minimizing the energy function, implemented as one of the energy terms of the energy function, to prevent the focal lengths in the horizontal and vertical directions from varying too much. Output of the technique of FIG. 3 is an adjusted image in which one or more features of the image that are to appear substantially vertical and/or horizontal according to human perception are adjusted to be more consistent with what the human eye expects to see when viewing the image. For an example of a horizontal feature that has been adjusted, see FIG. 19A, in which the horizon is slightly tilted in an original image, and FIG. 19B, in which the horizon has been adjusted to be more horizontal. For an example of vertical features that have been adjusted, see FIG. 22A, in which the buildings of the skyline are tilted due the optical features of the lens used to capture the original image, and FIG. 22B, in which the buildings have been adjusted to be substantially vertical. Other examples can be seen in FIGS. 1(a) through 1(e), as well as FIGS. 14A through 21B.
FIG. 4 is a flowchart of a camera calibration technique, according to at least some implementations. The flowchart of FIG. 4 provides details of element 110 of FIG. 2, according to at least some implementations. The camera calibration technique may estimate the camera parameters and vanishing points and lines for an input image in conjunction with each other. Output of the camera calibration technique may be input to the technique of FIG. 3. However, note that the camera calibration technique may be used to generate camera parameters and/or vanishing point information for other digital image processing techniques.
As indicated at 300, a set of line segments from an input image may be obtained. A low-level line detection technique may be applied to an input image (or to each image in an input set of images, such as the frames of a video sequence) to detect lines and edges in the image. Any of various techniques may be used to detect the line segments. As indicated at 310, initial values for the calibration technique may be determined. As indicated at 320, an energy function may be iteratively optimized to simultaneously estimate camera intrinsic parameter matrix “K,” orientation matrix “R” (e.g., a rotation matrix that may be used to describe a rotation in two dimensional or three dimensional space), and vanishing points for the input image. The camera intrinsic parameter matrix “K” may describe values such as a focal length, pixel size in one or more directions (e.g., “x” and “y” directions), and a principal point (e.g., which may be defined using “x” and “y” coordinates). As indicated at 330, vanishing lines for each vanishing point may be determined.
In the following sections, various elements of FIGS. 2 through 4 are described in more detail. A set of criteria for upright adjustment of photos that may be used in at least some implementations is first described. A formulation of an image transformation that may be used in at least some implementations is then described. An energy minimization framework that may be used in at least some implementations for performing the upright adjustment according to the criteria is then described. The energy minimization framework assumes as input camera parameters and vanishing points and lines estimated according to a camera calibration technique or other technique. Finally, implementations of a camera calibration technique that may be used in at least some implementations to simultaneously estimate the camera parameters and vanishing points and lines for an input image are described.
Criteria
Scenes with well-structured man-made objects often include many straight lines that are supposed to be horizontal or vertical in the world coordinates in regards to human perception. The criteria described herein, based on observations of human perception, reflect these characteristics. One or more of these criteria may be used as constraints in the optimization framework when optimizing the homography (see Equation (A2)) to estimate then new camera parameters (new intrinsic parameter matrix K1 with additional 3D rotation R1 and translation t1) that are used in the reprojection of the image. Note that the criteria described in this section are described mathematically in the subsection titled Energy terms of the section titled Adjustment Optimization framework.
Picture Frame Alignment
When looking at a big planar facade or a close planar object such as a painting, it is usually perceived as orthogonal to the view direction, and the horizontal and vertical object lines are assumed to be parallel and perpendicular to the horizon, respectively. When a photo of the same scene is viewed, the artificial picture frame (i.e., borders of the image) imposes significant alignment constraints on the object lines, and the viewer may feel discomfort if the object line directions are not well aligned with the picture frame orientation. FIGS. 1(a) and 1(b) show typical examples. It should be noted that such an artifact becomes less noticeable as the misalignments of line directions become larger, since in that case the viewer begins to perceive 3D depths from a slanted plane.
Eye Level Alignment
The eye level of a photo may be defined as a 2D line that contains the vanishing points of 3D lines parallel to the ground. In a scene of an open field or sea, the eye level may coincide with the horizon. However, even when the horizon is not visible, the eye level can still be defined as the connecting line of specific vanishing points. Eye level alignment may play a significant role in upright adjustment, especially when there are no other major object lines to be aligned to the picture frame. For example, in FIG. 1 (d), the invisible eye level is dominantly used to correct an unwanted rotation of the camera.
Perspective Distortion
Since humans do not usually see objects outside the natural field of view (FOV), an object may seem to be distorted when the object is pictured as if it is out of the FOV. This distortion can be hardly seen in ordinary photos, except for those taken with wide-angle lenses. However, such distortion may happen if a large rotation is applied to the image plane, which corresponds to a big change of the camera orientation. To prevent this from happening, at least some implementations may be configured to explicitly constrain perspective distortion in the upright adjustment process.
Image Distortion
When a transformation is applied to a photo, image distortion cannot be avoided. However, the human visual system may be tolerant to distortions of rectangular objects, while it is sensitive to distortions of circles, faces, and other familiar objects. This phenomenon may be considered in at least some implementations of the upright adjustment technique to reduce the perceived distortions in the resulting image as much as possible.
Formulation of the Image Transformation Used for Upright Adjustment
Implementations may assume that depth information is not available for the input image, and thus a homography may be used to transform the image for upright adjustment. A transformation may be used in some implementations, such as content-preserving warping. However, such a transformation contains more degrees of freedom, and therefore involves a large amount of reliable constraints that are then fulfilled with user interaction or additional information about the scene geometry. Accordingly, a homography may be used to achieve visually plausible results, especially for man-made structures. A given image can be rectified with a homography matrix “H” using the following equation:

p′=Hp=K(KR)−1p,  (A1)

where “p” and “p′” represent a position and its re-projection in the image, respectively “K” and “R” are intrinsic parameters and orientation matrices of the camera, respectively:




  
    K
    =
    
      (
      
        
          
            f
          
          
            0
          
          
            
              u
              0
            
          
        
        
          
            0
          
          
            f
          
          
            
              v
              0
            
          
        
        
          
            0
          
          
            0
          
          
            1
          
        
      
      )
    
  




  and




  
    
      R
      =
      
        
          R
          ψ
        
        ⁢
        
          R
          θ
        
        ⁢
        
          R
          φ
        
      
    
    ,
  



where “RΨ,” “Rθ,” and “Rφ” are rotation matrices with angles “Ψ,” “θ,” and “φ” along the “x,” “y,” and “z” axes, respectively. Note that “R” may be referred to herein as an orientation matrix “R.”

In some instances, image rectification may generate a visually unpleasing result (see, e.g., FIG. 9B). In at least some implementations of the automatic upright adjustment technique, for upright adjustment, Equation (AI) may be modified to support flexible control for enhancing the perceptual quality of the results over that of a simple rectification. In at least some implementations, the homography may be defined by the following re-projection model:

p′=Hp=K1{R1(KR)−1p+t1},  (A2)

where:





  
    
      
        
          
            
              K
              1
            
            =
            
              (
              
                
                  
                    
                      f
                      
                        1
                        ⁢
                        x
                      
                    
                  
                  
                    0
                  
                  
                    
                      u
                      1
                    
                  
                
                
                  
                    0
                  
                  
                    
                      f
                      
                        1
                        ⁢
                        y
                      
                    
                  
                  
                    
                      v
                      1
                    
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    1
                  
                
              
              )
            
          
          ,
          
            

          
          ⁢
          
            
              R
              1
            
            =
            
              
                R
                ψ1
              
              ⁢
              
                R
                θ1
              
              ⁢
              
                R
                φ1
              
            
          
          ,
          
            

          
          ⁢
          and
        
        ⁢
        
          

        
        ⁢
        
          
            t
            1
          
          =
          
            
              
                [
                
                  
                    t
                    
                      1
                      ⁢
                      x
                    
                  
                  ⁢
                  
                    t
                    
                      1
                      ⁢
                      y
                    
                  
                  ⁢
                  0
                
                ]
              
              T
            
            .
          
        
      
    
    
      
        (
        A3
        )
      
    
  




Compared to Equation (AI), Equation (A2) contains an intrinsic parameter matrix “K1” with additional three dimensional rotation “R1” and translation “t1”. This re-projection model implies re-shooting of the rectified scene using another camera placed at a possibly different position with novel orientation. In at least some implementations, this new camera may also be allowed to have different focal lengths in horizontal and vertical directions.
Adjustment Optimization Framework
In this section, an energy function for the image transformation (equation (A2)) formulated in the section titled Formulation of the image transformation used for upright adjustment according to the criteria based on human perception defined in the section titled Criteria is described. In at least some implementations, it may be assumed that camera parameters “K” and “R” have been estimated by a camera calibration technique. Thus, there are nine unknowns “f1x”, “f1y”, “u1”, “v1”, “ψ1”, “θ1”, “φ1”, “tx,” and “ty” in Equation (A2). However, “u1” and “v1” simply shift the result image after the transformation, and thus may be set as “u1=u0” and “v1=v0”. In at least some implementations, the objective thus becomes optimizing Equation (A2) with respect to the seven parameters of homography matrix “H.”
Although other techniques can also be used for camera calibration, a technique for robust camera calibration that may be used in at least some implementations is presented in the section titled Camera Calibration technique. In the camera calibration technique, at least some implementations may take the Manhattan world assumption, i.e. the major line structures of the scene are aligned to the “x,” “y,” and “z” directions in three dimensions. For example, a rectangular building may be assumed to be oriented following the principal directions of the world.
In at least some implementations, Manhattan directions “M=[vx vy vz]” may be obtained in addition to “K” and “R”, where “vx,” “vy,” and “vz” represent the three vanishing points corresponding to the “x,” “y,” and “z” directions, respectively. Three pencils of vanishing lines, “Lx,” “Ly,” and “Lz,” which contain two dimensional lines intersecting at vanishing points “vx,” “vy,” and “vz,” respectively, may also be obtained. The vanishing lines in “Lx,” “Ly,” and “Lz,” are projections of three dimensional lines that are parallel to the “x,” “y,” and “z” axes, respectively.
Energy Terms
Picture Frame Alignment
For major line structures of the scene to be aligned with the picture frame, vanishing lines corresponding to “x” and “y” directions for purposes of human perception should be horizontal and vertical in a photo, respectively. That is, vanishing lines in “Lx” and “Ly” are to be transformed to horizontal and vertical lines by a homography “H,” making vanishing points “vx” and “vy” placed at infinity in the “x” and “y” directions, respectively.
Let “l” be a vanishing line, and “p” and “q” two end points of “l.” The direction of the transformed line “l” may be expressed as follows:




  
    d
    =
    
      
        
          q
          ′
        
        -
        
          p
          ′
        
      
      
        
        
          
            q
            ′
          
          -
          
            p
            ′
          
        
        
      
    
  
  ,




where:




  
    
      p
      ′
    
    =
    
      Hp
      
        
          e
          z
          T
        
        ⁢
        Hp
      
    
  




  and




  
    
      q
      ′
    
    =
    
      
        Hq
        
          
            e
            z
            T
          
          ⁢
          Hq
        
      
      .
    
  



The expression “ez=[0 0 1]T may be used to normalize homogeneous coordinates. In at least some implementations, the energy term may be defined as:





  
    
      
        
          
            E
            pic
          
          =
          
            
              
                λ
                v
              
              ⁢
              
                
                  ∑
                  i
                
                ⁢
                
                  
                    
                      w
                      i
                    
                    ⁡
                    
                      (
                      
                        
                          e
                          x
                          T
                        
                        ⁢
                        
                          d
                          
                            y
                            i
                          
                        
                      
                      )
                    
                  
                  2
                
              
            
            +
            
              
                λ
                h
              
              ⁢
              
                
                  ∑
                  j
                
                ⁢
                
                  
                    
                      w
                      j
                    
                    ⁡
                    
                      (
                      
                        
                          e
                          y
                          T
                        
                        ⁢
                        
                          d
                          
                            x
                            j
                          
                        
                      
                      )
                    
                  
                  2
                
              
            
          
        
        ,
      
    
    
      
        (
        A4
        )
      
    
  




where “dyi” is the direction of the transformed line “l′yi” of a vanishing line “lyi” in “Ly. ex=[1 0 0]T,” and “exTdyj” is the deviation of “l′yi” from the vertical direction. The term “dxt” is defined similarly for a vanishing line “lxj” in “Lx,” and “ey=[0 1 0]T” is used to measure the horizontal device.

In Equation (A4), the weight “w” for a line “l” is the original line length before transformation, normalized by the calibrated focal length “f,” i.e.,

w=∥q−p∥/f. 

In at least some implementations, the weights “λv” and “λh” may be adaptively determined using initial rotation angles, as the constraint of picture frame alignment becomes weaker as rotation angles get bigger. At least some implementations may use:




  
    
      
        
          
            λ
            v
          
          =
          
            exp
            ⁡
            
              (
              
                -
                
                  
                    ψ
                    2
                  
                  
                    2
                    ⁢
                    
                      σ
                      v
                      2
                    
                  
                
              
              )
            
          
        
        ⁢
        
          

        
        ⁢
        and
        ⁢
        
          

        
        ⁢
        
          
            
              λ
              h
            
            =
            
              exp
              ⁡
              
                (
                
                  -
                  
                    
                      θ
                      2
                    
                    
                      2
                      ⁢
                      
                        σ
                        h
                        2
                      
                    
                  
                
                )
              
            
          
          ,
        
      
    
    
      
        (
        A5
        )
      
    
  




where “Ψ” and “θ” are calibrated rotation angles along the “x” and “y” axes respectively. “σv” and “σh” are parameters usable to control the tolerances to the rotation angles. In at least some implementations, these control parameters may be fixed as “σv=π/12” and “σh=π/15.” Other values may be used for the control parameters, and in some implementations the control parameters may be adjustable, for example via user input to a user interface.

Eye-Level Alignment
The eye-level in a photo may be defined as a line connecting two vanishing points “vx” and “vz.” Let “v′x” and “v′z” be the transformed vanishing points:



  
    
      v
      x
      ′
    
    =
    
      
        Hv
        x
      
      
        
          e
          z
          T
        
        ⁢
        
          Hv
          x
        
      
    
  




  and




  
    
      v
      z
      ′
    
    =
    
      
        
          Hv
          z
        
        
          
            e
            z
            T
          
          ⁢
          
            Hv
            z
          
        
      
      .
    
  



An objective relating to human perception may be to make the eye-level horizontal. In at least some implementations, the energy term may be defined as:




  
    
      
        
          
            
              E
              eye
            
            =
            
              
                (
                
                  
                    
                      ∑
                      i
                    
                    ⁢
                    
                      w
                      i
                    
                  
                  +
                  
                    
                      ∑
                      j
                    
                    ⁢
                    
                      w
                      j
                    
                  
                
                )
              
              ⁢
              
                
                  (
                  
                    
                      e
                      y
                      T
                    
                    ⁢
                    
                      d
                      e
                    
                  
                  )
                
                2
              
            
          
          ,
          
            

          
          ⁢
          where
        
        ⁢
        
          

        
        ⁢
        
          
            
              d
              e
            
            =
            
              
                (
                
                  
                    v
                    z
                    ′
                  
                  -
                  
                    v
                    x
                    ′
                  
                
                )
              
              /
              
                
                
                  
                    v
                    z
                    ′
                  
                  -
                  
                    v
                    x
                    ′
                  
                
                
              
            
          
          ,
        
      
    
    
      
        (
        A6
        )
      
    
  




and “wi” and “wj” are weights used in Equation (A4). Since eye-level alignment may be enforced even when a photo contains many vanishing lines, such implementations may weight “Eeye” by a sum of line weights to properly scale “Eeye” with respect to “Epic.”

Perspective Distortion
Perspective distortion of a cuboid can be measured using Perkins's law, as illustrated in FIG. 5. According to Perkins's law, vertices of a cube may be divided into two categories; fork and arrow junctures. For a fork juncture, “a1,” “a2,” and “a3′′” are defined to be greater than “π/2.” For an arrow juncture, both “β1” and “β2” are defined to be less than “π/2,” and the sum of the two angles is defined to be greater than “π/2.” Vertices that violate the above conditions will not be perceived as vertices of a cube to the viewer.
To apply Perkin's law, at least some implementations may detect corner points that are located on vertices of a cuboid. First, points are extracted where the start or end points of vanishing lines from two or three different axes meet. A mean-shift algorithm (or alternatively some other technique) may then be applied to those points to remove duplicated or nearby points. In at least some implementations, corner points with corner angles that are too small may also be removed. FIGS. 6A and 6B illustrate results of this corner point extraction technique, according to at least some implementations. Extracted points are marked as dots.
The extracted corner points may be used to measure perspective distortion under Perkins's law. For each corner point, three lines are drawn connecting the corner point to the three vanishing points. Angles between the three lines are then measured to see if Perkins's law is violated or not:




  
    
      
        
          
            
          
          ∀
        
        ⁢
        
          c
          i
        
        ,
        
          
            min
            ⁡
            
              (
              
                
                  α
                  
                    i
                    1
                  
                
                ,
                
                  α
                  
                    i
                    2
                  
                
                ,
                
                  α
                  
                    i
                    3
                  
                
              
              )
            
          
          >
          
            π
            2
          
        
      
    
    
      
        (
        A7
        )
      
    
  




where “ci” represents a corner point. At least some implementations consider fork junctures solely, since arrow junctures can be transformed to fork junctures by swapping the direction of an edge.

Image Distortion
In at least some implementations, circles and other features in the input image may be detected to accurately measure image distortion. However, accurately detecting these features may be difficult. Thus, at least some implementations may instead use an approximation as described below.
First, low-level image edges may be detected, for example using a Canny detector. Then, edge pixels that are nearby straight lines may be removed. Assuming the remaining edge pixels are from curved lines that could be originated from some features (see FIGS. 7A and 7B), distortions of these pixels may be measured, for example using the following Jacobian measure:




  
    
      E
      reg
    
    =
    
      
        λ
        r
      
      ⁢
      
        
          ∑
          i
        
        ⁢
        
          
            (
            
              
                det
                (
                
                  J
                  (
                  
                    
                      Hp
                      i
                    
                    
                      
                        e
                        z
                        T
                      
                      ⁢
                      
                        Hp
                        i
                      
                    
                  
                  )
                
                )
              
              -
              1
            
            }
          
          2
        
      
    
  
  ,




where “pi” is a remaining edge pixel, “J(•)” is the Jacobian matrix, and “det(•)” is the determinant. Jacobian matrix of a pixel “p” may be discreetly computed. For example, let “q” and “r” be two neighbor pixels of “p,” so that “p=(x,y)T,” “q=(x+1,y)T” and “r=(x,y+1)T.” Then the Jacobian matrix of “p” under a homography “H” is approximated as:





  
    J
    ⁡
    
      (
      p
      )
    
  
  =
  
    [
    
      
        
          
            
              (
              
                
                  Hq
                  
                    
                      e
                      z
                      T
                    
                    ⁢
                    Hq
                  
                
                -
                
                  Hp
                  
                    
                      e
                      z
                      T
                    
                    ⁢
                    Hp
                  
                
              
              )
            
            T
          
        
      
      
        
          
            
              (
              
                
                  Hr
                  
                    
                      e
                      z
                      T
                    
                    ⁢
                    Hr
                  
                
                -
                
                  Hp
                  
                    
                      e
                      z
                      T
                    
                    ⁢
                    Hp
                  
                
              
              )
            
            T
          
        
      
    
    ]
  




This energy increases when non-rigid transforms are applied to the pixels causing distortions of features. For “λr,” at least some implementations may use a small value (e.g., 10−4). FIG. 7A shows an example original image, and FIG. 7B shows an example of detected curved edge pixels in which some features may be detected, such as human heads and letters.

Focal Length Difference
In at least some implementations, a reprojection model for a homography may be used that allows different focal lengths along the “x” and “y” axes for more natural results. However, for purposes of human perception the two lengths are not to differ by too much. To enforce this property, the following energy may be defined:

Efacal=λf(f1x−f1y)2,

In at least some implementations:

λf=(4/f)2.

Energy Function Minimization
In at least some implementations, the energy function that may be minimized for upright adjustment becomes by combining each of the energy terms above:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            H
          
          ⁢
          
            
          
          ⁢
          
            E
            pic
          
        
        +
        
          E
          eye
        
        +
        
          E
          reg
        
        +
        
          E
          focal
        
      
    
    
      
        (
        A8
        )
      
    
  




The above expression is subject to equation sixteen above that relates to Perkin's law. Accordingly, there are nine unknowns to be optimized: “K1,” “R1,” and “t1” that include the values “f1x”, “f1y”, “u1”, “v1”, “Ψ1”, “θ1”, “tx” and “ty” as defined above. However, “u1” and “v1” simply shift the resulting image after the transformation, and thus “u1=u0” and “v1=v0”. Thus, equation three above may be optimized with respect to seven parameters. To initialize the variables, at least some implementations may use the following:

f1x=f1y=f,Ψ1=0,θ1=0,φ1=−φ, and tx=ty=0,

where f and φ are values that may, for example, be obtained by camera calibration.

Note that this energy function is non-linear and is not solvable in a closed form. In at least some implementations, a numerical technique, for example using “fmincon” in Matlab or a similar function, may be used to minimize the energy function. Although global optimum is not guaranteed, this approach works well in practice. Note that other implementations may use other techniques to minimize the energy function.
Homography Optimization Parameters
In at least some implementations, the parameters for homography optimization described above may be adjusted to fulfill the user's intention. For example, relaxing the eye-level constraint may not be recommended, because this criterion is enforced to obtain a perceptually better result. However, a user may wish to control the effect of picture frame alignment by manipulating “σv” and “σh3,” to avoid too aggressive adjustments. Thus, at least some implementations may provide a technique, for example via a user interface via which the user may adjust one or more homography optimization parameters.
Effects of Upright Adjustment Criteria
FIGS. 8A through 8C illustrate adjustment of a photo with large camera rotations, according to at least some implementations. FIG. 8A shows an original image, FIG. 8B shows the image as conventionally rectified, and FIG. 8C shows results of application of an implementation of the techniques described herein. Picture frame alignment may be desirable for photos of big planar objects, such as facades of buildings and billboards. However, its effect may diminish as the rotation angles of the camera increase, otherwise it may lead to undesirable distortion (see, e.g., FIG. 8B). Note that if picture frame alignment dominates other criteria, the adjustment result becomes similar to simple image rectification. At least some implementations may automatically handle this problem with an adaptive weight scheme (Equation (A5)) as well as the perspective and image distortion criteria, generating a better result as shown in FIG. 8C.
FIGS. 9A through 9C illustrate perspective distortion control, according to at least some implementations. FIG. 9A shows an original image. FIG. 9B shows a resulting image generated by adjusting the image of FIG. 9A without a perspective distortion constraint. FIG. 9C shows a resulting image generated by adjusting the image of FIG. 9A without a perspective distortion constraint, according to at least some implementations. Eye-level alignment may become increasingly desirable as the effect of picture frame alignment gets weaker (see, e.g., FIG. 1(d)), although applying this criterion may help to obtain a better result. Perspective distortion control prevents too strong adjustment that could make objects in the image appear distorted (see, e.g., FIGS. 9B and 9C). In at least some implementations, the focal lengths in the “x” and “y” directions may be allowed to slightly deviate with Equation (A3), resulting in a small aspect ratio change, to ease the perspective distortion.
Camera Calibration Techniques
In this section, a variety of different optimization-based technique for camera calibration are described that may, for example, be used to estimate the matrices “K” and “R” in Equation (A2), in at least some implementations of the automatic upright adjustment technique. Accordingly, a first example of one such technique is described, which is then followed by another example.
First Camera Calibration Example
In at least some conventional calibration techniques, Manhattan directions “M” are first determined using vanishing lines and vanishing points detected from the input photo, and then “K” and “R” are directly obtained from “M.” However, in determining “M,” corresponding vanishing points for the “x”, “y”, and “z” axes may not be obvious because there could be many vanishing points, possibly with position errors. The inaccuracy of “M” is then immediately propagated to “K” and “R” in such instances.
In contrast, implementations of the camera calibration technique described herein may estimate “K,” “R,” and “M” in conjunction with each other (i.e., “simultaneously”), for example using a maximum a posteriori (MAP) approach, which may produce results with increased reliability in comparison with these conventional techniques.
While the camera calibration technique is described as being used in at least some implementations of the automatic upright adjustment technique to estimate camera parameters and vanishing points and lines for an input image, note that the technique may be applied in other digital image processing techniques and techniques than those described herein to estimate camera parameters and/or vanishing points and lines for an input image.
Line Segment Detection
Line segments are basic primitives in implementations of the calibration technique. From the input image, a set of line segments “L” may be extracted, for example using a technique in a multi-scale fashion. For each line segment “li” its two end points “pi” and “qi” may be stored.
Calibration Formulation
In at least some implementations, the joint probability of Manhattan directions “M,” intrinsic matrix “K,” and orientation matrix “R” with respect to line segments L can be expressed as follows:

p(K,R,M|L)∝p(L|K,R,M)p(K,R,M)=p(L|M)p(M|K,R)p(K)p(R),   (A9)

with assumptions that “K” and “R” are independent of each other and also independent of “L.” By taking log probability, Equation (A9) may be rephrased into an energy function as:

EK,R,M|L=EK+ER+EM|K,R+RL|M   (A10)

Prior EK 
To define the prior for “K,” at least some implementations may assume that the center of projection “cp=(u0, v0)” is the image center “c1=(cx, cy),” and that the focal length “f” is the image width “W.” “EK” may then be defined as:




  
    E
    K
  
  =
  
    
      
        
          λ
          f
        
        ⁡
        
          (
          
            
              
                max
                ⁡
                
                  (
                  
                    W
                    ,
                    f
                  
                  )
                
              
              
                min
                ⁡
                
                  (
                  
                    W
                    ,
                    f
                  
                  )
                
              
            
            -
            1
          
          )
        
      
      2
    
    +
    
      
        λ
        c
      
      ⁢
      
        
          
            
            
              
                c
                p
              
              -
              
                c
                I
              
            
            
          
          2
        
        .
      
    
  




At least some implementations may set “λf as 0.04” and “λc as (10/W)2.” However, other values may be used in other implementations as further described below.

Prior Er 
For the prior of “R,” at least some implementations may assume that the orientation of the camera is aligned with the principal axes of the world, which is a reasonable assumption in most cases. In at least some implementations:

ER=λψψ2+λ0θ2+λφφ2.

In at least some implementations, the three rotation angles are not weighted equally. Particularly, it can be found that the prior for φ (z-axis rotation) should be stronger to enforce eye-level alignment. Thus, at least some implementations may use:

[λψ,λθ,λφ]=[4/π,3/π,6/π]2.

Posterior EM|K,R 
In at least some implementations, if “K” and “R” are known, “M” can be estimated as:

M=[vxvyvx]=(KR)I3,

where “I3=[exey ez]” is the identify matrix. In at least some implementations, using this property, an energy function may be formulated as follows:





  
    E
    
      
        M
        ❘
        K
      
      ,
      R
    
  
  =
  
    
      λ
      M
    
    ⁢
    
      
        ∑
        
          i
          ∈
          
            {
            
              x
              ,
              y
              ,
              z
            
            }
          
        
      
      ⁢
      
        
          
            [
            
              
                cos
                
                  -
                  1
                
              
              ⁢
              
                {
                
                  
                    e
                    i
                    T
                  
                  ⁢
                  
                    
                      
                        
                          (
                          KR
                          )
                        
                        
                          -
                          1
                        
                      
                      ⁢
                      
                        v
                        i
                      
                    
                    
                      
                      
                        
                          
                            (
                            KR
                            )
                          
                          
                            -
                            1
                          
                        
                        ⁢
                        
                          v
                          i
                        
                      
                      
                    
                  
                
                }
              
            
            ]
          
          2
        
        .
      
    
  




This energy function covers the orthogonality of Manhattan directions and the prior for zenith. In at least some implementations, “λM” may be set as “(24/π)2.” However, other values for “λM” may be used in some implementations.
Posterior EL|M 
This term measures the conformity of detected line segments to the estimated vanishing points. In at least some implementations, vanishing points for which more line segments could be parts of vanishing lines may be desirable. In at least some implementations, the energy function is:




  
    
      E
      
        L
        ❘
        M
      
    
    =
    
      
        λ
        L
      
      ⁢
      
        
          ∑
          i
        
        ⁢
        
          min
          ⁢
          
            {
            
              
                d
                ⁡
                
                  (
                  
                    
                      v
                      x
                    
                    ,
                    
                      1
                      i
                    
                  
                  )
                
              
              ,
              
                d
                ⁡
                
                  (
                  
                    
                      v
                      y
                    
                    ,
                    
                      1
                      i
                    
                  
                  )
                
              
              ,
              
                d
                ⁡
                
                  (
                  
                    
                      v
                      y
                    
                    ,
                    
                      1
                      i
                    
                  
                  )
                
              
            
            }
          
        
      
    
  
  ,




where “d(•)” is the distance between a vanishing point and a line. At least some implementations may use the following distance definition:





  
    
      
        
          
            d
            ⁡
            
              (
              
                v
                ,
                1
              
              )
            
          
          =
          
            min
            ⁡
            
              (
              
                
                  
                    
                    
                      
                        r
                        T
                      
                      ⁢
                      p
                    
                    
                  
                  
                    
                      
                        r
                        1
                        2
                      
                      +
                      
                        r
                        2
                        2
                      
                    
                  
                
                ,
                δ
              
              )
            
          
        
        ,
      
    
    
      
        (
        A11
        )
      
    
  




where “p” and “q” are two end points of “l” and





  r
  =
  
    
      
        (
        
          
            p
            +
            q
          
          2
        
        )
      
      ×
      v
    
    =
    
      [
      
        
          
            
              r
              1
            
          
          
            
              r
              2
            
          
          
            
              
                
                  
                    r
                    3
                  
                  ]
                
                T
              
              .
            
          
        
      
    
  




“δ” is the given maximum error value. In at least some implementations, “δ” may be 1.75. In at least some implementations, “λL” may be set to 0.02. However, note that other values may be used for “δ” and/or “λL” in some implementations.

Dealing with Missing Vanishing Points
When “M” is estimated, all three vanishing points may not be found in some cases. In at least some implementations, for robustness, the energy terms “EM|K,R” and “EL|M” may be able to handle this case. In at least some implementations, for “EM|K,R” the energy may be set to zero for a missing vanishing point, assuming that the point is located at the position estimated using “K” and “R.” In at least some implementations, for “EL|M, d(vmiss,li) is δ for li.”
Iterative Optimization of K, R, and M
With the energy terms defined above, directly optimizing Equation (A10) may be difficult since it is highly non-linear. Therefore, at least some implementations may use an iterative technique to find an approximate solution.
In at least some implementations, in the iterative technique, the technique may alternately optimize “K”, “R,” and “M.” In at least some implementations, by fixing “M,” Equation (A10) can be optimized with “K” and “R” by:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              K
              ,
              R
            
          
          ⁢
          
            E
            K
          
        
        +
        
          E
          R
        
        +
        
          
            E
            
              
                M
                |
                K
              
              ,
              R
            
          
          .
        
      
    
    
      
        (
        A12
        )
      
    
  




Similarly, in at least some implementations, optimization of “M” can be achieved by solving:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            M
          
          ⁢
          
            E
            
              
                M
                |
                K
              
              ,
              R
            
          
        
        +
        
          
            E
            
              L
              |
              M
            
          
          .
        
      
    
    
      
        (
        A13
        )
      
    
  




To optimize “K” and “R” given “M,” at least some implementations may use “fminsearch” in Matlab or a similar function, or some other optimization technique. However, optimization of “M” may still be difficult even if “K” and “R” are fixed, since “EL|M” truncates distances to “δ” as defined in Equation (A11). To solve Equation (A13), at least some implementations may use a discrete approximation.
In at least some implementations, from the line segments “L,” a large set of vanishing points “V=[v1, v2, . . . , vn]” may be hypothesized, where each element is computed as the intersection point of two randomly selected lines. Optimizing “M” thus becomes selecting vanishing points from “V” to minimize the energy in Equation (A13). For each element of “M=[vx, vy vz],” a vanishing point in “V” is found that minimizes the energy while retaining the other two elements.
In at least some implementations, a small subset “Vc={Vc1, Vc2, . . . , Vck}” may be selected from “V” that is the “closest to all lines” in the following way:




  
    
      
        arg
        ⁢
        
          
        
        ⁢
        min
      
      
        {
        
          
            v
            
              c
              1
            
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            v
            
              c
              k
            
          
        
        }
      
    
    ⁢
    
      
        ∑
        i
        
          
        
      
      ⁢
      
        min
        ⁢
        
          {
          
            
              d
              ⁡
              
                (
                
                  
                    v
                    
                      c
                      1
                    
                  
                  ,
                  
                    1
                    i
                  
                
                )
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              d
              ⁡
              
                (
                
                  
                    v
                    
                      c
                      k
                    
                  
                  ,
                  
                    1
                    i
                  
                
                )
              
            
          
          }
        
      
    
  
  ,




where “k=9” in at least some implementations. In at least some implementations, a special vanishing point “vmiss,” representing a missing vanishing point, may be added into “Vc” because “Vc” may not contain each of the Manhattan directions of the scene. For each triplet of vanishing points in “Vc,” at least some implementations may optimize “K,” “R,” and “M” using Equations (A12) and (A13), and then evaluate Equation (A10). Finally, “K,” “R,” and “M” with the minimum energy may be used as the calibration results.

In at least some implementations, although initial “Vc” may not contain each of the Manhattan directions, the missing directions can be detected from “V” while optimizing Equation (A13) in the iterative optimization process. However, optimizing “K,” “R,” and “M” for each of the possible triplets in “Vc” may be computationally expensive. Thus, at least some implementations may use one or more early termination strategies for speedup as described in further detail below.
Grouping Vanishing Lines
After the calibration process, at least some implementations may determine the vanishing lines for each vanishing point in “M.” Three sets of vanishing lines, “Lx,” “Ly,” and “Lz,” may be obtained from “L” by:

Li{lεL|d(vi,l)<δ},iγ{x,y,z}, 

where “d(•)” is the distance function defined in Equation (A11). Examples of camera calibration results with estimated vanishing lines are shown in FIGS. 10A-10D.

Camera Calibration Parameters
In some implementations, the values of the parameters for camera calibration may be fixed. However, in other implementations, the values may be specified. Values for these parameters may, for example, be determined experimentally. “δ” is related to the tolerance of noise in line segment positions. If “δ” is set too small or too large, the algorithm may not find optimal vanishing points since line segments could be grouped less accurately. “δ” is also related to “λL,” since the energy function “EL|M” is related to the distances between lines and vanishing points which are truncated to “δ”. Generally, “λL” is decreased as “δ” is increased, otherwise the calibration result may depend on “EL|M” to an excessive amount.
Decreasing “φ,” “n,” and “kc” may speed up the computation, at the cost of less accurate estimation. In addition, using bigger values for these parameters may not improve the estimation results. Similar to many other camera calibration techniques, implementations of the calibration technique are randomized and occasionally may obtain undesirable results. However, with the priors on “K” and “R” and simultaneous optimization of “K,” “R,” and “M”, stable results may be realized in most cases. At least some implementations may provide a technique, for example via a user interface, via which the user may adjust one or more camera calibration parameters.
Camera Calibration Initialization
The following recaps the camera calibration technique, and describes initialization details for the technique. An objective is to estimate camera intrinsic parameter matrix “K” and orientation “R,” as well as Manhattan direction “M” from a single image. In at least some implementations, this may be done by minimizing the following energy function:

EK,R,M|L=EK+ER+EM|K,R+RL|M.   (B1)

(Note that this energy function is also shown as Equation (A10)). At least some implementations may use an alternating optimization scheme to optimize “K,” “R,” and “M”. In some implementations, “M” is fixed to update “K” and “R” with the following equation:





  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              K
              ,
              R
            
          
          ⁢
          
            E
            K
          
        
        +
        
          E
          R
        
        +
        
          
            E
            
              
                M
                |
                K
              
              ,
              R
            
          
          .
        
      
    
    
      
        (
        B2
        )
      
    
  




Then “M” is updated by fixing “K” and “R” as:





  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            M
          
          ⁢
          
            E
            
              
                M
                |
                K
              
              ,
              R
            
          
        
        +
        
          
            E
            
              L
              |
              M
            
          
          .
        
      
    
    
      
        (
        B3
        )
      
    
  




This optimization process can optimize “K,” “R,” and “M” in conjunction with each other, i.e., “simultaneously.” In at least some implementations, to determine initial values, a small subset “{vc1, vc2, . . . , vck}” is selected from “V.” Then three vanishing points are selected as initial “M” from “Vc” to evaluate Equation (B1).
In at least some implementations, based on the Manhattan assumption, “Vc” may be selected that can minimize “EL|M” as follows:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              {
              
                
                  v
                  
                    c
                    1
                  
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  v
                  
                    c
                    k
                  
                
              
              }
            
          
          ⁢
          
            
              
                ∑
                n
              
              
                i
                =
                1
              
              
                
              
            
            ⁢
            
              min
              ⁢
              
                {
                
                  
                    d
                    ⁡
                    
                      (
                      
                        
                          v
                          
                            c
                            1
                          
                        
                        ,
                        
                          1
                          i
                        
                      
                      )
                    
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    d
                    ⁡
                    
                      (
                      
                        
                          v
                          
                            c
                            k
                          
                        
                        ,
                        
                          1
                          i
                        
                      
                      )
                    
                  
                
                }
              
            
          
        
        ,
      
    
    
      
        (
        B4
        )
      
    
  




where “n” is the number of line segments and “d(•)” is the distance function defined above. In at least some implementations, “k=9.” For each triplet of vanishing points in “Vc,” Equation (B1) may be evaluated by optimizing “K” and “R” with respect to the triplet. However, when vanishing points are selected, often some vanishing points may be missing, since there may be no vanishing point that represents a specific Manhattan direction (see, e.g., FIG. 10B).

In at least some implementations this may be modeled by adding a special vanishing point “vmiss,” representing a missing vanishing point, into “Vc” so that “Vc={vc1, . . . , vck, vmiss}.” Then a triplet of vanishing points may be selected to build “M” from “Vc” as follows:

M=[vxvyvz]

1≦x,y,z≦k+1

x≠y≠x if x,y,z≦k, 

where “vx,” “vy,” and “vz” are “x,” “y,” and “z”-th elements of “Vc.” With this representation, “M” can be built including missing vanishing points.

Once the initial “M” is built “K,” “R” and “M” can be optimized. However, optimizing for each of the possible triplets may involve a large amount of computation, and thus in at least some implementations the following strategy may be used. For each triplet, “K” and “R” are optimized using Equation (B2). Then Equation (B1) is evaluated without any further optimization of “M.” Each of the triplets are sorted by their evaluated energy values, and then several triplets are selected as inputs to the iterative optimization. In at least some implementations, triplets may be selected whose energy values are less than twice of the minimum amount all triplets.
FIGS. 10A through 10D illustrate the process of the camera calibration technique, according to at least some implementations. The technique can effectively find Manhattan directions and estimate camera parameters at the same time. FIG. 10A shows an input image. In FIG. 10B, Manhattan direction along the x-axis is not estimated well since “Vc” does not have a proper corresponding vanishing point. This problem is handled during the iterative optimization step; in FIG. 10C, the correct M is estimated. In FIG. 10D, the origin of the two axes shown by the dotted lines indicates the center of projection.
Second Camera Calibration Example
As described above, calibration of camera parameters from a single image is a highly ill-posed problem. Several priors were utilized in previous approaches, such as the Manhattan world assumption. In this section, a set of calibration priors are first described, a calibration technique is then formulated as a maximum a-posteriori (MAP) estimation, and an optimization algorithm is then described.
Scene Priors
Manhattan world assumption is the most common prior in single image camera calibration methods. It assumes the existence of three dominant orthogonal directions in the scene, which are called “Manhattan directions” as shown in FIG. 22C. By extracting those directions, the reference world coordinate axes can be recovered and the camera parameters can be calibrated.
Despite of the effectiveness of the Manhattan world model, in some cases a scene can have multiple orthogonal directions that do not align, such as two groups of buildings with a non-right angle between their horizontal directions (e.g., see FIG. 22C), which may be referred to as “Atlanta” world assumptions. In this example, a similar prior is employed in which an Atlanta world assumption is made. For example, the assumption may specify that an input image has a dominant orthogonal frame, with additional horizontal directions sharing the same vertical direction.
Camera Priors
Some techniques utilize priors on the intrinsic parameter matrix “K” of the camera. The assumption is that the focal length in pixel dimension of the camera is the same as the width of the image and the center of projection is the image center, so that:




  K
  =
  
    
      (
      
        
          
            f
          
          
            0
          
          
            
              u
              0
            
          
        
        
          
            0
          
          
            f
          
          
            
              v
              0
            
          
        
        
          
            0
          
          
            0
          
          
            1
          
        
      
      )
    
    ~
    
      (
      
        
          
            W
          
          
            0
          
          
            
              c
              x
            
          
        
        
          
            0
          
          
            W
          
          
            
              c
              y
            
          
        
        
          
            0
          
          
            0
          
          
            1
          
        
      
      )
    
  




where “W” is the image width and “(cz, cy)” is the image center, respectively.

For the prior on external camera orientation “R,” the human tendency that people tend to align their camera with the principal aces of the world is adopted. Under this assumption, rotation angles of the orientation matrix “R” are small so that:

{ψ,θ,φ} ̃0 where R=RψRθRφ

Calibration Formulation
As before, line segments are used as the basic primitives for calibration. Form the input image, a set of line segments “L” is extracted in a multi-scale fashion. Each line segment “li” is stored with its two end points “pi” and “qi” in the projective plant “P2”.
Once line segments are extracted, camera parameters “K” and “R” are calibrated. To utilize the calibration priors, Manhattan directions “M” and additional horizontal vanishing points “A” are extracted during calibration, where:

M=[vxvyvz] and A=[vα1vα2 . . . vαk].

and “v” representing a vanishing point in “P2”. The joint probability of “K,” “R,” “M,” and “A” with respect to “L” may be formatted as follows:

p(K,R,M,A|L)∝p(L|K,R,M,A)p(K,R,M,A)=p(L|M,A)p(M,A|K,R)p(K)p(R)

with the assumption that “K” and “R” are independent of each other and also independent of “L”. By taking a log, the above expression may be converted into the following energy function:

EK,R,M,A|L=EK+ER+EM,A|K,R+RL|M,A 

For the computation of “EL|M,A′” the scene priors are used. Under the Manhattan word assumption, triplets of vanishing points that represent more line segments are desirable. Furthermore, for the union of “M” and “A”, it may be desirable to have as many as possible line segments as vanishing lines. Accordingly, the energy function may be formulated as follows:




  
    E
    
      
        L
        |
        M
      
      ,
      A
    
  
  =
  
    
      
        λ
        
          L
          m
        
      
      ⁢
      
        
          ∑
          i
          
            
          
        
        ⁢
        
          
            d
            m
          
          ⁡
          
            (
            
              M
              ,
              
                1
                i
              
            
            )
          
        
      
    
    +
    
      
        λ
        
          L
          a
        
      
      ⁢
      
        
          ∑
          i
          
            
          
        
        ⁢
        
          
            d
            
              m
              ⁢
              
                
              
            
          
          ⁡
          
            (
            
              
                M
                ⋃
                A
              
              ,
              
                1
                i
              
            
            )
          
        
      
    
  




where “li” represents a line segment. The value “ ”dm(•)” is used to measure the minimum distance between a set of vanishing points “V={v1, v2, . . . , vk}” and a line segment “l” as follows:

dm(V,1)=min{d(v1,1),d(v2,1), . . . ,d(vk,1)}

The value “d((•)” is used for measuring a distance between a vanishing point and a line using the following definition:





  
    d
    ⁡
    
      (
      
        v
        ,
        1
      
      )
    
  
  =
  
    min
    (
    
      
        
          
          
            
              r
              T
            
            ⁢
            p
          
          
        
        
          
            
              r
              1
              2
            
            +
            
              r
              2
              2
            
          
        
      
      ,
      δ
    
    )
  




where “p” and “q” are two end points of “l” and





  r
  =
  
    
      
        (
        
          
            p
            +
            q
          
          2
        
        )
      
      ×
      v
    
    =
    
      
        [
        
          
            r
            1
          
          ⁢
          
            
          
          ⁢
          
            r
            2
          
          ⁢
          
            
          
          ⁢
          
            r
            3
          
        
        ]
      
      T
    
  




The value “δ” represents a given maximum error value, which was 1.75 in an example. The values “λLm” and “λLa” were set to 0.01 and 0.02, respectively, in this example although other examples are also contemplated.

The values “EK” and “ER” are related to camera priors. From the intrinsic parameter matrix “K” and “R”, the following expressions may be obtained:



  
    
      E
      K
    
    =
    
      
        
          
            λ
            f
          
          ⁡
          
            (
            
              
                
                  max
                  ⁡
                  
                    (
                    
                      W
                      ,
                      f
                    
                    )
                  
                
                
                  mi
                  |
                  
                    n
                    ⁡
                    
                      (
                      
                        W
                        ,
                        f
                      
                      )
                    
                  
                
              
              -
              1
            
            )
          
        
        2
      
      +
      
        
          λ
          c
        
        ⁢
        
          
            
            
              
                c
                p
              
              -
              
                c
                I
              
            
            
          
          2
        
      
    
  




  and




  
    
      E
      R
    
    =
    
      
        
          λ
          ψ
        
        ⁢
        
          ψ
          2
        
      
      +
      
        
          λ
          θ
        
        ⁢
        
          θ
          2
        
      
      +
      
        
          λ
          φ
        
        ⁢
        
          φ
          2
        
      
    
  



For “EK”, the value “λf” is set as 0.004 and “λC” is set as “(4/W)2.” For “ER”, the three rotation angles are not weighted equality. Particularly, it was found that it may be beneficial for the prior for “φ” (i.e., z-axis rotation) to be stronger for enforce eye-level alignment. Thus, the following expression may be utilized:

[λψ,λθ,λφ]=[3/π,2/π,6/π]2 

To compute “EM,A|K,R′”, it is assumed that “EM,|K,R′” and “EA|K,R′” may be computed independently so that:

EM,A|K,R=EM|K,R+EA|K,R 

Then, if “K” and “R” are known “M” may be estimated as:

M=[vxvyvz]=(KR)I3 

where “I3=[ex ey ez]” is the identity matrix. Using this property, “EM,|K,R′” may be formulated as follows:





  
    E
    
      
        M
        |
        K
      
      ,
      R
    
  
  =
  
    
      λ
      M
    
    ⁢
    
      
        ∑
        
          i
          ∈
          
            {
            
              x
              ,
              y
              ,
              z
            
            }
          
        
        
          
        
      
      ⁢
      
        
          [
          
            
              cos
              
                -
                1
              
            
            ⁢
            
              {
              
                
                  e
                  i
                  T
                
                ⁢
                
                  
                    
                      
                        (
                        KR
                        )
                      
                      
                        -
                        1
                      
                    
                    ⁢
                    
                      v
                      i
                    
                  
                  
                    
                    
                      
                        
                          (
                          KR
                          )
                        
                        
                          -
                          1
                        
                      
                      ⁢
                      
                        v
                        i
                      
                    
                    
                  
                
              
              }
            
          
          ]
        
        2
      
    
  




where “λm” is set as “(48/π)2” in one or more examples. The value “A” represents horizontal directions and thus is to be perpendicular to “ey”. Thus, “EA|K,R′” may be formulated as follows:





  
    E
    
      
        A
        |
        K
      
      ,
      R
    
  
  =
  
    
      λ
      A
    
    ⁢
    
      
        ∑
        i
        
          
        
      
      ⁢
      
        
          [
          
            
              
                cos
                
                  -
                  1
                
              
              ⁢
              
                {
                
                  
                    e
                    y
                    T
                  
                  ⁢
                  
                    
                      
                        
                          (
                          KR
                          )
                        
                        
                          -
                          1
                        
                      
                      ⁢
                      
                        v
                        
                          a
                          i
                        
                      
                    
                    
                      
                      
                        
                          
                            (
                            KR
                            )
                          
                          
                            -
                            1
                          
                        
                        ⁢
                        
                          v
                          
                            a
                            i
                          
                        
                      
                      
                    
                  
                
                }
              
            
            -
            
              π
              2
            
          
          ]
        
        2
      
    
  




where “vai” represents a horizontal vanishing point and “λA” is set as “(48/π)2” in one or more examples.

Missing Vanishing Points
An iterative approach may be used to find a solution using the energy terms defined above. In the iterative, the values “K” and “R”, “M”, and “A” are optimized in an alternating manner. If “M” and “A” are fixed, the energy function above for “EM,A|K,R′” may be optimized with respect to “K” and R′′ by the following:




  
    
      
        arg
        ⁢
        
          
        
        ⁢
        min
      
      
        K
        ,
        R
      
    
    ⁢
    
      E
      K
    
  
  +
  
    E
    R
  
  +
  
    E
    
      M
      ,
      
        A
        |
        K
      
      ,
      R
    
  




Similarly, optimization of “M” and “A” may be achieved by solving the following expressions:





  
    
      
        
          arg
          ⁢
          
            
          
          ⁢
          min
        
        M
      
      ⁢
      
        E
        
          M
          ,
          
            A
            |
            K
          
          ,
          R
        
      
    
    +
    
      E
      
        
          L
          |
          M
        
        ,
        A
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        
          arg
          ⁢
          
            
          
          ⁢
          min
        
        A
      
      ⁢
      
        E
        
          M
          ,
          
            A
            |
            K
          
          ,
          R
        
      
    
    +
    
      E
      
        
          L
          |
          M
        
        ,
        A
      
    
  




while fixing other parameters.

For optimizing “K” and “R”, at least some implementations may use “fminsearch” in Matlab or a similar function, or some other optimization technique. On the other hand, optimizations of “M” and “A” may still be difficult since “EL|M,A” truncates distances to “δ” as described above and the size of “A” is unknown.
To solve the above expressions, discrete approximation may be utilized. For example, from the line segments “L”, a large set of vanishing points “V=[v1 v2 . . . vn vmiss]” may be hypothesized in which each element is computed as an intersection point of two randomly selected lines except for “vmiss” which represents the missing vanishing point. The value “n” may be set to “2000” in one or more examples. Optimizing “M” and “A” thus becomes selecting vanishing points from “V” to minimize energies in the above expressions.
To optimize “M,” for each element of “M=[vx vy vz]” a vanishing point in “V” is found that minimizes the energy while retaining the other two elements. For optimizing “A” a greedy approach may be used in which a vanishing point from “V” is selected one by one that minimizes the optimization expression for “A” above until energy does not decrease.
In order to make initial values of “M”, a small subset of “Vc {vc, vc2, vck}” are selected from “V” that is the “closest to all lines” in the following way:




  
    
      arg
      ⁢
      
        
      
      ⁢
      min
    
    
      {
      
        
          v
          
            c
            1
          
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          v
          
            c
            k
          
        
      
      }
    
  
  ⁢
  
    
      ∑
      i
    
    ⁢
    
      min
      ⁢
      
        {
        
          
            d
            ⁡
            
              (
              
                
                  v
                  
                    c
                    1
                  
                
                ,
                
                  1
                  i
                
              
              )
            
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            d
            ⁡
            
              (
              
                
                  v
                  
                    c
                    k
                  
                
                ,
                
                  1
                  i
                
              
              )
            
          
        
        }
      
    
  




where “k” is set equal to nine in one or more examples. The value “vmiss” is also added into “Vc” also.

For each triplet of vanishing point in “Vc”, an initial “K” and “R” is optimized, “M” is set as the triplet, and “A” as empty. The initial “A” is then optimized. Each of the variables are then optimized using the above expressions and evaluated using the energy function above that takes a log of the joint probabilities above. Finally, values of “K”, “R”, “M”, and “A” with the minimum energy are used as calibration results. Although initial “Vc” may not contain each of the Manhattan directions, the missing directions may be detected from “V” while optimizing “M” using the above expression as part of the iterative optimization process.
After the calibration process, the vanishing lines for each vanishing point in “M” are determined. Three pencils of vanishing lines, “Lx”, “Ly”, and “Lz” are obtained from “L” by:

Li={lεL|d(vi,l)<δ},iε{x,y,z}

where “d(•)” is the distance function as described above.

Utilizing External Information
The MAP formulation may be reformulated to various forms to utilize additional information provided by a user or camera manufacturer. For example, focal length or center of projection may be fixed if given. Additional horizontal vanishing points “A” may be detected but may be ignored if the scene strictly follows a Manhattan world assumption. In such a case, “EL|M,A” and “EM,A|K,R” become “EL|M” and “EM,|K,R”, respectively and the calibration may be performed without detection of additional horizontal vanishing points.
Comparison with Manual Correction
FIGS. 11A and 11B compare results of an implementation of the automatic upright adjustment technique with manually generated results. A set of original images that are aligned well were collected. Each image was rotated with an arbitrary rotation matrix to produce corrupted results. Several users manually adjusted the transformed photos using a lens correction tool of a digital image processing application. The same corrupted images were also transformed using an implementation of the automatic upright adjustment technique. FIGS. 11A and 11B show some of the results for comparison. It can be seen that the manual adjustment results are similar to the results generated by the automatic upright adjustment technique.
To confirm that automatic upright adjustment technique performs upright adjustment correctly, rotation angles computed by the technique were compared with the ground truth values. Since the original photos are already well taken, rotation angles computed by the technique should be similar to the ground truth values. The differences of rotation angles were found to be small.
Comparison with Tilt-Shift Lenses
FIG. 12 compares results of an implementation of the automatic upright adjustment technique with images captured using a tilt-shift lens. Several pairs of photos were captured for the comparison. For each pair, a scene was first captured conventionally, and then a second image was captured using the shift functionality of the lens to take an upright version of the scene. The conventional photo was then adjusted using an implementation of the automatic upright adjustment technique and compared the result with the upright version from tilt-shift lens. FIG. 12 shows some example results. It can be seen that the results generated by the automatic upright adjustment technique are similar to the images captured using tilt-shift.
Example Results
FIGS. 14A through 22B show additional results of the automatic upright adjustment technique, according to at least some implementations. FIG. 14A shows an original image of a scene of a human sitting in a porch swing. FIG. 14B shows results of a conventional rectification technique applied to the image of FIG. 14A. Note distortion in the image, particularly in the swing and the human figure. FIG. 14C shows results of the automatic upright adjustment technique applied to the image of FIG. 14A, according to at least some implementations. Note that there is little or no distortion of the swing and human figure when compared to FIG. 14B.
FIG. 15A shows an original image of a scene of a human sitting in a kitchen. FIG. 15B shows results of the automatic upright adjustment technique applied to the image of FIG. 15A, according to at least some implementations. Note that foreground and background features have been adjusted, while there is little or no distortion of the human figure or other features.
FIG. 16A shows an original image of a scene of the inside of an airplane. FIG. 16B shows results of the automatic upright adjustment technique applied to the image of FIG. 16A, according to at least some implementations.
FIG. 17A shows an original image of a storefront scene. FIG. 17B shows results of the automatic upright adjustment technique applied to the image of FIG. 17A, according to at least some implementations.
FIG. 18A shows an original image of a wall with plaques and pictures. FIG. 17B shows results of the automatic upright adjustment technique applied to the image of FIG. 18A, according to at least some implementations.
FIG. 19A shows an original image that contains an unaligned horizon. FIG. 19B shows results of the automatic upright adjustment technique applied to the image of FIG. 19A, according to at least some implementations.
FIG. 20A shows an original image of a door. FIG. 20B shows results of the automatic upright adjustment technique applied to the image of FIG. 20A, according to at least some implementations.
FIG. 21A shows an original image of a poster that includes writing. FIG. 21B shows results of the automatic upright adjustment technique applied to the image of FIG. 21A, according to at least some implementations.
FIG. 22A shows an original image of a city scene take with a wide-angle lens and thus containing distortion. FIG. 22B shows results of the automatic upright adjustment technique applied to the image of FIG. 22A, according to at least some implementations.
Example System
Some implementations may include a means for automatic upright adjustment of images such as digital or digitized photographs, as described herein, and/or a means for camera calibration as described herein. For example, a module or modules of an application may receive input including but not limited to an image, obtain line segments from the image, and perform a calibration technique to simultaneously estimate camera parameters and vanishing points and lines, as described herein. In addition, a module or modules of an application may obtain an estimate of camera parameters and vanishing points and lines for an image, and optimize a reprojection model with respect to parameters of a homography matrix to estimate new camera parameters using one or more criteria based on human perception as energy terms to constrain the optimization, and reproject the image according to the new camera parameters, as described herein. The module or modules may in some implementations be implemented by a non-transitory, computer-readable storage medium and one or more processors (e.g., CPUs and/or GPUs) of a computing apparatus. The computer-readable storage medium may store program instructions executable by the one or more processors to cause the computing apparatus to perform the camera calibration technique and/or the reprojection technique, as described herein. Other implementations of the module or modules may be at least partially implemented by hardware circuitry and/or firmware stored, for example, in a non-volatile memory.
FIG. 23 illustrates an example module or modules that may implement one or more of the techniques for automatic upright adjustment of images as illustrated in FIGS. 1 through 22B. FIG. 24 illustrates an example computer system on which implementations of module(s) 900 may be implemented. Module(s) 900 receives as input one or more digital images 910A that each displays a scene. In some implementations, module(s) 900 may receive user input 912 via user interface 902 specifying one or more parameters for a camera calibration technique as described herein and/or for a reprojection technique as described herein. Module(s) 900 performs low-level line detection 904 to obtain line segments from the image 910A. Module 900 then performs camera calibration 906 to estimate camera parameters and vanishing point information for the image 910A. Module 900 then performs a reprojection technique 908 that estimates new camera parameters as described herein, and applies the new camera parameters to reproject image 910A. Module(s) 900 generates as output an adjusted image 910B for each input image 910A. Adjusted image 910B may, for example, be displayed on a display 930 device, stored to a storage medium 940, such as system memory, a disk drive, DVD, CD, etc., and/or passed on to one or more other modules 950 for additional processing. In some implementations, module(s) 900 may crop the reprojected image prior to outputting adjusted image 910B.
Implementations of the module(s) 900 or one or more of the techniques for automatic upright adjustment of images as illustrated in FIGS. 1 through 22B may be implemented as plug-in(s) for applications, as library functions, and/or as a stand-alone application. Implementations of the module or one or more of the techniques and algorithms as described herein may be implemented in any image processing application, including but not limited to Adobe® PhotoShop®, Adobe® PhotoShop® Elements®, and Adobe® After Effects®. Adobe, PhotoShop, PhotoShop Elements, and Adobe After Effects are either registered trademarks or trademarks of Adobe Systems Incorporated in the United States and/or other countries.
Implementations of the techniques for automatic upright adjustment of images as illustrated in FIGS. 1 through 22B may be executed on one or more computer systems, which may interact with various other devices. One such computer system is illustrated by FIG. 24. In different implementations, computer system 1000 may be any of various types of devices, including, but not limited to, a personal computer system, desktop computer, laptop, notebook, or netbook computer, pad or tablet device, mainframe computer system, handheld computer, workstation, network computer, a camera, a set top box, a mobile device, a wireless phone, a smart phone, a consumer device, video game console, handheld video game device, application server, storage device, a peripheral device such as a switch, modem, router, or in general any type of computing or electronic device.
In the illustrated implementation, computer system 1000 includes one or more processors 1010 coupled to a system memory 1020 via an input/output (I/0) interface 1030. Computer system 1000 further includes a network interface 1040 coupled to I/0 interface 1030, and one or more input/output devices 1050, such as cursor control device 1060, keyboard 1070, and display(s) 1080. Computer system 1000 may also include one or more touch- or multi-touch-enabled devices as input/output devices, for example a touch-enabled display and/or pad. In some implementations, it is contemplated that implementations may be implemented using a single instance of computer system 1000, while in other implementations multiple such systems, or multiple nodes making up computer system 1000, may be configured to host different portions or instances of implementations. For example, in one implementation some elements may be implemented via one or more nodes of computer system 1000 that are distinct from those nodes implementing other elements.
In various implementations, computer system 1000 may be a uniprocessor system including one processor 1010, or a multiprocessor system including several processors 1010 (e.g., two, four, eight, or another suitable number). Processors 1010 may be any suitable processor capable of executing instructions. For example, in various implementations, processors 1010 may be general-purpose or embedded processors implementing any of a variety of instruction set architectures (ISAs), such as the x86, PowerPC, SPARC, or MIPS ISAs, or any other suitable ISA. In multiprocessor systems, each of processors 1010 may commonly, but not necessarily, implement the same ISA.
In some implementations, at least one processor 1010 may be a graphics processing unit. A graphics processing unit or GPU may be considered a dedicated graphics-rendering device for a personal computer, workstation, game console or other computing or electronic device. Modern GPUs may be very efficient at manipulating and displaying computer graphics, and their highly parallel structure may make them more effective than typical CPUs for a range of complex graphical algorithms. For example, a graphics processor may implement a number of graphics primitive operations in a way that makes executing them much faster than drawing directly to the screen with a host central processing unit (CPU). In various implementations, the image processing techniques disclosed herein may, at least in part, be implemented by program instructions configured for execution on one of, or parallel execution on two or more of, such GPUs. The GPU(s) may implement one or more application programmer interfaces (APIs) that permit programmers to invoke the functionality of the GPU(s). Suitable GPUs may be commercially available from vendors such as NVIDIA Corporation, ATI Technologies (AMD), and others.
System memory 1020 may be configured to store program instructions and/or data accessible by processor 1010. In various implementations, system memory 1020 may be implemented using any suitable memory technology, such as static random access memory (SRAM), synchronous dynamic RAM (SDRAM), nonvolatile/Flash-type memory, or any other type of memory. In the illustrated implementation, program instructions and data implementing desired functions, such as those described above for implementations of the techniques for automatic upright adjustment of images as illustrated in FIGS. 1 through 22B are shown stored within system memory 1020 as program instructions 1025 and data storage 1035, respectively. In other implementations, program instructions and/or data may be received, sent or stored upon different types of computer accessible media or on similar media separate from system memory 1020 or computer system 1000. Generally speaking, a computer-accessible medium may include storage media or memory media such as magnetic or optical media, e.g., disk or CD/DVD-ROM coupled to computer system 1000 via I/O interface 1030. Program instructions and data stored via a computer-accessible medium may be transmitted by transmission media or signals such as electrical, electromagnetic, or digital signals, which may be conveyed via a communication medium such as a network and/or a wireless link, such as may be implemented via network interface 1040.
In one implementation, I/O interface 1030 may be configured to coordinate I/O traffic between processor 1010, system memory 1020, and any peripheral devices in the device, including network interface 1040 or other peripheral interfaces, such as input/output devices 1050. In some implementations, I/0 interface 1030 may perform any necessary protocol, timing or other data transformations to convert data signals from one component (e.g., system memory 1020) into a format suitable for use by another component (e.g., processor 1010). In some implementations, I/O interface 1030 may include support for devices attached through various types of peripheral buses, such as a variant of the Peripheral Component Interconnect (PCI) bus standard or the Universal Serial Bus (USB) standard, for example. In some implementations, the function of I/O interface 1030 may be split into two or more separate components, such as a north bridge and a south bridge, for example. In addition, in some implementations some or all of the functionality of I/O interface 1030, such as an interface to system memory 1020, may be incorporated directly into processor 1010.
Network interface 1040 may be configured to allow data to be exchanged between computer system 1000 and other devices attached to a network, such as other computer systems, or between nodes of computer system 1000. In various implementations, network interface 1040 may support communication via wired or wireless general data networks, such as any suitable type of Ethernet network, for example; via telecommunications/telephony networks such as analog voice networks or digital fiber communications networks; via storage area networks such as Fibre Channel SANs, or via any other suitable type of network and/or protocol.
Input/output devices 1050 may, in some implementations, include one or more display terminals, keyboards, keypads, touchpads, scanning devices, voice or optical recognition devices, or any other devices suitable for entering or retrieving data by one or more computer system 1000. Multiple input/output devices 1050 may be present in computer system 1000 or may be distributed on various nodes of computer system 1000. In some implementations, similar input/output devices may be separate from computer system 1000 and may interact with one or more nodes of computer system 1000 through a wired or wireless connection, such as over network interface 1040.
As shown in FIG. 24, memory 1020 may include program instructions 1025, configured to implement implementations of the techniques for automatic upright adjustment of images as illustrated in FIGS. 1 through 22B, and data storage 1035, comprising various data accessible by program instructions 1025. In one implementation, program instructions 1025 may include software elements of implementations of the techniques for automatic upright adjustment of images as illustrated in the above Figures. Data storage 1035 may include data that may be used in implementations. In other implementations, other or different software elements and data may be included.
Those skilled in the art will appreciate that computer system 1000 is merely illustrative and is not intended to limit the scope of the techniques for automatic upright adjustment of images as described herein. In particular, the computer system and devices may include any combination of hardware or software that can perform the indicated functions, including a computer, personal computer system, desktop computer, laptop, notebook, or netbook computer, pad or tablet device, mainframe computer system, handheld computer, workstation, network computer, a camera, a set top box, a mobile device, network device, internet appliance, PDA, wireless phones, smart phones, pagers, a consumer device, video game console, handheld video game device, application server, storage device, a peripheral device such as a switch, modem, router, or in general any type of computing or electronic device. Computer system 1000 may also be connected to other devices that are not illustrated, or instead may operate as a stand-alone system. In addition, the functionality provided by the illustrated components may in some implementations be combined in fewer components or distributed in additional components. Similarly, in some implementations, the functionality of some of the illustrated components may not be provided and/or other additional functionality may be available.
Those skilled in the art will also appreciate that, while various items are illustrated as being stored in memory or on storage while being used, these items or portions of them may be transferred between memory and other storage devices for purposes of memory management and data integrity. Alternatively, in other implementations some or all of the software components may execute in memory on another device and communicate with the illustrated computer system via inter-computer communication. Some or all of the system components or data structures may also be stored (e.g., as instructions or structured data) on a computer-accessible medium or a portable article to be read by an appropriate drive, various examples of which are described above. In some implementations, instructions stored on a computer-accessible medium separate from computer system 1000 may be transmitted to computer system 1000 via transmission media or signals such as electrical, electromagnetic, or digital signals, conveyed via a communication medium such as a network and/or a wireless link. Various implementations may further include receiving, sending or storing instructions and/or data implemented in accordance with the foregoing description upon a computer accessible medium. Accordingly, the present invention may be practiced with other computer system configurations.
CONCLUSION
Various implementations may further include receiving, sending or storing instructions and/or data implemented in accordance with the foregoing description upon a computer-accessible medium. Generally speaking, a computer-accessible medium may include storage media or memory media such as magnetic or optical media, e.g., disk or DVD/CD-ROM, volatile or non-volatile media such as RAM (e.g. SDRAM, DDR, RDRAM, SRAM, etc.), ROM, etc., as well as transmission media or signals such as electrical, electromagnetic, or digital signals, conveyed via a communication medium such as network and/or a wireless link.
The various techniques as illustrated in the Figures and described herein represent example implementations of techniques. The techniques may be implemented in software, hardware, or a combination thereof. The order of technique may be changed, and various elements may be added, reordered, combined, omitted, modified, etc.
Various modifications and changes may be made as would be obvious to a person skilled in the art having the benefit of this disclosure. It is intended that the invention embrace all such modifications and changes and, accordingly, the above description to be regarded in an illustrative rather than a restrictive sense.

## Claims

1. A computing device implemented to adjust perspective of one or more features in an image of a scene consistent with human perception, the computing device comprising:
a memory configured to maintain camera information for the image of the scene that includes the one or more features having lines;
a processor system configured to execute one or more modules of an image processing application that is implemented to:
compute a homography based on the camera information that is to be applied to the image to adjust alignment of the one or more features of the scene in relation to an axis of the image, the homography computed at least in part according to one or more human perception-based criteria; and
reproject the image according to the homography to generate an adjusted image of the scene having the lines of the one or more features of the scene adjusted for alignment with the axis of the image.

2. The computing device as recited in claim 1, wherein the axis is a vertical or horizontal axis and the one or more features are substantially aligned with the vertical or horizontal axis in the adjusted image.

3. The computing device as recited in claim 1, wherein the homography includes a translation and the homography describes new camera information according to the one or more human perception-based criteria.

4. The computing device as recited in claim 1, wherein the camera information includes an intrinsic camera parameter matrix and three dimensional rotation matrices.

5. The computing device as recited in claim 4, wherein the camera information further includes vanishing point information.

6. The computing device as recited in claim 1, wherein the image processing application is implemented to apply a camera calibration technique to estimate the camera information for the image, the camera calibration technique being optimization-based to estimate intrinsic camera parameters, a three dimensional rotation, and vanishing point information in conjunction with each other for the image of the scene.

7. The computing device as recited in claim 1, wherein the one or more human perception-based criteria include a picture frame alignment criterion that is usable to constrain the alignment of the one or more features according to a picture frame defined by the image.

8. The computing device as recited in claim 1, wherein the one or more human perception-based criteria include an eye-level alignment criterion that is usable to constrain the alignment of the one or more features according to a line connecting two vanishing points of the scene.

9. The computing device as recited in claim 1, wherein the one or more human perception-based criteria include an image distortion criterion that is usable to constrain distortion of the one or more features.

10. The computing device as recited in claim 1, wherein the homography includes focal lengths in vertical and horizontal directions, the focal length in each direction being allowed to vary, one to another.

11. A computing device implemented to adjust perspective of a feature in a digital image of a scene consistent with human perception, the computing device comprising:
a memory configured to maintain the digital image of the scene;
a processor system configured to execute an image processing application that is implemented to:
determine image data for a perspective of the feature in the scene, the image data including an axis of the image and lines of the feature that form the perspective of the feature; and
compute a planar transformation of the digital image for an upright adjustment of the feature in the scene to adjust an alignment of the feature in relation to an axis of the image, the planar transformation of the digital image computed at least in part according to one or more human perception based criteria.

12. The computing device as recited in claim 11, wherein the image processing application is implemented to further compute the planar transformation of the digital image based on the image data, the lines of the feature, and vanishing points created by the lines of the feature.

13. The computing device as recited in claim 11, wherein the image processing application is implemented to further compute the planar transformation of the digital image to adjust a viewpoint of the scene in the digital image consistent with the human perception.

14. The computing device as recited in claim 11, wherein the axis of the image is a vertical axis or a horizontal axis, and one of:
the alignment of the feature is adjusted to maintain a vertical perspective of the feature and correct a horizontal perspective of the feature in the scene; or
the alignment of the feature is adjusted to maintain the horizontal perspective of the feature and correct the vertical perspective of the feature in the scene.

15. The computing device as recited in claim 11, wherein the image processing application is implemented to remove perspective distortion for rectification of the scene in the digital image, wherein horizontal lines and vertical lines in the scene are adjusted for respective horizontal and vertical parallels.

16. The computing device as recited in claim 11, wherein the feature in the scene is a man-made structure and the image processing application is implemented to compute the planar transformation of the digital image for the upright adjustment of the feature to minimize perceived distortion of the man-made structure in the scene of the digital image.

17. The computing device as recited in claim 11, wherein the one or more human perception-based criteria include at least one of:
a picture frame alignment criterion that is usable to constrain the alignment of the feature in the scene according to a picture frame defined by a boundary of the digital image;
an eye-level alignment criterion that is usable to constrain the alignment of the feature in the scene according to a line connecting two vanishing points of the scene; and
an image distortion criterion that is usable to constrain distortion of the feature.

18. A method to adjust perspective of a feature in a digital image of a scene consistent with human perception, the method comprising:
executing an image processing application on a processor of a computing device to perform:
obtaining the digital image of the scene;
determining image data for a perspective of the feature in the scene, the image data including an axis of the image and lines of the feature that form the perspective of the feature; and
computing a planar transformation of the digital image for an upright adjustment of the feature in the scene to adjust an alignment of the feature in relation to an axis of the image, the planar transformation of the digital image computed at least in part according to one or more human perception based criteria.

19. The method as recited in claim 18, wherein said computing the planar transformation of the digital image includes the planar transformation further computed based on the image data, the lines of the feature, and vanishing points created by the lines of the feature.

20. The method as recited in claim 18, wherein said computing the planar transformation of the digital image includes the planar transformation further computed to adjust a viewpoint of the scene in the digital image consistent with the human perception.