• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.717-725
• /
• 2000

Within the last several years, there has been a large number of algorithms developed for face recognition. The majority of these algorithms have been view- and projection-based algorithms. Our definition of projection is not restricted to projecting the image onto an orthogonal basis the definition is expansive and includes a general class of linear transformation of the image pixel values. The class includes correlation, principal component analysis, clustering, gray scale projection, and matching pursuit filters. In this paper, we perform a detailed analysis of this class of algorithms by evaluating them on the FERET database of facial images. In our experiments, a projection-based algorithms consists of three steps. The first step is done off-line and determines the new basis for the images. The bases is either set by the algorithm designer or is learned from a training set. The last two steps are on-line and perform the recognition. The second step projects an image onto the new basis and the third step recognizes a face in an with a nearest neighbor classifier. The classification is performed in the projection space. Most evaluation methods report algorithm performance on a single gallery. This does not fully capture algorithm performance. In our study, we construct set of independent galleries. This allows us to see how individual algorithm performance varies over different galleries. In addition, we report on the relative performance of the algorithms over the different galleries.

• Korean Journal of Cognitive Science
• /
• v.25 no.2
• /
• pp.91-107
• /
• 2014

The syllable frequency effect is defined as the inhibitory effect that words starting with high frequency syllable generate a longer lexical decision latency and a larger error rate than words starting with low frequency syllable do. Researchers agree that the reason of the inhibitory effect is the interference from syllable neighbors sharing a target's first syllable at the lexical level and the degree of the interference effect correlates with the number of syllable neighbors or stronger syllable neighbors which have a higher word frequency. However, although the syllable frequency can be classified as the syllable type and token frequency, previous studies in visual word recognition have used the syllable frequency without the classification. Recently Conrad, Carreiras, & Jacobs (2008) demonstrated that the syllable type frequency might reflect a sub-lexical processing level including matching from letters to syllables and the syllable token frequency might reflect competitions between a target and higher frequency words of syllable neighbors in the whole word lexical processing level. Therefore, the present study investigated their proposals using word naming tasks. Generally word naming tasks are more sensitive to sub-lexical processing. Thus, the present study expected a facilitative effect of high syllable type frequency and a null effect of high syllable token frequency. In Experiment 1, words starting with high syllable type frequency generated a faster naming latency than words starting with low syllable type frequency with holding syllable token frequency of them. In Experiment 2, high syllable token frequency also created a shorter naming time than low syllable token frequency with holding their syllable type frequency. For that reason, we rejected the propose of Conrad et al. and suggested that both type and token syllable frequency could relate to the sub-lexical processing.

• Journal of the Korean Society of Radiology
• /
• v.14 no.2
• /
• pp.121-127
• /
• 2020

The era of the Fourth Industrial Revolution is increasingly demanding mathematical competencies for virtual reality (VR), artificial intelligence (AI) and the like. In this context, this study intended to identify the basic mathematical competency levels of university freshman students in radiology department and to provide basic data thereon. For this, the diagnostic assessment of basic learning competencies for the domain of mathematics was conducted from June 17, 2019 to June 28, 2019 among 78 freshman students of radiology department at S university and D university. As a result, the university students' overall basic mathematical competency levels were diagnosed to be excellent. However, their levels in the sectors of the geometry and vector and the probability and statistics were diagnosed to be moderate, with the mean scores of 2.61 points and 2.64 points, respectively, which were found to be lower than those of the other sections. As for basic mathematical competency levels according to genders, the levels of male students and female students were diagnosed to be excellent, with the mean scores of 17.48 points and 16.29 points, respectively, showing no statistically significant difference (p>0.05). Given the small number of subjects and regional restriction, there might be some limitations in the generalization of the findings of the present study to all university freshman students and all departments. The above results suggest that it is necessary to implement various programs such as student level-based special lectures for enhancing basic mathematical competencies relating to major in order to improve the basic mathematical competencies of freshman students in radiology department, and that it is necessary to increase the students' mathematical competencies by offering major math courses in the curriculum and applying teaching-learning methods matching students' levels.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.29-37
• /
• 2006

Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.5
• /
• pp.345-353
• /
• 2003

When designing network processors or implementing network equipments such as routers are implemented, IP lookup operations cause the major impact on their performance. As the organization of the IP address becomes simpler, the speed of the IP lookup operations can go faster. However, since the efficient management of IP address is inevitable due to the increasing number of network users, the address organization should become more complex. Therefore, for both IPv4(IP version 4) and IPv6(IP version 6), it is the essential fact that IP lookup operations are difficult and tedious. Lots of researcher for improving the performance of IP lookups have been presented, but the good solution has not been came out. Software approach alleviates the memory usage, but at the same time it si slow in terms of searching speed when performing an IP lookup. Hardware approach, on the other hand, is fast, however, it has disadvantages of producing hardware overheads and high memory usage. In this paper, conventional researches on IP lookups are shown and their advantages and disadvantages are explained. In addition, by mixing two representative structures, a new hybrid parallel architecture for fast IP lookups is proposed. The performance evaluation result shows that the proposed architecture provides better performance and lesser memory usage.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.689-698
• /
• 2006

Pattern recognition is the study of how machines can observe the environment, learn to distinguish patterns of interest from their background, and make sound and reasonable decisions about the categories of the patterns. Color image consists of various color patterns. And most pattern recognition methods use the information of color which has been trained and extract the feature of the color. This thesis extracts adaptively specific color feature from images with several limited colors. Because the number of the color patterns is limited, the distribution of the color in the image is similar. But, when there are some noises and distortions in the image, its distribution can be various. Therefore we cannot extract specific color regions in the standard image that is well expressed in special color patterns to extract, and special color regions of the image to test. We suggest new method to reduce the error of recognition by extracting the specific color feature adaptively for images with the low distortion, and six test images with some degree of noises and distortion. We consequently found that proposed method shouws more accurate results than those of statistical pattern recognition.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.10
• /
• pp.61-67
• /
• 2016

With the current high distribution rate of smart devices and the recent development of computing technology, user interest in multimedia, such as photos, videos, and so on, has rapidly increased, which is a departure from the simple pattern of information retrieval. Because of these increasing interests, image processing techniques, which generate and process images for diverse applications, are being developed. In entertainment recently, there are some techniques that present a celebrity's image as a mosaic comprising many small images. In addition, studies into the mosaic technique are actively conducted. However, conventional mosaic techniques result in a long processing time as the number of database images increases, because they compare the images in the databases sequentially. Therefore, to increase search efficiency, this paper proposes an algorithm to generate a mosaic image using a discrete cosine transform (DCT) hash. The proposed photo mosaic-generation algorithm is composed of database creation and mosaic image generation. In database creation, it first segments images into blocks with a predefined size. And then, it computes and stores a DCT hash set for each segmented block. In mosaic generation, it efficiently searches for the most similar blocks in the database via DCT hash for every block of the input image, and then it generates the final mosaic. With diverse experimental results, the proposed photo mosaic-creation algorithm can effectively generate a mosaic, regardless of the various types of images and sizes.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.107-116
• /
• 2005

The information on travel time in providing the information of traffic to drivers is one of the most important data to control a traffic congestion efficiently. Especially, this information is the major element of route choice of drivers, and based on the premise that it has the high degree of confidence in real situation. This study developed a vehicle arrival time prediction algorithm called as "VAT-DV" for 6 corridors in total 6.1Km of "Nam-san area trffic information system" in order to give an information of congestion to drivers using VMS, ARS, and WEB. The spatial scope of this study is 2.5km~3km sections of each corridor, but there are various situations of traffic flow in a short period because they have signalized intersections in a departure point and an arrival point of each corridor, so they have almost characteristics of interrupted and uninterrupted traffic flow. The algorithm uses the information on a demand volume and a queue length. The demand volume is estimated from density of each points based on the Greenburg model, and the queue length is from the density and speed of each point. In order to settle the variation of the unit time, the result of this algorithm is strategically regulated by importing the AVI(Automatic Vehicle Identification), one of the number plate matching methods. In this study, the AVI travel time information is composed by Hybrid Model in order to use it as the basic parameter to make one travel time in a day using ILD to classify the characteristics of the traffic flow along the queue length. According to the result of this study, in congestion situation, this algorithm has about more than 84% degree of accuracy. Specially, the result of providing the information of "Nam-san area traffic information system" shows that 72.6% of drivers are available.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.10
• /
• pp.1916-1923
• /
• 2007

We have studied to obtain the SAW filter for the passband was formed on the Langasite substrate and was evaporated by Aluminum-Copper alloy and thin we performed computer-simulated by simulator. We cm fabricate that the block weighted type IDT as an input transducer of the filter and the withdrawal weighted type IDT as an output transducer of the filter from the results of our computer-simulation. Also, we have performed to obtain the properly design conditions about phase shift of the SAW filter for WCDMA. We have employed that the number of pairs of the input and output IDT are 50 pairs and the thickness and the width of reflector are $5000\;{\AA}$ and $3.6{\mu}m$ respectively. And we have employed that the distances from the hot electrode to the reflector are $2.0{\mu}m$, $2.4{\mu}m$ and the distance from the hot electrode to the ground is $1.5{\mu}m$ respectively. Frequency response of the fabricated SAW filter has the property that the center frequency is about 190MHz and bandwidth at the 3dB is probably 7,8MHz. And we could obtain that return loss is less then -18dB, ripple characteristics is probably 3dB and triple transit echo is less then -25dB after when we have matched impedance.

• Korean Journal of Remote Sensing
• /
• v.37 no.5_1
• /
• pp.847-859
• /
• 2021

Recently, as the number of high-resolution satellite SAR images increases, the demand for precise matching of SAR imagesin change detection and image fusion is consistently increasing. RMSE (Root Mean Square Error) values using GCPs (Ground Control Points) selected by analysts have been widely used for quantitative evaluation of image registration results, while it is difficult to find an approach for automatically measuring the registration accuracy. In this study, a feasibility analysis was conducted on using the FSIM (Feature Similarity) index as a measure to evaluate the registration accuracy. TerraSAR-X (TSX) staring spotlight data collected from various incidence angles and orbit directions were used for the analysis. FSIM was almost independent on the spatial resolution of the SAR image. Using a single SAR image, the FSIM with respect to registration errors was analyzed, then use it to compare with the value estimated from TSX data with different imaging geometry. FSIM index slightly decreased due to the differencesin imaging geometry such as different look angles, different orbit tracks. As the result of analyzing the FSIM value by land cover type, the change in the FSIM index according to the co-registration error was most evident in the urban area. Therefore, the FSIM index calculated in the urban was mostsuitable for determining the accuracy of image registration. It islikely that the FSIM index has sufficient potential to be used as an index for the co-registration accuracy of SAR image.