Abstract: A threshold determination method is selected from among a plurality of alternative global thresholding determination methods and, optionally, a local thresholding determination method based on characteristics of a histogram of grayscales values representing an image. When it is determined to use a global thresholding method, a single global binarization threshold value is determined using the selected global thresholding method. Various alternative global binarization threshold values include a predetermined constant, an average value of the two grayscale values, an Otsu method based threshold value, a Newton method based threshold value, and an Otsu method based threshold value based on a truncated version of the histogram. When it is determined to use local thresholding, a plurality of local binarization threshold values are determined corresponding to different non-overlapping blocks of the image.

Abstract: A threshold determination method is selected from among a plurality of alternative global thresholding determination methods and, optionally, a local thresholding determination method based on characteristics of a histogram of grayscales values representing an image. When it is determined to use a global thresholding method, a single global binarization threshold value is determined using the selected global thresholding method. Various alternative global binarization threshold values include a predetermined constant, an average value of the two grayscale values, an Otsu method based threshold value, a Newton method based threshold value, and an Otsu method based threshold value based on a truncated version of the histogram. When it is determined to use local thresholding, a plurality of local binarization threshold values are determined corresponding to different non-overlapping blocks of the image.

Abstract: Methods and apparatus for providing JPEG decoder functions are described. In particular, features and methods of the present invention are directed to an efficient way of implementing a non-common decoding path function used in an MQ-coder, such as the type used to decode JPEG-2000 images. The methods of the present invention are well suited for implementation on general purpose computers such as conventional personal computers (PCs) and can provide improved decoding speed, compared to known systems which use processing branches as part of a non-common decoding path function by reducing and, in some implementations completely avoiding, branches. Thus, branch prediction penalties associated with known decoding schemes are reduced or avoided leading, in many cases, to faster decoding rates when using a general purpose processor of a given speed or computational capability.

Abstract: Improved methods and apparatus for implementing JPEG 2000 MQ encoding operations are described. The following features of the invention may be used alone or in combination to implement JPEG 2000's coefficient bit modeling 1) Lists of coefficients to be processed in one or more subsequent coding passes are generated as coefficients are processed. The list is allows processing in the subsequent coding pass to be limited to coefficients on the list; and 2) Generation, updating and use of a neighborhood descriptor value table that stores a neighborhood descriptor value for each coefficient of a block being processed. The neighborhood descriptor values provide information about the state of the coefficient and its adjacent neighbors. Neighborhood descriptor values are used to access a lookup table that provides one or more context values and/or sign value to be used in MQ encoding.

Abstract: Improved methods and apparatus for implementing JPEG 2000 MQ encoding operations are described. The following features of the invention may be used alone or in combination to implement JPEG 2000's coefficient bit modeling 1) Lists of coefficients to be processed in one or more subsequent coding passes are generated as coefficients are processed. The list is allows processing in the subsequent coding pass to be limited to coefficients on the list; and 2) Generation, updating and use of a neighborhood descriptor value table that stores a neighborhood descriptor value for each coefficient of a block being processed. The neighborhood descriptor values provide information about the state of the coefficient and its adjacent neighbors. Neighborhood descriptor values are used to access a lookup table that provides one or more context values and/or sign value to be used in MQ encoding.