• Title/Summary/Keyword: real-time update

Search Result 271, Processing Time 0.024 seconds

Robust Vision Based Algorithm for Accident Detection of Crossroad (교차로 사고감지를 위한 강건한 비젼기반 알고리즘)

  • Jeong, Sung-Hwan;Lee, Joon-Whoan
    • The KIPS Transactions:PartB
    • /
    • v.18B no.3
    • /
    • pp.117-130
    • /
    • 2011
  • The purpose of this study is to produce a better way to detect crossroad accidents, which involves an efficient method to produce background images in consideration of object movement and preserve/demonstrate the candidate accident region. One of the prior studies proposed an employment of traffic signal interval within crossroad to detect accidents on crossroad, but it may cause a failure to detect unwanted accidents if any object is covered on an accident site. This study adopted inverse perspective mapping to control the scale of object, and proposed different ways such as producing robust background images enough to resist surrounding noise, generating candidate accident regions through information on object movement, and by using edge information to preserve and delete the candidate accident region. In order to measure the performance of proposed algorithm, a variety of traffic images were saved and used for experiment (e.g. recorded images on rush hours via DVR installed on crossroad, different accident images recorded in day and night rainy days, and recorded images including surrounding noise of lighting and shades). As a result, it was found that there were all 20 experiment cases of accident detected and actual effective rate of accident detection amounted to 76.9% on average. In addition, the image processing rate ranged from 10~14 frame/sec depending on the area of detection region. Thus, it is concluded that there will be no problem in real-time image processing.

A Study on the Application method of Digital Media in Commercial Space - Using Persona-based Scenario Approach - (상업공간 디지털미디어 적용방안에 관한 연구 - 페르소나 기반 사용자 시나리오 기법으로 -)

  • An, Se-Yun;Kim, So-Yeon;Cao, Wen-jia
    • Korean Institute of Interior Design Journal
    • /
    • v.26 no.1
    • /
    • pp.33-42
    • /
    • 2017
  • Interior design especially the design developments for commercial spaces should ensure the economy of spaces. This is the marketing for space. It is necessary to understand the design elements of commercial space for the efficient using of digital media of space marketing. In this research decided to design application schemes for shopping mall by searching fashion shopping behaviors of users with persona-base scenario approach. Collected the information of users behavior base on case analysis of advance research to make personas. And develop scenario base personas for knowing the needs of users. And then made 4 schemes as the solution. Scheme 1. Customers can get the information and communication with the staff through with media screen in one room of shopping mall. The data of customers can be recorded for providing information or product recommendation personality. Forecast to preferred by group trip or customers that don't like walking around in shopping mall. Scheme 2. Install a media screen at entrance of a store in shopping mall and show special effect to raise customers' attention who walk through from the front of the store. Through with this customers will stay for long time and raise curiosity to get in the store. And the media screen also provide information of store and products. Scheme 3. Customers can get the information of products with using smart phone to scan QR cord in labels of products and record. Customers can finish whole shopping behaviors without the help of store staff. And can make buying decision even have left shopping mall as a online mode. Scheme 4. Store managers can record the products and the environment of store with 360 camera and update to website. Then customers can browse the virtual space with VR glasses. That make customers can have the real shopping experience without being in the store. In this study, have presented schemes of digital media in commercial space. But there are various of commercial space. In this study was presented schemes for shopping mall by searching fashion shopping behaviors of users. And look forward the researches about specific space setting and other type of commercial space for space development.

An Origin-Centric Communication Scheme to Support Sink Mobility for Continuous Object Detection in IWSNs (산업용 무선 센서망을 이용한 연속개체 탐지에서 이동 싱크 지원을 위한 발원점 중심의 통신방안)

  • Kim, Myung-Eun;Kim, Cheonyong;Yim, Yongbin;Kim, Sang-Ha;Son, Young-Sung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.12
    • /
    • pp.301-312
    • /
    • 2018
  • In industrial wireless sensor networks, the continuous object detection such as fire or toxic gas detection is one of major applications. A continuous object occurs at a specific point and then diffuses over a wide area. Therefore, many studies have focused on accurately detecting a continuous object and delivering data to a static sink with an energy-efficient way. Recently, some applications such as fire suppression require mobile sinks to provide real-time response. However, the sink mobility support in continuous object detection brings challenging issues. The existing approaches supporting sink mobility are designed for individual object detection, so they establish one-to-one communication between a source and a mobile sink for location update. But these approaches are not appropriate for a continuous object detection since a mobile sink should establish one-to-many communication with all sources. The one-to-many communication increases energy consumption and thus shortens the network lifetime. In this paper, we propose the origin-centric communication scheme to support sink mobility in a continuous object detection. Simulation results verify that the proposed scheme surpasses all the other work in terms of energy consumption.

Development of V2I2V Communication-based Collision Prevention Support Service Using Artificial Neural Network (인공신경망을 활용한 V2I2V 통신 기반 차량 추돌방지 지원 서비스 개발)

  • Tak, Sehyun;Kang, Kyeongpyo;Lee, Donghoun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.126-141
    • /
    • 2019
  • One of the Cooperative Intelligent Transportation System(C-ITS) priority services is collision prevention support service. Several studies have considered V2I2V communication-based collision prevention support services using Artificial Neural Networks(ANN). However, such services still show some issues due to a low penetration of C-ITS devices and large delay, particularly when loading massive traffic data into the server in the C-ITS center. This study proposes the Artificial Neural Network-based Collision Warning Service(ACWS), which allows upstream vehicle to update pre-determined weights involved in the ANN by using real-time sectional traffic information. This research evaluates the proposed service with respect to various penetration rates and delays. The evaluation result shows the performance of the ACWS increases as the penetration rate of the C-ITS devices in the vehicles increases or the delay decreases. Furthermore, it reveals a better performance is observed in more advanced ANN model-based ACWS for any given set of conditions.

Study on Chinese Youth Film Expression through Defamiliarization :Taking Us and Them(后来的我们) as Example ('낯설게 하기'를 통한 중국 청년 영화의 표현에 관한 연구 : 중국 영화 <먼 훗날 우리> (后来的我们)를 중심으로)

  • Zhang, Lin
    • Journal of Korea Entertainment Industry Association
    • /
    • v.14 no.1
    • /
    • pp.117-124
    • /
    • 2020
  • Chinese youth films fall into the dilemma of continuous development after experiencing rapid development from 2013 to 2017. How to update the creative ideas and methods of the films, arouse the audience's interest in watching and stimulate a new aesthetic experience has become a focal point for the creators who concern about the Chinese film market. "Us and Them" is a successful youth film in 2018. Its creative practice proves that defamiliarization can provide theoretical and methodological basis for the creation of Chinese youth films. Therefore, taking the current situation of Chinese youth film as the research background, treating "Us and Them" as the research object, the defamiliarization of narrative discourse and narrative content used in the film are analyzed. First, the defamiliarization of narrative discourse composed of scenes, characters and plots makes the film "stand out" from the real world. Second, the defamiliarization of narrative content composed of metropolis adoration, self-identity and hometown affection makes the film "stand out" from the existing context. These methods of creation not only meet the needs of the contemporary, but also provide an effective reference for the creation of other youth films. Research will be needed to utilize the elements of defamiliarization through the analysis of the successful case in spite of the time change.

The study of security management for application of blockchain technology in the Internet of Things environment (Focusing on security cases in autonomous vehicles including driving environment sensing data and occupant data) (사물인터넷 환경에서 블록체인 기술을 이용한 보안 관리에 관한 소고(주행 환경 센싱 데이터 및 탑승자 데이터를 포함한 자율주행차량에서의 보안 사례를 중심으로))

  • Jang Mook KANG
    • Convergence Security Journal
    • /
    • v.22 no.4
    • /
    • pp.161-168
    • /
    • 2022
  • After the corona virus, as non-face-to-face services are activated, domain services that guarantee integrity by embedding sensing information of the Internet of Things (IoT) with block chain technology are expanding. For example, in areas such as safety and security using CCTV, a process is required to safely update firmware in real time and to confirm that there is no malicious intrusion. In the existing safe security processing procedures, in many cases, the person in charge performing official duties carried a USB device and directly updated the firmware. However, when private blockchain technology such as Hyperledger is used, the convenience and work efficiency of the Internet of Things environment can be expected to increase. This article describes scenarios in how to prevent vulnerabilities in the operating environment of various customers such as firmware updates and device changes in a non-face-to-face environment. In particular, we introduced the optimal blockchain technique for the Internet of Things (IoT), which is easily exposed to malicious security risks such as hacking and information leakage. In this article, we tried to present the necessity and implications of security management that guarantees integrity through operation applying block chain technology in the increasingly expanding Internet of Things environment. If this is used, it is expected to gain insight into how to apply the blockchain technique to guidelines for strengthening the security of the IoT environment in the future.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

A Real-Time Head Tracking Algorithm Using Mean-Shift Color Convergence and Shape Based Refinement (Mean-Shift의 색 수렴성과 모양 기반의 재조정을 이용한 실시간 머리 추적 알고리즘)

  • Jeong Dong-Gil;Kang Dong-Goo;Yang Yu Kyung;Ra Jong Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.1-8
    • /
    • 2005
  • In this paper, we propose a two-stage head tracking algorithm adequate for real-time active camera system having pan-tilt-zoom functions. In the color convergence stage, we first assume that the shape of a head is an ellipse and its model color histogram is acquired in advance. Then, the min-shift method is applied to roughly estimate a target position by examining the histogram similarity of the model and a candidate ellipse. To reflect the temporal change of object color and enhance the reliability of mean-shift based tracking, the target histogram obtained in the previous frame is considered to update the model histogram. In the updating process, to alleviate error-accumulation due to outliers in the target ellipse of the previous frame, the target histogram in the previous frame is obtained within an ellipse adaptively shrunken on the basis of the model histogram. In addition, to enhance tracking reliability further, we set the initial position closer to the true position by compensating the global motion, which is rapidly estimated on the basis of two 1-D projection datasets. In the subsequent stage, we refine the position and size of the ellipse obtained in the first stage by using shape information. Here, we define a robust shape-similarity function based on the gradient direction. Extensive experimental results proved that the proposed algorithm performs head hacking well, even when a person moves fast, the head size changes drastically, or the background has many clusters and distracting colors. Also, the propose algorithm can perform tracking with the processing speed of about 30 fps on a standard PC.

One-Dimensional Consolidation Simulation of Kaolinte using Geotechnical Online Testing Method (온라인 실험을 이용한 카올리나이트 점토의 일차원 압밀 시뮬레이션)

  • Kwon, Youngcheul
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.4C
    • /
    • pp.247-254
    • /
    • 2006
  • Online testing method is one of the numerical experiment methods using experimental information for a numerical analysis directly. The method has an advantage in that analysis can be conducted without using an idealized mechanical model, because mechanical properties are updated from element test for a numerical analysis in real time. The online testing method has mainly been used for the geotechnical seismic engineering, whose major target is sand. A testing method that may be applied to a consolidation problem has recently been developed and laboratory and field verifications have been tried. Although related research thus far has mainly used a method to update average reaction for a numerical analysis by positioning an element tests at the center of a consolidation layer, a weakness that accuracy of the analysis can be impaired as the thickness of the consolidation layer becomes more thicker has been pointed out regarding the method. To clarify the effectiveness and possible analysis scope of the online testing method in relation to the consolidation problem, we need to review the results by applying experiment conditions that may completely exclude such a factor. This research reviewed the results of the online consolidation test in terms of reproduction of the consolidation settlement and the dissipation of excess pore water pressure of a clay specimen by comparing the results of an online consolidation test and a separated-type consolidation test carried out under the same conditions. As a result, the online consolidation test reproduced the change of compressibility according effective stress of clay without a huge contradiction. In terms of the dissipation rate of excess pore water pressure, however, the online consolidation test was a little faster. In conclusion, experiment procedure needs to improve in a direction that hydraulic conductivity can be updated in real time so as to more precisely predict the dissipation of excess pore water pressure. Further research or improvement should be carried out with regard to the consolidation settlement after the end of the dissipation of excess pore water pressure.

A Single Index Approach for Time-Series Subsequence Matching that Supports Moving Average Transform of Arbitrary Order (단일 색인을 사용한 임의 계수의 이동평균 변환 지원 시계열 서브시퀀스 매칭)

  • Moon Yang-Sae;Kim Jinho
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.42-55
    • /
    • 2006
  • We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.