• Journal of Broadcast Engineering
• /
• v.21 no.5
• /
• pp.782-791
• /
• 2016

The object segmentation algorithm from the background could be used for object recognition and tracking, and many applications. To segment objects, this paper proposes a method that refer to several initial frames with real-time processing at fixed camera. First we suggest the probability model to segment object and background and we enhance the performance of algorithm analyzing the color consistency and focus characteristic of camera for several initial frames. We compensate the segmentation result by using human skeleton characteristic among extracted objects. Last the proposed method has the applicability for various mobile application as we minimize computing complexity for real-time video processing.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.99-106
• /
• 2010

In this paper, we propose the construction of multi-queries and consistency principle for the user's emotion-based music retrieval system. The features used in the system are MPEG-7 audio descriptors, which are international standards recommended for content-based audio retrievals. In addition we propose the method to determine the weight that represent the importance of each descriptor for each emotion in order to reduce the computation. Also, the proposed retrieval algorithm that uses the relevance feedback based on consistency principal and multi-queries improves the success ratio of musics corresponding to user's emotion.

• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.697-709
• /
• 2001

In this paper we study two vector-valued process capability indices $C_{p}$=($C_{px}$, $C_{py}$ ) and C/aub pm/=( $C_{pmx}$, $C_{pmy}$) considering process capability indices $C_{p}$ and $C_{pm}$ . First, two asymptotic distributions of plug-in estimators $C_{p}$=($C_{px}$, $C_{py}$ ) and $C_{pm}$ =) $C_{pmx}$, $C_{pmy}$) are derived.. With the asymptotic distributions, we propose asymptotic confidence regions for our indices. Next, obtaining the asymptotic distributions of two bootstrap estimators $C_{p}$=($C_{px}$, $C_{py}$ )and $C_{pm}$ =( $C_{pmx}$, $C_{pmy}$) with our bootstrap algorithm, we will provide the consistency of our bootstrap for statistical inference. Also, with the consistency of our bootstrap, we propose bootstrap asymptotic confidence regions for our indices. (no abstract, see full-text)see full-text)e full-text)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.956-963
• /
• 2006

This research studies multi participant consistency and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted frequence, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dynamic data path prediction, the tests the location prediction error between Dead-reckoning convergence interval and error of prediction and actual condition one time above threshold it interpolates a previously location. The shared dynamic data of the 3D virtual environment is implementation using the VRML EAI.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2007.05a
• /
• pp.272-275
• /
• 2007

This paper is concerned with modified integration algorithm on the strain-space for rate and temperature dependent elasto-plastic constitutive relations in order to obtain more accurate results in numerical implementation. The proposed algorithm is integrated analytically using integration by part and chain rule and then is applied to the 2-stage Lobatto IIIA with second-order accuracy. It has advantage that is able to consider the convective stress rates on the yield surface of the strain-space. Also this paper is carried out the iteration procedure using the Newton-Raphson method to enforce consistency at the end of the step. And the performance of the proposed algorithm for rate and temperature dependent constitutive relation is illustrated by means of analysis of adiabatic shear bands.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• v.11 no.2
• /
• pp.447-453
• /
• 2006

This paper presents an area-based stereo algorithm suitable to real time applications. The core of the algorithm depends on the uniqueness constraint and on a matching process that allows for rejecting previous matches. The proposed approach is compared with the left right consistency constraint, being the latter the basic method for detecting unreliable matches in many area-based stereo algorithms. We used the watermelon and tomatoes for experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2203-2217
• /
• 2016

To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.617-629
• /
• 2021

Although the actual visual simultaneous localization and mapping (SLAM) algorithms provide highly accurate tracking and mapping, most algorithms are too heavy to run live on embedded devices. In addition, the maps they produce are often unsuitable for path planning. To mitigate these issues, we propose a completely closed-loop online dense RGB-D SLAM algorithm targeting autonomous indoor mobile robot navigation tasks. The proposed algorithm runs live on an NVIDIA Jetson board embedded on a two-wheel differential-drive robot. It exhibits lightweight three-dimensional mapping, room-scale consistency, accurate pose tracking, and robustness to moving objects. Further, we introduce a navigation strategy based on the proposed algorithm. Experimental results demonstrate the robustness of the proposed SLAM algorithm, its computational efficiency, and its benefits for on-the-fly navigation while mapping.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.2
• /
• pp.3-12
• /
• 2000

In this paper we propose a new algorithm which resolves the inconsistency problems occurring when DNS severs are employed as elements of PKI. The inconsistency may take place between primary name servers and secondary name servers and between cached certificate and original certificate. The former can be removed by adapting RFC 1996 NOTIFY opcode for DNS. In order to eliminate the latter type of inconsistency we develope a new algorithm which is implemented with two additional RR(Resource Record). The present algorithm is designed such that DNS contacts the destination DNS prior to returning public key to users. Therefore the inconsistency problem occurring when DNS is operated as PKI can be eliminated by using the proposed adaptation and algorithm.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.83-87
• /
• 2007

This research studies real time interaction and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted disorderly, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dead-reckoning path prediction, the error between the estimated and the actual static values which is over the threshold based on the shared object location requires interpolation and multicasting of the previous location by the ESPDU of DIS. The shared dynamic data of the 3D virtual environment is implementation using the VRML.