Browsing by Author "HSIEH, CC"

Now showing 1 - 5 of 5

A NEW SWITCH-CURRENT INTEGRATION READOUT STRUCTURE FOR INFRARED FOCAL PLANE ARRAY
(1994)
HSIEH, CC
;
WU, CY
;
JIH, FW
;
SUN, TP
;
YANG, SJ
A PROBABILISTIC STROKE-BASED VITERBI ALGORITHM FOR HANDWRITTEN CHINESE CHARACTERS RECOGNITION
(1992)
HSIEH, CC
;
LEE, HJ
;
資訊工程學系
;
Department of Computer Science
MODULO-2-SUM DECOMPOSITION OF BINARY SEQUENCES OF FINITE PERIODS
(1975-01-01)
HWANG, JC
;
SHENG, CL
;
HSIEH, CC
;
電信工程研究所
;
Institute of Communications Engineering
NEW DESIGN TECHNIQUES FOR A COMPLEMENTARY METAL-OXIDE-SEMICONDUCTOR CURRENT READOUT INTEGRATED-CIRCUIT FOR INFRARED DETECTOR ARRAYS
(1995-01-01)
WU, CY
;
HSIEH, CC
;
電子工程學系及電子研究所
;
Department of Electronics Engineering and Institute of Electronics
A new share-buffered direct-injection (SBDI) current readout circuit with high injection efficiency, low noise, high dynamic range, and good threshold control is proposed. The circuit is superior to the traditional direct-injection (DI) current readout circuit. Using the SBDI readout circuit, the same excellent performance of the buffered direct-injection (BDI) current readout can be achieved, but only half the chip area and power consumption are required. Thus the SBDI is more suitable for infrared (IR) readout applications, especially for 2-D focal plane arrays under strict power and area limitations. A dynamic discharge source follower (DDSF) output stage is also proposed and analyzed. It can improve the speed performance of the conventional source-follower output buffer and requires very little power dissipation. Both simulation and experimental results have verified the functions and the advantageous features of the proposed readout structure.
OFF-LINE RECOGNITION OF HANDWRITTEN CHINESE CHARACTERS BY ONLINE MODEL-GUIDED MATCHING
(1992-11-01)
HSIEH, CC
;
LEE, HJ
;
資訊工程學系
;
Department of Computer Science
A model-guided structural matching method for recognizing handwritten off-line Chinese characters is presented. According to the stroke writing sequence, each character is described by an on-line model, which is a one-dimensional (1D) string consisting of a stroke sequence interleaved with relationships between two consecutive strokes. After an unknown input is thinned and line approximated, all possible strokes are extracted. A tree is created to represent all possible combinations of the extracted strokes which have the same stroke sequence as the one defined in the model. In the recognition process, we match the strokes with those defined in the on-line model. The matching process is formulated as a tree searching algorithm guided by the relationships in the model. The modelled character is taken to be a candidate if there is a feasible path which satisfies the relationships defined in the on-line model and the number of missing strokes in the input is less than a given threshold. The input is recognized as the character with the greatest number of matched strokes among all candidates. Experimental results on 300 frequently used characters in a database called CCL/HCCR1, which contains 5401 Chinese characters and about 250 variations for each one, show that the recognition rate is over 90%.