• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.288-294
• /
• 2011

In this paper we define the probability models for determining the disparity map given stereo images and derive the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. The proposed method alternates between estimating the parameters with the intermediate disparity map and estimating the disparity map with the estimated parameters, after computing it with random initial parameters. Our algorithm is applied to the stereo matching algorithms based on the dynamic programming and belief propagation to verify its operation and measure its performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1384-1396
• /
• 1998

This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2000

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.11
• /
• pp.989-996
• /
• 2016

This paper intends to develop the rotor track and balance (RTB) algorithm using the nonlinear RTB models and a real-coded hybrid genetic algorithm. The RTB response data computed using the trim solutions with variation of the adjustment parameters have been used to build nonlinear RTB models based on the quadratic interpolation functions. Nonlinear programming problems to minimize the track deviations and the airframe vibration responses have been formulated to find optimum settings of balance weights, trim-tab deflections, and pitch-link lengths of each blade. The results are efficiently resolved using the real-coded genetic algorithm hybridized with the particle swarm optimization techniques for convergence acceleration. The nonlinear RTB models and the optimized RTB parameters have been compared with those computed using the linear models to validate the proposed techniques. The results showed that the nonlinear models lead to more accurate models and reduced RTB responses than the linear counterpart.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.149-155
• /
• 2013

Commonly, one seeks a particular pattern suitable for stock cutting and the number of such patterns through linear programming. However, since the number of the patterns increases exponentially, it is nearly impossible to predetermine all the existing patterns beforehand. This paper thus proposes an algorithm whereby one could accurately predetermine the number of existing patterns by applying Suliman's feasible pattern method. Additionally, this paper suggests a methodology by which one may obtain exact polynomial-time solutions for feasible patterns without applying linear programming or approximate algorithm. The suggested methodology categorizes the feasible patterns by whether the frequency of first occurrence of all the demands is distributed in 0 loss or in various losses. When applied to 2 data sets, the proposes algorithm is found to be successful in obtaining the optimal solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1387-1395
• /
• 2004

Turbo decoder inherently requires large memory and intensive hardware complexity due to iterative decoding, despite of excellent decoding efficiency. To decrease the memory space and reduce hardware complexity, various design issues have to be discussed. In this paper, various design issues on Turbo decoder are investigated and the tradeoffs between the hardware complexity and the performance are analyzed. Through the various simulations on the fixed-length analysis, we decided 5-bits for the received data, 6-bits for a priori information, and 7-bits for the quantization state metric, so the performance gets close to that of infinite precision. The MAX operation which is the main function of Log-MAP decoding algorithm is analyzed and the error correction term for MAX* operation can be efficiently implemented with very small hardware overhead. The size of the sliding window was decided as 32 to reduce the state metric memory space and to achieve an acceptable BER.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.9
• /
• pp.701-706
• /
• 2018

The characteristic basis function method, or CFBM, is one of the representative electromagnetic methods widely used today. In this paper, we propose an accelerating algorithm for the far field interaction calculation of CBFM, to efficiently analyze the electromagnetic characteristics of arbitrarily large structures. To effectively analyze the electromagnetic characteristics of a large structure, it is essential to shorten the computation time. In the CBFM analysis method, the complexity can be greatly reduced by using approximations created via the multipole expansion method. The new algorithm proposed in this paper is applied to the computation of radar cross sections of conductor spheres and fighter aircraft, and it is confirmed that calculation time is reduced by 34 % and 74 %, respectively, without loss of accuracy compared with existing CBFM.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.846-860
• /
• 2011

The binaural auditory system of human has ability to differentiate the direction and the distance of the sound sources by using the information which are inter-aural intensity difference(IID), inter-aural time difference(ITD) and/or the spectral shape difference(SSD). These information is generated from the acoustical transfer of a sound source to pinna, the outer ears. We can create a virtual sound system using the information which is called Head related transfer function(HRTF). However the performance of 3D sound is not always satisfactory because of non-individual characteristics of the HRTF. In this paper, we propose the algorithm that uses human's auditory characteristics for accurate perception. To achieve this, excitation energy of HRTF, global masking threshold and loudness are applied to the proposed algorithm. Informal listening test shows that the proposed method improves the sound localization characteristics much better than conventional methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.196-202
• /
• 2013

Basal cell carcinoma (BCC) is the most common skin cancer and its incidence is increasing rapidly. In this paper, we propose a diagnosis method of basal cell carcinoma by Raman spectra of skin tissue using the NMF(non-negative matrix factorization) algorithm. After preprocessing steps, measured Raman spectra is used classification experiments. The weight and the basis can be obtained in a simple matrix operation and a column vector of the matrix decompsed by the NMF. Linear combination of bases and weights, it is possible to approximate the average of Raman spectra. The classification method is to select the class which to minimize the root mean square of the difference of the linear combination and the objective spectrum. According to the experimental results, the proposed method shows the promising results to diagnosis BCC. In addition, it confirmed that the proposed method compared with the previous research result could be effectively applied in the analysis of the Raman spectra.