# Patent

## Title
Calibrating a one-dimensional coded light 3D acquisition system

## Abstract

A camera intrinsic calibration may be performed using an object geometry. An intrinsic camera matrix may then be recovered. A homography is fit between object and camera coordinate systems. View transformations are finally recovered.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
This is a non-provisional application based on provisional application Ser. No. 61/556,304 filed on Nov. 7, 2011, hereby expressly incorporated by reference herein.
BACKGROUND
This relates to calibration and calibration refinement of one-dimensional structured light active stereo three-dimensional (3D) acquisition.
Classical calibration methods can either project a two dimensional code in which each point in space has its own explicit relation to the projection unit, or use non-flat calibration objects with known dimensions by extracting measures between given detectable features. These measures are then used to simplify the calibration procedure of the system as a whole, or more specifically, find the relation between a non-calibrated projector and a pre-calibrated camera.



BRIEF DESCRIPTION OF THE DRAWINGS
Some embodiments are described with respect to the following figures:
FIG. 1 is a depiction of a one-dimensional coded light reconstruction system P-projector, C-camera according to one embodiment;
FIG. 2 is a depiction of a one-dimensional coded light projector for a 3D reconstruction system P-projector, C-camera according to one embodiment;
FIG. 3 is a flow chart for one embodiment;
FIG. 4 is a flow chart for a calibration referenced sequence;
FIG. 5 is a system depiction for one embodiment; and
FIG. 6 is a front elevational view for one embodiment.



DETAILED DESCRIPTION
A calibration system for a one dimensional coded light 3D acquisition system is shown in FIGS. 1 and 2.
A point x in world coordinates is projected onto the camera image plane by the following pin-hole model:

xc′=Kc(10)x  (1)

where x is a 4×1 vector representing the world point location in homogenous coordinates, Kc is the 3×3 upper-triangular intrinsic camera matrix,





  
    
      
        
          
            K
            c
          
          =
          
            (
            
              
                
                  
                    f
                    x
                  
                
                
                  
                    
                  
                
                
                  
                    c
                    x
                  
                
              
              
                
                  
                    
                  
                
                
                  
                    f
                    y
                  
                
                
                  
                    c
                    y
                  
                
              
              
                
                  
                    
                  
                
                
                  
                    
                  
                
                
                  1
                
              
            
            )
          
        
        ,
      
    
    
      
        (
        2
        )
      
    
  




and xc is the 3×1 vector of uncorrected homogenous camera coordinates. The camera system of coordinates is assumed to coincide with the world coordinate system; therefore, trivial rotation and translation (extrinsic) matrices are imposed.

To account for the lens distortion, a parametric distortion model is applied. The corrected camera coordinates vector xc is related to its uncorrected counterpart xc′ through the following inverse model:

xc′=KcDα(Kc−1xc)  (3)

where Dα is a plane-to-plane map given by

x′=(1+α1ρ2+α2ρ4+α3ρ6)x+2α4xy+α5(ρ2+2x2)

y′=(1+α1ρ2+α2ρ4+α3ρ6)y+2α5xy+α4(ρ2+2y2)  (4)

with ρ2=x2+y2. The parameters α1, α2, α3 govern the radial distortion component, while α4 and α5 account for the tangential one. The vector α=(α1, . . . , α5)T is called the camera inverse distortion parameters.

The projector is modeled as a one-dimensional pin-hole system:

xp=Kp(Rptp)x=Ppx,  (5)

where xp is the 2×1 vector of homogenous coordinates on the projector line, Kp is the 2×3 intrinsic matrix, and Rp, tp are the extrinsic rotation and translation transformation parameters between the camera and the projector coordinate systems. The intrinsic and the extrinsic projector parameters may be combined into a single 2×4 projection matrix Pp.

A pixel may be identified at position position xc=(xc, yc, 1)T in the camera image plane, and the corresponding xp=(xp, 1)T on the projector line. By applying the inverse distortion model (equation 3), a corrected pixel location xc′=(x′c, y′c, 1)T results. The pin-hone camera projection (equation 1) introduces ambiguity by projecting all points along the ray x=rd, r>0, to xc′.
In order to characterize the ray d=(dx, dy, dz)T,

βxc′=Kcd,  (6)

where β≠0 is an arbitrary scaling factor. This yields:

dzxc′=(Kc)1Td=fxdx+cxdz 

dzyc′=(Kc)2Td=fydy+cydz  (7)

where (Kc)iT denotes the i-th row vector of Kc. Solving for dx, dy and dz gives:





  
    
      
        d
        =
        
          (
          
            
              
                
                  
                    f
                    x
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        x
                        c
                        ′
                      
                      -
                      
                        c
                        x
                      
                    
                    )
                  
                
              
            
            
              
                
                  
                    f
                    y
                    
                      -
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        y
                        c
                        ′
                      
                      -
                      
                        c
                        y
                      
                    
                    )
                  
                
              
            
            
              
                1
              
            
          
          )
        
      
    
    
      
        (
        8
        )
      
    
  




Since the pixel grid is fixed at reconstruction, the described process is precomputed for every pixel in the image. The projector forward model (equation 5) introduces ambiguity by projecting an entire plane onto xp; however, the intersection of the latter plane with the ray x=rd yields a unique point in space. Substituting the unit direction {circumflex over (d)}=d/∥d∥ into the projector model gives:




  
    
      
        
          
            β
            ⁢
            
              
            
            ⁢
            
              x
              p
            
          
          =
          
            
              P
              p
            
            (
            
              
                
                  
                    r
                    ⁢
                    
                      
                    
                    ⁢
                    
                      d
                      ^
                    
                  
                
              
              
                
                  1
                
              
            
            )
          
        
        ,
      
    
    
      
        (
        9
        )
      
    
  




which can be rewritten as:





  
    
      
        
          x
          p
        
        =
        
          
            
              
                
                  rp
                  1
                  T
                
                ⁢
                
                  d
                  ^
                
              
              +
              
                q
                1
              
            
            
              
                
                  rp
                  2
                  T
                
                ⁢
                
                  d
                  ^
                
              
              +
              
                q
                2
              
            
          
          =
          
            
              
                
                  rp
                  1
                  T
                
                ⁢
                d
              
              +
              
                
                  q
                  1
                
                ⁢
                
                  
                  d
                  
                
              
            
            
              
                
                  rp
                  2
                  T
                
                ⁢
                d
              
              +
              
                
                  q
                  2
                
                ⁢
                
                  
                  d
                  
                
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




where the projector matrix is decomposed into:





  
    
      
        
          P
          p
        
        =
        
          
            (
            
              
                
                  
                    p
                    1
                    T
                  
                
                
                  
                    q
                    1
                  
                
              
              
                
                  
                    p
                    2
                    T
                  
                
                
                  
                    q
                    2
                  
                
              
            
            )
          
          .
        
      
    
    
      
        (
        11
        )
      
    
  




Solving for r, one has





  
    
      
        r
        =
        
          
            
              
                τ
                1
              
              ⁢
              
                x
                p
              
            
            +
            
              τ
              2
            
          
          
            
              
                τ
                3
              
              ⁢
              
                x
                p
              
            
            +
            
              τ
              4
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




where:

τ1=q2∥d∥

τ2=−q1∥d∥

τ3=p2Td 

τ4=−p1Td  (13)

are scalar coefficients depending only on the pixel location xc (and therefore can be be precomputed). We refer to τ1, . . . , τ4 as range triangulation coefficients. Note that using the unnormalized ray saves one division operation.

The reconstructed point is given by




  
    
      
        x
        =
        
          
            r
            ⁢
            
              
            
            ⁢
            
              d
              ^
            
          
          =
          
            
              
                
                  
                    q
                    2
                  
                  ⁢
                  
                    x
                    p
                  
                
                +
                
                  q
                  1
                
              
              
                
                  
                    τ
                    3
                  
                  ⁢
                  
                    x
                    p
                  
                
                +
                
                  τ
                  4
                
              
            
            ⁢
            
              d
              .
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




Summarized in a compact form, the backward model is given by:

r=r(xp,xc;α,Kc,Pp)

x=x(xp,xc;α,Kc,Pp).  (15)

During calibration, a known planar calibration object consisting of M points {xm} (in a self coordinate system) is presented to the system from N views described by the (unknown) view transformations {Rn, tn}. The world coordinates of the m-th point in the n-th view are denoted as:

xmn=(Rntn)xm  (16)

(Again, homogenous coordinates are used). As the result, the corresponding camera and projector coordinates xcmn and xpmn are recorded.

The goal of the calibration process is to establish the system parameters Kc, Pp and α. The process consists of coarse calibration where an initial estimate of the parameters is obtained, followed by the refinement stage, at which stage the parameters are refined.
Referring to FIG. 3, a camera intrinsic calibrator stage 10 receives an object geometry x0. Ignoring the lens distortion model (setting α=0), the intrinsic camera matrix Kc can be recovered using Zhang's technique, by which a homograpy Hn is fit between the object and the camera coordinate systems. From the homographies, Kc and the view transformations Rn, tn are recovered and set to calibration refinement 20.
An inverse distortion fitting 12 is then done.
A projector calibration procedure 15 suitable for one-dimensional projections is proposed.
Assuming known Rn, tn, the forward projector model is used to obtain the relation:

βxpmn=Pp(Rntn)xm=Ppxmn,  (17)

where β is an arbitrary scaling. Rewriting explicitly,

xpmn(Pp)2Txmn=(Pp)1Txmn  (18)

from where:





  
    
      
        
          
            (
            
              
                
                  (
                  
                    x
                    mn
                  
                  )
                
                T
              
              -
              
                
                  
                    x
                    p
                    mn
                  
                  ⁡
                  
                    (
                    
                      x
                      mn
                    
                    )
                  
                
                T
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    
                      (
                      
                        P
                        p
                      
                      )
                    
                    1
                  
                
              
              
                
                  
                    
                      (
                      
                        P
                        p
                      
                      )
                    
                    2
                  
                
              
            
            )
          
        
        =
        0
      
    
    
      
        (
        19
        )
      
    
  




for every m and n. Here (Pp)iT denotes the i-th row of Pp. Denoting:

amnT=((xmn)T−xpmn(xmn)T)  (20)

and the 8×1 vector pT=((Pp)1T, (Pp)2T), a unit p is search for minimizing

Σmn∥amnTp∥2=ΣmnpTamnamnTp.  (21)

Such a scaling is possible due to the scale ambiguity of the projection matrix Pp. Denoting:

A=ΣmnamnamnT,  (22)

p is found as the smallest eigenvector of A. Once p has been found, it is reshaped into Pp.

Once the initial estimate of the system parameters has been established by the coarse calibration procedure, refinement is performed (block 20). The refined parameters are sought to minimize the geometric reconstruction error:

E(α,Kc,Pp,{Rn,tn},{xm})=Σmn∥x(xpmn,xcmn;α,Kc,Pp)−Rnxm−tn∥2 

In addition to system parameters, α, Kc, Pp the view transformations {Rn, tn} and, potentially, the coordinates of the calibration object also participate as optimization variables. This gives the procedure more accuracy in some embodiments.

In a preferred embodiment, refinement 25 in FIG. 4 is performed by iterating until convergence the following sequence of steps. All parameters but Kc are fixed to determine the camera intrinsic matrix Kc as indicated in block 30. The geometric error becomes:

E(Kc)=Σmn∥r(xpmn,dKc(x′cmn))dKc(x′cmn)−xmn∥2,  (23)

where r is given in equation 12, and x′cmn=Dα(xcmn) are precomputed from the data. Due to the modest size of the problem (four degrees of freedom), a few safeguarded Newton iterations are used.

All parameters but α are fixed to determine camera distortion (block 32). The error function assumes the form:

E(α)=Σmn∥r(xpmn,dKc(Dα)(xcmn)dKc(Dα(xcmn))−xmn∥2.  (24)

Due to the modest size of the problem (up to six degrees of freedom), a few safeguarded Newton iterations are used.

All parameters but Pp are fixed, to determine projector matrix Pp (block 34) and minimize

E(Pp)=Σmn∥rPp(xpmn,dmn)dmn−xmn∥2,  (25)

where dmn=dKc(xcmn)) are precomputed from the data. Due to the modest size of the problem (seven degrees of freedom), a few safeguarded Newton iterations are used.

Fixing the reconstructed points ymn=x(xpmn, xcmn; α, Kc, Pp), the error function for the n-th view becomes:

E(Rn,tn)=Σm∥ymn−Rnxm−tn∥2,  (26)

which has a classical singular value decomposition (SVD)-based closed-form minimizer.

Since frequently the knowledge of the calibration object points is only approximate, this final bundle adjustment (block 38) step gives further accuracy to the calibration procedure. We fix all parameters but the xm's are fixed and minimize:




  
    
      
        
          
            
              
                E
                ⁡
                
                  (
                  
                    {
                    
                      x
                      m
                    
                    }
                  
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  mn
                
                ⁢
                
                  
                    
                    
                      
                        y
                        mn
                      
                      -
                      
                        
                          R
                          n
                        
                        ⁢
                        
                          x
                          m
                        
                      
                      -
                      
                        t
                        n
                      
                    
                    
                  
                  2
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∑
                  mn
                
                ⁢
                
                  
                    
                    
                      
                        
                          R
                          n
                          T
                        
                        ⁡
                        
                          (
                          
                            
                              y
                              mn
                            
                            -
                            
                              t
                              n
                            
                          
                          )
                        
                      
                      -
                      
                        x
                        m
                      
                    
                    
                  
                  2
                
              
            
          
        
      
    
    
      
        (
        27
        )
      
    
  




for which the closed-form minimizer





  
    
      
        
          x
          m
        
        =
        
          
            1
            N
          
          ⁢
          
            
              ∑
              n
            
            ⁢
            
              
                R
                n
                T
              
              ⁡
              
                (
                
                  
                    y
                    mn
                  
                  -
                  
                    t
                    n
                  
                
                )
              
            
          
        
      
    
    
      
        (
        28
        )
      
    
  




is used.

When a real acquisition system is assembled, manufacturing imperfections do not allow perfect reproducibility of all system parameters. While the accuracy of the camera and projector optics can be fairly high, the positioning of the two components themselves can result in misalignments. The above-described reconstruction is particularly sensitive to angular misalignments of the projector about its one-dimensional projection line.
While it is extremely costly to fully calibrate the entire system from scratch requiring multiple views of the calibration object (and hence time spent in the production line), a novel calibration correction approach may be used within a single lot, manufacture tolerances allow high repeatability of the intrinsic parameters Kc and α. Likewise, the projector matrix Pp can be decomposed into the 2×3 intrinsic matrix Kp, and the extrinsic parameters Rp, tp, as described by (equation 5). Out of these parameters, only the extrinsics Rp, tp are significantly affected by assembly imperfections.
Rp, tp may be refined starting with the result of the full calibration as the initial guess and minimizing the geometric error

E(Rp,tp)=Σmn∥x(xpmn,xcmn;α,Kc,Kp(Rptp))−xmn∥2.  (29)

under the constraint RpTRp=I. Standard second-order cone programming techniques may be used to solve the constrained problem. The number of participating views can be as little as one or a few.

Standard methods cannot be used to recover Kp, Rp and tp from the projector matrix Pp found by the calibration procedure, as the projection system is one-dimensional. Instead, the following modified technique is suggested.
Let Pp=(Qq) with a 2×2 matrix Q and a 2×1 vector q. Substituting into (equation 5), we have

Q=KpRp,

q=Kptp.  (30)

Since Rp is orthonormal,

QQT=KpRpRpTKpT=KpKpT.  (31)

Hence, Kp is recovered as the inverse of the Cholesky factor of (QQT)−1.

Once Kp has been recovered, the extrinsic parameters are recovered by substituting Kp into (equation 30) and solving for Rp and tp. Kp is then normalized by (Kp)23 to simplify further operations with it.
FIG. 5 illustrates an embodiment of a system 300. In embodiments, system 700 may be a media system although system 300 is not limited to this context. For example, system 300 may be incorporated into a personal computer (PC), laptop computer, ultra-laptop computer, tablet, touch pad, portable computer, handheld computer, palmtop computer, personal digital assistant (PDA), cellular telephone, combination cellular telephone/PDA, television, smart device (e.g., smart phone, smart tablet or smart television), mobile internet device (MID), messaging device, data communication device, and so forth.
In embodiments, system 300 comprises a platform 302 coupled to a display 320. Platform 302 may receive content from a content device such as content services device(s) 330 or content delivery device(s) 340 or other similar content sources. A navigation controller 350 comprising one or more navigation features may be used to interact with, for example, platform 302 and/or display 320. Each of these components is described in more detail below.
In embodiments, platform 302 may comprise any combination of a chipset 305, processor 310, memory 312, storage 314, graphics subsystem 315, applications 316 and/or radio 318. Chipset 305 may provide intercommunication among processor 310, memory 312, storage 314, graphics subsystem 315, applications 316 and/or radio 318. For example, chipset 305 may include a storage adapter (not depicted) capable of providing intercommunication with storage 314.
Processor 310 may be implemented as Complex Instruction Set Computer (CISC) or Reduced Instruction Set Computer (RISC) processors, x86 instruction set compatible processors, multi-core, or any other microprocessor or central processing unit (CPU). In embodiments, processor 310 may comprise dual-core processor(s), dual-core mobile processor(s), and so forth.
Memory 312 may be implemented as a volatile memory device such as, but not limited to, a Random Access Memory (RAM), Dynamic Random Access Memory (DRAM), or Static RAM (SRAM).
Storage 314 may be implemented as a non-volatile storage device such as, but not limited to, a magnetic disk drive, optical disk drive, tape drive, an internal storage device, an attached storage device, flash memory, battery backed-up SDRAM (synchronous DRAM), and/or a network accessible storage device. In embodiments, storage 314 may comprise technology to increase the storage performance enhanced protection for valuable digital media when multiple hard drives are included, for example.
Graphics subsystem 315 may perform processing of images such as still or video for display. Graphics subsystem 315 may be a graphics processing unit (GPU) or a visual processing unit (VPU), for example. An analog or digital interface may be used to communicatively couple graphics subsystem 315 and display 320. For example, the interface may be any of a High-Definition Multimedia Interface, DisplayPort, wireless HDMI, and/or wireless HD compliant techniques. Graphics subsystem 315 could be integrated into processor 310 or chipset 305. Graphics subsystem 315 could be a stand-alone card communicatively coupled to chipset 305.
The graphics and/or video processing techniques described herein may be implemented in various hardware architectures. For example, graphics and/or video functionality may be integrated within a chipset. Alternatively, a discrete graphics and/or video processor may be used. As still another embodiment, the graphics and/or video functions may be implemented by a general purpose processor, including a multi-core processor. In a further embodiment, the functions may be implemented in a consumer electronics device.
Radio 318 may include one or more radios capable of transmitting and receiving signals using various suitable wireless communications techniques. Such techniques may involve communications across one or more wireless networks. Exemplary wireless networks include (but are not limited to) wireless local area networks (WLANs), wireless personal area networks (WPANs), wireless metropolitan area network (WMANs), cellular networks, and satellite networks. In communicating across such networks, radio 318 may operate in accordance with one or more applicable standards in any version.
In embodiments, display 320 may comprise any television type monitor or display. Display 320 may comprise, for example, a computer display screen, touch screen display, video monitor, television-like device, and/or a television. Display 320 may be digital and/or analog. In embodiments, display 320 may be a holographic display. Also, display 320 may be a transparent surface that may receive a visual projection. Such projections may convey various forms of information, images, and/or objects. For example, such projections may be a visual overlay for a mobile augmented reality (MAR) application. Under the control of one or more software applications 316, platform 302 may display user interface 322 on display 320.
In embodiments, content services device(s) 330 may be hosted by any national, international and/or independent service and thus accessible to platform 302 via the Internet, for example. Content services device(s) 330 may be coupled to platform 302 and/or to display 320. Platform 302 and/or content services device(s) 330 may be coupled to a network 360 to communicate (e.g., send and/or receive) media information to and from network 360. Content delivery device(s) 340 also may be coupled to platform 302 and/or to display 320.
In embodiments, content services device(s) 330 may comprise a cable television box, personal computer, network, telephone, Internet enabled devices or appliance capable of delivering digital information and/or content, and any other similar device capable of unidirectionally or bidirectionally communicating content between content providers and platform 302 and/display 320, via network 360 or directly. It will be appreciated that the content may be communicated unidirectionally and/or bidirectionally to and from any one of the components in system 300 and a content provider via network 360. Examples of content may include any media information including, for example, video, music, medical and gaming information, and so forth.
Content services device(s) 330 receives content such as cable television programming including media information, digital information, and/or other content. Examples of content providers may include any cable or satellite television or radio or Internet content providers. The provided examples are not meant to limit embodiments of the invention.
In embodiments, platform 302 may receive control signals from navigation controller 350 having one or more navigation features. The navigation features of controller 350 may be used to interact with user interface 322, for example. In embodiments, navigation controller 350 may be a pointing device that may be a computer hardware component (specifically human interface device) that allows a user to input spatial (e.g., continuous and multi-dimensional) data into a computer. Many systems such as graphical user interfaces (GUI), and televisions and monitors allow the user to control and provide data to the computer or television using physical gestures.
Movements of the navigation features of controller 350 may be echoed on a display (e.g., display 320) by movements of a pointer, cursor, focus ring, or other visual indicators displayed on the display. For example, under the control of software applications 316, the navigation features located on navigation controller 350 may be mapped to virtual navigation features displayed on user interface 322, for example. In embodiments, controller 350 may not be a separate component but integrated into platform 302 and/or display 320. Embodiments, however, are not limited to the elements or in the context shown or described herein.
In embodiments, drivers (not shown) may comprise technology to enable users to instantly turn on and off platform 302 like a television with the touch of a button after initial boot-up, when enabled, for example. Program logic may allow platform 302 to stream content to media adaptors or other content services device(s) 330 or content delivery device(s) 340 when the platform is turned “off.” In addition, chip set 305 may comprise hardware and/or software support for 5.1 surround sound audio and/or high definition 7.1 surround sound audio, for example. Drivers may include a graphics driver for integrated graphics platforms. In embodiments, the graphics driver may comprise a peripheral component interconnect (PCI) Express graphics card.
In various embodiments, any one or more of the components shown in system 300 may be integrated. For example, platform 302 and content services device(s) 330 may be integrated, or platform 302 and content delivery device(s) 340 may be integrated, or platform 302, content services device(s) 330, and content delivery device(s) 340 may be integrated, for example. In various embodiments, platform 302 and display 320 may be an integrated unit. Display 320 and content service device(s) 330 may be integrated, or display 320 and content delivery device(s) 340 may be integrated, for example. These examples are not meant to limit the invention.
In various embodiments, system 300 may be implemented as a wireless system, a wired system, or a combination of both. When implemented as a wireless system, system 300 may include components and interfaces suitable for communicating over a wireless shared media, such as one or more antennas, transmitters, receivers, transceivers, amplifiers, filters, control logic, and so forth. An example of wireless shared media may include portions of a wireless spectrum, such as the RF spectrum and so forth. When implemented as a wired system, system 300 may include components and interfaces suitable for communicating over wired communications media, such as input/output (I/O) adapters, physical connectors to connect the I/O adapter with a corresponding wired communications medium, a network interface card (NIC), disc controller, video controller, audio controller, and so forth. Examples of wired communications media may include a wire, cable, metal leads, printed circuit board (PCB), backplane, switch fabric, semiconductor material, twisted-pair wire, co-axial cable, fiber optics, and so forth.
Platform 302 may establish one or more logical or physical channels to communicate information. The information may include media information and control information. Media information may refer to any data representing content meant for a user. Examples of content may include, for example, data from a voice conversation, videoconference, streaming video, electronic mail (“email”) message, voice mail message, alphanumeric symbols, graphics, image, video, text and so forth. Data from a voice conversation may be, for example, speech information, silence periods, background noise, comfort noise, tones and so forth. Control information may refer to any data representing commands, instructions or control words meant for an automated system. For example, control information may be used to route media information through a system, or instruct a node to process the media information in a predetermined manner. The embodiments, however, are not limited to the elements or in the context shown or described in FIG. 5.
As described above, system 300 may be embodied in varying physical styles or form factors. FIG. 6 illustrates embodiments of a small form factor device 400 in which system 300 may be embodied. In embodiments, for example, device 400 may be implemented as a mobile computing device having wireless capabilities. A mobile computing device may refer to any device having a processing system and a mobile power source or supply, such as one or more batteries, for example.
As described above, examples of a mobile computing device may include a personal computer (PC), laptop computer, ultra-laptop computer, tablet, touch pad, portable computer, handheld computer, palmtop computer, personal digital assistant (PDA), cellular telephone, combination cellular telephone/PDA, television, smart device (e.g., smart phone, smart tablet or smart television), mobile internet device (MID), messaging device, data communication device, and so forth.
Examples of a mobile computing device also may include computers that are arranged to be worn by a person, such as a wrist computer, finger computer, ring computer, eyeglass computer, belt-clip computer, arm-band computer, shoe computers, clothing computers, and other wearable computers. In embodiments, for example, a mobile computing device may be implemented as a smart phone capable of executing computer applications, as well as voice communications and/or data communications. Although some embodiments may be described with a mobile computing device implemented as a smart phone by way of example, it may be appreciated that other embodiments may be implemented using other wireless mobile computing devices as well. The embodiments are not limited in this context.
The processor 310 may communicate with a camera 322 and a global positioning system sensor 320, in some embodiments. A memory 312, coupled to the processor 310, may store computer readable instructions for implementing the sequences shown in FIGS. 3 and 4 in software and/or firmware embodiments. Particularly the sequences may be implemented by one or more non-transitory storage devices storing computer implemented instructions.
As shown in FIG. 6, device 400 may comprise a housing 402, a display 404, an input/output (I/O) device 406, and an antenna 408. Device 400 also may comprise navigation features 412. Display 404 may comprise any suitable display unit for displaying information appropriate for a mobile computing device. I/O device 806 may comprise any suitable I/O device for entering information into a mobile computing device. Examples for I/O device 406 may include an alphanumeric keyboard, a numeric keypad, a touch pad, input keys, buttons, switches, rocker switches, microphones, speakers, voice recognition device and software, and so forth. Information also may be entered into device 400 by way of microphone. Such information may be digitized by a voice recognition device. The embodiments are not limited in this context.
Various embodiments may be implemented using hardware elements, software elements, or a combination of both. Examples of hardware elements may include processors, microprocessors, circuits, circuit elements (e.g., transistors, resistors, capacitors, inductors, and so forth), integrated circuits, application specific integrated circuits (ASIC), programmable logic devices (PLD), digital signal processors (DSP), field programmable gate array (FPGA), logic gates, registers, semiconductor device, chips, microchips, chip sets, and so forth. Examples of software may include software components, programs, applications, computer programs, application programs, system programs, machine programs, operating system software, middleware, firmware, software modules, routines, subroutines, functions, methods, procedures, software interfaces, application program interfaces (API), instruction sets, computing code, computer code, code segments, computer code segments, words, values, symbols, or any combination thereof. Determining whether an embodiment is implemented using hardware elements and/or software elements may vary in accordance with any number of factors, such as desired computational rate, power levels, heat tolerances, processing cycle budget, input data rates, output data rates, memory resources, data bus speeds and other design or performance constraints.
One or more aspects of at least one embodiment may be implemented by representative instructions stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine readable medium and supplied to various customers or manufacturing facilities to load into the fabrication machines that actually make the logic or processor.
The graphics processing techniques described herein may be implemented in various hardware architectures. For example, graphics functionality may be integrated within a chipset. Alternatively, a discrete graphics processor may be used. As still another embodiment, the graphics functions may be implemented by a general purpose processor, including a multicore processor.
References throughout this specification to “one embodiment” or “an embodiment” mean that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one implementation encompassed within the present invention. Thus, appearances of the phrase “one embodiment” or “in an embodiment” are not necessarily referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be instituted in other suitable forms other than the particular embodiment illustrated and all such forms may be encompassed within the claims of the present application.
While the present invention has been described with respect to a limited number of embodiments, those skilled in the art will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover all such modifications and variations as fall within the true spirit and scope of this present invention.

## Claims

1. A method comprising:
performing a system calibration for a one-dimensional coded light three-dimensional acquisition system by:
using a coarse calibration to estimate system parameters;
minimizing geometric reconstruction error including iterating until convergence of the following refinement sequence:
fixing all parameters except a lens distortion model to determine camera distortion;
fixing all parameters except a 2×4 projection matrix PP to determine a projector matrix PP;
fixing reconstructed points to determine an error function for an n-th view;
fixing all parameters except parameters for a known planar calibration object and minimizing for a final bundle adjustment;

refining RP and tP using the refinement sequence as the initial value and minimizing geometric error, where RP and tP are extrinsic rotation and translation parameters between the camera and projector coordinate system; and
recovering KP, RP and tP from the projector matrix PP, where KP is a 2×3 intrinsic matrix.

2. The method of claim 1 including using system parameters and view transformation as optimization variables.

3. The method of claim 2 including fixing all parameters except an intrinsic camera matrix to determine camera distortion.

4. One or more non-transitory computer readable media storing instructions to perform a sequence comprising:
performing a system calibration for a one-dimensional coded light three-dimensional acquisition system by:
using a coarse calibration to estimate system parameters;
minimizing geometric reconstruction error including iterating until convergence of the following refinement sequence:
fixing all parameters except a lens distortion model to determine camera distortion;
fixing all parameters except a 2×4 projection matrix PP to determine a projector matrix PP;
fixing reconstructed points to determine an error function for an n-th view;
fixing all parameters except parameters for a known planar calibration object and minimizing for a final bundle adjustment;

refining RP and tP using the refinement sequence as the initial value and minimizing geometric error, where RP and tP are extrinsic rotation and translation parameters between the camera and projector coordinate system; and
recovering KP, RP and tP from the projector matrix PP, where KP is a 2×3 intrinsic matrix.

5. The media of claim 4, further storing instructions to perform a sequence including using system parameters and view transformation as optimization variables.

6. The media of claim 5, further storing instructions to perform a sequence including fixing all parameters except an intrinsic camera matrix to determine camera distortion.

7. An apparatus comprising:
a processor to perform a system calibration for a one-dimensional coded light three-dimensional acquisition system by using a coarse calibration to estimate system parameters, minimize geometric reconstruction error including iterating until convergence of the following refinement sequence:
fix all parameters except a lens distortion model to determine camera distortion;
fix all parameters except a 2×4 projection matrix PP to determine a projector matrix PP;
fix reconstructed points to determine an error function for an n-th view;
fix all parameters except parameters for a known planar calibration object and minimizing for a final bundle adjustment;

refine RP and tP using the refinement sequence as the initial value and minimizing geometric error where RP and tP are extrinsic rotation and translation parameters between the camera and projector coordinate system, and recover KP, RP and tP from the projector matrix PP, where KP is a 2×3 intrinsic matrix.

8. The apparatus of claim 7, said processor to use system parameters and view transformation as optimization variables.

9. The apparatus of claim 8, said processor to fix all parameters except an intrinsic camera matrix to determine camera distortion.