• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.13-19
• /
• 2001

The conventional fractal decoding was required a vast amount computational complexity, since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested that each range block was classified to iterated and non-iterated regions. Non-iterated regions is called data dependency region, and if data dependency region extended, IFS regions are contractive. In this paper, a searched region of the domain is limited to the range regions that is similar with the domain blocks, and the domain region is more overlapped. As a result, data dependency region has maximum region, that is IFS regions can be minimum region. The minimizing method of domain region is defined to minimum domain(MD) which is minimum IFS region. Using the minimizing method of domain region, there is not influence PSNR(peak signal-to-noise ratio). And it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.5
• /
• pp.441-446
• /
• 2020

In this paper, we propose the α-Feature Map Scaling (α-FMS) method which extends the FMS method that was designed to enhance the discriminative power of feature maps of deep neural networks in Speaker Verification (SV) systems. The FMS derives a scale vector from a feature map and then adds or multiplies them to the features, or sequentially apply both operations. However, the FMS method not only uses an identical scale vector for both addition and multiplication, but also has a limitation that it can only add a value between zero and one in case of addition. In this study, to overcome these limitations, we propose α-FMS to add a trainable parameter α to the feature map element-wise, and then multiply a scale vector. We compare the performance of the two methods: the one where α is a scalar, and the other where it is a vector. Both α-FMS methods are applied after each residual block of the deep neural network. The proposed system using the α-FMS methods are trained using the RawNet2 and tested using the VoxCeleb1 evaluation set. The result demonstrates an equal error rate of 2.47 % and 2.31 % for the two α-FMS methods respectively.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.21 no.3
• /
• pp.176-188
• /
• 2018

Modern urban problems are increasingly becoming a market mix that can not be solved by the power of a single department and the necessity of establishing a cooperation system based on data communication between departments is increasing. Therefore, this study analyzed Busan metropolitan city's IT projects from 2014 to 2018 in order to understand the utilization and sharing status of departmental data from the viewpoint that cooperation between departments can start from the sharing of data with high common utilization. In addition, based on the results of the FGI(Focus Group Interview) conducted for the officials of the department responsible for the informatization project, we verified the results of data status analysis. At the same time, we figured out the necessity of data link between departments through SNA(Social Network Analysis) and presented data that should be shared first in the future. As a result, most of the information systems currently use limited data only within the department that produced the data. Most of the linked data was concentrated in the information department. Therefore, this study suggested the following solutions. First, in order to prevent overlapping investments caused by the operation of individual departments and share information, it is necessary to build a small platform to tie the departments, which have high connectivity with each other, into small blocks. Second, a local level process is needed to develop data standards as an extension of national standards in order to expand the information to be used in various fields. Third, as another solution, we proposed a system that can integrate various types of information based on address and location information through application of cloud-based GIS platform. The results of this study are expected to contribute to build a cooperation system between departments through expansion of information sharing with cost reduction.