http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Higuchi, Tatsuo,Kawamata, Masayuki,Yoshie, Tomotaka 대한전자공학회 1994 ISPACS:Intelligent Signal Processing and Communica Vol.1 No.1
This paper proposes parallel separable (PS) two-dimensional (2-D) adaptive filters. Their adaptation algorithms are formulated and their computational complexities are estimated. They are applied to 2-D identification for comparison of the proposed adaptive filter and a conventional 2-D adaptive filter. A PS 2-D recursive adaptive filter and a 1PS 2-D non-recursive adaptive filter are realized in the form of the 2-D adaptive line enhancer, and they are applied for restoration of noisy images.
Optimal Design of Multi-Dimensional Recursive Digital Filters Using a Simple Genetic Algorithm
Higuchi, Tatsuo,Kawamata, Masayuki,Imakubo, Jun 대한전자공학회 1994 ISPACS:Intelligent Signal Processing and Communica Vol.1 No.1
This paper proposes an optimal design method of multi-dimensional recursive digital filters (MDDFs) based on a simple genetic algorithm (SGA) for frequency-domain specifications. Design problem is formulated both in general class and in separable-denominator (SD) class. Parameters of the transfer function of a M-DDF are encoded to hit strings in order to apply a SGA to the design. The proposed method has flexibility for change of specifications of M-DDFs and for error functions used in optimization. The solution obtained by the proposed method can be also a good initial point for traditional optimization methods, for example, the DFP method. The effectiveness of the proposed method is demonstrated by design examples.
Higuchi, Tatsuo,Kawamata, Masayuki,Nagahisa, Masaki 대한전자공학회 1994 ISPACS:Intelligent Signal Processing and Communica Vol.1 No.1
Iterated Transformation Theory-Based Coding (ITTBC) suffers from very high computational complexity in encoding phase. This is due to its exhaustive search. This paper proposes Multi-resolution Tree Search ITTBC (MTS-ITTBC) to reduce the encoding complexity. MTS-ITTBC searches ITT-code using a multi-resolution search-tree. The computational load of MTS-ITTBC is O(NlogN), while that of full search ITTBC is O(N²), where N is the number of range blocks or domain blocks in an image. Numerical examples show that the encoding time of MTS-ITTBC can be reduced to 12% of that of the full search ITTBC, while the loss in quality relative to the full search ITTBC is about 0.5 dB in PSNR, which is visually negligible.
Higuchi, Tatsuo,Kawamata, Masayuki,Abe, Masahide 대한전자공학회 1994 ISPACS:Intelligent Signal Processing and Communica Vol.1 No.1
This paper proposes evolutionary digital filters as a new concept for adaptive digital filters. Evolutionary digital filters are adaptive filters which are controlled by adaptive algorithm based on the evolutionary strategies of organisms. An evolutionary digital filter consists of many linear but time-variant inner digital filters which correspond to organisms. The output of the evolutionary digital filter is the output of an inner filter of which fitness is maximum at every iteration. The adaptive algorithm controls and changes the coefficients of inner filters using asexual reproduction method or sexual reproduction method. The adaptive algorithm is inherently parallel because of the natural independence of evolutionary operations. An example for interference canceling shows the effectiveness of evolutionary digital filters.