• 한국멀티미디어학회논문지
• /
• 제23권12호
• /
• pp.1540-1551
• /
• 2020

Aiming at the problem that the existing human behavior recognition algorithm cannot fully utilize the multi-level spatio-temporal information of the network, a human behavior recognition algorithm based on a dense three-dimensional residual network is proposed. First, the proposed algorithm uses a dense block of three-dimensional residuals as the basic module of the network. The module extracts the hierarchical features of human behavior through densely connected convolutional layers; Secondly, the local feature aggregation adaptive method is used to learn the local dense features of human behavior; Then, the residual connection module is applied to promote the flow of feature information and reduced the difficulty of training; Finally, the multi-layer local feature extraction of the network is realized by cascading multiple three-dimensional residual dense blocks, and use the global feature aggregation adaptive method to learn the features of all network layers to realize human behavior recognition. A large number of experimental results on benchmark datasets KTH show that the recognition rate (top-l accuracy) of the proposed algorithm reaches 93.52%. Compared with the three-dimensional convolutional neural network (C3D) algorithm, it has improved by 3.93 percentage points. The proposed algorithm framework has good robustness and transfer learning ability, and can effectively handle a variety of video behavior recognition tasks.

• 한국멀티미디어학회논문지
• /
• 제25권10호
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.287-296
• /
• 2009

Although asymptotic bounds of wireless network capacity have been heavily pursued, the answers to the following questions are still critical for network planning, protocol and architecture design: Given a three-dimensional (3D) network space with the number of active users randomly located in the space and using the wireless communication technology, what are the expected per-flow throughput, network capacity, and network transport capacity? In addition, how can the protocol parameters be tuned to enhance network performance? In this paper, we focus on the ultra wideband (UWB) based wireless personal area networks (WPANs) and provide answers to these questions, considering the salient features of UWB communications, i.e., low transmission/interference power level, accurate ranging capability, etc. Specifically, we demonstrate how to explore the spatial multiplexing gain of UWB networks by allowing appropriate concurrent transmissions. Given 3D space and the number of active users, we derive the expected number of concurrent transmissions, network capacity and transport capacity of the UWB network. The results reveal the main factors affecting network (transport) capacity, and how to determine the best protocol parameters, e.g., exclusive region size, in order to maximize the capacity. Extensive simulation results are given to validate the analytical results.

• 대한기계학회논문집A
• /
• 제27권7호
• /
• pp.1110-1119
• /
• 2003

This paper deals with the synthesis of the 3-dimensional grasp planning for unknown objects. Previous studies have many problems, which the estimation time for finding the grasping points is much long and the analysis used the not-perfect 3-dimensional modeling. To overcome these limitations in this paper new algorithm is proposed, which algorithm is achieved by two steps. First step is to find the whole 3-dimensional geometrical modeling for unknown objects by using stereo matching. Second step is to find the optimal grasping points for unknown objects by using the neural network trained by the result of optimization using genetic algorithm. The algorithm is verified by computer simulation, comparing the result between neural network and optimization.

• 정보처리학회논문지A
• /
• 제18A권5호
• /
• pp.205-214
• /
• 2011

본 논문은 널리 알려진 3차원 꼬인 큐브를 기반으로 하는 새로운 상호연결망 꼬인 큐브 토러스(TT) 네트워크를 제안한다. 꼬인 큐브 토러스 네트워크는 동일한 노드수를 갖는 honeycomb 토러스보다 짧은 지름을 갖고, 망 비용이 개선된 연결망이다. 본 논문에서는 꼬인 큐브 토러스의 라우팅 알고리즘을 제안하고, 지름, 망 비용, 이분할에지수, 해밀토니안 사이클을 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1209-1221
• /
• 2010

Three dimensional (3D) video is expected to be an important application for broadcast and IP streaming services. One of the main limitations for the transmission of 3D video over IP networks is network bandwidth mismatch due to the large size of 3D data, which causes fatal decoding errors and mosaic-like damage. This paper presents a novel selective frame discard method to address the problem. The main idea of the proposed method is the symmetrical discard of the two dimensional (2D) video frame and the depth map frame. Also, the frames to be discarded are selected after additional consideration of the playback deadline, the network bandwidth, and the inter-frame dependency relationship within a group of pictures (GOP). It enables the efficient utilization of the network bandwidth and high quality 3D IPTV service. The simulation results demonstrate that the proposed method enhances the media quality of 3D video streaming even in the case of bad network conditions.

• 한국전자거래학회지
• /
• 제1권1호
• /
• pp.141-157
• /
• 1996

Data sharing is a major challenge to implement CALS. STEP is the international standard for the product model data exchange among heterogeneous systems and plays a key role in CALS. Advances in computer networks are rapidly changing the product development processes. The network oriented modeling system premises to integrate design activities across the enterprise. To achieve goals of CALS 3-dimensional concurrent modeling that complies international standard is required since integrity and common perception of product data can be assured. This paper presents 3-dimensional concurrent geometric modeling on high speed network using STEP and methodologies.

• Journal of the Optical Society of Korea
• /
• 제1권1호
• /
• pp.52-59
• /
• 1997

In this paper, we propose a system design for a parallel3-dimensional optical interconnection network utilizing variable grating mode liquid crystal devices (VGM LCD's) which are optical transducers capable of performing intensity-to-spatial-frequency conversion. The proposed system performs real-time, reconfigurable, but blocking and nonbroadcasting 3-dimensional optical interconnections. The operating principles of the 3-D optical interconnection network are described, and some of the fundamental limitations are addressed. The system presented in this paper can be directly used as a configuration of switching elements for the 2-D optical perfect-shuffle dynamic interconnection network, as well as for a B-ISDN photonic switching system.

• 전자공학회논문지C
• /
• 제35C권2호
• /
• pp.71-79
• /
• 1998

In this paper, we propose a new mART(modified ART) neural network by combining the winner neuron definition method of SOM(self-organizing map) and the real-time adaptive clustering function of ART(adaptive resonance theory) and construct it in a modular structure, for the purpose of organizing the feature maps of three dimensional targets. Being constructed in a modular structure, the proposed modular mART can effectively prevent the clusters from representing multiple classes and can be trained to organze two dimensional distortion invariant feature maps so as to recognize targets with three dimensional distortion. We also present the recognition result and self-organization perfdormance of the proposed modular mART neural network after carried out some experiments with 14 tank and fighter target models.

• 한국재료학회지
• /
• 제18권3호
• /
• pp.163-168
• /
• 2008

The morphology of three-dimensional (3D) cross-linked electrodeposits of copper and tin was investigated as a function of the content of metal sulfate and acetic acid in a deposition bath. The composition of copper sulfate had little effect on the overall copper network structure, whereas that of tin sulfate produced significant differences in the tin network structure. The effect of the metal sulfate content on the copper and tin network is discussed in terms of whether or not hydrogen evolution occurs on electrodeposits. In addition, the hydrophobic additive, i.e., acetic acid, which suppresses the coalescence of evolved hydrogen bubbles and thereby makes the pore size controllable, proved to be detrimental to the formation of a well-defined network structure. This led to a non-uniform or discontinuous copper network. This implies that acetic acid critically retards the electrodeposition of copper.