• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• Education of Primary School Mathematics
• /
• v.14 no.1
• /
• pp.69-79
• /
• 2011

The purpose of this study is to analyze 3rd, 4th and 5th graders' probability understanding and raise issues concerning instructional methods and search for the possibility of learning probability. For the purpose, a descriptive study through pencil-and-paper test regarding fairness, sample space, probability of event, probability comparison, independence and conditional probability was conducted. The following conclusions were drawn from the results obtained in this study. First, the 3rd, 4th, and 5th grade students scored the highest in the sample space questions. In descending order of skill, the students scored the highest in sample space following probability of events, fairness and probability comparison. Second, however, the level of independence understanding was low. There was no meaningful differences between grades and the conditional probability was the least understood. The independence is difficult to develop naturally according to cognitive development. The conditional probability recognizing the probability of an event changes in non-replacement situations was very difficult for these students. Third, there were significant differences between the 5th graders and the 3rd and 4th graders in the probability comparison questions. It shows that 5th graders understand the concept of proportion when they compare equal ratio probability of an event. The 3rd graers could do different ratio probability of an event more easily than equal ratio probability of an event after they were instructed on probability comparison.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.598-606
• /
• 2003

In this paper, we analyze the performance of the PCM cell search algorithm proposed for fast cell search of WCDMA systems. In order to improve both performance and complexity of the cell search algorithm standardized for WCDMA systems the PCM scheme uses a group of the polarization codes produced by a Gold code generator. The PCM scheme only uses one synchronization channel since the polarization codes modulated on P-SCH can replace the RS codes of S-SCH. Thus, the PCM reduces the BS's transmission power since only one synchronization channel can be used, and it can also reduce the complexity of receiver as compared with the conventional one. In this paper, by defining a numerical model, we analyze the performance of the PCM cell search algorithm in terms of detection probability and mean acquisition time. Consequently, we could demonstrate that the PCM cell search algorithm is superior to the standard WCDMA cell search algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1030-1037
• /
• 2008

This paper presents an algorithm for the path-finding problem in unknown environments with cooperative and commutative multi-robots. To verify the algorithm, we investigate the problem of escaping through the exit of a randomly generated maze by muti-robots. For the purpose, we adopt the so called frontier cells and cell utility functions, which were used in the exploration problem for the multi-robots. For the wireless communications among the mobile robots, we modify and utilize the so called the random basket routing, a kind of hop-by-hop opportunistic routing. A mobile robot, once it finds the exit, will choose its next action, either escape immediately or stay-and-relay the exit information for the others, where the robot takes one action based on a given probability. We investigate the optimal probability that minimizes the average escaping time (out of the maze to the exit) of a mobile robot.

• Journal of the Korean Applied Science and Technology
• /
• v.40 no.1
• /
• pp.24-34
• /
• 2023

This study sought to explore the online consumption propensity of sports goods by generation of the productive population and to provide basic data to predict the future consumption market by segmenting online consumers in the sports 4.0 market. Therefore, this survey was conducted on those who consumed sports goods among the generation-specific groups (Generation Y and above, Z) of the productive population, and a total of 478 people's data were applied to the final analysis. Data processing was conducted with SPSS statistics (ver.21.0), frequency analysis, exploratory factor analysis, correlation analysis of re-examination reliability, reliability analysis, and decision tree analysis. According to the online consumption propensity of sports goods by generation of the productive population, there is a high probability of being classified as Generation Z group if the factors of leisure, joy, and environment are high. In addition, the classification accuracy of such a model was 69.7%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.157-163
• /
• 2017

The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.483-490
• /
• 1997

The evalution of the cumulative distridution function of the noncentral $X^2$ distribution required in approxi-mate determination of the $X^2$ test. Many approximations to the cumulative distribution function of the noncentral $X^2$ distribution have been suggested. However, in selecting an approximations both simplicity and accuracy should be considered. In this note we compared various approximations in terms of accuracy and efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.527-534
• /
• 2002

In this paper, efficiency in the acquisition of the PN code of the DS/CDMA system was analyzed by using the Nakagami-m probability density function that can model diverse fading channels. The system considers the fading environment that inevitably exists in the mobile communications channel environment. To analyze the efficiency of the system, the equations related to detection probability PD and false alarm probability PFA required for the acquisition of the PN code were induced by using the Nakagami-m probability density function. They were verified through simulation. For the DS/CDMA system an adaptive serial search technique was applied to acquire the PN code. To correct phase error, the equations related to detection probability PD and false alarm probability PFA that influence the time to acquire codes were induced after adding the PLL to each branch of the Rake Receiver. By using an induced equation, detection probability PD and false alarm probability PFA were verified through simulation.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.953-964
• /
• 2003

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the cross pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the cross pattern, and then lastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed cross pattern and flat-hexagonal pattern search algorithm(CFHPS ) improves about 0.2-6.2% in terms of average number of search point per motion vector estimation and improves about 0.02-0.31dB in terms of PSNR(Peak Signal to Noise Ratio).

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3272-3279
• /
• 2000

In this paper, we propose two fast VQ coclebook search algorithms efficient to the Wavelet/ VQ coding schemes. It is well known that the probability having large values in wavelet coefficient blocks is very low. In order to apply this property to codebook search, the index tables of the reordered codebook in each wavelet subband ae used. The exil condition in PDE can be satisfied in an earlystage by comparing the large coefficients of the codeword with their corresponding elements of input vector using the index tbles. As a result, search time can be reduced.