• Journal of Korea Multimedia Society
• /
• v.12 no.7
• /
• pp.922-928
• /
• 2009

In H.264 as the newest video standard, 9 modes are used in order to predict the signal values of a block composed with several pixels by intra prediction. From these process, H.264 can bring high compression ratio in the encoded signal but the use of total 9 modes can give the inefficiency of the increase of the complexity induced by the amount of operation processing or the number of searching which is applied to compare adjacent pixels. This paper proposes a simplification method of prediction mode for the intra-picture coding by considering subjective interest region. There are certain region being interested within a picture of the video sequence. This region requires better subjective picture quality than the other regions. The proposed method increases the simplification of prediction mode by providing just essential modes of total 9 modes for less interest regions compared with the interest region. It is possible to get the additional 11%$\sim$15% simplification of the prediction mode by the proposed method, compared with the conventional method which simplifies the prediction mode for all of the picture by using the prediction characteristics only.

• Korean Journal of Optics and Photonics
• /
• v.19 no.1
• /
• pp.60-67
• /
• 2008

An all-optical 4-bit Gray code to binary coded decimal (BCD) converter by means of commercially available numerical analysis tool (VPI) was demonstrated, for the first time to our knowledge. Circuit design approach was modified appropriately in order to fit the electrical method on an all-optical logic circuit based on a cross gain modulation (XGM) process so that signal degradation due to the non-ideal optical logic gates can be minimized. Without regenerations, Q-factor of around 4 was obtained for the most severely degraded output bit (least significant bit-LSB) with 2.5 Gbps clean input signals having 20 dB extinction ratio. While modifying the two-level simplification method and Karnaugh map method to design a Gray code to BCD converter, a general design concept was also founded (one-level simplification) in this research, not only for the Gray code to BCD converter but also for any general applications.

• Phonetics and Speech Sciences
• /
• v.2 no.4
• /
• pp.83-92
• /
• 2010

The present study examined how listeners of Seoul Korean would recover deleted phonemes in consonant cluster simplification. In a phoneme monitoring experiment, listeners had to monitor for C2 (/k/ or /p/) in C1C2C3 when C2 was deleted (C1 was preserved) or preserved (C1 was deleted). The target consonant (C2) was either /k/ or /p/ (e.g., i$\b{lk}$-t${\partial}$lato vs. pa$\b{lp}$-t${\partial}$lato), and there were two listener groups, one group tested in 2002 and the other in 2009. Some points have emerged from the results. First, listeners were able to detect deleted phonemes as accurately and rapidly as preserved phonemes, showing that the physical presence of the acoustic information did not improve the listeners' performance. This suggests that listeners must have relied on language-specific phonological knowledge about the consonant cluster simplification, rather than relying on the low-level acoustic-phonetic information. Second, listener groups (participants in 2002 vs. 2009), differed in processing /p/ versus /k/: listeners in 2009 failed to detect /p/ more frequently than those in 2002, suggesting that the way the consonant cluster sequence is produced and perceived has changed over time. This result was interpreted as coming from statistical patterns of speech production in contemporary Seoul Korean as reported in a recent study by Cho & Kim (2009): /p/ is deleted far more often than /p/ is preserved, which is likely reflected in the way listeners process simplified variants. Finally, listeners processed /k/ more efficiently than /p/, especially when the target was physically present (in C-preserved condition), indicating that listeners benefited more from the presence of /k/ than of /p/. This was interpreted as supporting the view that velars are perceptually more robust than labials, which constrains shaping phonological patterns of the language. These results were then discussed in terms of their implications for theories of spoken word recognition.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.2
• /
• pp.199-208
• /
• 2001

The digital map in Korea has been producted and utilized independently according to scales such as 1:1,000, 1:5,000, and 1:25,000. Therefore, whenever we need to obtain the spatial data of other scales, we have to product the digital maps over and over again which it is time-consuming and ineconomic. To solve these problems, it has been accomplished many researches on map generalization to make digital maps in small scale from the master data of large scale. This paper aims to analyze the conversion characteristics of the large scale to the small scale by simplification of map generalization. For this purpose, it is proposed the algorithm for the simplification process of digital map and it is investigated the simplification characteristic of digital map through the experiment on the conversion of 1:5,000 scale into 1:25.000 scale. The results show that Area-Preservation algorithm indicates the good agreement with the original data in terms of the area and features of building layer compared to Douglas-Peucker algorithm and Reumann-Witkam algorithm.

• The KIPS Transactions:PartD
• /
• v.17D no.6
• /
• pp.405-414
• /
• 2010

A rule is defined as a case to determine the target values according to combination of various Business factors. The information system is used to represent enterprise's business, which includes and implements the amount of these rules to Rule-Based System. A Rule-Based System can be constructed by using the rules engine method or Relational Database technology. Because the rules engine method has some disadvantages, the Rule-Based System is mostly developed with Relational Database technology. When business scales become larger and more complex, a large number of various rule cases must be operated in system, and processing these rule cases requires additional time, overhead and storage space, and the speed of execution slows down. To solve these problems, we propose a simplification algorithm that converts a large amount of rule cases to simplification rule cases with same effects. The proposed algorithm is applied to hypothetical business rule data and a large number of simplification experiments and tests are conducted. The final results proved that the number of rows can be reduced to some extent. The proposed algorithm can be used to simplify business rule data for improving performance of the Rule-Based System implemented with the Relational Database.

• Journal of Korean Society of Water and Wastewater
• /
• v.21 no.4
• /
• pp.409-420
• /
• 2007

ASM No. 1 is a very useful model to analyze wastewater treatment system removing organic carbon and nitrogen material. But it isn't adequate to control the wastewater treatment system with real time since it has many material divisions and parameters. So, the purpose of this study is the simplification of ASM No. 1 to control the wastewater treatment system. ASM No. 1 was changed with the model which has 3 material divisions(COD, $NH_4{^+}$, $NO_3{^-}$) and two phases(Aerobic and Anoxic condition). SBR was running with two phases(Phase I and II). Phase II running 20 minutes with aerobic time was used for deciding model parameters and Phase I running 12 minutes with aerobic time was used for proving the simplified model. The simplified model was compared with ASM No. 1 using data of Phase I and II. As a result of model comparison, the simplified model has enough ability to express the variation of $NH_4{^+}$ compound.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.147-152
• /
• 2016

One of major issues in machine learning that extracts and acquires knowledge implicit in data is to find an appropriate way of representing it. Knowledge can be represented by a number of structures such as networks, trees, lists, and rules. The differences among these exist not only in their structures but also in effectiveness of the models for their problem solving capability. In this paper, we propose partition utility as a criterion function for clustering that can lead to simplification of the model and thus avoid overfitting problem. In addition, a heuristic is proposed as a way to construct balanced hierarchical models.

• Journal of architectural history
• /
• v.19 no.4
• /
• pp.91-108
• /
• 2010

The objective of this paper is to clarify the architectural characteristics of the Korean-Western eclectic houses at Ojeong-dong Missionary Village in Daejeon city, focused on the spatial and structural changes due to eclecticism. The consequences of the comparative analysis between the eclectic houses and two reference buildings, Myeongjae residence and Moore house, are as follows. The diverse aspects due to eclecticism can be summarized as two concepts; transformation and simplification. The transformation has appeared in the characteristic spatial elements such as an-madang, entrance and corridor, in the territory organization and the connection between building and yard, and in the roof and wall structures. The simplification has appeared in the layering of the building space, and in the joint of roof and wall. The methods of eclecticism and the resultant aspects from them that are clarified through this study are expected to be referred in examining the new possibilities of the hanok.

• Journal of Korea Multimedia Society
• /
• v.18 no.3
• /
• pp.298-311
• /
• 2015

Vector data represents a map by its coordinate and Raster data represents a map by its pixel. Since these data types have very large data size, data compression procedure is a compulsory process. This paper compare the results from three different methodologies; GIS (Geographic Information System) vector map data compression using DP(Douglas-Peucker) Simplification algorithm, vector data compression based on Bin classification and the combination between two previous methods. The results shows that the combination between the two methods have the best performance among the three tested methods. The proposed method can achieve 4-9% compression ratio while the other methods show a lower performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.150-157
• /
• 2004

For the mobile GIS services, it is not acceptable to construct a new map database only for wireless service due to vast cost. But the existing map database cannot be used directly for the services due to narrow wireless bandwidth and shortage of mobile device resources. This thesis proposes spatial data simplification methods, thus, the existing map database enable the mobile GIS services. The proposing methods are based on the existing map generalization techniques. We extend it to mobile environments, and implement. This thesis also includes the issue of discriminative data simplification technique according to display level and map display interface suitable for mobile devices. Research results an estimated by experiments.