• Title/Summary/Keyword: vector computer

Search Result 2,006, Processing Time 0.036 seconds

Performance Analysis of MVDR and RLS Beamforming Using Systolic Array Structure (시스토릭 어레이 구조를 갖는 최소분산 비왜곡응답 및 최소자승 회귀 빔형성기법 성능 분석)

  • 이호중;서상우;이원철
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.1
    • /
    • pp.1-6
    • /
    • 2003
  • This paper analyses the performance of either the minimum variance distortionless response (MVDR) or the recursive least square (RLS) beamformer structured on the systolic array. Provided that the snapshot vector including the desired user's signal and the interferences with the noise is received at the array antenna. In order to improve the quality of received signal, MVDR or RLS algorithm can be utilized to update the beamformer weights recursively. Furthermore to increase the channel capacity, by the usage of the above schemes, the effect of the spatial filtering can be obtained which constructively combining multipath components corresponding to the desired user whereas the multiple access interferences (MAI) is nulled out on spatial domain. This paper introduces the MVDR and RLS beamformer structured on systolic array conducting the spatial filtering, and its performance under the multipath fading channel in the presence of multiple access interferences will be analyzed. To show the superior spatial filtering performances of the proposed scheme employing the systolic way structured beamformer, the computer simulations are carried out. And the validity of practical deployment of the proposed scheme will be confirmed throughout showing the BER behaviors and the beampatterns.

Visualization of Structural Shape Information based on Octree using Terrestrial Laser Scanning (3D레이저스캐닝을 이용한 옥트리기반 구조물 형상정보 가시화)

  • Cha, Gichun;Lee, Donghwan;Park, Seunghee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.8
    • /
    • pp.8-16
    • /
    • 2016
  • This study presents the visualization of shape information based on Octree using 3D laser scanning. The process of visualization was established to construct the Octree structure from the 3D scan data. The scan data was converted to a 2D surface through the mesh technique and the surface was then converted to a 3D object through the Raster/Vector transformation. The 3D object was transmitted to the Octree Root Node and The shape information was constructed by the recursive partitioning of the Octree Root Node. The test-bed was selected as the steel bridge structure in Sungkyunkwan University. The shape information based on Octree was condensed into 89.3%. In addition, the Octree compressibility was confirmed to compare the shape information of the office building, a computer science campus in Germany and a New College in USA. The basis is created by the visualization of shape information for double-deck tunnel and it will be expected to improve the efficiency of structural health monitoring and maintenance.

ACQUISITION OF THE FLIGHT INFORMATION USING THE KSR-3 MAGNETOMETER (KSR-3 탑재 자력계를 이용한 비행정보 획득 연구)

  • Kim, Sun-Mi;Jang, Min-Hwan;Lee, Dong-Hun;Han, Young-Seok;Kim, Jun;Hwang, Seung-Hyun;Lee, Eun-Seok;Lee, Sun-Min;Kim, Hyo-Jin;Lee, Su-Jin
    • Journal of Astronomy and Space Sciences
    • /
    • v.20 no.1
    • /
    • pp.29-42
    • /
    • 2003
  • The KSR-3 magnetometers consist of the fluxgate magnetometer (MAG/AIM) for acquiring the rocket flight attitude information, and the search-coil magnetometer (MAG/SIM) for the observation of the Earth's magnetic fluctuations. The position (latitude, longitude, and height) and flight condition (the transformation angle) of the rocket is measured after the data based on these two magnetometers are compared with IGRF The gap in the vector of magnetic field between the position of the launching point and an impact point is taken into account in data reduction. Angular variation of pitch, yaw, and roll can be researched when the data is applied to the coordinate system of the rocket.

Real-Time Object Tracking Algorithm based on Pattern Classification in Surveillance Networks (서베일런스 네트워크에서 패턴인식 기반의 실시간 객체 추적 알고리즘)

  • Kang, Sung-Kwan;Chun, Sang-Hun
    • Journal of Digital Convergence
    • /
    • v.14 no.2
    • /
    • pp.183-190
    • /
    • 2016
  • This paper proposes algorithm to reduce the computing time in a neural network that reduces transmission of data for tracking mobile objects in surveillance networks in terms of detection and communication load. Object Detection can be defined as follows : Given image sequence, which can forom a digitalized image, the goal of object detection is to determine whether or not there is any object in the image, and if present, returns its location, direction, size, and so on. But object in an given image is considerably difficult because location, size, light conditions, obstacle and so on change the overall appearance of objects, thereby making it difficult to detect them rapidly and exactly. Therefore, this paper proposes fast and exact object detection which overcomes some restrictions by using neural network. Proposed system can be object detection irrelevant to obstacle, background and pose rapidly. And neural network calculation time is decreased by reducing input vector size of neural network. Principle Component Analysis can reduce the dimension of data. In the video input in real time from a CCTV was experimented and in case of color segment, the result shows different success rate depending on camera settings. Experimental results show proposed method attains 30% higher recognition performance than the conventional method.

A Performance Analysis of an Adaptive Sector Cell System using the Measured Urban Wireless Channel Data (도심 무선채널의 실측데이터를 이용한 적응 섹터 셀 시스템의 성능분석)

  • Ko, Hak-Lim;Park, Byeong-Hoon;Lee, Jong-Heon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.24-30
    • /
    • 2008
  • In this paper we analyze the performance of an adaptive sector cell system, which is adopted to maintain the traffic balance between sectors and to utilize the cell resources effectively, using the data collected from real channel environments. In the data measurements, we transmitted the QPSK modulated signal with carrier frequency of 1.95GHz and received the signals using the 8x4 array antenna equipped on the top of buildings in the urban area. We analyzed the angular distribution and the delay spread of a user signal and analyzed angular distribution of mobile users in a cell using the collected data. Also, we propose the vector channel modeling using the estimated pdf(probability distribution function) of the analyzing results. Through the proposed channel modeling the improvement of the call blocking rate was analyzed when using the adaptive sector cell system, and computer simulations show that the call blocking rate of the adaptive sector cell system was much lower than that of the fixed sector cell system. Additionally, it shows that the call blocking rate increases severely in the fixed sector cell system while the difference of the call blocking rate was smaller in the adaptive sector cell system, as the user density of the spatial distribution increases.

  • PDF

Vehicle Detection using Feature Points with Directional Features (방향성 특징을 가지는 특징 점에 의한 차량 검출)

  • Choi Dong-Hyuk;Kim Byoung-Soo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.2 s.302
    • /
    • pp.11-18
    • /
    • 2005
  • To detect vehicles in image, first the image is transformed with the steerable pyramid which has independent directions and levels. Feature vectors are the collection of filter responses at different scales of a steerable image pyramid. For the detection of vehicles in image, feature vectors in feature points of the vehicle image is used. First the feature points are selected with the grid points in vehicle image that are evenly spaced, and second, the feature points are comer points which m selected by human, and last the feature points are corner Points which are selected in grid points. Next the feature vectors of the model vehicle image we compared the patch of the test images, and if the distance of the model and the patch of the test images is lower than the predefined threshold, the input patch is decided to a vehicle. In experiment, the total 11,191 vehicle images are captured at day(10,576) and night(624) in the two local roads. And the $92.0\%$ at day and $87.3\%$ at night detection rate is achieved.

Design of Dynamic Buffer Assignment and Message model for Large-scale Process Monitoring of Personalized Health Data (개인화된 건강 데이터의 대량 처리 모니터링을 위한 메시지 모델 및 동적 버퍼 할당 설계)

  • Jeon, Young-Jun;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.187-193
    • /
    • 2015
  • The ICT healing platform sets a couple of goals including preventing chronic diseases and sending out early disease warnings based on personal information such as bio-signals and life habits. The 2-step open system(TOS) had a relay designed between the healing platform and the storage of personal health data. It also took into account a publish/subscribe(pub/sub) service based on large-scale connections to transmit(monitor) the data processing process in real time. In the early design of TOS pub/sub, however, the same buffers were allocated regardless of connection idling and type of message in order to encode connection messages into a deflate algorithm. Proposed in this study, the dynamic buffer allocation was performed as follows: the message transmission type of each connection was first put to queuing; each queue was extracted for its feature, computed, and converted into vector through tf-idf, then being entered into a k-means cluster and forming a cluster; connections categorized under a certain cluster would re-allocate the resources according to the resource table of the cluster; the centroid of each cluster would select a queuing pattern to represent the cluster in advance and present it as a resource reference table(encoding efficiency by the buffer sizes); and the proposed design would perform trade-off between the calculation resources and the network bandwidth for cluster and feature calculations to efficiently allocate the encoding buffer resources of TOS to the network connections, thus contributing to the increased tps(number of real-time data processing and monitoring connections per unit hour) of TOS.

Developmental disability Diagnosis Assessment Systems Implementation using Multimedia Authorizing Tool (멀티미디어 저작도구를 이용한 발달장애 진단.평가 시스템 구현연구)

  • Byun, Sang-Hea;Lee, Jae-Hyun
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.3 no.1
    • /
    • pp.57-72
    • /
    • 2008
  • Serve and do so that graft together specialists' view application field of computer and developmental disability diagnosis estimation data to construct developmental disability diagnosis estimation system in this Paper and constructed developmental disability diagnosis estimation system. Developmental disability diagnosis estimation must supply information of specification area that specialists are having continuously. Developmental disability diagnosis estimation specialist system need multimedia data processing that is specialized little more for developmental disability classification diagnosis and decision-making and is atomized for this. Characteristic of developmental disability diagnosis estimation system that study in this paper can supply quick feedback about result, and can reduce mistake on recording and calculation as well as can shorten examination's enforcement time, and background of training is efficient system fairly in terms of nonprofessional who is not many can use easily. But, as well as when multimedia information that is essential data of system construction for developmental disability diagnosis estimation is having various kinds attribute and a person must achieve description about all developmental disability diagnosis estimation informations, great amount of work done is accompanied, technology about equal data can become different according to management. Because of these problems, applied search technology of contents base (Content-based) that search connection information by contents of edit target data for developmental disability diagnosis estimation data processing multimedia data processing technical development. In the meantime, typical access way for conversation style data processing to support fast image search, after draw special quality of data by N-dimension vector, store to database regarding this as value of N dimension and used data structure of Tree techniques to use index structure that search relevant data based on this costs. But, these are not coincided correctly in purpose of developmental disability diagnosis estimation because is developed focusing in application field that use data of low dimension such as original space DataBase or geography information system. Therefore, studied save structure and index mechanism of new way that support fast search to search bulky good physician data.

  • PDF

A Watermarking Scheme Based on k-means++ for Design Drawings (k-means++ 기반의 설계도면 워터마킹 기법)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.5
    • /
    • pp.57-70
    • /
    • 2009
  • A CAD design drawing based on vector data that is very important art work in industrial fields has been considered to content that the copyright protection is urgently needed. This paper presents a watermarking scheme based on k-means++ for CAD design drawing. One CAD design drawing consists of several layers and each layer consists of various geometric objects such as LINE, POLYLINE, CIRCLE, ARC, 3DFACE and POLYGON. POLYLINE with LINE, 3DFACE and ARC that are fundamental objects make up the majority in CAD design drawing. Therefore, the proposed scheme selects the target object with high distribution among POLYLINE, 3DFACE and ARC objects in CAD design drawing and then selects layers that include the most target object. Then we cluster the target objects in the selected layers by using k-means++ and embed the watermark into the geometric distribution of each group. The geometric distribution is the normalized length distribution in POLYLINE object, the normalized area distribution in 3DFACE object and the angle distribution in ARC object. Experimental results verified that the proposed scheme has the robustness against file format converting, layer attack as well as various geometric editing provided in CAD editing tools.

Outdoor Noise Propagation: Geometry Based Algorithm (옥외 소음의 전파: 음 추적 알고리즘)

  • 박지헌;김정태
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.4
    • /
    • pp.339-438
    • /
    • 2002
  • This paper presents a method to simulate noise propagation by a computer for outdoor environment. Sound propagated in 3 dimensional space generates reflected waves whenever it hits boundary surfaces. If a receiver is away from a sound source, it receives multiple sound waves which are reflected from various boundary surfaces in space. The algorithm being developed in this paper is based on a ray sound theory. If we get 3 dimensional geometry input as well as sound sources, we can compute sound effects all over the boundary surfaces. In this paper, we present two approaches to compute sound: the first approach, called forward tracing, traces sounds forwards from sound sources. while the second approach, called geometry based computation, computes possible propagation routes between sources and receivers. We compare two approaches and suggest the geometry based sound computation for outdoor simulation. Also this approach is very efficient in the sense we can save computational time compared to the forward sound tracing. Sound due to impulse-response is governed by physical environments. When a sound source waveform and numerically computed impulse in time is convoluted, the result generates a synthetic sound. This technique can be easily generalized to synthesize realistic stereo sounds for virtual reality, while the simulation result is visualized using VRML.