Patents by Inventor Chi-Lim Oscar Au

Chi-Lim Oscar Au 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: 7907209
    Abstract: There is provided a method for converting an image with N rows of pixels present and N rows of pixels missing to an image with 2N rows of pixels, wherein the missing pixels are generated by performing a deinterlacing algorithm. The algorithm determines whether missing pixels are part of a horizontal edge region, a smooth region, a vertical edge region or a texture region. Based on the determination, a deinterlacing method is selected.
    Type: Grant
    Filed: May 12, 2006
    Date of Patent: March 15, 2011
    Assignee: The Hong Kong University of Science and Technology
    Inventors: Chi-Lim Oscar Au, Tak-Song Chong
  • Patent number: 7672523
    Abstract: Methods, systems, and apparatuses for defining a target bit rate and collections of coefficients of source data, as well as a global coding order of the collections of coefficients. A plurality of coding units and corresponding allowable truncation points for each of said collections of coefficients and a local coding order of said coding units can be defined. A rate value and a distortion value for each of said coding units can be defined along with an adaptive threshold value for each of said coding units. The encoding of the collections of coefficients is performed in turn according to the global coding order. During the encoding, if a predetermined termination criterion is not met for a particular coding unit, the particular coding unit will be included in an output code-stream, and if the termination criterion is met, an encoding of the one of the collection of coefficients will be terminated.
    Type: Grant
    Filed: March 2, 2004
    Date of Patent: March 2, 2010
    Assignee: The Hong Kong University of Science and Technology
    Inventors: Yick Ming Yeung, Chi-Lim Oscar Au
  • Publication number: 20040228537
    Abstract: There are disclosed three fast rate control methods that can efficiently reduce or remove the computation and memory usage redundancy over conventional PCRD methods. The first method, called successive bit-plane rate allocation (SBRA), assigns the maximum allowable bit-rate for each bit-plane of each code-block by using the currently available rate-distortion information only. The second method is called priority scanning rate allocation (PSRA). This first predicts the order of magnitude of each truncation point's rate-distortion slope and then encodes the truncation points based on the order (priority) information. The third method uses PSRA to obtain a significantly smaller amount of data than PCRD for optimal truncation and is called priority scanning with optimal truncation (PSOT). SBRA provides the highest computational complexity and memory usage reduction, and the lowest coding/transmission delay. The computational complexity reduction can be up to about 90% of the entropy coding process.
    Type: Application
    Filed: March 2, 2004
    Publication date: November 18, 2004
    Applicant: THE HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY
    Inventors: Yick Ming Yeung, Chi-Lim Oscar Au