• Title/Summary/Keyword: Descriptor system

Search Result 217, Processing Time 0.024 seconds

A Study on the Development of Dynamic Positioning System for Barge Type Surface Vessels (Barge 형 수상선의 DP(Dynamic Positioning) System 개발에 관한 연구)

  • Bui, Van-Phuoc;Kim, Young-Bok
    • Journal of Power System Engineering
    • /
    • v.16 no.2
    • /
    • pp.66-74
    • /
    • 2012
  • In this paper, the authors propose a new approach to control a barge type surface vessel. It is based on the Dynamic Positioning System(DPS) design. The main role of barge ship is to carry and supply the materials to the floating units and other places. To carry out this job, it should be positioned in the specified area. However sometimes the thrust systems are installed on it, and in general the rope control by mooring winch system is used. It may be difficult to compare the control performances of two types. If we consider this problem in point of usefulness, we can easily find out that the winch control system is more useful and applicable to the real field than the thrust control system except a special use. Therefore, in this paper we consider a DPS design problem which can be extended to the many application fields. The goal of this paper is twofold. First, the sliding mode controller (SMC) for positioning the our vessel is proposed. Especially, in this paper, a robust stability condition is given based on descriptor system representation. In the result, the sliding mode control law guarantees to keep the vessel in the defined area in the presence of environmental disturbances. And second, the thrust allocation problem is solved by using redistributed pseudo-inverse (RPI) algorithm to determine the thrust force and direction of each individual actuator. The proposed approach has been simulated with a supply vessel model and found work well.

Spherical Panorama Image Generation Method using Homography and Tracking Algorithm (호모그래피와 추적 알고리즘을 이용한 구면 파노라마 영상 생성 방법)

  • Munkhjargal, Anar;Choi, Hyung-Il
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.3
    • /
    • pp.42-52
    • /
    • 2017
  • Panorama image is a single image obtained by combining images taken at several viewpoints through matching of corresponding points. Existing panoramic image generation methods that find the corresponding points are extracting local invariant feature points in each image to create descriptors and using descriptor matching algorithm. In the case of video sequence, frames may be a lot, so therefore it may costs significant amount of time to generate a panoramic image by the existing method and it may has done unnecessary calculations. In this paper, we propose a method to quickly create a single panoramic image from a video sequence. By assuming that there is no significant changes between frames of the video such as in locally, we use the FAST algorithm that has good repeatability and high-speed calculation to extract feature points and the Lucas-Kanade algorithm as each feature point to track for find the corresponding points in surrounding neighborhood instead of existing descriptor matching algorithms. When homographies are calculated for all images, homography is changed around the center image of video sequence to warp images and obtain a planar panoramic image. Finally, the spherical panoramic image is obtained by performing inverse transformation of the spherical coordinate system. The proposed method was confirmed through the experiments generating panorama image efficiently and more faster than the existing methods.

Performance Evaluations for Leaf Classification Using Combined Features of Shape and Texture (형태와 텍스쳐 특징을 조합한 나뭇잎 분류 시스템의 성능 평가)

  • Kim, Seon-Jong;Kim, Dong-Pil
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.3
    • /
    • pp.1-12
    • /
    • 2012
  • There are many trees in a roadside, parks or facilities for landscape. Although we are easily seeing a tree in around, it would be difficult to classify it and to get some information about it, such as its name, species and surroundings of the tree. To find them, you have to find the illustrated books for plants or search for them on internet. The important components of a tree are leaf, flower, bark, and so on. Generally we can classify the tree by its leaves. A leaf has the inherited features of the shape, vein, and so on. The shape is important role to decide what the tree is. And texture included in vein is also efficient feature to classify them. This paper evaluates the performance of a leaf classification system using both shape and texture features. We use Fourier descriptors for shape features, and both gray-level co-occurrence matrices and wavelets for texture features, and used combinations of such features for evaluation of images from the Flavia dataset. We compared the recognition rates and the precision-recall performances of these features. Various experiments showed that a combination of shape and texture gave better results for performance. The best came from the case of a combination of features of shape and texture with a flipped contour for a Fourier descriptor.

A study on image region analysis and image enhancement using detail descriptor (디테일 디스크립터를 이용한 이미지 영역 분석과 개선에 관한 연구)

  • Lim, Jae Sung;Jeong, Young-Tak;Lee, Ji-Hyeok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.6
    • /
    • pp.728-735
    • /
    • 2017
  • With the proliferation of digital devices, the devices have generated considerable additive white Gaussian noise while acquiring digital images. The most well-known denoising methods focused on eliminating the noise, so detailed components that include image information were removed proportionally while eliminating the image noise. The proposed algorithm provides a method that preserves the details and effectively removes the noise. In this proposed method, the goal is to separate meaningful detail information in image noise environment using the edge strength and edge connectivity. Consequently, even as the noise level increases, it shows denoising results better than the other benchmark methods because proposed method extracts the connected detail component information. In addition, the proposed method effectively eliminated the noise for various noise levels; compared to the benchmark algorithms, the proposed algorithm shows a highly structural similarity index(SSIM) value and peak signal-to-noise ratio(PSNR) value, respectively. As shown the result of high SSIMs, it was confirmed that the SSIMs of the denoising results includes a human visual system(HVS).

3D partial object retrieval using cumulative histogram (누적 히스토그램을 이용한 3차원 물체의 부재 검색)

  • Eun, Sung-Jong;Hyoen, Dae-Hwan;Lee, Ki-Jung;WhangBo, Taeg-Keun
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.669-672
    • /
    • 2009
  • The techniques extract shape descriptors from 3D models and use these descriptors for indices for comparing shape similarities. Most similarity search techniques focus on comparisons of each individual 3D model from databases. However, our similarity search technique can compare not only each individual 3D model, but also partial shape similarities. The partial shape matching technique extends the user's query request by finding similar parts of 3D models and finding 3D models which contain similar parts. We have implemented an experimental partial shape-matching search system for 3D pagoda models, and preliminary experiments show that the system successfully retrieves similar 3D model parts efficiently.

  • PDF

A Study on Feasibility of Dual-Channel 3DTV Service via ATSC-M/H

  • Kim, Byung-Yeon;Bang, Min-Suk;Kim, Sung-Hoon;Choi, Jin-Soo;Kim, Jin-Woong;Kang, Dong-Wook;Jung, Kyeong-Hoon
    • ETRI Journal
    • /
    • v.34 no.1
    • /
    • pp.17-23
    • /
    • 2012
  • This paper analyzes the feasibility of a new 3DTV broadcasting service scenario via Advanced Television Systems Committee Mobile/Handheld (ATSC-M/H). We suggest a dual-channel system in which a left-view image is encoded by MPEG-2 with HD quality and a small-sized right-view image is encoded by AVC. Also, the left view is transmitted through ATSC main channel and the right view is transmitted through ATSC-M/H channel. Although the transport stream formats of two channels are different from each other, we demonstrate that it is possible for the ATSC 2.0 decoder to synchronize the display of the left and right views when both encoders use a common wall clock and time stamp. We also propose a program specific information descriptor which guarantees full compatibility with the conventional 2D HDTV and emerging mobile TV services. Finally, we provide the results of subjective visual quality assessment of the proposed system in support of its 3DTV service quality.

Post-Processing for JPEG-Coded Image Deblocking via Sparse Representation and Adaptive Residual Threshold

  • Wang, Liping;Zhou, Xiao;Wang, Chengyou;Jiang, Baochen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1700-1721
    • /
    • 2017
  • The problem of blocking artifacts is very common in block-based image and video compression, especially at very low bit rates. In this paper, we propose a post-processing method for JPEG-coded image deblocking via sparse representation and adaptive residual threshold. This method includes three steps. First, we obtain the dictionary by online dictionary learning and the compressed images. The dictionary is then modified by the histogram of oriented gradient (HOG) feature descriptor and K-means cluster. Second, an adaptive residual threshold for orthogonal matching pursuit (OMP) is proposed and used for sparse coding by combining blind image blocking assessment. At last, to take advantage of human visual system (HVS), the edge regions of the obtained deblocked image can be further modified by the edge regions of the compressed image. The experimental results show that our proposed method can keep the image more texture and edge information while reducing the image blocking artifacts.

Simultaneous Optimization of Structure and Control Systems Based on Convex Optimization - An approximate Approach - (볼록최적화에 의거한 구조계와 제어계의 동시최적화 - 근사적 어프로치 -)

  • Son, Hoe-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.8
    • /
    • pp.1353-1362
    • /
    • 2003
  • This paper considers a simultaneous optimization problem of structure and control systems. The problem is generally formulated as a non-convex optimization problem for the design parameters of mechanical structure and controller. Therefore, it is not easy to obtain the global solutions for practical problems. In this paper, we parameterize all design parameters of the mechanical structure such that the parameters work in the control system as decentralized static output feedback gains. Using this parameterization, we have formulated a simultaneous optimization problem in which the design specification is defined by the Η$_2$and Η$\_$$\infty$/ norms of the closed loop transfer function. So as to lead to a convex problem we approximate the nonlinear terms of design parameters to the linear terms. Then, we propose a convex optimization method that is based on linear matrix inequality (LMI). Using this method, we can surely obtain suboptimal solution for the design specification. A numerical example is given to illustrate the effectiveness of the proposed method.

Robust PCB Image Alignment using SIFT (잡음과 회전에 강인한 SIFT 기반 PCB 영상 정렬 알고리즘 개발)

  • Kim, Jun-Chul;Cui, Xue-Nan;Park, Eun-Soo;Choi, Hyo-Hoon;Kim, Hak-Il
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.7
    • /
    • pp.695-702
    • /
    • 2010
  • This paper presents an image alignment algorithm for application of AOI (Automatic Optical Inspection) based on SIFT. Since the correspondences result using SIFT descriptor have many wrong points for aligning, this paper modified and classified those points by five measures called the CCFMR (Cascade Classifier for False Matching Reduction) After reduced the false matching, rotation and translation are estimated by point selection method. Experimental results show that the proposed method has fewer fail matching in comparison to commercial software MIL 8.0, and specially, less than twice with the well-controlled environment’s data sets (such as AOI system). The rotation and translation accuracy is robust than MIL in the noise data sets, but the errors are higher than in a rotation variation data sets although that also meaningful result in the practical system. In addition to, the computational time consumed by the proposed method is four times shorter than that by MIL which increases linearly according to noise.

License Plate Recognition System based on Normal CCTV (일반 CCTV 기반 차량 번호판 인식 시스템)

  • Woong, Jang Ji;Man, Park Goo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.8
    • /
    • pp.89-96
    • /
    • 2017
  • This Paper proposes a vehicle detection system and a license plate recognition system from CCTV images installed on public roads. Since the environment of this system acquires the image in the general road environment, the stable condition applied to the existing vehicle entry / exit system is not given, and the input image is distorted and the resolution is irregular. At the same time, the viewing angle of the input image is more wide, so that the computation load is high and the recognition accuracy of the plate is likely to be lowered. In this paper, we propose an improved method to detect and recognize a license plate without a separate input control devices. The vehicle and license plate were detected based on the HOG feature descriptor, and the characters inside the license plate were recognized using the k-NN algorithm. Experimental environment was set up for the roads more than 45m away from the CCTV, Experiments were carried out on an entry vehicle capable of visually identifying license plate and Experimental results show good results of the proposed method.