• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.2
• /
• pp.71-75
• /
• 2013

Recently proliferating heterogeneous multimedia service environments should be able to deal with many different transmission speeds, image sizes, or qualities of video. However, not many existing video compression standards satisfy those necessities. To satisfy the functional requirements, the standardization of the H.264/AVC Scalable Extension (SE) technique has been recently completed. It is an extension of the H.264/AVC which can encode several image sizes and qualities at the same time as a single bitstream. To perform optimum mode decision, motion estimation is performed for all MB modes, and the RD costs are compared to identify an MB mode with the smallest RD cost. This increases computational complexity of H.264/AVC SE encoding. In this paper, we propose an early skip mode detection scheme to reduce candidate modes and suggest an algorithm of fast mode decision utilizing reference modes according to the mode history.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.20-29
• /
• 2013

The compression of video data is intended for real-time transmission of band-limited channels. Compressed video bit-streams are very sensitive to transmission error. If we lose packets or receive them with errors during transmission, not only the current frame will be corrupted, but also the error will propagate to succeeding frames due to the spatio-temporal predictive coding structure of sequences. Error detection and concealment is a good approach to reduce the bad influence on the reconstructed visual quality. To increase concealment efficiency, we need to get some more accurate error detection algorithm. In this paper, We hide specific data into the motion vector difference of each macro-block, which is obtained from the procedure of inter prediction mode in H.264/AVC. Then, the location of errors can be detected easily by checking transmitted specific data in decoder. We verified that the proposed algorithm generates good performances in PSNR and subjective visual quality through the computer simulation by H.324M mobile simulation tool.

• International Journal of Contents
• /
• v.14 no.3
• /
• pp.7-16
• /
• 2018

The extent and depth of the event plan determines the scope of pedagogical experience in situations and consequently the quality of immersive learning based on our simulated world. In contrast to planning in conventional narrative-based systems mainly pursuing dramatic interests, planning in virtual world-based pedagogical systems strive to provide realistic experiences in immersed situations. Instead of story plot comprising predetermined situations, our inter-event planning method aims at simulating diverse situations that each involve multiple events coupled via their associated agents' conditions and meaningful associations between events occurring in a background world. The specific techniques to realize our planning method include, two-phase planning based on inter-event search and intra-event decomposition (down to the animated action level); autonomous and independent agents to behave proactively with their own belief and planning capability; full-blown background world to be used as the comprehensive stage for all events to occur in; coupling events via realistic association types including deontic associations as well as conventional causality; separation of agents from event roles; temporal scheduling; and parallel and concurrent event progression mechanism. Combining all these techniques, diverse exogenous events can be derived and seamlessly (i.e., semantically meaningfully) integrated with the original event to form a wide scope of situations providing chances of abundant pedagogical experiences. For effective implementation of plan execution, we devise an execution scheme based on multiple priority queues, particularly to realize concurrent progression of many simultaneous events to simulate its corresponding reality. Specific execution mechanisms include modeling an action in terms of its component motions, adjustability of priority for agent across different events, and concurrent and parallel execution method for multiple actions and its expansion for multiple events.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.47-56
• /
• 2002

In the distributed multimedia document system, media objects distributed over a computer network are retrieved from their sources and presented to users according to specified temporal relations. For effective presentation, synchronization has to be supported. Furthermore, since the presentation in the distributed environment is influenced by the network bandwidth and delay, they should be considered for synchronization. This paper proposes a distributed multimedia presentation system that performs presentation effectively in the distributed environment. And it also suggests a method to supports synchronization, in which, network situation and resources are monitored when media objects are transferred from servers to a client. Then a feedback message for the change of them is sent to the server so that the server might adjust the data sending rate to control synchronization. To monitor the situation of network, we use two methods together. One is to manage the level of the buffer by setting thresholds on a buffer and the other is to check the difference between the sending time of a packet from the server and the arrival time of the packet to the client.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.639-648
• /
• 2005

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-worts but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.47-57
• /
• 2014

In order to publicly notify the information security (Internet or Cyber) threat level, the security companies have developed the Threat Meters. As the physical security devices are getting more intelligent and can be monitored and managed through networks, we propose a physical security threat meter (PSTM) to determine the current threat level of physical security; that is a very similar compared with the one of information security. For this purpose, we investigate and prioritize the physical security events, and consider the impact of temporal correlation among multiple security events. We also present how to determine the threshold values of threat levels, and then propose a practical PSTM using the threshold based decision. In particular, we show that the proposed scheme is fully implementable through showing the block diagram in detail and the whole implementation processes with the access controller and CCTV+video analyzer system. Finally the simulation results show that the proposed PSTM works perfectly under some test scenarios.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1675-1685
• /
• 2012

DVC (Distributed Video Coding) technique plays an essential role in providing low-complexity video encoder. But, in order to achieve the better rate-distortion performances, most DVC systems need feedback channel for parity bit control. This causes the DVC-based system to have high decoding latency and becomes as one of the most critical problems to overcome for a real implementation. In order to overcome this problem and to accelerate the commercialization of the DVC applications, this paper analyzes an effect of LDPCA frame size for adaptive LDPCA frame-based parity bit request estimations. First, this paper presents the LDPCA segmentation method in pixel-domain and explains the temporal-based bit request estimation method and the spatial-based bit request estimation method using the statistical characteristics between adjacent LDPCA frames. Through computer simulations, it is shown that the better performance and fast decoding is observed specially when the LDPCA frame size is 3168 in QCIF resolution.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.72-78
• /
• 2003

A new self-organizing neuro-fuzzy network based rate control algorithm for MPEG-4 video encoder is proposed in this paper. Contrary to the traditional methods that construct the rate-distorion (RD) model based on experimental equations, the proposed method effectively exploits the non-stationary property of the video date with neuro-fuzzy network that self-organizes the RD model online and adaptively updates the structure. The method needs not require off-line pre-training; hence it is geared toward real-time coding. The comparative results through the experiments suggest that our proposed rate control scheme encodes the video sequences with less frame skip, providing good temporal quality and higher PSNR, compared to VM18.0.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.86-95
• /
• 1998

Intra-frame video compression, which cannot make use of temporal predictions, requires much higher bit rates compared with inter-frame schemes. In order to reduce bit rates, intra-frame predictive coding methods in DCT domain have been studied especially within the framework of the MPEG-4 video coding standard currently being developed. In this paper, we propose novel intra-frame predictive coding methods in DCT domain with the marginal complexity increase over the conventional methods . The proposed methods consist of a DC coefficient prediction method and two AC coefficient prediction methods. The proposed methods consist of a DC coefficient prediction method and two AC coefficient prediction methods. The proposed DC coefficient prediction method makes it possible to adaptively select the prediction directions without overhead bits, by comparing gradients of DC coefficients from neighboring blocks. As the AC coefficient prediction methods, first, we present an effective method which can improve the prediction directions of the MPEG-4 scheme by considering the DC coefficient of the current block to be coded. And, we present another effective method that decision on the prediction is carried out for each AC coefficient. Simulation results show that substantial bit savings can be achieved by the proposed methods.

• KIISE Transactions on Computing Practices
• /
• v.20 no.10
• /
• pp.534-542
• /
• 2014

Multiscale modeling is a new simulation approach which can manage different spatial and temporal scales of system. In this study, as part of multiscale modeling research, we propose the way of combining two different simulation methods, molecular dynamics(MD) and stochastic rotation dynamics(SRD). Our conceptual implementations are based on LAMMPS, one of the well-known molecular dynamics programs. Our prototype of multiscale modeling follows the form of the third party implementation of LAMMPS. It added MD to SRD in order to simulate the boundary area of the simulation box. Because it is important to guarantee the seamless simulation, we also designed the overlap zones and communication zones. The preliminary experimental results showed that our proposed scheme is properly worked out and the execution time is also reduced.