• Title/Summary/Keyword: segment speed

Search Result 185, Processing Time 0.027 seconds

Development of an Image Segmentation Algorithm using Dynamic Programming for Object ID Marks in Automation Process (동적계획법을 이용한 자동화 공정에서의 제품 ID 마크 자동분할 알고리듬 개발)

  • 유동훈;안인모;김민성;강동중
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.8
    • /
    • pp.726-733
    • /
    • 2004
  • This paper presents a method to segment object ID(identification) marks on poor quality images under uncontrolled lighting conditions of automated inspection process. The method is based on dynamic programming using multiple templates and normalized gray-level correlation (NGC) method. If the lighting condition is not good and hence, we can not control the image quality, target image to be inspected presents poor quality ID marks and it is not easy to identify and recognize the ID characters. Conventional several methods to segment the interesting ID mark regions fail on the bad quality images. In this paper, we propose a multiple template method, which uses combinational relation of multiple templates from model templates to match several characters of the inspection images. To increase the computation speed to segment the ID mark regions, we introduce the dynamic programming based algorithm. Experimental results using images from real factory automation(FA) environment are presented.

The Enforcement Scheme of the Overspeeding vehicle by Travel Speed (구간과속단속시스템의 도입 방안 연구)

  • Han, Won-Seop;Kim, Man-Bae;Hyeon, Cheol-Seung;Yu, Seong-Jun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.1
    • /
    • pp.21-32
    • /
    • 2005
  • At present automated speed enforcement system in Korea control overspeed vehicle only in the specific spot. Because the drivers generally recognize the previous stated fact, they reduce a speed only in the establishment location of systems and increase rapidly again as soon as it passes the location. we have known that the rate of traffic risk at the tunnel, bridge and curve road segment is higher than other road section. Therefore, it needs speed control in them. In such a case, it is necessary to establish the automated traffic enforcement system based on the travel time speed of an individual vehicle over a pre defined stretch of road. In this study, the application limit of existing spot overspeed enforcement system was studied through an analysis of traffic flow characteristics in the tunnel, bridge and curve section. Also we found out the optimal distance of segment and the most suitable location to an application of the overspeed vehicle by travel time speed through an analysis of the road structure, traffic condition and accident numbers in the road.

A Clustering Scheme for Discovering Congested Routes on Road Networks

  • Li, He;Bok, Kyoung Soo;Lim, Jong Tae;Lee, Byoung Yup;Yoo, Jae Soo
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1836-1842
    • /
    • 2015
  • On road networks, the clustering of moving objects is important for traffic monitoring and routes recommendation. The existing schemes find out density route by considering the number of vehicles in a road segment. Since they don’t consider the features of each road segment such as width, length, and directions in a road network, the results are not correct in some real road networks. To overcome such problems, we propose a clustering method for congested routes discovering from the trajectories of moving objects on road networks. The proposed scheme can be divided into three steps. First, it divides each road network into segments with different width, length, and directions. Second, the congested road segments are detected through analyzing the trajectories of moving objects on the road network. The saturation degree of each road segment and the average moving speed of vehicles in a road segment are computed to detect the congested road segments. Finally, we compute the final congested routes by using a clustering scheme. The experimental results showed that the proposed scheme can efficiently discover the congested routes in different directions of the roads.

A Case study of the requirement verification model development for High Speed Railway Systems (고속철도시스템 요구사항 검증 모델 개발 사례)

  • Jeong, Jae-Deok;Lee, Jae-Cheon;Kim, Chan-Muk;Yun, Jae-Han;Wang, Jong-Bae;Choe, Yo-Cheol
    • 시스템엔지니어링워크숍
    • /
    • s.6
    • /
    • pp.126-129
    • /
    • 2005
  • Systems engineering requirement verification model developmetn for High Speed Railway systems in progress is a national large system development program that is not only large-size and complex but also multi-disciplinary in nature. For the High Speed Railway TEP development, verification requirements that could verify system function, performance, and constraint, should be derived from SSS(system Segment specification). Hereafter, this could be referred to as verification requirements. System engineering process establishes traceability between verification requirements and system requirements. These tasks could be accomplished by the schema. using computer-aided Systems Engineering tool(CORE), High Speed Railway program can become a database and other system related to High Speed Railway program will be developed effectively and efficiently.

  • PDF

[ $C^1$ ] Continuous Piecewise Rational Re-parameterization

  • Liang, Xiuxia;Zhang, Caiming;Zhong, Li;Liu, Yi
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.59-64
    • /
    • 2006
  • A new method to obtain explicit re-parameterization that preserves the curve degree and parametric domain is presented in this paper. The re-parameterization brings a curve very close to the arc length parameterization under $L_2$ norm but with less segmentation. The re-parameterization functions we used are $C^1$ continuous piecewise rational linear functions, which provide more flexibility and can be easily identified by solving a quadratic equation. Based on the outstanding performance of Mobius transformation on modifying pieces with monotonic parametric speed, we first create a partition of the original curve, in which the parametric speed of each segment is of monotonic variation. The values of new parameters corresponding to the subdivision points are specified a priori as the ratio of its cumulative arc length and its total arc length. $C^1$ continuity conditions are imposed to each segment, thus, with respect to the new parameters, the objective function is linear and admits a closed-form optimization. Illustrative examples are also given to assess the performance of our new method.

Mobile Performance Evaluation of ISDB-T Full-Segment TV Receiver (ISDB-T 풀세그 TV 수신기 이동 성능 평가)

  • Gu, Young Mo
    • Journal of Broadcast Engineering
    • /
    • v.23 no.2
    • /
    • pp.293-301
    • /
    • 2018
  • In ISDB-T, which is Japanese digital terrestrial TV specification based on OFDM technology, 6MHz bandwidth is divided into 13 segments. Twelve segments (full-seg) are used for high definition broadcasting for fixed receivers and one segment (one-seg) for mobile receivers. Though one-seg supports high speed mobility by using QPSK modulation, it is not suitable for large display mobile devices because of its low data rate. Full-seg using 64QAM modulation also suffers from its low mobile performance. In this paper, mobile performance of ISDB-T full-seg receiver is evaluated by applying sub-carrier interference removing scheme, high speed mobile channel estimation scheme and antenna diversity scheme.

Performance Improvement for Robust Eye Detection Algorithm under Environmental Changes (환경변화에 강인한 눈 검출 알고리즘 성능향상 연구)

  • Ha, Jin-gwan;Moon, Hyeon-joon
    • Journal of Digital Convergence
    • /
    • v.14 no.10
    • /
    • pp.271-276
    • /
    • 2016
  • In this paper, we propose robust face and eye detection algorithm under changing environmental condition such as lighting and pose variations. Generally, the eye detection process is performed followed by face detection and variations in pose and lighting affects the detection performance. Therefore, we have explored face detection based on Modified Census Transform algorithm. The eye has dominant features in face area and is sensitive to lighting condition and eye glasses, etc. To address these issues, we propose a robust eye detection method based on Gabor transformation and Features from Accelerated Segment Test algorithms. Proposed algorithm presents 27.4ms in detection speed with 98.4% correct detection rate, and 36.3ms face detection speed with 96.4% correct detection rate for eye detection performance.

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.618-636
    • /
    • 1997
  • DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

  • PDF

An Implementation of Pipelined Prallel Processing System for Multi-Access Memory System

  • Lee, Hyung;Cho, Hyeon-Koo;You, Dae-Sang;Park, Jong-Won
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.149-151
    • /
    • 2002
  • We had been developing the variety of parallel processing systems in order to improve the processing speed of visual media applications. These systems were using multi-access memory system(MAMS) as a parallel memory system, which provides the capability of the simultaneous accesses of image points in a line-segment with an arbitrary degree, which is required in many low-level image processing operations such as edge or line detection in a particular direction, and so on. But, the performance of these systems did not give a faithful speed because of asynchronous feature between MAMS and processing elements. To improve the processing speed of these systems, we have been investigated a pipelined parallel processing system using MAMS. Although the system is considered as being the single instruction multiple data(SIMD) type like the early developed systems, the performance of the system yielded about 2.5 times faster speed.

  • PDF

Consolidation of Segment Powder for Diamond Tool by Magnetic Pulsed Compaction (자기펄스 압축성형법에 의한 다이아몬드 공구용 세그먼트 분말 성형)

  • Yun, J.S.;Lee, J.G.;Lee, M.K.;Rhee, C.K.;Park, M.S.;Hong, S.J.
    • Journal of Powder Materials
    • /
    • v.15 no.5
    • /
    • pp.378-385
    • /
    • 2008
  • This article presents the successful consolidation of the mixed Co and Diamond powders for a drilling segment by the combined application of magnetic pulsed compaction (MPC) and subsequent sintering, and their properties were analyzed. Homogeneous hardness (Hv 220) and density (97%) of sintered bulks fabricated by MPC were obtained by the new technique, where higher pressure has been employed for short period of time than that of general process. A fine microstructure and homogeneous hardness in the consolidated bulk were observed without cracks. Relatively higher drilling speed of 9.61 cm/min and life time of 6.55 m were found to the MPCed specimens, whereas the value of the specimens fabricated by general process was 11.71 cm/min and 7.96 m, respectively. A substantial improvement of mechanical properties of segment was achieved through this study.