• Journal of the HCI Society of Korea
• /
• v.1 no.2
• /
• pp.51-58
• /
• 2006

Information visualization, generally speaking, consists of three steps: transform from raw data to data model, visual mapping from data model to visual structure, and transform from visual structure to information model. In this paper, we propose a visual mapping method from spatiotemporal table information, which is related to events in large-scale building, to 3D map metaphor. The process has also three steps as follows. First, after analyzing the table attributes, we carefully define a context to fully represent the table-information. Second, we choose meaningful attribute sets from the context. Third, each meaningful attribute set is mapped to one well defined visual structure. Our method has several advantages. First, users can intuitively achieve non-spatial information through the 3D map which is a powerful spatial metaphor. Second, this system shows various visual mapping method applicable to other data models in the form of table, especially GIS. After describing the whole concept of our visual mapping, we will show the results of implementation for several requests.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.268-271
• /
• 2012

The high peak-to-average power is one of the main drawbacks in OFDM systems. This letter proposes a partial shift mapping (PSM) method for peak power reduction in OFDM systems. By utilizing the properties of the discrete Fourier transform, the proposed method generates a set of candidate signals without additional complex multiplication and selects the one with minimum peak power for transmission. Analyses and simulations confirm that the PSM method achieves satisfactory peak power reduction performance and low complexity compared with other kindred methods, for example, selected mapping and partial transmit sequences.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3962-3980
• /
• 2019

To deal with single sample face recognition, this paper presents a patch based semi-supervised linear regression (PSLR) algorithm, which draws facial variation information from unlabeled samples. Each facial image is divided into overlapped patches, and a regression model with mapping matrix will be constructed on each patch. Then, we adjust these matrices by mapping unlabeled patches to $[1,1,{\cdots},1]^T$. The solutions of all the mapping matrices are integrated into an overall objective function, which uses ${\ell}_{2,1}$-norm minimization constraints to improve discrimination ability of mapping matrices and reduce the impact of noise. After mapping matrices are computed, we adopt majority-voting strategy to classify the probe samples. To further learn the discrimination information between probe samples and obtain more robust mapping matrices, we also propose a multistage PSLR (MPSLR) algorithm, which iteratively updates the training dataset by adding those reliably labeled probe samples into it. The effectiveness of our approaches is evaluated using three public facial databases. Experimental results prove that our approaches are robust to illumination, expression and occlusion.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.336-340
• /
• 2007

This paper proposes a multicast scheme over IEEE 802.16 networks which support multiple upper layer protocols such as ATM, IPv4 packets, IPv6 packets, IEEE 802.3 over IPv4 and so on. The multicast capabilities over IEEE 802.16 are important both control plane and data plane. The proposed multicast scheme can be divided into two types: direct mapping and indirect mapping. The direct mapping scheme is that layer 3 address is directly mapped into CID information which is used for connection identifier at IEEE 802.16 link layer. The indirect mapping scheme has two steps for mapping between layer 3 address and layer 2 CID. Firstly, a layer 3 address translates to Ethernet MAC address with group MAC address. Secondly, a group MAC address is mapped into CID. The mapping scheme depends on the upper layer protocols.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.211-222
• /
• 2006

In collaborative environment, it is necessary that the participants in collaboration should share the same understanding about the semantics of terms. For example, they should know that 'COMPONENT' and 'ITEM' are different word-expressions for the same meaning. In order to handle such problems in information sharing, an information system needs to automatically recognize that the terms have the same semantics. So we develop an algorithm mapping two terms based on their ontological definitions and their similarities. The proposed algorithm consists of four steps: the character matching, the inferencing, the definition comparing and the similarity checking. In the similarity checking step, we consider relation similarity and hierarchical similarity. The algorithm is very primitive, but it shows the possibility of semi-automatic mapping using ontology. In addition, we design a mapping procedure for a mapping system, called SOM (semantic ontology mapper).

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.295-303
• /
• 2005

Semantic Web and its related technologies have been opening the era of information sharing via Web. In the meantime, there are several huddles to overcome toward the new era and one of the major huddles is information integration issue unless we build and use a single unified but huge ontology which address everything in the world. Particularly in e-business area, information integration problem must be a great concern in search and comparison of products from various internet shopping sites and e-marketplaces. To overcome such an information integration problem, we propose an ontology driven mapping algorithm between heterogeneous product classification and description frameworks. We also perform comparative evaluation of the proposed mapping algorithm against a well-known ontology mapping tool, PROMPT.

• Advances in robotics research
• /
• v.2 no.1
• /
• pp.45-57
• /
• 2018

Even though the popularity of projection mapping continues to increase and it is being implemented in more and more settings, most current projection mapping systems are limited to special purposes, such as outdoor events, live theater and musical performances. This lack of versatility arises from the large number of projectors needed and their proper calibration. Furthermore, we cannot change the positions and poses of projectors, or their projection targets, after the projectors have been calibrated. To overcome these problems, we propose a projection mapping method using a projector robot that can perform projection mapping in more general or ubiquitous situations, such as shopping malls. We can estimate a projector's position and pose with the robot's self-localization sensors, but the accuracy of this approach remains inadequate for projection mapping. Consequently, the proposed method solves this problem by combining self-localization by robot sensors with position and pose estimation of projection targets based on a 3D model. We first obtain the projection target's 3D model and then use it to accurately estimate the target's position and pose and thus achieve accurate projection mapping with a projector robot. In addition, our proposed method performs accurate projection mapping even after a projection target has been moved, which often occur in shopping malls. In this paper, we employ Ubiquitous Display (UD), which we are researching as a projector robot, to experimentally evaluate the effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.311-316
• /
• 2012

In this paper, a bit-mapping scheme is proposed for partial Chase combining in LDPC-coded systems. Contrary to the previously known bit mapping that assigns the information bits to more reliable channels, the proposed mapping assigns the codeword bits of irregular LDPC codes to distinct Gaussian channels by considering the characteristics of LDPC codes and channels. The recursion equation for partial Chase combining is derived by using the density evolution technique, based on it, the best bit mapping among the various bit-mapping schemes is derived, and the validity of them is confirmed through simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.730-732
• /
• 2001

클러스터 환경에서 최근의 다양한 서비스의 증가로 인해 단순한 부하의 균등화만으로 적절한 지연 시간을 기대할 수 없게 되어, 내용-기반 맵핑(content-based mapping)이 제안되었다. 본 논문에서는 요구되는 내용을 기반으로 맵핑하며, 이질적 서버들에 대해 능력에 따라 우선 순위를 부여하여, 내용-기반 맵핑 방식을 이질적 환경에 적합하도록 개선시킨 우선순위 최상임의 가중치 맵핑(Prioritized Highest Random Weight Mapping, PHRW Mapping)을 제안하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.670-672
• /
• 2001

소프트웨어 산업계에서 재사용 단위가 객체보다 더 큰 컴포넌트 기반의 개발에 관심이 집중되고 있다. 그래서 모델링 언어인 UML과 컴포넌트가 운용되는 유연하고 확장성 높은 기반 아키텍처인 EJB를 이용한 기업형 시스템 개발이 요즘 기업에서 활발해지고 있다. UML과 EJB 각각에 대한 연구는 많이 진행되었지만, UML Model을 이용한 EJB Model 구현시의 mapping 기법에 관한 연구는 아직 미흡한 실정이다. 그래서 본 논문에서는 UML Modeling을 통해 Class diagram에서 추출된 Class들이 EJB로 구현될 때 실제로 어떤 Bean으로 Mapping 되는지에 대해 제시한다.