• Title/Summary/Keyword: 필터 링

Search Result 3,392, Processing Time 0.034 seconds

A Dual Processing Load Shedding to Improve The Accuracy of Aggregate Queries on Clustering Environment of GeoSensor Data Stream (클러스터 환경에서 GeoSensor 스트림 데이터의 집계질의의 정확도 향상을 위한 이중처리 부하제한 기법)

  • Ji, Min-Sub;Lee, Yeon;Kim, Gyeong-Bae;Bae, Hae-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.31-40
    • /
    • 2012
  • u-GIS DSMSs have been researched to deal with various sensor data from GeoSensors in ubiquitous environment. Also, they has been more important for high availability. The data from GeoSensors have some characteristics that increase explosively. This characteristic could lead memory overflow and data loss. To solve the problem, various load shedding methods have been researched. Traditional methods drop the overloaded tuples according to a particular criteria in a single server. Tuple deletion sensitive queries such as aggregation is hard to satisfy accuracy. In this paper a dual processing load shedding method is suggested to improve the accuracy of aggregation in clustering environment. In this method two nodes use replicated stream data for high availability. They process a stream in two nodes by using a characteristic they share stream data. Stream data are synchronized between them with a window as a unit. Then, processed results are merged. We gain improved query accuracy without data loss.

Location Recommendation System based on LBSNS (LBSNS 기반 장소 추천 시스템)

  • Jung, Ku-Imm;Ahn, Byung-Ik;Kim, Jeong-Joon;Han, Ki-Joon
    • Journal of Digital Convergence
    • /
    • v.12 no.6
    • /
    • pp.277-287
    • /
    • 2014
  • In LBSNS(Location-based Social Network Service), users can share locations and communicate with others by using check-in data. The check-in data consists of POI name, category, coordinate and address of locations, nickname of users, evaluating grade of locations, related article/photo/video, and etc. If you analyze the check-in data from the location-based social network service in accordance with your situation, you can provide various customized services. Therefore, In this paper, we develop a location recommendation system based on LBSNS that can utilize the check-in data efficiently. This system analyzes the location category of the check-in data, determines the weighted value of it, and finds out the similarity between users by using the Pearson correlation coefficient. Also, it obtains the preference score of recommended locations by using the collaborated filtering algorithm and then, finds out the distance score by applying the Euclidean's algorithm to the recommended locations and the current users' locations. Finally, it recommends appropriate locations by applying the weighted value to the preference score and the distance score. In addition, this paper approved excellence of the proposed system throughout the experiment using real data.

Smoothed Group-Sparsity Iterative Hard Thresholding Recovery for Compressive Sensing of Color Image (컬러 영상의 압축센싱을 위한 평활 그룹-희소성 기반 반복적 경성 임계 복원)

  • Nguyen, Viet Anh;Dinh, Khanh Quoc;Van Trinh, Chien;Park, Younghyeon;Jeon, Byeungwoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.173-180
    • /
    • 2014
  • Compressive sensing is a new signal acquisition paradigm that enables sparse/compressible signal to be sampled under the Nyquist-rate. To fully benefit from its much simplified acquisition process, huge efforts have been made on improving the performance of compressive sensing recovery. However, concerning color images, compressive sensing recovery lacks in addressing image characteristics like energy distribution or human visual system. In order to overcome the problem, this paper proposes a new group-sparsity hard thresholding process by preserving some RGB-grouped coefficients important in both terms of energy and perceptual sensitivity. Moreover, a smoothed group-sparsity iterative hard thresholding algorithm for compressive sensing of color images is proposed by incorporating a frame-based filter with group-sparsity hard thresholding process. In this way, our proposed method not only pursues sparsity of image in transform domain but also pursues smoothness of image in spatial domain. Experimental results show average PSNR gains up to 2.7dB over the state-of-the-art group-sparsity smoothed recovery method.

A Deblurring Algorithm Combined with Edge Directional Color Demosaicing for Reducing Interpolation Artifacts (컬러 보간 에러 감소를 위한 에지 방향성 컬러 보간 방법과 결합된 디블러링 알고리즘)

  • Yoo, Du Sic;Song, Ki Sun;Kang, Moon Gi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.205-215
    • /
    • 2013
  • In digital imaging system, Bayer pattern is widely used and the observed image is degraded by optical blur during image acquisition process. Generally, demosaicing and deblurring process are separately performed in order to convert a blurred Bayer image to a high resolution color image. However, the demosaicing process often generates visible artifacts such as zipper effect and Moire artifacts when performing interpolation across edge direction in Bayer pattern image. These artifacts are emphasized by the deblurring process. In order to solve this problem, this paper proposes a deblurring algorithm combined with edge directional color demosaicing method. The proposed method is consisted of interpolation step and region classification step. Interpolation and deblurring are simultaneously performed according to horizontal and vertical directions, respectively during the interpolation step. In the region classification step, characteristics of local regions are determined at each pixel position and the directionally obtained values are region adaptively fused. Also, the proposed method uses blur model based on wave optics and deblurring filter is calculated by using estimated characteristics of local regions. The simulation results show that the proposed deblurring algorithm prevents the boosting of artifacts and outperforms conventional approaches in both objective and subjective terms.

Touch-Pen Noise Reduction Using B-Spline Function (B-Spline 곡선을 이용한 터치펜 잡음제거)

  • Lee, Sang-Bum
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.6
    • /
    • pp.121-126
    • /
    • 2017
  • Recently, a lot of people use touch-pen devices such as smart phones and tab computers. To generate the picture and text, a user can give input or control the touch-pen device through simple or multi-touch gestures by touching the screen with a special stylus pen and/or one or more fingers. The accuracy and response time from the moment of contact with the touch board is very important to the touch device. Therefore, research is needed to find a way of removing the noise included in the touch signal quickly and efficiently. In this paper, we propose a method for removing a noise mixed in with a touch point coordinate which has been caused by a input pen on the touch screen. For effective filtering, the fast sampling of the coordinate corresponding to the noise from the input signal is required primarily. Secondly the total compensation of the touch coordinates using the characteristics of the B-Spline curve is applied to correct coordinates of the points. This method can ensure a real-time response than other algorithms. The applied performance evaluation method is comparing error pixels with evaluation values by dividing 10 intervals on the touch pad diagonally. Usually the average error is 7.1 pixels but our proposed method shows an average 4.1 errors. Therefore, our proposed touch pen method can express the input signal on the coordinates more correctly.

An Index-Based Approach for Subsequence Matching Under Time Warping in Sequence Databases (시퀀스 데이터베이스에서 타임 워핑을 지원하는 효과적인 인덱스 기반 서브시퀀스 매칭)

  • Park, Sang-Hyeon;Kim, Sang-Uk;Jo, Jun-Seo;Lee, Heon-Gil
    • The KIPS Transactions:PartD
    • /
    • v.9D no.2
    • /
    • pp.173-184
    • /
    • 2002
  • This paper discuss an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, Kim et al. suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multidimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our approach, we perform extensive experiments. The results reveal that our approach achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

A Mobile Newspaper Application Interface to Enhance Information Accessibility of the Visually Impaired (시각장애인의 정보 접근성 향상을 위한 모바일 신문 어플리케이션 인터페이스)

  • Lee, Seung Hwan;Hong, Seong Ho;Ko, Seung Hee;Choi, Hee Yeon;Hwang, Sung Soo
    • Journal of the HCI Society of Korea
    • /
    • v.11 no.3
    • /
    • pp.5-12
    • /
    • 2016
  • The number of visually-impaired people using a smartphone is currently increasing with the help Text-to-Speech(TTS). TTS converts text data in a mobile application into sound data, and it only allows sequential search. For this reason, the location of buttons and contents inside an application should be determined carefully. However, little attention has been made on TTS service environment during the development of mobile newspaper application. This makes visually-impaired people difficult to use these applications. Furthermore, a mobile application interface which also reflects the desire of the low vision is necessary. Therefore, this paper presents a mobile newspaper interface which considers the accessibility and the desire of various visually impaired people. To this end, the proposed interface locates buttons with the consideration of TTS service environment and provides search functionality. The proposed interface also enables visually impaired people to use the application smoothly by filtering out the words that are pronounced improperly and providing the proper explanation for every button. Finally, several functionalities such as increasing font size and color reversal are implemented for the low vision. Simulation results show that the proposed interface achieves better performance than other applications in terms of search speed and usability.

Measurement and Analysis of P2P Traffic in Campus Networks Under Firewall (방화벽이 존재하는 캠퍼스 망에서의 P2P 트래픽 측정 및 분석)

  • Lee, Young-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11B
    • /
    • pp.750-757
    • /
    • 2005
  • This paper reports on the study of P2P traffic behaviors in a high-speed campus network under a simple firewall which drops packets with default port numbers for the well-blown P2P applications. Among several ways of detecting P2P traffic, the easiest method is to filter out packets with the default port number of each P2P application. After deploying the port-based firewall against P2P-traffic, it is expected that the amount of P2P traffic will be decreased. However, during the eight-month measurement period, three new commercial P2P applications have been identified and their traffic usages have reached up to $30/5.6\%$ of the total outbound/inbound traffic volumes at the end of the measurement period. In addition, the most famous P2P application, eDonkey, has adapted and has escaped detection through port hopping. The measurement result shows that the amount of eDonkey traffic is around $6.7/4.0\%$ of the total outbound/inbound traffic volume. From the measurement results, it is observed that the port-based firewall is not effective to limit the usage of P2P applications and that the P2P traffic is steadily growing due to not only the evolution of existing P2P applications such as port hopping but also appearances of new P2P applications.

Investigations on Techniques and Applications of Text Analytics (텍스트 분석 기술 및 활용 동향)

  • Kim, Namgyu;Lee, Donghoon;Choi, Hochang;Wong, William Xiu Shun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.471-492
    • /
    • 2017
  • The demand and interest in big data analytics are increasing rapidly. The concepts around big data include not only existing structured data, but also various kinds of unstructured data such as text, images, videos, and logs. Among the various types of unstructured data, text data have gained particular attention because it is the most representative method to describe and deliver information. Text analysis is generally performed in the following order: document collection, parsing and filtering, structuring, frequency analysis, and similarity analysis. The results of the analysis can be displayed through word cloud, word network, topic modeling, document classification, and semantic analysis. Notably, there is an increasing demand to identify trending topics from the rapidly increasing text data generated through various social media. Thus, research on and applications of topic modeling have been actively carried out in various fields since topic modeling is able to extract the core topics from a huge amount of unstructured text documents and provide the document groups for each different topic. In this paper, we review the major techniques and research trends of text analysis. Further, we also introduce some cases of applications that solve the problems in various fields by using topic modeling.

Infrared-based User Location Tracking System for Indoor Environments (적외선 기반 실내 사용자 위치 추적 시스템)

  • Jung, Seok-Min;Jung, Woo-Jin;Woo, Woon-Tack
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.5
    • /
    • pp.9-20
    • /
    • 2005
  • In this paper, we propose ubiTrack, a system which tracks users' location in indoor environments by employing infrared-based proximity method. Most of recently developed systems have focussed on performance and accuracy. For this reason, they adopted the idea of centralized management, which gathers all information in a main system to monitor users' location. However, these systems raise privacy concerns in ubiquitous computing environments where tons of sensors are seamlessly embedded into environments. In addition, centralized systems also need high computational power to support multiple users. The proposed ubiTrack is designed as a passive mobile architecture to relax privacy problems. Moreover, ubiTrack utilizes appropriate area as a unit to efficiently track users. To achieve this, ubiTrack overlaps each sensing area by utilizing the TDM (Time-Division Multiplexing) method. Additionally, ubiTrack exploits various filtering methods at each receiver and utilization module. The filtering methods minimize unexpected noise effect caused by external shock or intensity weakness of ID signal at the boundary of sensing area. ubiTrack can be applied not only to location-based applications but also to context-aware applications because of its associated module. This module is a part of middleware to support communication between heterogeneous applications or sensors in ubiquitous computing environments.