• Title/Summary/Keyword: On-line algorithm

검색결과 2,422건 처리시간 0.037초

Extraction of Features in key frames of News Video for Content-based Retrieval (내용 기반 검색을 위한 뉴스 비디오 키 프레임의 특징 정보 추출)

  • Jung, Yung-Eun;Lee, Dong-Seop;Jeon, Keun-Hwan;Lee, Yang-Weon
    • The Transactions of the Korea Information Processing Society
    • /
    • 제5권9호
    • /
    • pp.2294-2301
    • /
    • 1998
  • The aim of this paper is to extract features from each news scenes for example, symbol icon which can be distinct each broadcasting corp, icon and caption which are has feature and important information for the scene in respectively, In this paper, we propose extraction methods of caption that has important prohlem of news videos and it can be classified in three steps, First of al!, we converted that input images from video frame to YIQ color vector in first stage. And then, we divide input image into regions in clear hy using equalized color histogram of input image, In last, we extracts caption using edge histogram based on vertical and horizontal line, We also propose the method which can extract news icon in selected key frames by the difference of inter-histogram and can divide each scene by the extracted icon. In this paper, we used comparison method of edge histogram instead of complex methcxls based on color histogram or wavelet or moving objects, so we shorten computation through using simpler algorithm. and we shown good result of feature's extraction.

  • PDF

A Study on Stereo Visualization of the X-ray Scanned Image Based on Dual-line Sensors (듀얼센서 기반 X-선 검색영상 스테레오 가시화 연구)

  • Lee, Nam-Ho;Hwang, Young-Gwan;Park, Jong-Won;Lim, Yong-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제14권9호
    • /
    • pp.2083-2090
    • /
    • 2010
  • This paper presents a 3-D visualization technique using stereo radioactive images to provide efficient inspection of fast moving cargo objects. The proposed technique can be used for such objects which CT or MRI cannot inspect due to restricted scan environment. Stereo radioactive images are acquired from a specially designed equipment which consists of a X-ray source, linear radioactive sensors, and a moving stage. Two radioactive sensors are installed so that rectified stereo X-ray images of objects are acquired. Using the stereo X-ray images, we run a matching algorithm to find the correspondences between the images and reconstruct 3-D shapes of real objects. The objects are put in a parallelepiped box to simulate cargo inspection. Three real objects are tested and reconstructed. Due to the inherent ambiguity in the stereo X-ray images, we reconstruct 3-D shapes of the edges of the objects. The experimental results show the proposed technique can provide efficient visualization for cargo inspection.

Modified Recursive PC (수정된 반복 주성분 분석 기법에 대한 연구)

  • Kim, Dong-Gyu;Kim, Ah-Hyoun;Kim, Hyun-Joong
    • The Korean Journal of Applied Statistics
    • /
    • 제24권5호
    • /
    • pp.963-977
    • /
    • 2011
  • PCA(Principal Component Analysis) is a well-studied statistical technique and an important tool for handling multivariate data. Although many algorithms exist for PCA, most of them are unsuitable for real time applications or high dimensional problems. Since it is desirable to avoid extensive matrix operations in such cases, alternative solutions are required to calculate the eigenvalues and eigenvectors of the sample covariance matrix. Erdogmus et al. (2004) proposed Recursive PCA(RPCA), which is a fast adaptive on-line solution for PCA, based on the first order perturbation theory. It facilitates the real-time implementation of PCA by recursively approximating updated eigenvalues and eigenvectors. However, the performance of the RPCA method becomes questionable as the size of newly-added data increases. In this paper, we modified the RPCA method by taking advantage of the mathematical relation of eigenvalues and eigenvectors of sample covariance matrix. We compared the performance of the proposed algorithm with that of RPCA, and found that the accuracy of the proposed method remarkably improved.

AUTOMATIC MULTITORCH WELDING SYSTEM WITH HIGH SPEED

  • Moon, H.S;Kim, J.S.;Jung, M.Y.;Kweon, H.J.;Kim, H.S.;Youn, J.G.
    • Proceedings of the KWS Conference
    • /
    • 대한용접접합학회 2002년도 Proceedings of the International Welding/Joining Conference-Korea
    • /
    • pp.320-323
    • /
    • 2002
  • This paper presents a new generation of system for pressure vessel and shipbuilding. Typical pressure vessel and ship building weld joint preparations are either traditional V, butt, fillet grooves or have narrow or semi narrow gap profiles. The fillet and U groove are prevalently used in heavy industries and shipbuilding to melt and join the parts. Since the wall thickness can be up to 6" or greater, welds must be made in many layers, each layer containing several passes. However, the welding time for the conventional processes such as SAW(Submerged Arc Welding) and FCAW(Flux Cored Arc Welding) can be many hours. Although SAW and FCAW are normally a mechanized process, pressure vessel and ship structures welding up to now have usually been controlled by a full time operator. The operator has typically been responsible for positioning each individual weld run, for setting weld process parameters, for maintaining flux and wire levels, for removing slag and so on. The aim of the system is to develop a high speed welding system with multitorch for increasing the production speed on the line and to remove the need for the operator so that the system can run automatically for the complete multi-torch multi-layer weld. To achieve this, a laser vision sensor, a rotating torch and an image processing algorithm have been made. Also, the multitorch welding system can be applicable for the fine grained steel because of the high welding speed and lower heat input compare to a conventional welding process.

  • PDF

Estimation of Gamut Boundary based on Modified Segment Maxima to Reduce Color Artifacts (컬러 결점을 줄이기 위한 수정된 segment maxima 기반의 색역 추정)

  • Ha, Ho-Gun;Jang, In-Su;Lee, Tae-Hyoung;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • 제48권3호
    • /
    • pp.99-105
    • /
    • 2011
  • In this paper, we proposed a method for estimating an accurate gamut based on segment maxima method. According to the number of segments in the segment maxima, a local concavity is generated in the vicinity of lightness axis or a gamut is reduced in high chroma region. It induces artifacts or deterioration of the image quality. To remove these artifacts, the number of segment is determined according to the number of samples. and a local concavity is modified by extending a detected concave point to the line connecting two adjacent boundary points. Experimental results show that the contours in a uniform color region and speckle artifacts from the conventional segment maxima algorithm are removed.

Calculating of 3-Dimensional Temperature Distribution for High-Temperature Exhaust Gas Using CT-TDLAS (CT-TDLAS를 이용한 고온 배기가스의 3차원 온도분포 측정)

  • YOON, DONGIK;KIM, JOONHO;JEON, MINGYU;CHOI, DOOWON;CHO, GYEONGRAE;DOH, DEOGHEE
    • Transactions of the Korean hydrogen and new energy society
    • /
    • 제29권1호
    • /
    • pp.97-104
    • /
    • 2018
  • 3-dimensional temperature distribution of the exhaust gas of a fire flame of LPG have been measured by the constructed CT-TDLAS system. 3-Dimensional temperature distributions are measured by 2 layers of CT-TDLAS. Each layer has $8{\times}8$ laser beams implying the temperatures of 64 meshes are measured. SMART algorithm has been adopted for reconstructing the absorption coefficients on the meshes. The line strengths at 6 representative wave lengths of $H_2O$ have been used for obtaining the absorption spectra of the exhaust gas. The temperature distributions measured by the constructed CT-TDLAS have been compared with those by the thermocouples. The relative errors measured between by thermocouple and CT-TDLAS were 13% in average and 33% at maximum. The similarity of temperature distribution between by thermocouples and by CT-TDLAS has been shown at the lower layer than the upper layer implying an unstability of combustions.

A Design of Power Management and Control System using Digital Protective Relay for Motor Protection, Fault Diagnosis and Control (모터 보호, 고장진단 및 제어를 위한 디지털 보호계전기 활용 전력감시제어 시스템 설계)

  • Lee, Sung-Hwan;Ahn, Ihn-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • 제49권10호
    • /
    • pp.516-523
    • /
    • 2000
  • In this paper, intelligent methods using digital protective relay in power supervisory control system is developed in order to protect power systems by means of timely fault detection and diagnosis during operation for induction motor which has various load environments and capacities in power systems. The spectrum pattern of input currents was used to monitor to state of induction motors, and by clustering the spectrum pattern of input currents, the newly occurrence of spectrums pattern caused by faults were detected. For diagnosis of the fault detected, the fuzzy fault tree was derived, and the fuzzy relation equation representing the relation between an induction motor fault and each fault type, was solved. The solution of the fuzzy relation equation shows the possibility of each fault's occurring. The results obtained are summarized as follows: 1) The test result on the basis of KEMC1120 and IEC60255, show that the operation time error of the digital motor protective relay is improved within ${\pm}5%$. 2) Using clustering algorithm by unsupervisory learning, an on-line fault detection method, not affected by the characteristics of loads and rates, was implemented, and the degree of dependency by experts during fault detection was reduced. 3) With the fuzzy fault tree, fault diagnosis process became systematic and expandable to the whole system, and the diagnosis for sub-systems can be made as an object-oriented module.

  • PDF

Development of On-line Judge System based on Block Programming Environment (블록 프로그래밍 환경 기반 온라인 평가 시스템 개발)

  • Shim, Jaekwoun;Chae, Jeong Min
    • The Journal of Korean Association of Computer Education
    • /
    • 제21권4호
    • /
    • pp.1-10
    • /
    • 2018
  • Block programming environment, which is represented by Scratch in elementary and middle school programming education, is suitable for learner's characteristics and cognitive level, and is recommended not only for beginners. Transference to the text programming environment after the block programming is essential for understanding the data processing process, understanding the accuracy and efficiency aspects of algorithms, and creating SW activity. In addition, it is presented step by step in the programming curriculum. In this study, developed WithBlock the online evaluation system for the purpose of transference from a block programming to a text programming environment. The developed system can solve the same algorithm problem in both block and text programming environment, and it can be used for elementary and secondary programming education by automatically scoring the written code and providing immediate feedback. In order to applicable to programming education in elementary and secondary surveyed the usability, learning possibility, interest and satisfaction of WithBlock. The results of the survey showed that it can be used for programming education.

A Novel Test Structure for Process Control Monitor for Un-Cooled Bolometer Area Array Detector Technology

  • Saxena, R.S.;Bhan, R.K.;Jalwania, C.R.;Lomash, S.K.
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제6권4호
    • /
    • pp.299-312
    • /
    • 2006
  • This paper presents the results of a novel test structure for process control monitor for uncooled IR detector technology of microbolometer arrays. The proposed test structure is based on resistive network configuration. The theoretical model for resistance of this network has been developed using 'Compensation' and 'Superposition' network theorems. The theoretical results of proposed resistive network have been verified by wired hardware testing as well as using an actual 16x16 networked bolometer array. The proposed structure uses simple two-level metal process and is easy to integrate with standard CMOS process line. The proposed structure can imitate the performance of actual fabricated version of area array closely and it uses only 32 pins instead of 512 using conventional method for a $16{\times}16$ array. Further, it has been demonstrated that the defective or faulty elements can be identified vividly using extraction matrix, whose values are quite similar(within the error of 0.1%), which verifies the algorithm in small variation case(${\sim}1%$ variation). For example, an element, intentionally damaged electrically, has been shown to have the difference magnitude much higher than rest of the elements(1.45 a.u. as compared to ${\sim}$ 0.25 a.u. of others), confirming that it is defective. Further, for the devices having non-uniformity ${\leq}$ 10%, both the actual non-uniformity and faults are predicted well. Finally, using our analysis, we have been able to grade(pass or fail) 60 actual devices based on quantitative estimation of non-uniformity ranging from < 5% to > 20%. Additionally, we have been able to identify the number of bad elements ranging from 0 to > 15 in above devices.

Two-Phase Localization Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서의 2단계 위치 추정 알고리즘)

  • Song Ha-Ju;Kim Sook-Yeon;Kwon Oh-Heum
    • Journal of Korea Multimedia Society
    • /
    • 제9권2호
    • /
    • pp.172-188
    • /
    • 2006
  • Sensor localization is one of the fundamental problems in wireless sensor networks. Previous localization algorithms can be classified into two categories, the GGB (Global Geometry-Based) approaches and the LGB (Local Geometry-Based). In the GGB approaches, there are a fixed set of reference nodes of which the coordinates are pre-determined. Other nodes determine their positions based on the distances from the fixed reference nodes. In the LGB approaches, meanwhile, the reference node set is not fixed, but grows up dynamically. Most GGB algorithms assume that the nodes are deployed in a convex shape area. They fail if either nodes are in a concave shape area or there are obstacles that block the communications between nodes. Meanwhile, the LGB approach is vulnerable to the errors in the distance estimations. In this paper, we propose new localization algorithms to cope with those two limits. The key technique employed in our algorithms is to determine, in a fully distributed fashion, if a node is in the line-of-sight from another. Based on the technique, we present two localization algorithms, one for anchor-based, another for anchor-free localization, and compare them with the previous algorithms.

  • PDF