Key blank identification system with bitting analysis

Information

  • Patent Grant
  • 9582734
  • Patent Number
    9,582,734
  • Date Filed
    Friday, January 3, 2014
    11 years ago
  • Date Issued
    Tuesday, February 28, 2017
    7 years ago
Abstract
A key identification system is provided. The key identification system comprises a sensing device configured to extract bitting information from a master key, and a logic configured to analyze the image. The sensing device may be configured to capture information about the bittings of the master key, such as an image of the bittings. The logic analyzes information about the bittings of the master key and compares it with bitting characteristics of known key blanks to determine the likelihood of a match between the master key and a known key blank.
Description
FIELD OF ART

This invention relates generally to the field of systems for identifying objects and, more particularly to systems for utilizing a means for identifying key blanks that are functionally compatible with an unknown key.


BACKGROUND OF THE INVENTION

The art of key replication is well known. Commonly, a key intended for duplication (the master key) is copied on to an appropriately identified key blank utilizing any number of different systems known in the art. The process of identifying an appropriate key blank to use when making copies of a key can be a difficult, tedious and time consuming affair. It is important that each master key be copied onto the proper key blank so as to prevent numerous adverse consequences caused by reproducing a master key onto an inappropriate key blank. However, choosing the correct key blank can be difficult even for experts in the field.


There are hundreds, if not thousands, of key blanks, and many blanks are not readily distinguished from others. Identifying the correct key blank for use in duplication involves selecting a blank from hundreds or even thousands of possibilities, where differences between key blanks may be very subtle. These hard-to-notice subtleties significantly increase the level of difficulty for all operators of such key replication systems, both inexperienced trainees and experts alike.


Once a key blank is chosen, it goes through a cutting process. The typical cutting process simply traces the profile of the master key onto the key blank, such that the key blank will exactly match (within the error limits and accuracy of the tracing machine) the original master key. Normally, a mechanically linked cutting wheel actually cuts into the key blank while it mimics the movement of the tracer as the tracer moves longitudinally along the profile of the master key. If the incorrect key blank is provided during this process, the key blank being formed into the duplicate key may not possess the correct longitudinal length, thereby causing a failure. When this type of failure occurs, the entire process of selecting a key blank for replication and then mechanically cutting the key must begin again. Worse still, if the blank has the proper length but does not possess the appropriate thickness, contour, groove or other traits, the failure may not be discovered until the key is actually inserted into the lock.


Businesses that offer key cutting services are often times not staffed by experienced locksmiths. Instead, employees are usually trained to “eyeball” what is thought to be the correct blank and then cut a duplicate key. Such informal and imprecise key blank identification invariably increases the rate of failures for the duplication process. These failures often occur at the expense of the industry and to the extreme dismay of the key holder. Therefore, the industry would welcome an easy-to-use key blank identification system that increases the accuracy and efficiency of key replication.


Not surprisingly, numerous attempts have been made to improve identification systems and/or key replication systems. Many of these improvements include imaging systems designed to determine the proper key blank based on physical parameters of the key to be copied, such as length, shape, and groove characteristics.


While many of these systems provide useful improvements for determining a proper key blank, they still suffer from various deficiencies. Specifically, many of these systems compare scanned data from a master key with data of known key blanks. However, in some instances the scanned key parameters and the key blank data are insufficient to determine the proper key blank. In such cases, additional information about the master key and the key blank would be useful in narrowing the field of prospective key blanks. Accordingly, an improved system and method for determining a key blank is needed.


SUMMARY

A key identification system is provided. The key identification system comprises a sensing device configured to determine information and characteristics of a master key, and a logic to analyze the information and characteristics of the master key. The sensing device may be configured to capture information about the bittings of the master key. The logic analyzes information about the bittings and compares it with bitting characteristics of known key blanks to determine the likelihood of a match between the master key and the known key blanks.


In an embodiment, the system configured to extract bitting information may comprise an imaging system, such as a camera or other imaging device. The camera may capture an image, such as a digital image, of the bittings of the master key to be analyzed by the logic.





DESCRIPTION OF THE DRAWINGS

Objects and advantages together with the operation of the invention may be better understood by reference to the following detailed description taken in connection with the following illustrations, wherein:



FIG. 1. illustrates a master key.



FIG. 2. illustrates an embodiment of the key ID system.



FIG. 3 illustrates an example comparison chart between a TR47 master key and TR47 key data.



FIG. 4 illustrates an example comparison chart between a KW1 master key and KW1 key data.



FIG. 5 illustrates an example comparison chart between a KW1 master key and SC1 key data.



FIG. 6 illustrates an example comparison chart between a KW1 master key and AM3 key data.





DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to exemplary embodiments of the present invention, examples of which are illustrated in the accompanying drawings. It is to be understood that other embodiments may be utilized and structural and functional changes may be made without departing from the respective scope of the present invention.


A system for identifying a key blank (“key ID system”) and method for identifying a key blank are provided. The key ID system analyzes a master key to be duplicated, such as a house key, car key or other key, and determines the appropriate key blank to be used. The system and method described herein may be used independently to determine a proper key blank, or may be used in conjunction with other systems to narrow the field of prospective key blanks. Moreover, it will be understood that existing key identification systems may be modified or retrofitted to implement some or all features described herein.


With reference to FIG. 1, a master key 10 is depicted. The master key 10 may include standard key features such as a head 16 and a blade 18. The blade 18 may connect at one end to the head 16 with the tip 14 at the opposing end. The master key 10 may include teeth or bittings 12 cut into the blade. The bittings 12 consist of notches cut in the blade 18 to interface with the tumblers of a corresponding lock. The bittings 12 must match up with the lock's unique tumbler configuration in order to activate and turn the lock.


The key ID system may analyze the master key 10 to determine certain physical characteristics of the key 10. Based on these characteristics, the key ID system may then determine the proper key blank to be used to duplicate the master key 10. For example, the key ID system may include a sensing device or system to extract bittings information from a master key 10. The sensing system may sense and capture parameters of the bittings 12. The sensing system may include any mechanical, electronic or optical sensors, sensors, imaging devices or other tools known in the art for extracting physical characteristics of a key or similar object.


In an embodiment, the sensing system for extracting bittings information from the master key 10 includes an imaging system to scan and analyze the physical characteristics of the master key 10. As is known in the art, the imaging system may be a laser imaging system, an optical imaging system, a photo imaging system, or any other imaging system known in the art. The imaging system may scan the master key or capture an image of the master key to determine characteristics of the key that are unique to a specific key blank. Further, it will be appreciated that other known methods or devices, such as electrical, mechanical, or optical sensors, may be used in place of or in conjunction with the imaging system to determine the traits and characteristics of the master key geometry.


In an embodiment illustrated in FIG. 2, the imaging system includes one or more cameras 20 configured to capture an image, such as digital images, of the master key 10. The camera 20 may specifically be positioned to capture an image of the blade 18 and bittings 12. The camera 20 may be positioned perpendicular to the blade 18. Alternatively, the camera 20 may positioned at an angle or at other position to capture the desired image.


The imaging system may further include other components to aid in capturing images of the master key 10, such as one or more lights 24 and mirrors. The lights 24 may be positioned to enhance the clarity and quality of the image recorded by the imaging system. For example, the light 24 may be positioned to provide backlighting for the key. The mirrors may be positioned to allow a camera in a first position to record an image of the key from a second position. The mirrors may further allow a single camera to record multiple images of the master key from different angles, thereby increasing the amount of information related to the master key recorded by a single camera.


As illustrated in FIG. 2, the image system may include one or more reflectors 26. The reflector 26 may be positioned to direct light to a desired location. For example, as shown in FIG. 2, a reflector may be positioned underneath the key 10 and facing the light 24. The reflector 26 may be angled, such as tilted upwards, to direct light from the light 24 to the underside of the key 10, thereby providing backlighting of the key 10. It will be appreciated, however, that the light 24 and reflector 26 may be arranged in any configuration to optimize or clarify the image of the key 10.


The key ID system may include a key holder 22 to hold the master key 10. The key holder may be any device capable of holding or supporting a master key 10. For example, as shown in FIG. 2, the key holder 22 may comprise a lower support and an upper door to close onto the key 10. The key holder may alternatively comprise a clamp, gripper, platform, suspension, or any other device configured to hold the master key 10.


As described in further detail below, the key ID system may analyze characteristics of the master key's teeth or bittings 12. Because the bittings 12 are configured to match up with the corresponding lock's unique tumbler configuration, various characteristics of the bittings 12 are often unique to certain types of key blanks. For example, certain key manufacturers may use distinct bitting patterns, or a set of unique bitting patterns, for their locks or for a group of locks. Additionally, certain types of keys, such as house keys or car keys, may use a different bittings configuration than other types of keys. By analyzing the master key bittings 12 and comparing them to bitting configurations used with known key blanks, the field of prospective matching key blanks may be greatly reduced.


The key ID system may include a logic to analyze bitting characteristic information captured by the key ID system. As used herein, the term “logic” includes but is not limited to a software, a firmware, an executable program, a hardware or hard-wired circuit, or combinations thereof. For example, based on a desired application or needs, a logic may include a software controlled microprocessor, discrete logic like an application specific integrated circuit (ASIC), an analog circuit, a digital circuit, a programmed logic device, a memory device containing instructions, or the like. Logic may include one or more gates, combinations of gates, or other circuit components. Logic may also be fully embodied as software. Where multiple logics are described, it may be possible to incorporate the multiple logics into one physical logic. Similarly, where a single logic is described, it may be possible to distribute that single logic between multiple physical logics.


The logic may be configured to determine a correlation or likelihood of a match between a known key blank and the master key 10. For example, the logic may include a database to store key related information (“key data”). The key data may include characteristics of known key blanks, such as length, shape, bitting information, size, shape and location of key grooves, and other geometric and physical characteristics of known key blanks. The database may be integral with the logic, in communication with the logic, or remotely accessible to the logic. The database may associate key data with specific key blanks or with types or groups of key blanks. For example, the database may associate key data with specific key manufacturers or different types of keys such as house keys or car keys. The key ID system may access the database to compare scanned characteristics of the master key with the stored key data in the database. Key blanks that do not have characteristics consistent with those of the master key may be then ruled out as possible matches for the key blank. The key ID system may scan the master key 10 at one or more angles and compare the scanned data with stored key data.


In an embodiment, the database stores key data related to bittings used with known key blanks. Traditionally, key bittings are represented as a numeric bitting code that contains information as to how a key is to be cut by a locksmith. Often the bitting code is a series of integers (e.g. 372164) that may be translated or decoded from a key code chart or bitting code list. However, not all the information in the bitting code is necessary in order to determine unique properties of the bittings. Therefore, the database may store data related to known key bitting patterns other than numeric bitting codes. For example, the database may store measurements of bitting geometries used with known key blanks.


Stored bitting geometries may include bitting spacings, notch depths, blade width, and bitting flat width. Spacing data may relate to the location or spacing between of each bitting notch along the length of the key blade 18. Spacing data may be measured from the center of each notch to a specific reference point, such as the tip 14 or shoulder of the blade 18. Depth data may relate to the depth of each bitting notch and may be measured as the distance between a reference edge, such as the back side or center line of the blade 18, and the notch surface. Blade width may relate to the width of the blade surface to be cut. Bitting flat width may relate to the width of each notch surface and may be measured as the distance across the bottom of the notch.


In an embodiment, the logic may determine bitting parameters of the master key 10 by analyzing an image captured by an imaging system. The bitting parameters may be compared to bitting data in the database to determine if the master key 10 matches a key blank or blanks in the database. As shown in FIGS. 3-6, bitting parameters of the master key, such as spacing and depth, may be analyzed at various preselected points, such as at the bitting notches. The master key bitting parameters may then be compared to bitting data in the database. If the bitting parameters of the master key match the bitting data of a key blank in the database, then that key blank may be appropriate for duplicating the master key. For example, if each bitting depth of a master key 10 is very close to an allowable bitting depth for a given key blank, then the key blank may be a match. Likewise, if the bitting flat width and spacing of the bittings of a master key 10 are close to allowable bitting flat widths and spacings for a given key blank, then the key blank may be a match. However, if the bitting data of the master key is not close to allowable data for a given key blank, then the given key blank or blanks may be ruled out as a possible match.


The database may associate bitting data with various key-related identifiers. For example, while bitting data may be directly associated with specific key blanks, it may also be associated with groups of keys, such as keys made by a specific key manufacturer or certain types of keys. Accordingly, large groups of potential key blanks may be ruled out if a bitting parameter of the master key does not match a bitting parameter shared by the group of keys.


The bitting positions can be analyzed in any number of methods. One embodiment includes first determining the pattern of the unknown subject key. Each stored pattern may then be tested against the subject key. The test may involve checking each of the known spacing positions for the stored pattern and seeing if there is a bitting at that position. To accomplish this, the logic may analyze or measure the slope or angle with respect to the length of the blade 18 of the master key pattern near the sample position and determining if there is a “flat” in that position. A flat could be defined as a small segment of the pattern (0.020″ wide for example) with a slope or angle that is close to 0 degrees, (less than 17 degrees for example) that is either centered, just left or right of, the target spacing position. If a flat is identified, then the depth of the flat can also be identified from the subject key pattern relative to the reference axis.


To account for reasonable variances in the master key, the key ID system may set tolerance ranges for each bitting parameter measurement. In order for a key blank to match a master key, the comparison values must fall within the predetermined tolerance range. For example, as illustrated in the test results window of FIGS. 3-6, the tolerance range for bitting depth may be set to plus or minus six thousandths of an inch. In order for the master key to match a key blank, each depth measurement comparison must fall within this range. As shown in FIGS. 3 and 4, the comparison values are all between −1 and +1, indicating a match between the master key and the tested key blank or blanks FIGS. 5 and 6, however, illustrate comparison values of greater than 6, indicating that the master key does not match the tested key blank or blanks. The pass/fail limits (tolerance range) could be based on a set range, a set percentage of the depth offsets of the target key, or some other parameter. The limits may be set the same for all keys or may be individualized on a key-by-key basis.


To account for positional variation inherent to the subject keys and/or the inspection system, the pattern matching algorithms may be repeated while shifting the data by small increments (0.020″ for example) in either or both directions. For example, if a key blank was slightly miscut and the spacing was shifted from the nominal position, the search may fail at the nominal position but may identify the pattern shifted slightly over from the nominal position.


The spacing and depth evaluations may be measured using a scoring system of 0 to 100%, where 0 is considered to be an impossible match and 100 is a perfect match. The total bitting score is then the product of the combined spacing and depth scores.


The logic may compare the bittings of a master key 10 to key data related to a key blank in the database and evaluate a series of preset spacing point for the given key blank. For example, the geometry of the master key 10 may be analyzed at each spacing point. A score may be given to each spacing point based on the flatness of the bitting 12 at the spacing point and a measurement of the variation or slope of the bitting 12 relative to the database depths. The relationships between angles can be varied to achieve optimal results. The flatter the area near the spacing point, the higher the score. For example, zero degrees (or flat) might represent a score of 100 and 45 degrees might represent 0. Similarly, the logic may analyze the depth of the blade at each spacing point give a score to the spacing point based on the variation from one of the valid depths for the given key blank stored in the database. For example, no variation might represent a score of 100 and 2× the differences between depths might represent a score of 0.


The logic may compute this evaluation for each of the spacing points and then compute a total by averaging all the points. This entire process may be repeated with a slight shift towards the head 16 of the key 10 and again with a shift towards the tip 14 of the key 10. This will compensate for a key 10 that has a slight spacing shift. The best of the three totals are used in the final results for the bitting evaluation.


The logic may determine the centers of each of the flats on the bittings 12 of the master key 10. Because the center of a flat that is on the peak of a bitting may be skewed due to the depth of the bitting on the left and right, the logic may ignore peaks. The logic may also ignore ridges because the center of flats that are on ridges may be skewed due to the depth and height of the bittings 12 on either side. However, flats that are located in “valleys,” or between bittings of lesser depth, are often properly centered regardless of what is on either side. For each identified valley, the logic may compare the nearest database spacing position and a score is given. A total spacing score is then computed based on the average score for each of the valleys.


It will be appreciated that the database is not limited to bittings data. In addition to bittings data, the database may store information related to other identifying parameters of the key. The key ID system may utilize other key parameters, in combination with bittings information, to narrow the field of possible key blanks.


The key ID system as described may be used in conjunction with other known key identification systems. For example, the key ID system may be used in conjunction with user interface identification systems, such as the object identification system disclosed in U.S. Publication No. 2004/0095380 and the key duplication system disclosed in U.S. Publication No. 2007/0224008, each of which are hereby incorporated by reference in their entirety.


The invention has been described above and, obviously, modifications and alternations will occur to others upon a reading and understanding of this specification. The claims as follows are intended to include all modifications and alterations insofar as they come within the scope of the claims or the equivalent thereof.

Claims
  • 1. A key identification system comprising: a sensing system configured to extract bitting information from a master key; anda logic configured to analyze said bitting information to determine at least one geometric characteristic of the shape of said bittings of said master key and further to compare said geometric characteristic of said bittings with bitting characteristics of known key blanks to determine the likelihood of a match between said master key and a known key blankwherein said at least one geometric characteristic of the shape includes at least one of a depth of a bitting, a width of a bitting, a bitting profile shape, and a spacing between the bittings, and at least one of a—location, slope, angle, or radius of a feature of said master key;wherein said data related to bitting characteristics of known key blanks includes a set of bitting centers associated with a given key blank.
  • 2. The key identification system of claim 1, wherein said sensing system includes an imaging system.
  • 3. The key identification system of claim 2, wherein said imaging system is configured to capture an image of the bittings of said master key.
  • 4. The key identification system of claim 2, wherein said imaging system includes a camera.
  • 5. The key identification system of claim 4, wherein said camera is positioned perpendicular to the blade of said master key.
  • 6. The key identification system of claim 2, wherein said imaging system includes a light.
  • 7. The key identification system of claim 3, wherein said captured image is a digital image.
  • 8. The key identification system of claim 1 further comprising a key holder to hold said master key.
  • 9. The key identification system of claim 8, wherein said key holder comprises a support and an upper door.
  • 10. The key identification system of claim 1, wherein said data related to bitting characteristics of known key blanks includes a set of depths at given blade spacing points associated with a given key blank.
  • 11. The key identification system of claim 1, wherein said data related to bitting characteristics of known key blanks includes a set of bitting flat widths at given blade spacing points associated with a given key blank.
  • 12. The key identification system of claim 10 wherein said logic compares the depth of the master key bitting at each spacing point to said set of depths for said given key blank.
  • 13. The key identification system of claim 12 wherein said logic computes a score for said given key blank based on the comparison between the depths of said master key at each spacing point and said set of depths for said given key blank.
  • 14. The key identification system of claim 11 wherein said logic compares the bitting flat widths of the master key bitting at each spacing point to said set of bitting flat widths for said given key blank.
  • 15. The key identification system of claim 14 wherein said logic computes a score for said given key blank based on the comparison between the bitting flat widths of said master key at each spacing point and said set of bitting flat widths for said given key blank.
  • 16. The key identification system of claim 1, wherein said logic compares the bitting centers of the master key bitting to said set of bitting centers for said given key blank.
  • 17. The key identification system of claim 16 wherein said logic computes a score for said given key blank based on the comparison between the bitting centers of said master key and said set of bitting centers for said given key blank.
  • 18. The key identification system of claim 1, wherein said logic analyzes one of a bitting depth, a bitting flat width, and a bitting center of said master key at a blade spacing point shifted from said blade spacing point associated with a given key blank.
  • 19. The key identification system of claim 4, further comprising a mirror positioned to allow said camera to capture more than one view of said master key.
  • 20. The key identification system of claim 1, wherein said logic is configured to overlay bitting patterns for a plurality of known keys over said master key bittings.
  • 21. The key identification system of claim 1, wherein said logic includes a tolerance range for each bitting characteristic to determine whether a master key passes or fails to match a known key blank.
  • 22. The key blank identification system of claim 1, wherein said logic is configured to shift the position of said bittings information of said master key to compare with said bitting characteristics of said known key blanks.
  • 23. The key blank identification system of claim 22, wherein said shift includes at least one of a move laterally towards the tip, a move longitudinally towards the head, or a rotation.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/772,763 entitled “KEY BLANK IDENTIFICATION SYSTEM WITH BITTING ANALYSIS,” which claims the benefit of priority of U.S. Provisional Patent Application Ser. No. 61/215,122 filed on May 1, 2009, and U.S. Provisional Patent Application Ser. No. 61/275,648 filed on Sep. 1, 2009, each of which are hereby incorporated by reference in their entirety.

US Referenced Citations (359)
Number Name Date Kind
40480 Hill Mar 1863 A
288300 Borowsky Nov 1883 A
466044 Jacobs Dec 1891 A
943806 Billings Dec 1909 A
1059545 Kunze Apr 1913 A
1081472 Tucker Dec 1913 A
1135676 Engelbert Apr 1915 A
1218653 Heldrich Mar 1917 A
1367280 Reiges Feb 1921 A
1390958 Hulbert Sep 1921 A
1440459 Greff Jan 1923 A
1628637 Shaw May 1927 A
1656295 Schechter Jan 1928 A
1674291 Malone Jun 1928 A
1702488 Baird Feb 1929 A
1750218 Falk Mar 1930 A
1752668 Johnson Apr 1930 A
1775921 Williams Sep 1930 A
1848046 Caron Mar 1932 A
1889461 Hansen Nov 1932 A
1923164 Roos Aug 1933 A
1948260 Fowler Feb 1934 A
1961516 Hansen Jun 1934 A
1978628 Hansen Oct 1934 A
1991151 Hansen Feb 1935 A
2032820 Turrell Mar 1936 A
2038949 Mintz Apr 1936 A
2098728 McPhee Nov 1937 A
2105099 Schuyler Jan 1938 A
2114597 Goddard Apr 1938 A
2148668 Yoskowitz et al. Feb 1939 A
2176106 Segal Oct 1939 A
2274012 Swayze et al. Feb 1942 A
2325541 Poole Jul 1943 A
2329269 Jacobi Sep 1943 A
2386816 Scholz Oct 1945 A
2430924 Fowle et al. Nov 1947 A
2445041 Scholz Jul 1948 A
2499124 Zipp et al. Feb 1950 A
2556577 Drake Jun 1951 A
2582012 Currier Jan 1952 A
2605294 Barnhart Jul 1952 A
2622485 Martellotti Dec 1952 A
2645978 Sejarto et al. Jul 1953 A
2707335 Falk May 1955 A
2728251 Turner Dec 1955 A
2860884 Sloan et al. Nov 1958 A
2929177 Sheps Mar 1960 A
2940183 Fromberg Jun 1960 A
3053149 Rossetti Sep 1962 A
3094039 Spain Jun 1963 A
3138999 Haggstrom Jun 1964 A
3172969 Haggstrom Mar 1965 A
3245149 Haggstrom Apr 1966 A
3257908 Haggstrom Jun 1966 A
3259022 Vietorisz Jul 1966 A
3276328 Schreiber et al. Oct 1966 A
3286596 Lieptz Nov 1966 A
3286597 Schwartz Nov 1966 A
3305100 Barbee Feb 1967 A
3323420 Roxburgh Jun 1967 A
3388619 Schreiber et al. Jun 1968 A
3418882 Brand Dec 1968 A
3424056 Stolove et al. Jan 1969 A
3429207 John Feb 1969 A
3430535 Haggstrom Mar 1969 A
3440906 Allen Apr 1969 A
3442174 Weiner et al. May 1969 A
3457831 Adler et al. Jul 1969 A
3466747 Patriquin et al. Sep 1969 A
3496636 Lieptz Feb 1970 A
3499366 Spain Mar 1970 A
RE26848 Simon Apr 1970 E
3599147 Rogers et al. Aug 1971 A
3602092 Richens Aug 1971 A
3625111 Carlo et al. Dec 1971 A
3633451 Lieptz Jan 1972 A
3651573 Kaplan Mar 1972 A
3656402 French Apr 1972 A
3675536 Hungerford, Jr. et al. Jul 1972 A
3682041 Essig Aug 1972 A
3707999 Coats Jan 1973 A
3722341 Hungerford, Jr. et al. Mar 1973 A
RE27665 Spain Jun 1973 E
3769865 Kleist Nov 1973 A
3773360 Timbers Nov 1973 A
3792639 Richens et al. Feb 1974 A
3795174 Oliver et al. Mar 1974 A
3796130 Gartner Mar 1974 A
3807276 Oliver Apr 1974 A
3810416 Nelms, Jr. May 1974 A
3826555 Matsumoto Jul 1974 A
3848235 Lewis et al. Nov 1974 A
3865011 Patriquin Feb 1975 A
3870895 Lax et al. Mar 1975 A
3880047 Dosier Apr 1975 A
3884121 Agius May 1975 A
3902382 Lieptz Sep 1975 A
3919589 Hanak Nov 1975 A
3919920 Schlage Nov 1975 A
3945298 Cockroft Mar 1976 A
3955179 Planke May 1976 A
3956968 Crasnianski May 1976 A
3978764 Patriquin Sep 1976 A
3981214 Wich Sep 1976 A
4012991 Uyeda Mar 1977 A
4019415 Wich Apr 1977 A
4023464 Zion May 1977 A
4051748 Sherman Oct 1977 A
4062261 Stahl Dec 1977 A
4088060 Johns May 1978 A
4090303 Uyeda May 1978 A
4092806 Wich Jun 1978 A
4105340 Kempf Aug 1978 A
4117763 Uyeda Oct 1978 A
4121292 Galanis et al. Oct 1978 A
4132151 Weber Jan 1979 A
D251365 Lipinski Mar 1979 S
4143582 Heimann Mar 1979 A
4166949 Pold et al. Sep 1979 A
4171161 Jung Oct 1979 A
4172632 Holmes, Jr. Oct 1979 A
4188163 Juskevic Feb 1980 A
4223791 Taggart Sep 1980 A
4233746 Troillet Nov 1980 A
D257758 Limacher Jan 1981 S
4251173 Saucedo Feb 1981 A
4256423 Juskevic Mar 1981 A
4281379 Austin Jul 1981 A
4283859 Roland Aug 1981 A
4294096 Heimann Oct 1981 A
4300042 Oldenkamp et al. Nov 1981 A
4300170 Sakamoto Nov 1981 A
4300836 Holmes et al. Nov 1981 A
4301373 Sjodin Nov 1981 A
4354780 Bougiouris Oct 1982 A
4359299 Sagarian Nov 1982 A
4373414 Agius Feb 1983 A
4426179 Jefferson Jan 1984 A
4432142 Korsak Feb 1984 A
4433487 Roland Feb 1984 A
4437150 Dahlgren, Jr. et al. Mar 1984 A
4453432 Widen Jun 1984 A
4468994 Lieptz Sep 1984 A
4472056 Nakagawa et al. Sep 1984 A
4479673 Inaba et al. Oct 1984 A
4521142 Juskevic Jun 1985 A
4525908 Bernstein Jul 1985 A
4526498 Fieldhouse Jul 1985 A
4541760 Zoueki Sep 1985 A
4545569 Schroder et al. Oct 1985 A
4551046 Kinas Nov 1985 A
4553844 Nakagawa et al. Nov 1985 A
4557488 Litherland Dec 1985 A
4558215 Kaneko et al. Dec 1985 A
4562759 Schmitt Jan 1986 A
4592683 Wu Jun 1986 A
4601185 Sheldon Jul 1986 A
4614465 Wu Sep 1986 A
4625107 Planke Nov 1986 A
4638567 Leversee Jan 1987 A
4647028 Yang Mar 1987 A
4648585 Yang Mar 1987 A
4651604 Almblad et al. Mar 1987 A
4652738 Nishihara et al. Mar 1987 A
4652765 Nishihara Mar 1987 A
4653104 Tamura Mar 1987 A
4656590 Ace Apr 1987 A
4657448 Alexander Apr 1987 A
4666351 Marchal May 1987 A
4671711 Steinbach et al. Jun 1987 A
4677835 Almblad Jul 1987 A
4679331 Koontz Jul 1987 A
4687389 Santii et al. Aug 1987 A
4697300 Warlop Oct 1987 A
4710808 Hoogenboom et al. Dec 1987 A
4717294 Grasser Jan 1988 A
4741652 Marchal May 1988 A
4767110 Yang Aug 1988 A
4780032 Uyeda et al. Oct 1988 A
4783829 Miyakawa et al. Nov 1988 A
4803371 Durland Feb 1989 A
4805224 Koezuka et al. Feb 1989 A
4809341 Matsui et al. Feb 1989 A
4821200 Oberg Apr 1989 A
4821393 Spigarelli Apr 1989 A
4839913 Annis et al. Jun 1989 A
4845764 Ueda et al. Jul 1989 A
4848116 Lizotte Jul 1989 A
4853866 Andrada Galan et al. Aug 1989 A
4868559 Pinnow Sep 1989 A
4898504 Agius et al. Feb 1990 A
4899391 Cimino et al. Feb 1990 A
4909892 Quinn et al. Mar 1990 A
4929129 Dickson May 1990 A
4929843 Chmielewski, Jr. et al. May 1990 A
4941335 Allen Jul 1990 A
4969782 Castain Nov 1990 A
4971489 Womack Nov 1990 A
4993291 Sopko Feb 1991 A
4998349 Killeen Mar 1991 A
5029459 Almblad Jul 1991 A
5043144 Gordon et al. Aug 1991 A
5056204 Bartschi Oct 1991 A
5058940 Hart Oct 1991 A
5083759 Pollak et al. Jan 1992 A
5088864 Yanagida Feb 1992 A
5094538 Reedman et al. Mar 1992 A
5096346 Ueda Mar 1992 A
5111056 Yoshimura et al. May 1992 A
5119190 Lemelson Jun 1992 A
5122018 Zion Jun 1992 A
5127532 Cimino et al. Jul 1992 A
5128531 Fadel Jul 1992 A
5130064 Smalley et al. Jul 1992 A
5139246 Yakou Aug 1992 A
5144561 Soper Sep 1992 A
5146689 Roland Sep 1992 A
5165315 Terada Nov 1992 A
5167171 Heredia Dec 1992 A
5171112 Roland Dec 1992 A
5192469 Smalley et al. Mar 1993 A
5201203 Almblad Apr 1993 A
5229619 Van Amstel Jul 1993 A
5244321 Sopko Sep 1993 A
5255199 Barkman et al. Oct 1993 A
5259708 Brice Nov 1993 A
5271698 Heredia et al. Dec 1993 A
5293687 Willoughby, Jr. et al. Mar 1994 A
5307151 Hof et al. Apr 1994 A
5308360 Neitzke et al. May 1994 A
5311286 Pike May 1994 A
5311756 Villani May 1994 A
5311758 Neitzke et al. May 1994 A
5314274 Heredia et al. May 1994 A
D348393 Neitzke et al. Jul 1994 S
5330168 Enomoto et al. Jul 1994 A
5351409 Heredia Oct 1994 A
5360299 Oliana Nov 1994 A
5363463 Kleinerman Nov 1994 A
5365812 Harnden Nov 1994 A
5382784 Eberhardt Jan 1995 A
5393967 Rice et al. Feb 1995 A
5416591 Yoshimura et al. May 1995 A
5429202 Millard et al. Jul 1995 A
5441369 Foscan et al. Aug 1995 A
5443339 Heredia et al. Aug 1995 A
5485399 Saigo et al. Jan 1996 A
5496138 Drori Mar 1996 A
5497888 Michaels et al. Mar 1996 A
5503785 Crump et al. Apr 1996 A
5515903 Hronas et al. May 1996 A
5538374 Cole et al. Jul 1996 A
5543103 Hogan et al. Aug 1996 A
5545367 Bae et al. Aug 1996 A
5552992 Hunter Sep 1996 A
5555176 Menhennett et al. Sep 1996 A
5556240 Almblad Sep 1996 A
5583443 McMurtry et al. Dec 1996 A
5592728 Susnjara Jan 1997 A
5594652 Penn et al. Jan 1997 A
5607267 Heredia et al. Mar 1997 A
5617323 Stansberry et al. Apr 1997 A
RE35518 Sussina May 1997 E
5630332 Aldieri et al. May 1997 A
5660509 Cole et al. Aug 1997 A
5671523 Juchinewicz Sep 1997 A
5676504 Mueller et al. Oct 1997 A
5677522 Rice et al. Oct 1997 A
5711643 Parr et al. Jan 1998 A
5739766 Chaloux Apr 1998 A
5764156 Chaloux Jun 1998 A
5771176 Froehlich et al. Jun 1998 A
5807042 Almblad et al. Sep 1998 A
5855836 Leyden et al. Jan 1999 A
5886775 Houser et al. Mar 1999 A
5906365 Wu May 1999 A
5908273 Titus et al. Jun 1999 A
5926388 Kimbrough et al. Jul 1999 A
5940229 Baumgarten Aug 1999 A
5964554 Drori Oct 1999 A
5966457 Lemelson Oct 1999 A
5982491 Breyer et al. Nov 1999 A
5984597 Chen Nov 1999 A
5997224 Beauregard et al. Dec 1999 A
5997795 Danforth et al. Dec 1999 A
6053677 Juchinewicz Apr 2000 A
6059495 Mueller et al. May 2000 A
6064747 Wills et al. May 2000 A
6065911 Almblad et al. May 2000 A
6082580 Mueller et al. Jul 2000 A
6094953 Evans Aug 2000 A
6152662 Titus et al. Nov 2000 A
6175638 Yanovsky Jan 2001 B1
6179531 Jaw Jan 2001 B1
6185311 Yanovsky et al. Feb 2001 B1
6186711 Mueller Feb 2001 B1
6243960 Andrews et al. Jun 2001 B1
6321430 Goldman et al. Nov 2001 B1
D455104 Hillman et al. Apr 2002 S
6406227 Titus et al. Jun 2002 B1
6415931 Mueller Jul 2002 B1
6449381 Yanovsky et al. Sep 2002 B1
6478515 Mueller Nov 2002 B1
6543972 Cimino Apr 2003 B1
6588995 Wills et al. Jul 2003 B2
6602030 Markbreit Aug 2003 B1
6612142 Capwell Sep 2003 B1
6641339 Chies et al. Nov 2003 B2
6647308 Prejean Nov 2003 B1
6687565 Wetterlin et al. Feb 2004 B2
6711557 Palaniappan Mar 2004 B1
6801829 Kawai Oct 2004 B2
6817814 Mueller Nov 2004 B2
6836553 Campbell et al. Dec 2004 B2
6839449 Campbell et al. Jan 2005 B1
6839451 Campbell et al. Jan 2005 B2
6895100 Pacenzia et al. May 2005 B1
6959862 Neumark Nov 2005 B2
6965911 Coffman et al. Nov 2005 B1
7010498 Berstis Mar 2006 B1
7111894 Kora et al. Sep 2006 B2
7114436 Mueller Oct 2006 B1
7114894 Mueller et al. Oct 2006 B2
7163364 Foscan et al. Jan 2007 B2
7214011 Ryai, Sr. et al. May 2007 B2
7484446 Gula Feb 2009 B1
7643685 Miller Jan 2010 B2
7891919 Bass et al. Feb 2011 B2
7918629 Belflower et al. Apr 2011 B2
8128322 Bass et al. Mar 2012 B2
8532809 Freeman Sep 2013 B2
8585029 Ryai, Sr. Nov 2013 B2
8634655 Thompson et al. Jan 2014 B2
8644619 Thompson et al. Feb 2014 B2
20010033781 Wills et al. Oct 2001 A1
20010056385 Timms et al. Dec 2001 A1
20020031251 Campbell et al. Mar 2002 A1
20020168241 David et al. Nov 2002 A1
20020191849 Campbell et al. Dec 2002 A1
20030145499 Tarter et al. Aug 2003 A1
20030154135 Covington et al. Aug 2003 A1
20030205070 Chaum Nov 2003 A1
20040024486 Almblad et al. Feb 2004 A1
20040036595 Kenny et al. Feb 2004 A1
20040095380 Bass et al. May 2004 A1
20040253067 Bosch Dec 2004 A1
20050000052 Byles Jan 2005 A1
20050216120 Rosenberg et al. Sep 2005 A1
20060003676 Bernard et al. Jan 2006 A1
20060147289 Gimelfarb et al. Jul 2006 A1
20070224008 Bass et al. Sep 2007 A1
20070234614 Tarter et al. Oct 2007 A1
20080145163 Freeman et al. Jun 2008 A1
20080252551 Kubo et al. Oct 2008 A1
20090074528 Hadad Mar 2009 A1
20090180664 Efstathiades et al. Jul 2009 A1
20110262240 Mutch et al. Oct 2011 A1
20120243957 Drake et al. Sep 2012 A1
Foreign Referenced Citations (22)
Number Date Country
673612 Mar 1990 CH
2951065 Jul 1981 DE
0053730 Oct 1981 EP
0133091 Feb 1985 EP
0835720 Apr 1998 EP
1976656 Oct 2014 EP
2017240 Jan 1991 ES
2499435 Aug 1982 FR
2276106 Sep 1994 GB
S59201708 Nov 1984 JP
63-31108 Dec 1988 JP
63-31109 Dec 1988 JP
4-250911 Sep 1992 JP
291113 Jan 2007 MX
WO9003867 Apr 1990 WO
WO9113535 Sep 1991 WO
WO9619309 Jun 1996 WO
WO0157472 Aug 2001 WO
WO0201480 Jan 2002 WO
WO2005042196 May 2005 WO
WO2007087389 Aug 2007 WO
WO2012096685 Jul 2012 WO
Non-Patent Literature Citations (32)
Entry
Chinese Office Action, Application No. 200780009675.0, Hy-Ko Products Company, Dec. 4 2009.
Chinese Office Action, Application No. 201080024166.7, Hy-Ko Products Company, Dec. 6, 2013.
Chinese Office Action, Application No. 201080024166.7, Hy-Ko Products Company, Sep. 30, 2014.
Chinese Office Action, Application No. 201080024163.3, Hy-Ko Products Company, Aug. 1, 2013.
Supplementary European Search Report, Application No. 07709849.9-1702/ 1976656, Hy-Ko Products Company, May 15, 2013.
Extended European Search Report, Application No. 07709849.9-1702/ 1976656, Hy-Ko Products Company, Apr. 26, 2013.
European Communication pursuant to Article 94(3) EPC, Application No. 10 770 489.2-1901, Hy-Ko Products, Jun. 27, 2014.
Supplementary European Search Report, Application No. 10770489.2-1901/ 2424690, Hy-Ko Products, Nov. 12, 2013.
Extended European Search Report, 10770489.2-1901 / 2424690, Hy-Ko Products, Oct. 25, 2013.
European Communication pursuant to Article 94(3) EPC, Application No. 12 003 030.9-1702, Hy-Ko Products Company, Mar. 20, 2014.
European Communication pursuant to Article 94(3) EPC, Application No. 12 003 030.9-1702, Hy-Ko Products Company, Jul. 30, 2013.
Extended European Search Report, Application No. 12003030.9-2302, Hy-Ko Products Company, Sep. 4, 2012.
European Communication pursuant to Article 94(3) EPC, Application No. 03 767 220.1-2201, Hy-Ko Products, Aug. 18, 2010.
European Supplementary Search Report, Application No. 03767220.1-2201, Hy-Ko Products, Jul. 18, 2007.
Mexican Office Action, Application No. MX/A/2011/011630, Hy-Ko Products, Nov. 18, 2014.
Mexican Office Action, Application No. MX/A/2011/011630, Hy-Ko Products, Apr. 28, 2014.
International Preliminary Report on Patentability, PCT/US2011/034564, Mutch, William R. et al., Jul. 16, 2013.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2011/034564, Hy-Ko Products Company, Jul. 15, 2011.
International Preliminary Report on Patentability, PCT/US2010/033414, Hy-Ko Products et al., Nov. 1, 2011.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2010/033414, Hy-Ko Products, Aug. 18, 2010.
International Preliminary Report on Patentability, PCT/US2007/002015, Hy-Ko Products Company, Jul. 29, 2008.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2007/02015, Hy-Ko Products Company, Sep. 28, 2007.
International Preliminary Report on Patentability, PCT/US2010/033421, Hy-Ko Products et al., Nov. 1, 2011.
International Search Report and the Written Opinion of the International Searching Authority, PCT/US2010/033421, Hy-Ko Products, Sep. 17, 2010.
Giuliani Productivity Through Flexibility, Multicode CCE-1, 2 pages.
Giuliani Productivity Through Flexibility, Multicode CCE-2, 3 pages.
Farzin Mokhtarian and Hiroshi Murase, Silhouette-Based Object Recognition through Curvature Scale Space, IEEE, Proceedings from Fourth International Conference on Computer Vision, 1993, pp. 269-274.
Ihtisham Kabir, A Computer Vision System Using Fast, One Pass Algorithms, (Thesis), Graduate Division of the University of California, Davis, 1986 pp. 1-164.
Roger D. Quinn et al., Design of an Agile Manufacturing Workcell for Light Mechanical Applications, Apr. 1996, pp. 858-863, Proceedings from the 1996 IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota.
Anil K. Jain, Fundamentals of Digital Image Processing, Ch. 9, Image Analysis and Computer Vision, University of California, Davis, 1989, pp. 342-430, Prentice Hall, Inc., Englewood Cliffs, NJ.
Amir Novini, Fundamentals of Machine Vision Lighjting, IEEE, Proceedings of Northcon 93 Electrical Electronics Convention, 1993, pp. 38-46.
Wesley E. Snyder, Industrial Robots Computer Interfacing and Control, Ch., 13 Computer Vision, North Carolina State University, 1985, pp. 248-283, Prentice-Hall, Inc., Englewood, NJ.
Related Publications (1)
Number Date Country
20140140628 A1 May 2014 US
Provisional Applications (2)
Number Date Country
61215122 May 2009 US
61275648 Sep 2009 US
Continuations (1)
Number Date Country
Parent 12772763 May 2010 US
Child 14147308 US