• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.596-610
• /
• 2007

In order to reduce the complexity of SVC encoding, we introduce a fast mode decision method in the enhancement layers of spatial scalability by selectively performing the inter-layer residual prediction of SVC. The Inter-layer residual prediction coding in Scalable Video Coding has a large advantage of enhancing the coding efficiency since it utilizes the correlation between two residuals from a lower spatial layer and its next higher spatial layer. However, this entails the dramatical increase in the complexity of SVC encoders. The proposed method is to analyze the characteristics of integer transform coefficients for the subtracted signal for two residuals from lower and upper spatial layers. Then it selectively performs the inter-layer residual prediction coding and rate-distortion optimizations in the upper spatial enhancement layer if the SAD values of residuals exceed adaptive threshold values. Therefore, by classifying the residuals according to the properties of integer-transform coefficients only with SAD of residuals between two layers, the SVC encoder can perform the inter-layer residual coding selectively, thus significantly reducing the total required encoding time. The proposed method results in reduction of the total encoding time with 51.5% in average while maintaining the RD performance with negligible amounts of quality degradation.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.222-235
• /
• 2008

Recently, as growing of high definition media services like HDTV and IPTV, fast moving picture manipulation techniques need to meet what those services require. Especially, a fast reduced-size image extracting method is required in the areas of video indexing and video summary Conventional DC image extracting methods, however, can't be applied to H.264/AVC streams since a spatial domain prediction scheme is adopted in H.264/AVC intra mode. In this paper, we propose a theoretical method for extracting a thumbnail image from an H.264/AVC intra frame in the frequency domain. Furthermore, the proposed scheme can extract the thumbnail very fast since all operations are applied to transform coefficients directly, after a general equation for the thumbnail extraction in nine H.264/AVC intra prediction modes is introduced, an LUT(Look Up Table) for each mode is designed. Through the implementation and performance evaluation, while the subject quality difference between the output of our scheme and a conventional output is negligible, the former can extract the thumbnail faster then the latter by up to 63%.

• Journal of Astronomy and Space Sciences
• /
• v.26 no.2
• /
• pp.229-236
• /
• 2009

KOorea Multi-purpose SATellite(KOMPSAT)-5 will be launched at 550km altitude in 2010. Accurate satellite position(20 cm) and velocity(0.03 cm/s) are required to treat highly precise Synthetic Aperture Radar(SAR) image processing. Ionosphere delay was eliminated using dual frequency GPS data and double differenced GPS measurement removed common clock errors of both GPS satellites and receiver. SAC-C carrier phase data with 0.1 Hz sampling rate was used to achieve precise orbit determination(POD) with ETRI GNSS Precise Orbit Determination(EGPOD) software, which was developed by ETRI. Dynamic model approach was used and satellite's position, velocity, and the coefficients of solar radiation pressure and drag were adjusted once per arc using Batch Least Square Estimator(BLSE) filter. Empirical accelerations for sinusoidal radial, along-track, and cross track terms were also estimated once per revolution for unmodeled dynamics. Additionally piece-wise constant acceleration for cross-track direction was estimated once per arc. The performance of POD was validated by comparing with JPL's Precise Orbit Ephemeris(POE).

• Applied Biological Chemistry
• /
• v.26 no.2
• /
• pp.75-81
• /
• 1983

The performance of the flat-plate solar collector with rock-pile thermal storage medium and the drying characteristics of rough rice and red pepper by use of natural air and of supplementary heated air by the solar drier were studied. The thermal efficiency of the flat-plate solar collector was average 25.4 percent and the overall heattransfer coefficient of the collector was approximately $38.13kJ/hr.m^2^{\circ}C$. The flat-plate collector was able to supply the supplementary heated air which was about $7^{\circ}C$ higher than the ambient air temperature during the daytime and about $3^{\circ}C$ higher than during the night. For rough rice drying of grain moisture content front 24.5 to 14.5%, it took 18 days in the natural air system, 12 days in the tubular solar collector and 10 days in the flat-plate solar collector. For red pepper drying from it's moisture from 81.0 to 15.0%, 68 hrs required under conventional sun drying system, but 38 hrs in tubular solar collector and 36 hrs in the flateplate solar collector. The changes of capsanthin and capsaicine content were investigated at various drying system, and little difference was found among the drying system.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.

• Journal of Intelligence and Information Systems
• /
• v.18 no.1
• /
• pp.91-107
• /
• 2012

As the Internet becomes more popular, many people use it to communicate. With the increasing number of personal homepages, blogs, and social network services, people often expose their personal information online. Although the necessity of those services cannot be denied, we should be concerned about the negative aspects such as personal information leakage. Because it is impossible to review all of the past records posted by all of the people, an automatic personal information detection method is strongly required. This study proposes a method to detect or classify online documents that contain personal information by analyzing features that are common to personal information related documents and learning that information based on the Na$\ddot{i}$ve Bayes algorithm. To select the document classification algorithm, the Na$\ddot{i}$ve Bayes classification algorithm was compared with the Vector Space classification algorithm. The result showed that Na$\ddot{i}$ve Bayes reveals more excellent precision, recall, F-measure, and accuracy than Vector Space does. However, the measurement level of the Na$\ddot{i}$ve Bayes classification algorithm is still insufficient to apply to the real world. Lewis, a learning algorithm researcher, states that it is important to improve the quality of category features while applying learning algorithms to some specific domain. He proposes a way to incrementally add features that are dependent on related documents and in a step-wise manner. In another experiment, the algorithm learns the additional dependent features thereby reducing the noise of the features. As a result, the latter experiment shows better performance in terms of measurement than the former experiment does.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.527-533
• /
• 2018

Recently, the device-to-device (D2D) communication has been conceived as the key technology for the next-generation mobile communication systems. The neighbor discovery in which the nearby users are found, is essential for the proper operation of the D2D communication. In this paper, we propose new neighbor discovery scheme based on deep learning technology which has gained a lot of attention recently. In the proposed scheme, the neighboring users can be found using the uplink pilot transmission of users only, unlike conventional neighbor discovery schemes in which direct pilot communication among users is required, such that the signaling overhead can be greatly reduced in our proposed scheme. Moreover, the neighbors with different proximity can also be classified accordingly which enables more accurate neighbor discovery compared to the conventional schemes. The performance of our proposed scheme is verified through the tensorflow-based computer simulations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.5
• /
• pp.680-687
• /
• 2016

Although advanced weapon system weapons with high-performance and various functions have been developed, weapon defects can be fatal in the weapons industry. Therefore, the army requires quality improvement to reduce the number of defects which occur during both the development and operation of the weapon system. Recently, many manufacturers, including weapons manufacturers, have conducted analyses using defect related big-data in order to improve the quality. However, there have been few data analyses, because it is difficult to obtain the data required for the analysis of the development phase. Therefore, this study summarizes the pattern of the weapon system, military organization, and defect types using the actual data of the Post-Logistics Support (PLS) phase. The PLS data, which is referred to as the data collected after force integration, includes information on requests for maintenance. Through this information, this study selects key variables and analyzes the selected variables. The analysis results show the critical factors to be considered during the development phase. Finally, this study proposes a framework for advanced PLS systems using the PLS data. The proposed framework enables the development time of weapon systems to be further shortened and their quality to be improved.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1451-1458
• /
• 2013

This paper deals with the programs and algorithms that generate the full data set that satisfy the basic combinatorial requirement of combination, permutation, partial permutation or shortly r-permutation, which are used in the application of the total data testing or the simulation input. We search the programs able to meet the rules which is permutations and combinations, r-permutations, select the fastest program by field. With further study, we developed a new program reducing the time required to processing. Our research performs the following pre-study. Firstly, hundreds of algorithms and programs in the internet are collected and corrected to be executable. Secondly, we measure running time for all completed programs and select a few fast ones. Thirdly, the fast programs are analyzed in depth and its pseudo-code programs are provided. We succeeded in developing two programs that run faster. Firstly, the combination program can save the running time by removing recursive function and the r-permutation program become faster by combining the best combination program and the best permutation program. According to our performance test, the former and later program enhance the running speed by 22% to 34% and 62% to 226% respectively compared with the fastest collected program. The programs suggested in this study could apply to a particular cases easily based on Pseudo-code., Predicts the execution time spent on data processing, determine the validity of the processing, and also generates total data with minimum access programming.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.428-436
• /
• 2002

Providing a mobile host with its required QoS is highly influenced by its mobility. The resource ReSerVation Protocol(RSVP) establishes and maintains a reservation state to ensure a given QoS level along the path from the sender to the receiver. However, RSVP is designed for use in fixed networks and thus it is inadequate in the mobile networking environment where a host changes its point of attachment. In this paper, we propose a new resource reservation protocol, RSVP-RA(RSVP by RSVP Agent) for mobile hosts. Our protocol assumes IETF Mobile IP as a mobility support mechanism. The proposed protocol introduce a new protocol entity - RSVP agent - to manage reservations in a mobile host's current visiting network. RSVP Agent is located in a local network and makes resource reservations in neighboring cells that the mobile host is expected to visit in the future. Thus, the proposed Protocol can provide a seamless QoS to the mobile host and significantly improve the scalability problem of RSVP by reducing the end-to-end signalling messages acrossing the backbone networks. The proposed protocols reduce packet delay, bandwidth overhead and the number of RSVP messages to maintain reservation states. We compared the performance of our proposed protocol with other proposed protocols in terms of signalling overhead, packet delay by simulation.