• Title/Summary/Keyword: multi-dimensional metric

Search Result 26, Processing Time 0.038 seconds

Energy-aware Multi-dimensional Resource Allocation Algorithm in Cloud Data Center

  • Nie, Jiawei;Luo, Juan;Yin, Luxiu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4320-4333
    • /
    • 2017
  • Energy-efficient virtual resource allocation algorithm has become a hot research topic in cloud computing. However, most of the existing allocation schemes cannot ensure each type of resource be fully utilized. To solve the problem, this paper proposes a virtual machine (VM) allocation algorithm on the basis of multi-dimensional resource, considering the diversity of user's requests. First, we analyze the usage of each dimension resource of physical machines (PMs) and build a D-dimensional resource state model. Second, we introduce an energy-resource state metric (PAR) and then propose an energy-aware multi-dimensional resource allocation algorithm called MRBEA to allocate resources according to the resource state and energy consumption of PMs. Third, we validate the effectiveness of the proposed algorithm by real-world datasets. Experimental results show that MRBEA has a better performance in terms of energy consumption, SLA violations and the number of VM migrations.

Reduced Reference Quality Metric for Synthesized Virtual Views in 3DTV

  • Le, Thanh Ha;Long, Vuong Tung;Duong, Dinh Trieu;Jung, Seung-Won
    • ETRI Journal
    • /
    • v.38 no.6
    • /
    • pp.1114-1123
    • /
    • 2016
  • Multi-view video plus depth (MVD) has been widely used owing to its effectiveness in three-dimensional data representation. Using MVD, color videos with only a limited number of real viewpoints are compressed and transmitted along with captured or estimated depth videos. Because the synthesized views are generated from decoded real views, their original reference views do not exist at either the transmitter or receiver. Therefore, it is challenging to define an efficient metric to evaluate the quality of synthesized images. We propose a novel metric-the reduced-reference quality metric. First, the effects of depth distortion on the quality of synthesized images are analyzed. We then employ the high correlation between the local depth distortions and local color characteristics of the decoded depth and color images, respectively, to achieve an efficient depth quality metric for each real view. Finally, the objective quality metric of the synthesized views is obtained by combining all the depth quality metrics obtained from the decoded real views. The experimental results show that the proposed quality metric correlates very well with full reference image and video quality metrics.

Construction of Multi-Dimensional Ortho-Images with a Digital Camera and the Multi-Image Connection Method (디지털카메라와 다중영상접합법을 이용한 다차원 정사영상의 구축)

  • Kim, Dong Moon
    • Journal of Digital Convergence
    • /
    • v.12 no.8
    • /
    • pp.295-302
    • /
    • 2014
  • Essential to the establishment of such 3D spatial information are the laser scanning technology to obtain high-precision 3D point group data and the photography-metric camera to obtain high-resolution multispectral image information. The photography-metric camera, however, lacks in usability for its broad scope of utilization due to the high purchase price, difficult purchase channel, and low applicability. This study thus set out to investigate a technique to establish multi-dimensional ortho-image data with a single lens reflex digital camera of high speed and easy accessibility for general users. That is, the study remodeled a single lens reflex digital camera and calibrated the remodeled camera to establish 3D multispectral image information, which is the essential data of 3D spatial information. Multi-dimensional ortho-image data were collected by surveying the reference points for stereo photos, taking multispectral shots of the objects, and converting them into ortho-images.

Self-localization of Mobile Robots by the Detection and Recognition of Landmarks (인공표식과 자연표식을 결합한 강인한 자기위치추정)

  • 권인소;장기정;김성호;이왕헌
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.306-311
    • /
    • 2003
  • This paper presents a novel localization paradigm for mobile robots based on artificial and natural landmarks. A model-based object recognition method detects natural landmarks and conducts the global and topological localization. In addition, a metric localization method using artificial landmarks is fused to complement the deficiency of topology map and guide to action behavior. The recognition algorithm uses a modified local Zernike moments and a probabilistic voting method for the robust detection of objects in cluttered indoor environments. An artificial landmark is designed to have a three-dimensional multi-colored structure and the projection distortion of the structure encodes the distance and viewing direction of the robot. We demonstrate the feasibility of the proposed system through real world experiments using a mobile robot, KASIRI-III.

  • PDF

Neural and MTS Algorithms for Feature Selection

  • Su, Chao-Ton;Li, Te-Sheng
    • International Journal of Quality Innovation
    • /
    • v.3 no.2
    • /
    • pp.113-131
    • /
    • 2002
  • The relationships among multi-dimensional data (such as medical examination data) with ambiguity and variation are difficult to explore. The traditional approach to building a data classification system requires the formulation of rules by which the input data can be analyzed. The formulation of such rules is very difficult with large sets of input data. This paper first describes two classification approaches using back-propagation (BP) neural network and Mahalanobis distance (MD) classifier, and then proposes two classification approaches for multi-dimensional feature selection. The first one proposed is a feature selection procedure from the trained back-propagation (BP) neural network. The basic idea of this procedure is to compare the multiplication weights between input and hidden layer and hidden and output layer. In order to simplify the structure, only the multiplication weights of large absolute values are used. The second approach is Mahalanobis-Taguchi system (MTS) originally suggested by Dr. Taguchi. The MTS performs Taguchi's fractional factorial design based on the Mahalanobis distance as a performance metric. We combine the automatic thresholding with MD: it can deal with a reduced model, which is the focus of this paper In this work, two case studies will be used as examples to compare and discuss the complete and reduced models employing BP neural network and MD classifier. The implementation results show that proposed approaches are effective and powerful for the classification.

Feasibility study on an acceleration signal-based translational and rotational mode shape estimation approach utilizing the linear transformation matrix

  • Seung-Hun Sung;Gil-Yong Lee;In-Ho Kim
    • Smart Structures and Systems
    • /
    • v.32 no.1
    • /
    • pp.1-7
    • /
    • 2023
  • In modal analysis, the mode shape reflects the vibration characteristics of the structure, and thus it is widely performed for finite element model updating and structural health monitoring. Generally, the acceleration-based mode shape is suitable to express the characteristics of structures for the translational vibration; however, it is difficult to represent the rotational mode at boundary conditions. A tilt sensor and gyroscope capable of measuring rotational mode are used to analyze the overall behavior of the structure, but extracting its mode shape is the major challenge under the small vibration always. Herein, we conducted a feasibility study on a multi-mode shape estimating approach utilizing a single physical quantity signal. The basic concept of the proposed method is to receive multi-metric dynamic responses from two sensors and obtain mode shapes through bridge loading test with relatively large deformation. In addition, the linear transformation matrix for estimating two mode shapes is derived, and the mode shape based on the gyro sensor data is obtained by acceleration response using ambient vibration. Because the structure's behavior with respect to translational and rotational mode can be confirmed, the proposed method can obtain the total response of the structure considering boundary conditions. To verify the feasibility of the proposed method, we pre-measured dynamic data acquired from five accelerometers and five gyro sensors in a lab-scale test considering bridge structures, and obtained a linear transformation matrix for estimating the multi-mode shapes. In addition, the mode shapes for two physical quantities could be extracted by using only the acceleration data. Finally, the mode shapes estimated by the proposed method were compared with the mode shapes obtained from the two sensors. This study confirmed the applicability of the multi-mode shape estimation approach for accurate damage assessment using multi-dimensional mode shapes of bridge structures, and can be used to evaluate the behavior of structures under ambient vibration.

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree (다차원 색인구조 M-트리에서 노드 색인 공간의 중첩을 최소화하기 위한 효율적인 분할 알고리즘)

  • Im Sang-hyuk;Ku Kyong-I;Kim Ki-chang;Kim Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.233-246
    • /
    • 2005
  • To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

Study of Improvement of Search Range Compression Method of VP-tree for Video Indexes (영상 색인용 VP-tree의 검색 범위 압축법의 개선에 관한 연구)

  • Park, Gil-Yang;Lee, Samuel Sang-Kon;Hwang, Jea-Jeong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.2
    • /
    • pp.215-225
    • /
    • 2012
  • In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

RowAMD Distance: A Novel 2DPCA-Based Distance Computation with Texture-Based Technique for Face Recognition

  • Al-Arashi, Waled Hussein;Shing, Chai Wuh;Suandi, Shahrel Azmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5474-5490
    • /
    • 2017
  • Although two-dimensional principal component analysis (2DPCA) has been shown to be successful in face recognition system, it is still very sensitive to illumination variations. To reduce the effect of these variations, texture-based techniques are used due to their robustness to these variations. In this paper, we explore several texture-based techniques and determine the most appropriate one to be used with 2DPCA-based techniques for face recognition. We also propose a new distance metric computation in 2DPCA called Row Assembled Matrix Distance (RowAMD). Experiments on Yale Face Database, Extended Yale Face Database B, AR Database and LFW Database reveal that the proposed RowAMD distance computation method outperforms other conventional distance metrics when Local Line Binary Pattern (LLBP) and Multi-scale Block Local Binary Pattern (MB-LBP) are used for face authentication and face identification, respectively. In addition to this, the results also demonstrate the robustness of the proposed RowAMD with several texture-based techniques.