Search

A novel algorithm of median filters for VLSI implementation is proposed. The architecture based on this algorithm has modular, regular, locally connected and expansible features. The throughput of the filter is independent of the window size and the hardware complexity is O(WN), where W is the window size and N is the bit number per pixel. The algorithm is based on storing an ordered list of the input data and updating the list as a new datum arrives. The new input datum is compared, in parallel, with all the values in the ordered list to find the position where it can be inserted into the list. This approach is efficient in hardware and suitable for fast software implementation. An application to 2D image processing is discussed. >

(Tl0.5Pb0.5)Ca2Sr2Cu3Oy compound with Tco = 113 K has been achieved. The intragranular critical current density Jc at Ha = 1 T is estimated to be about 6 × 106 A/cm2 at 5 K and has a logarithmic temperature dependence below 40 K. An anomalous dimpling behavior occurs near the origin of the loop for powder sample. This Jc decreases slightly with magnetic field at low temperature and reaches a stable value at high field. The flux pinning centers may be considered as coming from the grain boundaries by the observation of the strong shielding effect and large hysteresis curves in bulk specimen compared with those in powder specimen.

Dot matrix representation of Chinese characters is the most popular method used, however, it requires a relatively large memory for the storage of Chinese character patterns. For the purpose of a global study, various data compression techniques are investigated to determine the method that requires the least amount of memory for data storage. The entropy of Chinese character patterns preprocessed using the two-dimensional prediction algorithm shows the best results and appears almost independent of the subblock resolutions of m*n. Therefore, a possible bound of data compression for Chinese character patterns can be predicted. The data compression technique involving two-dimensional prediction preprocessing as well as arithmetic coding for subblock symbols is found to be capable of achieving the best compression results for the 13051 Chinese character patterns with various fonts in different resolutions. >