The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 21, 2006
Filed:
Dec. 23, 2003
Charles Lapinski, Bethlehem, PA (US);
Charles Eckert, Pipersville, PA (US);
Richard Skokowski, Hatfield, PA (US);
James Cox, Quakertown, PA (US);
William Scott, Sellersville, PA (US);
Edward Chaleff, Doylestown, PA (US);
Jeffrey G. Sharpe, Hatfield, PA (US);
David A. Wurz, Chalfont, PA (US);
Charles Lapinski, Bethlehem, PA (US);
Charles Eckert, Pipersville, PA (US);
Richard Skokowski, Hatfield, PA (US);
James Cox, Quakertown, PA (US);
William Scott, Sellersville, PA (US);
Edward Chaleff, Doylestown, PA (US);
Jeffrey G. Sharpe, Hatfield, PA (US);
David A. Wurz, Chalfont, PA (US);
Accu-Sort Systems, Inc., Telford, PA (US);
Abstract
A method for processing scanned code data, including a plurality of strings, to determine whether the scanned code data is part of a valid code begins by examining a first string of a first scanned code data. A cluster is opened with the first string if the first string contains a start pattern. At least one valid middle portion of the first string is identified and a transition position count associated with the at least one valid middle portion is stored. A second scanned code data is searched for a second string matching at least part of the first string in the cluster. If a match is found, then the second string is added to the end of the cluster. The cluster is closed upon detection of a stop pattern and is then decoded.