Abstract:
Techniques for identifying copied images based on an original image are described. The identifying copied image is based on creating unique and identifiable features that in turn are used to generate multiple histograms. The histograms are generated by patches of the image, where the patches are created by equally dividing the image. The combined patch histograms are representative of the image.

Description:
BACKGROUND 
       [0001]    Digital pictures or digital images, like other works of arts, provide copyrights to their owners. Digital images are easily accessed, transferred, downloaded, and manipulated by authorized and unauthorized parties. For example, by simply visiting a website, parties are able to copy digital images without authorization of the copyright owner. Furthermore, digital images may also be easily exchanged between parties, without the consent of the copyright owner. In many instances, unauthorized copied digital images may be considered pirated works or pirated images. 
         [0002]    In certain instances, it is desirable to search for digital images that are copies of an original digital image. Such a search may, or may not, be to determine if the copied image(s) is/are pirated or not. Attempts may be made to search from thousands, if not millions of images, for copied images, which can amount to considerable effort or task. 
         [0003]    Techniques to search for copied images, including detecting copied or pirated images, include watermark schemes; however watermark schemes and certain other searching schemes may be inefficient, when content of an original image (i.e., copyrighted image) is modified. To detect slightly modified images or near, different schemes or techniques are needed. 
       SUMMARY 
       [0004]    This summary is provided to introduce concepts relating to remote auto provisioning and publication of applications. These concepts are further described below in the detailed description. The presented summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter. 
         [0005]    In an implementation, an image is divided into multiple patches, and histograms are created for each patch. The multiple histograms are combined to represent the image. Histograms are unique to each image. Therefore copied images may be found by analyzing histograms of the images. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0006]    The detailed description is described with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The same numbers are used throughout the drawings to reference like features and components. 
           [0007]      FIG. 1  is a diagram illustrating an exemplary image that is divided into 8 by 8 or 64 patches. 
           [0008]      FIG. 2  is diagram illustrating an exemplary image and a dominant gradient direction 
           [0009]      FIG. 3  is a diagram illustrating an exemplary patch segmented into eight texture directions. 
           [0010]      FIG. 4  is diagram of an exemplary texture histogram of a patch of an image. 
           [0011]      FIG. 5  is a flowchart illustrating an exemplary process for indexing images. 
           [0012]      FIG. 6  is a flowchart illustrating an exemplary process for detecting copies of images. 
           [0013]      FIG. 7  is a block diagram illustrating an exemplary computing environment. 
       
    
    
     DETAILED DESCRIPTION 
       [0014]    Given an original digital image (i.e., copyrighted image) as a query, duplicate or near duplicate images, or copied images may be found by content analysis. To find such images, a Content Based Image Retrieval or CBIR scheme may be implemented. For such a CBIR scheme, a digital image (i.e., an original image) may be represented by a feature vector. Similarity between images may be defined as distance in a feature space. Given an original image, other similar images (i.e., copied images) may be retrieved by such a CBIR scheme. Similar images may then be judged by other methods to determine whether they are copied images or not. 
         [0015]    Two issues in copy or near duplicate detection are efficient image features and similarity measurement. Features used in large-scale near-duplicate detection may include “mean gray”, color histogram, texture histogram, etc. For similarity measurement, distance functions as known in the industry may be implemented, such as Minkowski metrics, histogram cosine distance, fuzzy logic, etc. 
         [0016]    A large-scale duplicate detection algorithm or scheme, as further described below, may be implemented. The scheme divides an original image into patches, and can use a “mean gray” of each patch as a feature. A hash code, one of many as known in the industry, can be generated from the most distinguishing feature dimensions picked by Principle Component Analysis or PCA to facilitate fast similarity comparison, where PCA and its use is known. In an implementation, Hamming distance may be used for similarity measurement. 
         [0017]    Because the distinguishing features picked by PCA may only characterize the whole dataset, the specific property of the query image may not be well utilized. Therefore, similarity measurement may be dynamic according to the query image (i.e., original image), and a query oriented subspace shifting method may be implemented to detect near-duplicates or copied images. 
         [0018]    In an implementation, a special hash code may be used for both image representation and fast similarity search. An original image is first segmented into 8 by 8 (i.e., 64) blocks or patches, and the average brightness of each patch may be taken as a feature dimension, resulting in a 64 dimension feature vector, which may be further reduced into 32 dimensional feature vector by PCA. Each dimension may then be quantized into a binary value according to whether the dimension is above a mean value or not. In this way, the image may be represented by a 32-bit hash code. The Hamming distance between two hash codes is taken as the similarity measure of two images. Based on this method, similar images may be detected very quickly. 
         [0019]    In certain cases, the above scheme may not be able to detect copied or pirated images effectively in certain instances. A pirated image may have a slight difference in color, contrast, and/or saturation from the original image. These changes might change the average brightness of an image block significantly, and result in a different hash code, causing a failure in image detection. 
         [0020]    A patch-based texture histogram coding method to measure the similarity between images may be implemented, as described in further detail below. Such a patch-based texture histogram coding method may be insensitive to color change issues as discussed above. 
         [0021]      FIG. 1  shows an original image  100 . Image  100  may also be considered a query image. Image  100  may be part of a collection of original images that are identified as copyrighted or protected images. The image  100  is divided into 8 by 8 or 64 equal-sized patches  102 - 1  to  102 - 64 .  FIG. 2  shows a dominant gradient direction  200  referred to as “D” in the equations described below.  FIG. 3  shows an example patch  102 - 129  segmented into eight texture directions d 0   300 - 1 ; d 1   300 - 2 , d 2   300 - 3 , d 3   300 - 4 , d 4   300 - 5 , d 5   300 - 6 , d 6   300 - 7 , and d 8   300 - 8 . 
         [0022]    Now referring back to  FIG. 1  and  FIG. 2 , within each patch  102 , the dominant gradient direction  200  of texture gradient is calculated. Then the patch  102  is rotated according to the dominant direction  200 . Afterwards, the texture histogram of the eight different directions as shown in  FIG. 3  is calculated as discussed below. 
         [0023]    In the following equations, I represents an image, such as image  100 . I i, j  is defined as the i, j pixel value of the image (i.e., image  100 ). The gradient magnitude of the i, j pixel is m i, j. ; The value d i, j  represents the gradient direction at pixel i, j. The k th  dimension h(k) of a texture histogram represents the total intensity of the pixel gradient whose direction lies in the k th  direction bin d k , k=0, . . . , 7 (i.e., d 0   300 - 1  . . . , d 7   300 - 8 ). The direction bins  300  are defined by the relative angle to the dominant gradient direction  200 . 
         [0024]    This provides for extraction of texture histogram feature from each image patch  102 , where the feature is robust to patch  102  rotation, image scale change, and color change. 
         [0025]    Generation of hash code based on texture histogram features is performed and instead of using one histogram to represent the image  100 , multiple patch (i.e., patches  102 ) histograms (e.g.,  400 ) are combined. Such a representation considers global information of the image  100 , as well as the spatial distribution of the features of image  100 , which is robust to color and size modification, while sensitive to different images. The patch histogram features may be coded in 32-bit hash code, making the method efficient. 
         [0026]    For each patch  102 , an 8-bin texture histogram h(k), k=0, . . . , 7 is calculated based on the following equations. 
         [0000]    
       
         
           
             
               
                 
                   
                     h 
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         
                           d 
                           ij 
                         
                         ∈ 
                         
                           d 
                           k 
                         
                       
                     
                      
                     
                         
                     
                      
                     
                       m 
                       ij 
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
             
               
                 
                   
                     m 
                     ij 
                   
                   = 
                   
                     
                       
                         dx 
                         ij 
                         2 
                       
                       + 
                       
                         dy 
                         ij 
                         2 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
             
               
                 
                   
                     d 
                     ij 
                   
                   = 
                   
                     arctan 
                      
                     
                       
                          
                         
                           y 
                           ij 
                         
                       
                       
                          
                         
                           x 
                           ij 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
             
               
                 
                   
                     dx 
                     ij 
                   
                   = 
                   
                     
                       I 
                       ij 
                     
                     - 
                     
                       I 
                       
                         
                           i 
                           + 
                           1 
                         
                         , 
                         j 
                       
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
             
               
                 
                   
                     dy 
                     ij 
                   
                   = 
                   
                     
                       I 
                       ij 
                     
                     - 
                     
                       I 
                       
                         i 
                         , 
                         
                           j 
                           + 
                           1 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
             
               
                 
                   D 
                   = 
                   
                     arctan 
                      
                     
                       
                         
                           ∑ 
                           ij 
                         
                          
                         
                             
                         
                          
                         
                           dy 
                           ij 
                         
                       
                       
                         
                           ∑ 
                           ij 
                         
                          
                         
                             
                         
                          
                         
                           dx 
                           ij 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0027]    The dominant gradient direction  200  defined by equation (6), where the dominant gradient direction  200  or D is defined as the direction of the average gray gradient vector. 
         [0028]    After D is calculated or defined, a patch  102  (e.g.,  102 - 29  of  FIG. 3 ) is rotated according to its dominant direction  300  to make the dominant direction horizontally pointing to the right. Then, eight texture directions  300  are defined. The direction d 0   300 - 1  is chosen as the dominant direction, and di, where “i” is 1, 2, 3, 4, 5, 6 or 7 (corresponding to d 1   300 - 2 , d 2   300 - 3 , d 3   300 - 4 , d 4   300 - 5 , d 6   300 - 7 , and d 7   300  - 8 ) is chosen with i*45 degree clock-wise to d 0   300 - 1 . 
         [0029]      FIG. 4  shows an exemplary texture histogram represented of patch  102 - 29 . The texture histogram  400  by quantizing the gradient direction of each pixel into one of 8 directions as shown in  FIG. 3 , and summing its gradient magnitude to that direction over each patch. The gradient magnitude and direction of each pixel is defined by equations (1), (2), and (3) above. 
         [0030]    To represent an image, patch histograms (e.g., histogram  400 ) as described and calculated above are combined to form an n*n*8 dimensional feature. Therefore, if n=8, a 512 dimensional feature vector may be formed. 
         [0031]    PCA may then be used to reduce the dimension to 32. A 32-bit hash code, as described below, may be used to represent the feature in further compact form. Each bit of the hash code denotes whether the corresponding dimension is above or below an average level. In this way, an image may be represented as a compact 32-bit hash code. 
       Hash Coding 
       [0032]    In consideration of efficiency and robustness to noise, PCA may be applied to project the image feature to a lower dimensional space (i.e., subspace). A projection matrix is prepared based on a sufficiently large image collection. PCA may provide that the features are projected along the most distinguishing “d” dimensions. Because the projection matrix does not change with a query image, the projection matrix may be referred to as a “static” or a static projection matrix. 
         [0033]    In the lower dimensional space, the image  100  is able to be represented by a further compact hash code to reduce the calculation burden in similarity measurement. An example hash code method is described in “Large-scale duplicate detection for web image search”, by B. Wang et al, published in the Proc. Of IEEE International Conference on Multimedia &amp; Expo (ICME), 2006. 
         [0034]    Overall for such a hash coding, the following is applied. C ik =0, if v ik &gt;mean k , and C ik =1 otherwise. C ik  is the k th  bit of the hash code for image i (e.g., image  100 ), and v ik  is the k th  dimension of the feature vector for image i; mean i  is the mean of the i th  dimension of the feature vector over all the images. 
         [0035]    The hash code generation is a vector quantization process. As the final quantized vector has K bits, allocation of the bits to each dimension should be determined. One method of allocation is to allocate one (1) bit for each K dimension as follows, where H is hash code, and G is grouping. H ik =1, if G ik &gt;mean k , and G ik ≦mean k  otherwise, where mean k  is the mean value of dimension k. A K-dimension feature vector is transformed into a K-bit binary string, which is the image&#39;s hash code. K may be constrained to no more than 32. 
         [0036]    Hash coding and the use of hash codes may be used to categorize or group duplicate images. For vector quantization, a problem may be threshold operation. Some drifting near a boundary can change a quantized value. To improve performance, similar hash codes with small “difference” may be grouped together instead of identical ones. The difference may be indicated by a Hamming distance between two binary strings. In PCA, drifting may be more likely to occur in less significant dimensions than in more significant dimensions. In order to recall, as well as retain precision, criterion for similar hash codes is for the most significant L bits to be identical while a small variance is allowed in least significant K-L bits. 
       Detection 
       [0037]    A “rough filtering” or selection may be performed for better proficiency. For a large scale data set, a complex similarity search algorithm may not be applied, because of limited computational resources. Therefore, an efficient rough filtering may be used to reduce the scale of the collection. Such a process may make use of hash code matching by Hamming distance, where a loose threshold is set on the hash code distance to exclude the images which are obviously different from the query image q. 
         [0038]    For example, if the query image q, is q ∈ R n . An image I j  is calculated to be close the query image q, if and only if the following applies. 
         [0000]      ∥ H ( Pq )− H ( PI   j   (I) )∥ κ &lt;∈  (7) 
         [0039]    where P is the static projection matrix for rough filtering. H(•) is the hash coding function. “κ” represents the corresponding subspace, and ∈ is the threshold to determine whether the image is close to the query or not in the subspace. The set of samples which are close to the query may be referred to as query surrounding samples. The query surrounding images form the query surrounding collection Q s . 
         [0040]    In order to determine the loose threshold ∈ for rough filtering, several random transformations (or query expansion) may be generated from each query image and represented in hash code in the same sub-space projected with the static PCA matrix. The largest Hamming distance between the query and its expansions is set as the threshold. 
         [0000]    
       
         
           
             
               
                 
                   ∈ 
                   
                     = 
                     
                       
                         max 
                         l 
                       
                        
                       
                         
                            
                           
                             
                               Pq 
                               j 
                             
                             - 
                             
                               Pq 
                               j 
                               
                                 ( 
                                 l 
                                 ) 
                               
                             
                           
                            
                         
                         κ 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0041]    where q j   (l)  is the l th  random transformation of the query image q j . 
       Query Oriented Subspace Shifting 
       [0042]    Sine hash code matching may provide a smaller query surrounding collection, an iterative scheme to detect the near-duplicates from the collection may be implemented. For each iteration, PCA eigenspace of the query surrounding samples is selected as the optimal subspace for measuring the similarity among the query surrounding samples. This subspace keeps as much of the variance of the collection as possible. The remote samples will then be excluded from the query surrounding collection. As the collection is updated, the eigenspace will shift. Therefore, in the next iteration, the similarity measurement will be performed in another eigenspace. It is probable that the near-duplicates would remain close to the query after the subspace has shifted, while non-duplicated images which may form a cluster in a previous subspace will scatter in the subsequent spaces. This process is presented as follows. 
         [0043]    (1) Calculate the closeness threshold in the subspace ∈ by the query expansion described in the above rough filtering. 
         [0044]    (2) Select the query surrounding samples and update the Q s  as follows: 
         [0000]        Q   s   ={I   j   |∥PQ−PI   j ∥ κ &lt;∈}  (9) 
         [0045]    (3) Update the projection matrix P based on the query surrounding collection, as follows. 
         [0000]      P i ←eigenvector(cov(Q s ),i)   (10) 
         [0000]      P=[P 0 , P 1 , . . . , P d ]  (11) 
         [0046]    where eigenvector(cov(Q s ), i) is the i th  sorted eigenvector of the covariance matrix for query surrounding collection, and d is the dimension of the low dimensional space. 
         [0047]    (4) Repeat (1) and (3), until the query surrounding collection Q does not change. In likelihood, non-duplicates surrounding the query image are filtered, and the process/algorithm finishes. 
         [0048]    The threshold ∈ in each iteration is calculated in the same way as the rough filtering or step (1). The only variation is the projection matrix P. Therefore, the threshold is adaptive to the query in different subspaces. 
       Exemplary Methods 
       [0049]    Exemplary processes for remote auto provisioning and publication of applications are described with reference to  FIGS. 1-4 . The processes may be described in the general context of computer executable instructions. Generally, computer executable instructions can include routines, programs, objects, components, data structures, procedures, modules, functions, and the like that perform particular functions or implement particular abstract data types. The processes may also be practiced in a distributed computing environment where functions are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, computer executable instructions may be located in both local and remote computer storage media, including memory storage devices. 
         [0050]      FIG. 5  illustrates an exemplary method  500  for indexing digital images that may be queried or compared against copied or pirated images. Process  500  is illustrated as a collection of blocks in a logical flow graph, which represents a sequence of operations that can be implemented in hardware, software, or a combination thereof. In the context of software, the blocks represent computer instructions that, when executed by one or more processors, perform the recited operations. 
         [0051]    The order in which the method is described is not intended to be construed as a limitation, and any number of the described method blocks can be combined in any order to implement the method, or alternate method. Additionally, individual blocks may be deleted from the method without departing from the spirit and scope of the subject matter described herein. Furthermore, the method can be implemented in any suitable hardware, software, firmware, or a combination thereof, without departing from the scope of the invention. 
         [0052]    At block  502 , collecting is performed for one or more digital images. The digital images may be protected or copyrighted original images, and may be part of a collection of images. The images may be used later for querying and determination as to copied or pirated images. 
         [0053]    At block  504 , generating of features for each of the images is performed. As described above, the generating of features may include generating or more histograms of a number a patches for a given image. 
         [0054]    At block  506 , projecting may be performed for the image to a lower dimensional space or subspace, or what may be termed subspace projection. As described above, in certain implementations, PCA may be applied to project the image feature to a lower dimensional space (i.e., subspace). A projection matrix is prepared based on a sufficiently large image collection. PCA may provide that the features are projected along the most distinguishing “d” dimensions. 
         [0055]    At block  508 , projecting of a static PCA matrix may be performed. As described above, because the projection matrix may not change with a query image, the projection matrix may be referred to as a “static” or a static projection matrix. 
         [0056]    At block  510 , a hash coding may be performed for each of the images. The hash coding may be implemented as described above. The hash coding and the use of hash codes may be used to categorize or group duplicate images in consideration of efficiency. 
         [0057]      FIG. 6  illustrates an exemplary method  600  for detecting copied or pirated images. Process  600  is illustrated as a collection of blocks in a logical flow graph, which represents a sequence of operations that can be implemented in hardware, software, or a combination thereof. In the context of software, the blocks represent computer instructions that, when executed by one or more processors, perform the recited operations. 
         [0058]    At block  602 , querying is performed as based on a known original image. The known image is defined as a query image, and is used or compared with a number of images which may be copies. 
         [0059]    At block  604 , a random transform is performed. As described above, rough filtering may be implemented using a loose threshold. Several random transformations may be generated from each query image and represented in hash code in the same sub-space projected, may be with a static PCA matrix. The largest Hamming distance between the query and its expansions is set as the threshold. 
         [0060]    At block  606 , generating of features if performed for each of the images. The feature generation may include dividing images into patches and creating histograms of the patches, as described above. 
         [0061]    At block  608 , projecting is performed in the subspace or lower dimension. This is particularly applied in rough filtering as described. In the lower dimensional space or subspace, an image may be represented by a further compact hash code to reduce the calculation burden in similarity measurement. 
         [0062]    At block  610 , hash coding is performed to categorize duplicate and near duplicate images. 
         [0063]    At block  612 , near duplicate image detection is performed. The near duplicate detection may be performed using one or more of the techniques described above, and/or other processes. 
         [0064]    At block  614 , near duplicate images are collected. As described above, the collection may be an iterative process, which may refine the collection as the process is performed. 
         [0065]    At block  616 , generating a projection matrix is performed. A different projection matrix is generated for each process interation. 
       An Exemplary Computer Environment 
       [0066]      FIG. 7  illustrates an exemplary general computer environment  700 , which can be used to implement the techniques described herein, and which may be representative, in whole or in part, of elements described herein. The computer environment  700  is only one example of a computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the computer and network architectures. Neither should the computer environment  700  be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the example computer environment  700 . 
         [0067]    Computer environment  700  includes a general-purpose computing-based device in the form of a computer  702 . Computer  702  can be, for example, a desktop computer, a handheld computer, a notebook or laptop computer, a server computer, a game console, and so on. The components of computer  702  can include, but are not limited to, one or more processors or processing units  704 , a system memory  706 , and a system bus  708  that couples various system components including the processor  704  to the system memory  706 . 
         [0068]    The system bus  708  represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, such architectures can include an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnects (PCI) bus also known as a Mezzanine bus. 
         [0069]    Computer  702  typically includes a variety of computer readable media. Such media can be any available media that is accessible by computer  702  and includes both volatile and non-volatile media, removable and non-removable media. 
         [0070]    The system memory  706  includes computer readable media in the form of volatile memory, such as random access memory (RAM)  710 , and/or non-volatile memory, such as read only memory (ROM)  712 . A basic input/output system (BIOS)  714 , containing the basic routines that help to transfer information between elements within computer  702 , such as during start-up, is stored in ROM  712  is illustrated. RAM  710  typically contains data and/or program modules that are immediately accessible to and/or presently operated on by the processing unit  704 . 
         [0071]    Computer  702  may also include other removable/non-removable, volatile/non-volatile computer storage media. By way of example,  FIG. 7  illustrates a hard disk drive  716  for reading from and writing to a non-removable, non-volatile magnetic media (not shown). Furthermore  FIG. 7  illustrates a magnetic disk drive  718  for reading from and writing to a removable, non-volatile magnetic disk  720  (e.g., a “floppy disk”), additionally  FIG. 7  illustrates an optical disk drive  722  for reading from and/or writing to a removable, non-volatile optical disk  724  such as a CD-ROM, DVD-ROM, or other optical media. The hard disk drive  716 , magnetic disk drive  718 , and optical disk drive  722  are each connected to the system bus  708  by one or more data media interfaces  726 . Alternately, the hard disk drive  716 , magnetic disk drive  718 , and optical disk drive  722  can be connected to the system bus  708  by one or more interfaces (not shown). 
         [0072]    The disk drives and their associated computer-readable media provide non-volatile storage of computer readable instructions, data structures, program modules, and other data for computer  702 . Although the example illustrates a hard disk  716 , a removable magnetic disk  720 , and a removable optical disk  724 , it is to be appreciated that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes or other magnetic storage devices, flash memory cards, CD-ROM, digital versatile disks (DVD) or other optical storage, random access memories (RAM), read only memories (ROM), electrically erasable programmable read-only memory (EEPROM), and the like, can also be utilized to implement the exemplary computing system and environment. 
         [0073]    Any number of program modules can be stored on the hard disk  716 , magnetic disk  720 , optical disk  724 , ROM  712 , and/or RAM  710 , including by way of example, an operating system  726 , one or more applications  728 , other program modules  730 , and program data  732 . Each of such operating system  726 , one or more applications  728 , other program modules  730 , and program data  732  (or some combination thereof) may implement all or part of the resident components that support the distributed file system. 
         [0074]    A user can enter commands and information into computer  702  via input devices such as a keyboard  734  and a pointing device  736  (e.g., a “mouse”). Other input devices  738  (not shown specifically) may include a microphone, joystick, game pad, satellite dish, serial port, scanner, and/or the like. These and other input devices are connected to the processing unit  704  via input/output interfaces  740  that are coupled to the system bus  708 , but may be connected by other interface and bus structures, such as a parallel port, game port, or a universal serial bus (USB). 
         [0075]    A monitor  742  or other type of display device can also be connected to the system bus  708  via an interface, such as a video adapter  744 . In addition to the monitor  742 , other output peripheral devices can include components such as speakers (not shown) and a printer  746 , which can be connected to computer  702  via the input/output interfaces  740 . 
         [0076]    Computer  702  can operate in a networked environment using logical connections to one or more remote computers, such as a remote computing-based device  748 . By way of example, the remote computing-based device  748  can be a personal computer, portable computer, a server, a router, a network computer, a peer device or other common network node, and the like. The remote computing-based device  748  is illustrated as a portable computer that can include many or all of the elements and features described herein relative to computer  702 . 
         [0077]    Logical connections between computer  702  and the remote computer  748  are depicted as a local area network (LAN)  750  and a general wide area network (WAN)  752 . Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet. 
         [0078]    When implemented in a LAN networking environment, the computer  702  is connected to a local network  750  via a network interface or adapter  754 . When implemented in a WAN networking environment, the computer  702  typically includes a modem  756  or other means for establishing communications over the wide network  752 . The modem  756 , which can be internal or external to computer  702 , can be connected to the system bus  708  via the input/output interfaces  740  or other appropriate mechanisms. It is to be appreciated that the illustrated network connections are exemplary and that other means of establishing communication link(s) between the computers  702  and  748  can be employed. 
         [0079]    In a networked environment, such as that illustrated with computing environment  700 , program modules depicted relative to the computer  702 , or portions thereof, may be stored in a remote memory storage device. By way of example, remote applications  758  reside on a memory device of remote computer  748 . For purposes of illustration, applications and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in different storage components of the computing-based device  702 , and are executed by the data processor(s) of the computer. 
         [0080]    Various modules and techniques may be described herein in the general context of computer-executable instructions, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that performs particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments. 
         [0081]    An implementation of these modules and techniques may be stored on or transmitted across some form of computer readable media. Computer readable media can be any available media that can be accessed by a computer. By way of example, and not limitation, computer readable media may comprise “computer storage media” and “communications media.” 
         [0082]    “Computer storage media” includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. 
         [0083]    Alternately, portions of the framework may be implemented in hardware or a combination of hardware, software, and/or firmware. For example, one or more application specific integrated circuits (ASICs) or programmable logic devices (PLDs) could be designed or programmed to implement one or more portions of the framework. 
       CONCLUSION 
       [0084]    Although embodiments for implementing remote auto provisioning and publication of applications have been described in language specific to structural features and/or methods, it is to be understood that the subject of the appended claims is not necessarily limited to the specific features or methods described. Rather, the specific features and methods are disclosed as exemplary implementations.