Abstract: A remote diagnosis management system is utilized for a plurality of massage bath devices and includes at least one processor executing steps of: receiving a remote trigger event of each of the massage bath devices, wherein the remote trigger event is generated by a control unit of each of the massage bath devices or by at least one of a maintenance-worker and a user of each of the massage bath devices; analyzing the remote trigger event to generate an analyzed result; remotely operating at least one state of each of the massage bath devices according to the analyzed result; requesting authorization from the user of each of the massage bath devices before the step of remotely operating the at least one state of each of the massage bath devices; and scheduling at least one remote diagnosis of the massage bath devices.

Abstract: A remote diagnosis management system and a method for operating the same are disclosed. The remote diagnosis management system is utilized for at least one massage bath equipment and includes a communication module configured to receive a remote trigger event of the at least one massage bath equipment; an analyzing module configured to analyze the remote trigger event to generate an analyzed result; and a processing module configured to remotely operate at least one state of the at least one massage bath equipment. The remote diagnosis management system and the method for operating the same can provide more services for the at least one massage bath equipment.

Abstract: Pixel information of a current block is correlated with pixel information of a reference frame indicated by a first motion vector of a block proximate to the current block, pixel information of the reference frame indicated by a second motion vector of a block of the reference frame spatially coincident with the current block, and pixel information of predetermined regions of the reference frame. At least one of the first, second, and third motion vectors having the lowest cost function is selected as a candidate motion vector. Pixel information of the current block is correlated with pixel information of regions offset from the regions indicated by the candidate motion vectors to determine refined candidate motion vectors and corresponding refined cost functions. The refined candidate motion vector having the lowest refined cost function is selected as the motion vector of the current block.

Abstract: A block matching motion estimation method for obtaining a motion vector between a macro block in a current frame and a best match block in a reference frame is provided. The block matching motion estimation method includes steps of dividing a search window of the reference frame into a first area, a second area and a third area, wherein the first area is located between the second area and the third area, and searching initially from the first area for the motion vector.

Abstract: A method provides a predetermined sequence of video frames, the predetermined sequence beginning with an I-frame, ending with a P-frame, and having intermediate B-frames. The method encodes blocks of each frame according to the order of the frame in the sequence and the frame type, determines a number of intra picture coded blocks in an encoded P-frame, and determines that a scene change occurs when the number of intra-picture encoded blocks is greater than a predetermined number. The method redefines the P-frame detected as having a scene change as an I-frame, redefines all B-frames of the sequence as P-frames, and re-encodes redefined frames while detecting for the scene change in the newly defined P-frames.

Abstract: Pixel information of a current block is correlated with pixel information of a reference frame indicated by a first motion vector of a block proximate to the current block, pixel information of the reference frame indicated by a second motion vector of a block of the reference frame spatially coincident with the current block, and pixel information of predetermined regions of the reference frame. At least one of the first, second, and third motion vectors having the lowest cost function is selectedas a candidate motion vector. Pixel information of the current block is correlated with pixel information of regions offset from the regions indicated by the candidate motion vectors to determine refined candidate motion vectors and corresponding refined cost functions. The refined candidate motion vector having the lowest refined cost function is selected as the motion vector of the current block.

Abstract: A system and a method provide edge enhancement for a printer engine which produces multiple laser beams for marking a corresponding number of scan lines on at least one photosensitive medium. A corresponding number of windows are created. Each window contains data of a matrix of dots centered at a to-be-processed dot located in a corresponding one of the scan lines. An edge enhancing device provides edge enhancement for the windows that are alternately outputted to the edge enhancing device by a multiplexer. The windows processed by the edge enhancing device are alternately outputted by a de-multiplexer to a number of modulators. Each modulator controls a corresponding one of the laser beams produced by the printer engine.

Abstract: An image transformation method to reduce the number of the gray levels is disclosed. Error diffusion, error bias and a programmable integer C are utilized. For the focus pixel, the value Gi of the original gray scale is read. The related errors Ej previously obtained from some chosen pixels are loaded in. The respective corresponding weighting coefficient Wj for each errors Ej are determined. Then, a resultant gray value Ri of the focus pixel is calculated by Ri=Gi+&Sgr;Wj(Ej−C), wherein C is a programmable integer. Thereafter, the gray value Ri is dividing into most significant part Mi and least significant part Li, wherein Mi is a K-bit integer, Li is an (N−K)-bit integer, Mi×2N−K+Li=Ri, and −2N−K/2≦Li<2N−K/2. The error Ei of the focus pixel is stored as Li plus an error bias D of 2N−K/2. Finally, the focus pixel is displayed using Mi as the degraded target gray value.

Abstract: A method for transforming a source image into a target image with the original resolution N time to the target resolution is disclosed. The original image data of pixels is read and stored for N scan lines and grouped into a series of matrices each including N2 pixels. The matrices are then classified into various matrix types defined previously, wherein matrices with different numbers of original dots are classified as different matrix types. The target image is formed with a plurality of target units each determined based on one corresponding matrix. In general, a target unit is drawn with target dots having a larger total area when its corresponding matrix includes a larger number of the original dots.

Abstract: A method for converting a facsimile-based vertical resolution to a printer-based vertical resolution is disclosed. The printer-based vertical resolution is firstly divided by using the facsimile-based vertical resolution to obtain a quotient and a remainder both being integers. All the data lines of the printing job are repeatedly generated for “quotient” times. Next, some data lines that their total number equals to the remainder are selected from the repeatedly data lines for further generated once than the other is. The selected data lines can be randomly or fixed selected from the data lines.