Patents by Inventor David Crutchfield
David Crutchfield has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8086583Abstract: An analytics system can obtain analytics data. The analytics system can automatically partition data based on months or another time period, into fact tables. A scrolling window system can combine multiple eligible fact tables into a single view. A reporting engine can then use the single view.Type: GrantFiled: February 5, 2008Date of Patent: December 27, 2011Assignee: Oracle International CorporationInventors: David Crutchfield, Brent Cromley, James Hang, Sean Li
-
Patent number: 8023144Abstract: A method for generating transposed image data for use in an imaging apparatus having access to a memory includes (a) generating a set of data blocks corresponding to at least a portion of image data representing an image to be printed; (b) performing a combined format and transpose operation on the set of data blocks; and (c) storing a result of the combined format and transpose operation in the memory.Type: GrantFiled: July 11, 2006Date of Patent: September 20, 2011Assignee: Lexmark International, Inc.Inventors: Christopher Wilson Case, David A. Crutchfield, James Alan Ward
-
Publication number: 20090196519Abstract: Error diffusion is performed using a Floyd-Steinberg-like approach. A integer-representation of a running error is compressed by storing only its most significant bits and returning any remainder to the error diffusion processor. The running error is shifted to the right until only the desired number of significant bits remain, and this compressed error is stored. Any portion of the original running error that is lost due to the shifting is treated as a remainder and is returned to the error diffusion processor for use in calculating an adjusted current pixel value. The amount of the shift is retained in compressed form to keep track of the number of shifts needed to form a truncated running error from the compressed running error.Type: ApplicationFiled: December 30, 2008Publication date: August 6, 2009Applicant: LEXMARK INTERNATIONAL, INC.Inventors: James R. Bailey, David A. Crutchfield, Shaun T. Love
-
Patent number: 7486834Abstract: Error diffusion is performed using a Floyd-Steinberg-like approach. A integer-representation of a running error is compressed by storing only its most significant bits and returning any remainder to the error diffusion processor. The running error is shifted to the right until only the desired number of significant bits remain, and this compressed error is stored. Any portion of the original running error that is lost due to the shifting is treated as a remainder and is returned to the error diffusion processor for use in calculating an adjusted current pixel value. The amount of the shift is retained in compressed form to keep track of the number of shifts needed to form a truncated running error from the compressed running error.Type: GrantFiled: January 18, 2005Date of Patent: February 3, 2009Assignee: Lexmark International, Inc.Inventors: James R. Bailey, David A. Crutchfield, Shaun T. Love
-
Publication number: 20080228829Abstract: An analytics system can obtain analytics data. The analytics system can automatically partition data based on months or another time period, into fact tables. A scrolling window system can combine multiple eligible fact tables into a single view. A reporting engine can then use the single view.Type: ApplicationFiled: February 5, 2008Publication date: September 18, 2008Applicant: BEA SYSTEMS, INC.Inventors: David Crutchfield, Brent Cromley, James Hang, Sean Li
-
Patent number: 7333243Abstract: The present invention relates to error diffusion logic in which three partial diffusion error values are produced in a pipelined manner and then summed together when the last partial error value is produced. The resulting summed error can be used to adjust a target pixel in a sequence of pixels or stored in a buffer until further corresponding partial error is produced for adjusting the target pixel.Type: GrantFiled: December 17, 2003Date of Patent: February 19, 2008Assignee: Lexmark International, IncInventor: David A. Crutchfield
-
Publication number: 20080013119Abstract: A method for generating transposed image data for use in an imaging apparatus having access to a memory includes (a) generating a set of data blocks corresponding to at least a portion of image data representing an image to be printed; (b) performing a combined format and transpose operation on the set of data blocks; and (c) storing a result of the combined format and transpose operation in the memory.Type: ApplicationFiled: July 11, 2006Publication date: January 17, 2008Inventors: Christopher Wilson Case, David A. Crutchfield, James Alan Ward
-
Publication number: 20070260783Abstract: A USB host/client system includes a USB host device, a USB client device connected via a USB cable to the USB host device, and a power supply unit remote from the USB host device for powering the USB host device through the USB cable connecting the USB client device to the USB host device. The USB host device can have means for communicating with a computer while the USB host device is connected to a USB client device, and/or the power supply unit supplies sufficient power for all normal operations of the USB host device.Type: ApplicationFiled: April 25, 2006Publication date: November 8, 2007Inventors: James Combs, David Crutchfield
-
Publication number: 20070106719Abstract: An integer square root calculation technique determines the precise root of an input value to determine the distance between data points such as pixels in a digital image. The technique avoids division and floating point multiplication steps. An initial root estimate may be used as a seed value beginning an iterative convergence towards the final solution. A scaled error may be determined by bit shifting an error difference between a square of the root estimate and the input value. Depending on whether the scaled error satisfies a predetermined condition, the current square root estimate may be adjusted by a bit-shifted fraction of the scaled error and the scaled error is then recalculated. In certain instances, a final adjustment to the root estimate may be implemented to yield the precise square root value. Ultimately, the final root estimate may be assigned to an output value representing the desired distance.Type: ApplicationFiled: November 8, 2005Publication date: May 10, 2007Inventors: James Bailey, David Crutchfield, Zachary Fister
-
Publication number: 20070091383Abstract: A method and system for performing dual-sided scanning of an original document in a device having an automatic document feeder uses two application specific circuits (ASICs), each ASIC configured to control an associated scanning element. A first of the two ASICs receives position information about a motor associated with the automatic document feeder, or the document itself, and uses this position information to determine when to read a line of scan data from its associated scanning element. The first ASIC also uses the position information to create a scanning synchronization signal that is sent to the second ASIC. The second ASIC uses the scanning synchronization signal to determine when to read data from its associated scanning element.Type: ApplicationFiled: October 24, 2005Publication date: April 26, 2007Inventors: David Crutchfield, James Ward, Doyle White, Joseph Yackzan
-
Publication number: 20060245527Abstract: A method for effecting synchronous pulse generation for use in serial communications is provided. The method includes the steps of generating a difference signal representing a signal level difference between at least two data stream signals; providing a clock signal; providing a counter, defining a sample count value of the counter; incrementing the counter in relation to the clock signal; and determining whether a current count value of the counter corresponds to the sample count value. If the current count value corresponds to the sample count value, then the method performs a step of generating a synchronous pulse.Type: ApplicationFiled: June 26, 2006Publication date: November 2, 2006Inventors: David Crutchfield, Timothy Rademacher, Galen Rasche
-
Publication number: 20060164667Abstract: Printer (1) is provided with a mode to edit and print forms without reference to or interruption of a host computer and with immediate printing of one or more of the forms. Page data for the forms is preferably stored in flash memory (21) in a high level printer language. Preferably, at initiation of the forms mode at least the first listed document is immediately prepared by the control data processor (17) of the printer in bit mapped form for printing. Documents can be listed on the control panel by name for ready selection for printing.Type: ApplicationFiled: April 4, 2006Publication date: July 27, 2006Inventors: Adam Ahne, David Crutchfield, Mark Edwards, Galen Rasche
-
Publication number: 20060158692Abstract: Error diffusion is performed using a Floyd-Steinberg-like approach. A integer-representation of a running error is compressed by storing only its most significant bits and returning any remainder to the error diffusion processor. The running error is shifted to the right until only the desired number of significant bits remain, and this compressed error is stored. Any portion of the original running error that is lost due to the shifting is treated as a remainder and is returned to the error diffusion processor for use in calculating an adjusted current pixel value. The amount of the shift is retained in compressed form to keep track of the number of shifts needed to form a truncated running error from the compressed running error.Type: ApplicationFiled: January 18, 2005Publication date: July 20, 2006Inventors: James Bailey, David Crutchfield, Shaun Love
-
Publication number: 20060132848Abstract: Pixel data-driven error diffusion is performed by using two lookup tables. The first table receives a non-binary pixel value and outputs a selection signal in response thereto. The selection signal serves as a pointer to entries in the second table where coefficients associated with a set of error spread weights are stored. In this manner, each non-binary pixel value is mapped onto a handful of predetermined sets of error spread weights to be used in an error diffusion calculation. The first table, the second table and an associated error diffusion processor can all reside on a common integrated circuit. A third table can also be indexed at the same time to provide randomization information to be used in calculating a dynamic threshold for used in a half-toning process for the corresponding pixel.Type: ApplicationFiled: December 20, 2004Publication date: June 22, 2006Inventors: James Bailey, David Crutchfield
-
Publication number: 20060001921Abstract: The present invention is directed to a system and method for reducing the memory requirement for offset and gain calibration to relieve the size/performance bottleneck in scanner systems. The resulting methodology produces visually equivalent scanned results with a substantial increase in performance, which results in a shorter amount of time required to output a first copy in, for example, an all-in-one device. Since the calibration step is often the bottleneck in scanner performance, this method noticeably speeds up scan and copy time. Implementing the decompression in hardware requires a minimal amount of hardware overhead and complexity. Thus, this method has a minimal impact on the size and cost of the scanner controller (e.g., an ASIC—application specific integrated circuit). Since compression only takes place at most once per scan, this added step has no significant impact on the overall scan time.Type: ApplicationFiled: June 30, 2004Publication date: January 5, 2006Inventors: James Bailey, Curt Breswick, David Crutchfield, Joseph Yackzan
-
Publication number: 20050254706Abstract: A method of transforming a n-bit data packet to a m-bit data packet with a lookup table. The lookup table includes at least one entry data packet and at least one respective delta value associated with each entry data packet. The method includes the acts of receiving an input data packet having n-bits, indexing the lookup table with at least a portion of the input data packet to obtain one of the at least one entry data packet, and decompressing the obtained entry data packet with the at least one respective delta value associated with the obtained entry data packet, thereby resulting in an output data packet having m-bits. The decompressing act includes using a portion of the input data packet to determine the number of delta values called for decompressing the obtained entry data packet. The method can be used in, for example, an image processor.Type: ApplicationFiled: May 13, 2004Publication date: November 17, 2005Inventors: James Bailey, Curt Breswick, David Crutchfield, Thomas Eade, Zachary Fister
-
Publication number: 20050134919Abstract: The present invention relates to error diffusion logic in which three partial diffusion error values are produced in a pipelined manner and then summed together when the last partial error value is produced. The resulting summed error can be used to adjust a target pixel in a sequence of pixels or stored in a buffer until further corresponding partial error is produced for adjusting the target pixel.Type: ApplicationFiled: December 17, 2003Publication date: June 23, 2005Inventor: David Crutchfield