Patent Application
20170139940
The disclosure relates generally to content-management and search engines, and more particularly to the collection, clustering, and creation of concept structures of multimedia data elements for the purpose of effective storage, management, knowledge database generation, and searching.
With the abundance of multimedia data made available through various means in general and the Internet and world-wide web (WWW) in particular, there is a need for effective ways of searching for multimedia data, and management of such multimedia data. Searching, organizing, and management of multimedia data in general and video data in particular may be challenging at best due to the difficulty of representing and comparing the information embedded in the video content, and due to the scale of information that needs to be checked. Moreover, when it is necessary to find a content of a video by means of textual query, prior art cases revert to various metadata that textually describe the content of the multimedia data. However, such content may be abstract and complex by nature and not necessarily adequately defined by the existing and/or attached metadata.
The rapid increase in multimedia databases, accessible for example through the Internet, calls for the application of new methods of representation of information embedded in video content. Searching for multimedia in general and for video data in particular is challenging due to the huge amount of information that has to be first indexed, classified and clustered. Moreover, prior art techniques revert to model-based methods to define and/or describe multimedia data. However, by its very nature, the structure of such multimedia data may be too abstract and/or complex to be adequately represented by means of metadata. The difficulty arises in cases where the target sought for multimedia data is not adequately defined in words, or by respective metadata of the multimedia data. For example, it may be desirable to locate a car of a particular model in a large database of video clips or segments. In some cases the model of the car would be part of the metadata but in many cases it would not. Moreover, the car may be oriented at angles different from the angles of a specific photograph of the car that is available as a search item. Similarly, if a piece of music, as in a sequence of notes, is to be found, it is not necessarily the case that in all available content the notes are known in their metadata form, or for that matter, the search pattern may just be a brief audio clip.
A system implementing a computational architecture (hereinafter “the Architecture”) that is based on a PCT patent application publication number WO2007/049282 and published on May 3, 2007, entitled “A Computing Device, a System and a Method for Parallel Processing of Data Streams”, assigned to common assignee, is hereby incorporated by reference for all the useful information it contains. Generally, the Architecture consists of a large ensemble of randomly, independently generated, heterogeneous processing cores, mapping in parallel data-segments onto a high-dimensional space and generating compact signatures for classes of interest.
Searching multimedia data has been a challenge of past years and has therefore received considerable attention. Early systems would take a multimedia data element in the form of, for example an image, compute various visual features from it and then search one or more indexes to return images with similar features. In addition, values for these features and appropriate weights reflecting their relative importance could be also used. Searching and indexing techniques have improved over time to handle various types of multimedia inputs and to handle such inputs with ever increasing effectiveness. However, since the exponential growth of the use of the Internet and the multimedia data available therein, these prior art systems have become less effective in handling the multimedia data due to the vast amounts of data already existing, as well as the speed at which new ones are added.
Searching has therefore become a significant challenge and even the addition of metadata to assist in the search has limited functionality. Firstly, metadata may be inaccurate or not fully descriptive of the multimedia data, and secondly, not every piece of multimedia data can be accurately enough described by a sequence of textual metadata. A query model for a search engine has some advantages, such as comparison and ranking of images based on objective visual features, rather than on subjective image annotations. However, the query model has its drawbacks as well. Certainly when no metadata is available and only the multimedia data needs to be used, the process requires significant effort. Those skilled in the art will appreciate that there is no known intuitive way of describing multimedia data. Therefore, a large gap may be found between a user's perception or conceptual understanding of the multimedia data and the way it is actually stored and manipulated by a search engine.
The current generation of web applications has become more and more effective at aggregating massive amounts of data of various multimedia content such as pictures, videos, clips, paintings, and mash-ups, and is capable of slicing and dicing it in different ways, as well as searching it and displaying it in an organized fashion, by using, for example, concept networks. A concept may enable understanding of multimedia data from its related concept. However, current art is unable to add any real “intelligence” to the mix, i.e., no new knowledge is extracted from the multimedia data that are aggregated by existing systems. Moreover, the existing systems tend to be non-scalable due to the vast amounts of data they have to handle. This, by definition, hinders the ability to provide high quality searching for multimedia content.
There is therefore a need in the art to overcome the deficiencies of the prior art solutions by providing the building element for a search engine for content-management of multimedia data that is intelligent, effective, and scalable.
A summary of several example embodiments of the disclosure follows. This summary is provided for the convenience of the reader to provide a basic understanding of such embodiments and does not wholly define the breadth of the disclosure. This summary is not an extensive overview of all contemplated embodiments, and is intended to neither identify key or critical elements of all embodiments nor to delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more embodiments in a simplified form as a prelude to the more detailed description that is presented later. For convenience, the term “some embodiments” may be used herein to refer to a single embodiment or multiple embodiments of the disclosure.
Certain embodiments disclosed herein include a method for generating concept structures based on a plurality of multimedia data elements (MMDEs). The method includes: generating, based on the plurality of MMDEs, a plurality of patches, wherein each patch is at least a portion of one of the MMDEs; generating, based on the plurality of patches, a plurality of signatures for the plurality of MMDEs; clustering the generated plurality of signatures into a plurality of clusters; generating metadata for each of the plurality of clusters; and creating, based on the plurality of clusters, at least one concept structure, wherein each concept structure includes at least one of the plurality of clusters and the metadata associated with the at least one of the plurality of clusters.
Certain embodiments disclosed herein also include a non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to perform a process, the process comprising: generating, based on the plurality of MMDEs, a plurality of patches, wherein each patch is at least a portion of one of the MMDEs; generating, based on the plurality of patches, a plurality of signatures for the plurality of MMDEs; clustering the generated plurality of signatures into a plurality of clusters; generating metadata for each of the plurality of clusters; and creating, based on the plurality of clusters, at least one concept structure, wherein each concept structure includes at least one of the plurality of clusters and the metadata associated with the at least one of the plurality of clusters.
Certain embodiments disclosed herein also include a system for generating concept structures based on a plurality of multimedia data elements (MMDEs). The system comprises: a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: generate, based on the plurality of MMDEs, a plurality of patches, wherein each patch is at least a portion of one of the MMDEs; generate, based on the plurality of patches, a plurality of signatures for the plurality of MMDEs; cluster the generated plurality of signatures into a plurality of clusters; generate metadata for each of the plurality of clusters; and create, based on the plurality of clusters, at least one concept structure, wherein each concept structure includes at least one of the plurality of clusters and the metadata associated with the at least one of the plurality of clusters.
The subject matter disclosed herein is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features and advantages of the disclosed embodiments will be apparent from the following detailed description taken in conjunction with the accompanying drawings.
The embodiments disclosed herein are only examples of the many possible advantageous uses and implementations of the innovative teachings presented herein. In general, statements made in the specification of the present application do not necessarily limit any of the various claimed embodiments. Moreover, some statements may apply to some inventive features but not to others. In general, unless otherwise indicated, singular elements may be in plural and vice versa with no loss of generality. In the drawings, like numerals refer to like parts through several views.
Certain example embodiments include a large-scale web-platform for a multimedia deep-content-classification (DCC) system, capable of continuously creating a knowledge database for multimedia data. The DCC system initially receives a large number of multimedia data elements (MMDEs) to create a knowledge base that is condensed into concept structures that are efficient to store, retrieve, and check for matches. As new MMDEs are collected, they are efficiently added to the knowledge base and concept structures such that the resource requirement is generally sub-linear rather than linear or exponential. The DCC system extracts patterns from each MMDE and selects the important/salient patterns for the creation of signatures thereof. A process of inter-matching between the patterns followed by clustering, is followed by reduction of the number of signatures in a cluster to a minimum that maintains matching and enables generalization to new MMDEs. Metadata respective of the MMDEs is collected, thereby forming, together with the reduced clusters, a concept structure.
Every MMDE in the DB 150, or referenced therefrom, is then processed by a patch attention processor (PAP) 110, thereby resulting in a plurality of patches that are of specific interest, or are otherwise of higher interest than other patches. In one embodiment, a more general pattern extraction, such as an attention processor (AP) is used in lieu of patches. The AP receives the MMDE that is partitioned into items. An item may be an extracted pattern or a patch, or any other applicable partition depending on the type of the MMDE. The functions of the PAP 110 are described herein below in more detail. Those patches that are of higher interest are then used by a signature generator (SG) 120 to generate signatures respective of the patch. The operation of the signature generator is described in more detail herein below. A clustering process (CP) 130 initiates a process of inter-matching of the signatures once it determines that there are a number of patches that is above a predefined threshold. In one embodiment the threshold is defined to be large enough to enable proper and meaningful clustering. With a plurality of clusters, a process of clustering reduction takes place so as to extract the most useful data about the cluster and keep it at an optimal size to produce meaningful results. The process of cluster reduction is continuous. When new signatures are provided after the initial phase of the operation of the CP 130, the new signatures may be immediately checked against the reduced clusters to save on the operation of the CP 130. A more detailed description of the operation of the CP 130 is provided herein below.
A concept generator (CG) 140 operates to create concept structures from the reduced clusters provided by the CP 130. Each concept structure comprises a plurality of metadata associated with the reduced clusters. The result is a compact representation of a concept that can now be easily compared against a MMDE to determine if the received MMDE matches a concept structure stored, for example, in the DB 150, by the CG 140. This can be done, for example and without limitation, by providing a query to the DCC system 100 for finding a match between a concept structure and a MMDE. A more detailed description of the operation of the CG 140 is provided herein below.
It should be appreciated that the DCC system 100 can generate a number of concept structures that is significantly smaller than the number of MMDEs. For example, if one billion (109) MMDEs need to be checked for a match against another one billion MMDEs, typically the result is that no less than 109×109=1018 matches have to take place, a daunting undertaking. The DCC system 100 would typically have around 10 million concept structures or less, and therefore at most only 2×106×109=2×1015 comparisons need to take place, a mere 0.2% of the number of matches that had to be made by other solutions. As the number of concept structures grows significantly slower than the number of MMDEs, the advantages of the DCC system 100 would be apparent to one with ordinary skill in the art.
The operation of the PAP 110 will now be provided in greater detail with respect to an image of the MMDE. However, this should not be understood as to limit the scope of the disclosed embodiments; other types of MMDEs are specifically included herein and may be handled by the PAP 110.
In S240, it is checked whether the entropy was determined to be above a predefined threshold and, if so, execution continues with S250; otherwise, execution continues with S260. In S250, the patch having an entropy above the predefined threshold is stored for future use by the SG 120 in, for example, the DB 150. In S260, it is checked whether there are more patches of the MMDE to be checked and, if so, execution continues with S220; otherwise, execution continues with S270. In S270, it is checked whether there are additional MMDEs and, if so, execution continues with S210; otherwise, execution terminates. It would be appreciated by those of skill in the art that this process reduces the information that must be handled by the DCC system 100 by focusing on areas of interest in the MMDEs rather than areas that are less meaningful for the formation of a concept structure.
A high-level description of the process for large scale video matching performed by the Matching System is depicted in
A brief description of the operation of the SG 120 is therefore provided, this time with respect to a MMDE which is a sound clip. However, this should not be understood as to limit the scope of the disclosed embodiments and other types of MMDEs are specifically included herein and may be handled by the SG 120. To demonstrate an example of a signature generation process, it is assumed, merely for the sake of simplicity and without limitation on the generality of the disclosed embodiments, that the signatures are based on a single frame, leading to certain simplification of the computational core's generation. The Matching System shown in
The signatures generation process will be described with reference to
In order to generate Robust Signatures, i.e., Signatures that are robust to additive noise L (where L is an integer equal to or greater than 1) computational cores are utilized in the Matching System. A frame i is injected into all the Cores. The computational cores 3 generate two binary response vectors: {right arrow over (S)} which is a Signature vector, and {right arrow over (RS)} which is a Robust Signature vector.
For generation of signatures robust to additive noise, such as White-Gaussian-Noise, scratch, etc., but not robust to distortions, such as crop, shift and rotation, etc., a core Ci={ni} (1≦i≦L) may consist of a single leaky integrate-to-threshold unit (LTU) node or more nodes. The node ni equations are:
ni=θ(Vi−Thx); θ is a Heaviside step function; wij is a coupling node unit (CNU) between node i and image component j (for example, grayscale value of a certain pixel j); kj is an image component j (for example, grayscale value of a certain pixel j); Thx is a constant Threshold value, where x is ‘S’ for Signature and ‘RS’ for Robust Signature; and Vi is a Coupling Node Value.
The Threshold values Thx are set differently for Signature generation and for Robust Signature generation. For example, for a certain distribution of Vi values (for the set of nodes), the thresholds for Signature (ThS) and Robust Signature (ThRS) are set apart, after optimization, according to at least one or more of the following criteria:
For: Vi>ThRS
1−p(V>ThS)−1−(1−ε)l<<1 I
i.e., given that l nodes (cores) constitute a Robust Signature of a certain image I, the probability that not all of these I nodes will belong to the Signature of same, but noisy image, Ĩ is sufficiently low (according to a system's specified accuracy).
p(Vi>ThRS)≈l/L II
i.e., approximately I out of the total L nodes can be found to generate Robust Signature according to the above definition.
III: Both Robust Signature and Signature are generated for certain frame i.
It should be understood that the creation of a signature is a unidirectional compression where the characteristics of the compressed data are maintained but the compressed data cannot be reconstructed. Therefore, a signature can be used for the purpose of comparison to another signature without the need of comparison to the original data. Detailed description of the signature generation process can be found in the co-pending patent applications of which this patent application is a continuation-in-part of, and are hereby incorporated by reference.
Computational Core generation is a process of definition, selection and tuning of the Architecture parameters for a certain realization in a specific system and application. The process is based on several design considerations, such as: (a) The Cores should be designed so as to obtain maximal independence, i.e. the projection from a signal space should generate a maximal pair-wise distance between any two cores' projections into a high-dimensional space; (b) The Cores should be optimally designed for the type of signals, i.e. the Cores should be maximally sensitive to the spatio-temporal structure of the injected signal, for example, and in particular, sensitive to local correlations in time and space. Thus, in some cases a core represents a dynamic system, such as in state space, phase space, edge of chaos, etc., which is uniquely used herein to exploit their maximal computational power, and, (c) The Cores should be optimally designed with regard to invariance to set of signal distortions, of interest in relevant applications.
Hence, in an embodiment, signatures are generated by the SG 120 responsive of patches received either from the PAP 110, or retrieved from the DB 150, in accordance with the principles shown hereinabove. It should be noted that other ways for generating signatures may also be used for the purposes the DCC system 100 without departing from the scope of the disclosed embodiments. Furthermore, as noted above, the array of cores may be used by the PAP 110 for the purpose of determining if a patch has an entropy level that is of interest for signature generation according to the principles of the disclosed embodiments. The generated signatures are stored, for example, in the DB 150, with reference to the MMDE and the patch for which it was generated thereby enabling back annotation as may be necessary.
Portions of the CP 130 have been discussed in detail in the co-pending U.S. patent application Ser. No. 12/507,489, entitled “Unsupervised Clustering of Multimedia Data Using a Large-Scale Matching System”, filed Jul. 22, 2009, assigned to common assignee (the “'489 application”), and which is hereby incorporated for all that it contains. In accordance with an embodiment, an inter-match process and clustering thereof is utilized. The process can be performed on signatures provided by the SG 120. It should be noted though that this inter-matching and clustering process is merely an example for the operation of the CP 130 and other inter-matching and/or clustering processes may be used.
Following is a brief description of the inter-match and clustering process. The unsupervised clustering process maps a certain content-universe onto a hierarchical structure of clusters. The content-elements of the content-universe are mapped to signatures, when applicable. The signatures of all the content-elements are matched to each other, and consequently generate the inter-match matrix. The described clustering process leads to a set of clusters. According to an embodiment, each cluster is represented by a small/compressed number of signatures such as, for example, signatures generated by the SG 120 as further explained hereinabove, which can be increased by variants. This results in a highly compressed representation of the content-universe. In one embodiment, a connection graph between the multimedia data elements of a cluster may be stored. The graph can be used to assist a user searching for data to move along the graph in the search of a desired multimedia data element.
In another embodiment, upon determination of a cluster, a signature for the whole cluster may be generated based on the signatures of the multimedia data elements that belong to the cluster. It should be appreciated that using a Bloom filter may be used to reach such signatures. Furthermore, as the signatures in accordance with the principles of the disclosed embodiments are correlated to some extent, the hash functions of the Bloom filter may be replaced by simpler pattern detectors, with the Bloom filter being the upper limit.
While signatures are used here as the basic data elements, it should be realized that other data elements may be clustered using the principles of the disclosure. For example, a system generating data items is used, where the data items generated may be clustered according to the disclosed principles. Such data items may be, without limitation, multimedia data elements. The clustering process may be performed by dedicated hardware or by using a computing device having storage to store the data items generated by the system and then performing the process described herein above. Then, the clusters can be stored in memory for use as may be deemed necessary.
The CP 130 further uses an engine designed to reduce the number of signatures used in a cluster, thereby extracting only the most meaningful signatures that identify the cluster uniquely. This can be done by testing a removal of a signature from a cluster and checking if the MMDEs associated with the cluster still are capable of being recognized by the cluster through signature matching. The process of signature extraction is on-going as the DCC system 100 operates. It should be noted that, after initialization and upon generation of a signature for a MMDE by the SG 120, the MMDE's respective signature is first checked against the clusters to see if there is a match and, if so, it may not be necessary to add the signature to the cluster or clusters. Rather, it may be sufficient to simply associate the MMDE with the identified cluster or clusters. However, in some cases where additional refinement of the concept structure is possible, the signature may be added, or at times even replace, one or more of the existing signatures in the reduced cluster. If no match is found, then the process of inter-matching and clustering may take place.
In S550, the signature identified as matching one or more existing clusters is associated with the existing cluster(s). In S560, it is checked whether a periodic cluster reduction is to be performed and, if so, execution continues with S570; otherwise, execution continues with S580. In S570, the cluster reduction process is performed. Specifically, the purpose of the operation is to ensure that the minimum number of signatures that still identify all of the MMDEs that are associated with the signature reduced cluster (SRC) remain in the cluster. This can be performed, for example, by attempting to match the signatures of each of the MMDEs associated with the SRC having one or more signatures removed therefrom. In one embodiment, the process of cluster reduction for the purpose of generating SRCs is performed in parallel and independently of the process described herein above. In such a case, after either S540 or S550, the operation of S580 takes place. In S580, it is checked whether there are additional signatures to be processed and, if so, execution continues with S510; otherwise, execution terminates. SRCs may be stored in a memory, such as the DB 150, for the purpose of being used by other elements included in the DCC system 100.
The CG 140 performs two tasks: it associates metadata to the SRCs provided by the CP 130, and it associates between similar clusters based on commonality of metadata. Example methods for associating metadata with MMDEs is described in U.S. patent application Ser. No. 12/348,888, entitled “Methods for Identifying Relevant Metadata for Multimedia Data of a Large-Scale Matching System”, filed on Jan. 5, 2009, assigned to common assignee (the “'888 application”), and which is hereby incorporated by reference for all that it contains. One embodiment of the '888 application includes a method for identifying and associating metadata to input MMDEs. The method comprises comparing an input first MMDE to at least a second MMDE; collecting metadata of at least the second MMDE when a match is found between the first MMDE and at least the second MMDE; associating at least a subset of the collected metadata to the first MMDE; and storing the first MMDE and the associated metadata in a storage.
Another embodiment of the '888 application includes a system for collecting metadata for a first MMDE. The system comprises a plurality of computational cores enabled to receive the first MMDE, each core having properties found to be statistically independent of each other core, each generates responsive to the first MMDE a first signature element and a second signature element, the first signature element being a robust signature; a storage unit for storing at least a second MMDE, metadata associated with the second MMDE, and at least one of a first signature and a second signature associated with the second MMDE, the first signature being a robust signature; and a comparison unit for comparing signatures of MMDEs coupled to the plurality of computational cores and further coupled to the storage unit for the purpose of determining matches between multimedia data elements; wherein responsive to receiving the first MMDE the plurality of computational cores generate a respective first signature of said first MMDE and/or a second signature of said first MMDE, for the purpose of determining a match with at least a second MMDE stored in the storage and associating metadata associated with the at least second MMDE with the first MMDE.
Similar processes to match metadata with a MMDE or signatures thereof may be used in accordance with the disclosed embodiments. However, these should be viewed only as example implementations, and other methods of operation may be used with respect to the DCC system 100 without departing from the scope of the disclosed embodiments. Accordingly, each SRC is associated with metadata which is the combination of the metadata associated with each of the signatures that are included in the respective SRC, preferably without repetition of metadata. A plurality of SRCs having metadata may now be associated to each other based on the metadata and/or partial match of signatures. For example, and without limitation, if the metadata of a first SRC and the metadata of a second SRC overlap more than a predetermined threshold level, for example 50% of the metadata match, they may be considered associated clusters that form a concept structure. Similarly, a second threshold level can be used to determine if there is an association between two SRCs where at least a number of signatures above the second threshold are identified as a match with another SRC. From a practical example, one may want to consider the concept of Abraham Lincoln where images of the late President and features thereof, appear in a large variety of photographs, drawings, paintings, sculptures and more and are associated as a concept structure of the concept “Abraham Lincoln”. Each concept structure may be then stored in memory, for example, in the DB 150 for further use.
In S630, the SRC is matched to previously generated SRCs to attempt to find various matches, as described, for example, hereinabove in more detail. In S640, it is checked if at least one match was found and, if so, execution continues with S650; otherwise, execution continues with S660. In S650, the SRC is associated with one or more of the concept structures to which the SRC has been shown to match. In S660, it is checked whether additional SRCs are to be received and, if so, execution continues with S610; otherwise, execution terminates.
A person skilled in the art would now appreciate the advantages of the DCC system 100 and methods thereof. The DCC system 100 is capable of creating, automatically and in an unsupervised fashion, concept structures of a wide variety of MMDEs. When checking a new MMDE, it may be checked against the concept structures stored, for example, in the DB 150 and, upon detection of a match, providing the concept information about the MMDE. With the number of concept structures being significantly lower than the number of MMDEs, the solution is cost effective and scalable for the purpose of identification of content of a MMDE.
The embodiments disclosed herein can be implemented as hardware, firmware, software, or any combination thereof. Moreover, the software is preferably implemented as an application program tangibly embodied on a program storage unit or computer readable medium consisting of parts, or of certain devices and/or a combination of devices. The application program may be uploaded to, and executed by, a machine comprising any suitable architecture. Preferably, the machine is implemented on a computer platform having hardware such as one or more central processing units (“CPUs”), a memory, and input/output interfaces. The computer platform may also include an operating system and microinstruction code. The various processes and functions described herein may be either part of the microinstruction code or part of the application program, or any combination thereof, which may be executed by a CPU, whether or not such computer or processor is explicitly shown. In addition, various other peripheral units may be connected to the computer platform such as an additional data storage unit and a printing unit. Furthermore, a non-transitory computer readable medium is any computer readable medium except for a transitory propagating signal.
All examples and conditional language recited herein are intended for pedagogical purposes to aid the reader in understanding the principles of the invention and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.
| Number | Date | Country | Kind |
|---|---|---|---|
| 171577 | Oct 2005 | IL | national |
| 173409 | Jan 2006 | IL | national |
| 185414 | Aug 2007 | IL | national |
This application is a continuation of U.S. patent application Ser. No. 14/509,558 filed on Oct. 8, 2014, now allowed, which is a continuation of U.S. patent application Ser. No. 13/602,858 filed on Sep. 4, 2012, now U.S. Pat. No. 8,868,619. The Ser. No. 13/602,858 application is a continuation of U.S. patent application Ser. No. 12/603,123 filed on Oct. 21, 2009, now U.S. Pat. No. 8,266,185. The Ser. No. 12/603,123 application is a continuation-in-part of: (1) U.S. patent application Ser. No. 12/084,150 having a filing date of Apr. 7, 2009, now U.S. Pat. No. 8,655,801, which is the National Stage of International Application No. PCT/IL2006/001235 filed on Oct. 26, 2006, which claims foreign priority from Israeli Application No. 171577 filed on Oct. 26, 2005 and Israeli Application No. 173409 filed on Jan. 29, 2006; (2) U.S. patent application Ser. No. 12/195,863 filed on Aug. 21, 2008, now U.S. Pat. No. 8,326,775, which claims priority under 35 USC 119 from Israeli Application No. 185414 filed on Aug. 21, 2007, and which is also a continuation-in-part of the above-referenced U.S. patent application Ser. No. 12/084,150; (3) U.S. patent application Ser. No. 12/348,888, filed Jan. 5, 2009, now pending, which is a CIP of the above-referenced U.S. patent application Ser. No. 12/084,150 and the above-referenced U.S. patent application Ser. No. 12/195,863; and (4) U.S. patent application Ser. No. 12/538,495 filed on Aug. 10, 2009, now U.S. Pat. No. 8,312,031, which is a continuation-in-part of the above-referenced U.S. patent application Ser. No. 12/084,150; the above-referenced U.S. patent application Ser. No. 12/195,863; and the above-referenced U.S. patent application Ser. No. 12/348,888. All of the applications referenced above are herein incorporated by reference.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14509558 | Oct 2014 | US |
| Child | 15416415 | US | |
| Parent | 13602858 | Sep 2012 | US |
| Child | 14509558 | US | |
| Parent | 12603123 | Oct 2009 | US |
| Child | 13602858 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 12084150 | Apr 2009 | US |
| Child | 12603123 | US | |
| Parent | 12195863 | Aug 2008 | US |
| Child | 12603123 | US | |
| Parent | 12084150 | Apr 2009 | US |
| Child | 12195863 | US | |
| Parent | 12348888 | Jan 2009 | US |
| Child | 12603123 | US | |
| Parent | 12084150 | Apr 2009 | US |
| Child | 12348888 | US | |
| Parent | 12195863 | Aug 2008 | US |
| Child | 12084150 | US | |
| Parent | 12538495 | Aug 2009 | US |
| Child | 12603123 | US | |
| Parent | 12084150 | Apr 2009 | US |
| Child | 12538495 | US | |
| Parent | 12195863 | Aug 2008 | US |
| Child | 12084150 | US | |
| Parent | 12348888 | Jan 2009 | US |
| Child | 12195863 | US |
