• Title/Summary/Keyword: histogram data

Search Result 488, Processing Time 0.03 seconds

Model-based Clustering of DOA Data Using von Mises Mixture Model for Sound Source Localization

  • Dinh, Quang Nguyen;Lee, Chang-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.13 no.1
    • /
    • pp.59-66
    • /
    • 2013
  • In this paper, we propose a probabilistic framework for model-based clustering of direction of arrival (DOA) data to obtain stable sound source localization (SSL) estimates. Model-based clustering has been shown capable of handling highly overlapped and noisy datasets, such as those involved in DOA detection. Although the Gaussian mixture model is commonly used for model-based clustering, we propose use of the von Mises mixture model as more befitting circular DOA data than a Gaussian distribution. The EM framework for the von Mises mixture model in a unit hyper sphere is degenerated for the 2D case and used as such in the proposed method. We also use a histogram of the dataset to initialize the number of clusters and the initial values of parameters, thereby saving calculation time and improving the efficiency. Experiments using simulated and real-world datasets demonstrate the performance of the proposed method.

A case study of MS Excel's powerful functions for statistical data analysis. (Focused on an Analysis of Variance menu) (자료 통계 분석을 위한 MS 엑셀의 유용한 기능들에 관한 사례연구 (지하철 이용객 자료 분석))

  • Kim, Sook-Young
    • Journal of the Korea Computer Industry Society
    • /
    • v.9 no.5
    • /
    • pp.223-228
    • /
    • 2008
  • A case study to show MS Excel's convenient and powerful functions was conducted to test hypotheses with subway data. Quantitative variables were described using descriptive menu, and qualitative variables were described using histogram menu of a MS Excel software. Relationships were tested using regression menu, differences were tested using t-test menu, and factors were tested using variance-layout menu of a Excel software. Data input, management, and statistical analysis were done successfully with only a MS Excel software.

  • PDF

Probabilistic Analysis of Design Live Loads on A Refrigeration Store (냉동 창고 상시 적재하중에 관한 확률론적 연구)

  • Kim, Dai-Ho;Jeong, Jae-Hun;Won, Young-SuI;Joo, Kyung-Jai
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.5 no.4
    • /
    • pp.109-120
    • /
    • 2001
  • Live load data were collected with a systematic manner from a survey of a refrigeration stores. Using the collected floor live load survey data, the basic statistics, a histogram of the uniformly distributed loads, and the equivalent uniformly distributed loads are computed for various structural members. Based on the above results, the maximum values of a combined live loads during the design life have been estimated and compared with current design live loads. The ultimate goals of this study are to develop probabilistic live load models to analyze survey data of domestic refrigeration stores, and to propose design live loads for structural types.

  • PDF

AUTOMATIC GENERATION OF BUILDING FOOTPRINTS FROM AIRBORNE LIDAR DATA

  • Lee, Dong-Cheon;Jung, Hyung-Sup;Yom, Jae-Hong;Lim, Sae-Bom;Kim, Jung-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.637-641
    • /
    • 2007
  • Airborne LIDAR (Light Detection and Ranging) technology has reached a degree of the required accuracy in mapping professions, and advanced LIDAR systems are becoming increasingly common in the various fields of application. LiDAR data constitute an excellent source of information for reconstructing the Earth's surface due to capability of rapid and dense 3D spatial data acquisition with high accuracy. However, organizing the LIDAR data and extracting information from the data are difficult tasks because LIDAR data are composed of randomly distributed point clouds and do not provide sufficient semantic information. The main reason for this difficulty in processing LIDAR data is that the data provide only irregularly spaced point coordinates without topological and relational information among the points. This study introduces an efficient and robust method for automatic extraction of building footprints using airborne LIDAR data. The proposed method separates ground and non-ground data based on the histogram analysis and then rearranges the building boundary points using convex hull algorithm to extract building footprints. The method was implemented to LIDAR data of the heavily built-up area. Experimental results showed the feasibility and efficiency of the proposed method for automatic producing building layers of the large scale digital maps and 3D building reconstruction.

  • PDF

Analysis of noise rejection of stored holographic digital data on the chalcogenide thin film (칼코게나이드 박막에 저장된 홀로그래픽 디지털 정보의 잡음 제거에 관한 연구)

  • Lim, Byoung-Rock;Lee, Woo-Sung;Ahn, Kwang-Seop;Yeo, Cheol-Ho;Chung, Hong-Bay
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2005.07a
    • /
    • pp.479-480
    • /
    • 2005
  • The Analog data is impossible to perfect reconstruct original data at a hologram data storage because of noise such as cross talk. So it is necessary that data can be stored by digital signal unavoidably. Therefore this work deals with experiments from this point of view through writing & reading of digital data. We stored 256bit digital data at one point on As-Ge-Se-S chalcogenide thin film and we reconstruct original data of 100% through the specified algorithm such as the histogram equalization, the interactive correction, etc. This result shows that the data is able to reconstruct under relative low diffraction efficiency. As the result, we expect the possibility of chalcogenide thin film for HDDS as the analysis of the effective resolution refer to reconstruction rate and diffraction efficiency.

  • PDF

Spatial Partitioning for Query Result Size Estimation in Spatial Databases (공간 데이터베이스에서 질의 결과 크기 추정을 위한 공간 분할)

  • 황환규
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.2
    • /
    • pp.23-32
    • /
    • 2004
  • The query optimizer's important task while a query is invoked is to estimate the fraction of records in the databases that satisfy the given query condition. The query result size estimation in spatial databases, like relational databases, proceeds to partition the whole input into a small number of subsets called “buckets” and then estimate the fraction of the input in the buckets. The accuracy of estimation is determined by the difference between the real data counts and approximations in the buckets, and is dependent on how to partition the buckets. Existing techniques for spatial databases are equi-area and equi-count techniques, which are respectively analogous in relation databases to equi-height histogram that divides the input value range into buckets of equal size and equi-depth histogram that is equal to the number of records within each bucket. In this paper we propose a new partitioning technique that determines buckets according to the maximal difference of area which is defined as the product of data ranges End frequencies of input. In this new technique we consider both data values and frequencies of input data simultaneously, and thus achieve substantial improvements in accuracy over existing approaches. We present a detailed experimental study of the accuracy of query result size estimation comparing the proposed technique and the existing techniques using synthetic as well as real-life datasets. Experiments confirm that our proposed techniques offer better accuracy in query result size estimation than the existing techniques for space query size, bucket number, data number and data size.

A Error Analysis of Scanning for Topological Data Construction in Geographic Information Systems (GIS의 지형자료 구축을 위한 SCANNING 방법의 오차분석)

  • Yoo, Hwan-Hee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.10 no.2
    • /
    • pp.37-44
    • /
    • 1992
  • Although scanners are much more expensive than other input devices expect for some low quality devices, raster scanner and vectorizing softwares have been used and will be used as a means for the data entry in GIS. In this study, the accuracy of raster data and vectorizing in data entry by scanning technology, the coverage generation are investigated. As a result, the deterioration of spatial resolution can be improved by using the histogram analysis and the line enhancement when we scan a map at a lower dpi. It is to be desired that a raster scanner dpi is selected 150 dpi or 200 dpi among five densities (75 dpi, 150, dpi, 200 dpi, 300 dpi, 400 dpi) in view of the storage of raster data and the RMSE of coverage generation. Also, it was very important role of the choice of trace parameters to trace raster data in the vectorizing procedure.

  • PDF

Efficient Fuzzy Rule Generation Using Fuzzy Decision Tree (퍼지 결정 트리를 이용한 효율적인 퍼지 규칙 생성)

  • 민창우;김명원;김수광
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.10
    • /
    • pp.59-68
    • /
    • 1998
  • The goal of data mining is to develop the automatic and intelligent tools and technologies that can find useful knowledge from databases. To meet this goal, we propose an efficient data mining algorithm based on the fuzzy decision tree. The proposed method combines comprehensibility of decision tree such as ID3 and C4.5 and representation power of fuzzy set theory. So, it can generate simple and comprehensive rules describing data. The proposed algorithm consists of two stages: the first stage generates the fuzzy membership functions using histogram analysis, and the second stage constructs a fuzzy decision tree using the fuzzy membership functions. From the testing of the proposed algorithm on the IRIS data and the Wisconsin Breast Cancer data, we found that the proposed method can generate a set of fuzzy rules from data efficiently.

  • PDF

Randomized Block Size (RBS) Model for Secure Data Storage in Distributed Server

  • Sinha, Keshav;Paul, Partha;Amritanjali, Amritanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4508-4530
    • /
    • 2021
  • Today distributed data storage service are being widely used. However lack of proper means of security makes the user data vulnerable. In this work, we propose a Randomized Block Size (RBS) model for secure data storage in distributed environments. The model work with multifold block sizes encrypted with the Chinese Remainder Theorem-based RSA (C-RSA) technique for end-to-end security of multimedia data. The proposed RBS model has a key generation phase (KGP) for constructing asymmetric keys, and a rand generation phase (RGP) for applying optimal asymmetric encryption padding (OAEP) to the original message. The experimental results obtained with text and image files show that the post encryption file size is not much affected, and data is efficiently encrypted while storing at the distributed storage server (DSS). The parameters such as ciphertext size, encryption time, and throughput have been considered for performance evaluation, whereas statistical analysis like similarity measurement, correlation coefficient, histogram, and entropy analysis uses to check image pixels deviation. The number of pixels change rate (NPCR) and unified averaged changed intensity (UACI) were used to check the strength of the proposed encryption technique. The proposed model is robust with high resilience against eavesdropping, insider attack, and chosen-plaintext attack.

Sensor Data Fusion for Navigation of Mobile Robot With Collision Avoidance and Trap Recovery

  • Jeon, Young-Su;Ahn, Byeong-Kyu;Kuc, Tae-Yong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2461-2466
    • /
    • 2003
  • This paper presents a simple sensor fusion algorithm using neural network for navigation of mobile robots with obstacle avoidance and trap recovery. The multiple sensors input sensor data to the input layer of neural network activating the input nodes. The multiple sensors used include optical encoders, ultrasonic sensors, infrared sensors, a magnetic compass sensor, and GPS sensors. The proposed sensor fusion algorithm is combined with the VFH(Vector Field Histogram) algorithm for obstacle avoidance and AGPM(Adaptive Goal Perturbation Method) which sets adaptive virtual goals to escape trap situations. The experiment results show that the proposed low-level fusion algorithm is effective for real-time navigation of mobile robot.

  • PDF