• Title/Summary/Keyword: noise robustness

Search Result 559, Processing Time 0.027 seconds

Real-Time Vehicle License Plate Recognition System Using Adaptive Heuristic Segmentation Algorithm (적응 휴리스틱 분할 알고리즘을 이용한 실시간 차량 번호판 인식 시스템)

  • Jin, Moon Yong;Park, Jong Bin;Lee, Dong Suk;Park, Dong Sun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.9
    • /
    • pp.361-368
    • /
    • 2014
  • The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

Local Prominent Directional Pattern for Gender Recognition of Facial Photographs and Sketches (Local Prominent Directional Pattern을 이용한 얼굴 사진과 스케치 영상 성별인식 방법)

  • Makhmudkhujaev, Farkhod;Chae, Oksam
    • Convergence Security Journal
    • /
    • v.19 no.2
    • /
    • pp.91-104
    • /
    • 2019
  • In this paper, we present a novel local descriptor, Local Prominent Directional Pattern (LPDP), to represent the description of facial images for gender recognition purpose. To achieve a clearly discriminative representation of local shape, presented method encodes a target pixel with the prominent directional variations in local structure from an analysis of statistics encompassed in the histogram of such directional variations. Use of the statistical information comes from the observation that a local neighboring region, having an edge going through it, demonstrate similar gradient directions, and hence, the prominent accumulations, accumulated from such gradient directions provide a solid base to represent the shape of that local structure. Unlike the sole use of gradient direction of a target pixel in existing methods, our coding scheme selects prominent edge directions accumulated from more samples (e.g., surrounding neighboring pixels), which, in turn, minimizes the effect of noise by suppressing the noisy accumulations of single or fewer samples. In this way, the presented encoding strategy provides the more discriminative shape of local structures while ensuring robustness to subtle changes such as local noise. We conduct extensive experiments on gender recognition datasets containing a wide range of challenges such as illumination, expression, age, and pose variations as well as sketch images, and observe the better performance of LPDP descriptor against existing local descriptors.

Improving the Accuracy of Document Classification by Learning Heterogeneity (이질성 학습을 통한 문서 분류의 정확성 향상 기법)

  • Wong, William Xiu Shun;Hyun, Yoonjin;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.3
    • /
    • pp.21-44
    • /
    • 2018
  • In recent years, the rapid development of internet technology and the popularization of smart devices have resulted in massive amounts of text data. Those text data were produced and distributed through various media platforms such as World Wide Web, Internet news feeds, microblog, and social media. However, this enormous amount of easily obtained information is lack of organization. Therefore, this problem has raised the interest of many researchers in order to manage this huge amount of information. Further, this problem also required professionals that are capable of classifying relevant information and hence text classification is introduced. Text classification is a challenging task in modern data analysis, which it needs to assign a text document into one or more predefined categories or classes. In text classification field, there are different kinds of techniques available such as K-Nearest Neighbor, Naïve Bayes Algorithm, Support Vector Machine, Decision Tree, and Artificial Neural Network. However, while dealing with huge amount of text data, model performance and accuracy becomes a challenge. According to the type of words used in the corpus and type of features created for classification, the performance of a text classification model can be varied. Most of the attempts are been made based on proposing a new algorithm or modifying an existing algorithm. This kind of research can be said already reached their certain limitations for further improvements. In this study, aside from proposing a new algorithm or modifying the algorithm, we focus on searching a way to modify the use of data. It is widely known that classifier performance is influenced by the quality of training data upon which this classifier is built. The real world datasets in most of the time contain noise, or in other words noisy data, these can actually affect the decision made by the classifiers built from these data. In this study, we consider that the data from different domains, which is heterogeneous data might have the characteristics of noise which can be utilized in the classification process. In order to build the classifier, machine learning algorithm is performed based on the assumption that the characteristics of training data and target data are the same or very similar to each other. However, in the case of unstructured data such as text, the features are determined according to the vocabularies included in the document. If the viewpoints of the learning data and target data are different, the features may be appearing different between these two data. In this study, we attempt to improve the classification accuracy by strengthening the robustness of the document classifier through artificially injecting the noise into the process of constructing the document classifier. With data coming from various kind of sources, these data are likely formatted differently. These cause difficulties for traditional machine learning algorithms because they are not developed to recognize different type of data representation at one time and to put them together in same generalization. Therefore, in order to utilize heterogeneous data in the learning process of document classifier, we apply semi-supervised learning in our study. However, unlabeled data might have the possibility to degrade the performance of the document classifier. Therefore, we further proposed a method called Rule Selection-Based Ensemble Semi-Supervised Learning Algorithm (RSESLA) to select only the documents that contributing to the accuracy improvement of the classifier. RSESLA creates multiple views by manipulating the features using different types of classification models and different types of heterogeneous data. The most confident classification rules will be selected and applied for the final decision making. In this paper, three different types of real-world data sources were used, which are news, twitter and blogs.

Image Watermarking for Copyright Protection of Images on Shopping Mall (쇼핑몰 이미지 저작권보호를 위한 영상 워터마킹)

  • Bae, Kyoung-Yul
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.147-157
    • /
    • 2013
  • With the advent of the digital environment that can be accessed anytime, anywhere with the introduction of high-speed network, the free distribution and use of digital content were made possible. Ironically this environment is raising a variety of copyright infringement, and product images used in the online shopping mall are pirated frequently. There are many controversial issues whether shopping mall images are creative works or not. According to Supreme Court's decision in 2001, to ad pictures taken with ham products is simply a clone of the appearance of objects to deliver nothing but the decision was not only creative expression. But for the photographer's losses recognized in the advertising photo shoot takes the typical cost was estimated damages. According to Seoul District Court precedents in 2003, if there are the photographer's personality and creativity in the selection of the subject, the composition of the set, the direction and amount of light control, set the angle of the camera, shutter speed, shutter chance, other shooting methods for capturing, developing and printing process, the works should be protected by copyright law by the Court's sentence. In order to receive copyright protection of the shopping mall images by the law, it is simply not to convey the status of the product, the photographer's personality and creativity can be recognized that it requires effort. Accordingly, the cost of making the mall image increases, and the necessity for copyright protection becomes higher. The product images of the online shopping mall have a very unique configuration unlike the general pictures such as portraits and landscape photos and, therefore, the general image watermarking technique can not satisfy the requirements of the image watermarking. Because background of product images commonly used in shopping malls is white or black, or gray scale (gradient) color, it is difficult to utilize the space to embed a watermark and the area is very sensitive even a slight change. In this paper, the characteristics of images used in shopping malls are analyzed and a watermarking technology which is suitable to the shopping mall images is proposed. The proposed image watermarking technology divide a product image into smaller blocks, and the corresponding blocks are transformed by DCT (Discrete Cosine Transform), and then the watermark information was inserted into images using quantization of DCT coefficients. Because uniform treatment of the DCT coefficients for quantization cause visual blocking artifacts, the proposed algorithm used weighted mask which quantizes finely the coefficients located block boundaries and coarsely the coefficients located center area of the block. This mask improves subjective visual quality as well as the objective quality of the images. In addition, in order to improve the safety of the algorithm, the blocks which is embedded the watermark are randomly selected and the turbo code is used to reduce the BER when extracting the watermark. The PSNR(Peak Signal to Noise Ratio) of the shopping mall image watermarked by the proposed algorithm is 40.7~48.5[dB] and BER(Bit Error Rate) after JPEG with QF = 70 is 0. This means the watermarked image is high quality and the algorithm is robust to JPEG compression that is used generally at the online shopping malls. Also, for 40% change in size and 40 degrees of rotation, the BER is 0. In general, the shopping malls are used compressed images with QF which is higher than 90. Because the pirated image is used to replicate from original image, the proposed algorithm can identify the copyright infringement in the most cases. As shown the experimental results, the proposed algorithm is suitable to the shopping mall images with simple background. However, the future study should be carried out to enhance the robustness of the proposed algorithm because the robustness loss is occurred after mask process.

Design of Sliding Mode Fuzzy Controller for Vibration Reduction of Large Structures (대형구조물의 진동 감소를 위한 슬라이딩 모드 퍼지 제어기의 설계)

  • 윤정방;김상범
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.3 no.3
    • /
    • pp.63-74
    • /
    • 1999
  • A sliding mode fuzzy control (SMFC) algorithm is presented for vibration of large structures. Rule-base of the fuzzy inference engine is constructed based on the sliding mode control, which is one of the nonlinear control algorithms. Fuzziness of the controller makes the control system robust against the uncertainties in the system parameters and the input excitation. Non-linearity of the control rule makes the controller more effective than linear controllers. Design procedure based on the present fuzzy control is more convenient than those of the conventional algorithms based on complex mathematical analysis, such as linear quadratic regulator and sliding mode control(SMC). Robustness of presented controller is illustrated by examining the loop transfer function. For verification of the present algorithm, a numerical study is carried out on the benchmark problem initiated by the ASCE Committee on Structural Control. To achieve a high level of realism, various aspects are considered such as actuator-structure interaction, modeling error, sensor noise, actuator time delay, precision of the A/D and D/A converters, magnitude of control force, and order of control model. Performance of the SMFC is examined in comparison with those of other control algorithms such as $H_{mixed 2/{\infty}}$ optimal polynomial control, neural networks control, and SMC, which were reported by other researchers. The results indicate that the present SMFC is an efficient and attractive control method, since the vibration responses of the structure can be reduced very effectively and the design procedure is simple and convenient.

  • PDF

Fireworks Modeling Technique based on Particle Tracking (입자추적기반의 불꽃 모델링 기법)

  • Cho, ChangWoo;Kim, KiHyun;Jeong, ChangSung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.102-109
    • /
    • 2014
  • A particle system is used for modeling the physical phenomenon. There are many traditional ways for simulation modeling which can be well suited for application including the landscapes of branches, clouds, waves, fog, rain, snow and fireworks in the three-dimensional space. In this paper, we present a new fireworks modeling technique for modeling 3D firework based on Firework Particle Tracking (FPT) using the particle system. Our method can track and recognize the launched and exploded particle of fireworks, and extracts relatively accurate 3D positions of the particles using 3D depth values. It can realize 3D simulation by using tracking information such as position, speed, color and life time of the firework particle. We exploit Region of Interest (ROI) for fast particle extraction and the prevention of false particle extraction caused by noise. Moreover, Kalman filter is used to enhance the robustness in launch step. We propose a new fireworks particle tracking method for the efficient tracking of particles by considering maximum moving range and moving direction of particles, and shall show that the 3D speeds of particles can be obtained by finding the rotation angles of fireworks. Also, we carry out the performance evaluation of particle tracking: tracking speed and accuracy for tracking, classification, rotation angle respectively with respect to four types of fireworks: sphere, circle, chrysanthemum and heart.

Extraction and Complement of Hexagonal Borders in Corneal Endothelial Cell Images (각막 내피 세포 영상내 육각형 경계의 검출과 보완법)

  • Kim, Eung-Kyeu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.102-112
    • /
    • 2013
  • In this paper, two step processing method of contour extraction and complement which contain hexagonal shape for low contrast and noisy images is proposed. This method is based on the combination of Laplacian-Gaussian filter and an idea of filters which are dependent on the shape. At the first step, an algorithm which has six masks as its extractors to extract the hexagonal edges especially in the corners is used. Here, two tricorn filters are used to detect the tricorn joints of hexagons and other four masks are used to enhance the line segments of hexagonal edges. As a natural image, a corneal endothelial cell image which usually has regular hexagonal form is selected. The edge extraction of hexagonal shapes in corneal endothelial cell is important for clinical diagnosis. The proposed algorithm and other conventional methods are applied to noisy hexagonal images to evaluate each efficiency. As a result, this proposed algorithm shows a robustness against noises and better detection ability in the aspects of the output signal to noise ratio, the edge coincidence ratio and the extraction accuracy factor as compared with other conventional methods. At the second step, the lacking part of the thinned image by an energy minimum algorithm is complemented, and then the area and distribution of cells which give necessary information for medical diagnosis are computed.

Performance Evaluation of Hybrid-SE-MMA Adaptive Equalizer using Adaptive Modulus and Adaptive Step Size (적응 모듈러스와 적응 스텝 크기를 이용한 Hybrid-SE-MMA 적응 등화기의 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.97-102
    • /
    • 2020
  • This paper relates with the Hybrid-SE-MMA (Signed-Error MMA) that is possible to improving the equalization performance by using the adaptive modulus and adaptive step size in SE-MMA adaptive equalizer for the minimizing the intersymbol interference. The equalizer tap coefficient is updatted use the error signal in MMA algorithm for adaptive equalizer. But the sign of error signal is used for the simplification of arithmetic operation in SE-MMA algorithm in order to updating the coefficient. By this simplification, we get the fast convergence speed and the reduce the algorithm processing speed, but not in the equalization performance. In this paper, it is possible to improve the equalization performance by computer simulation applying the adaptive modulus to the SE-MMA which is proposional to the power of equalizer output signal. In order to compare the improved equalization performance compared to the present SE-MMA, the recovered signal constellation that is the output of the equalizer, residual isi, MD(maximum distortion), MSE and the SER perfomance that means the robustness to the external noise were used. As a result of computer simulation, the Hybrid-SE-MMA improve equalization performance in the residual isi and MD, MSE, SER than the SE-MMA.

Automatic speech recognition using acoustic doppler signal (초음파 도플러를 이용한 음성 인식)

  • Lee, Ki-Seung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.35 no.1
    • /
    • pp.74-82
    • /
    • 2016
  • In this paper, a new automatic speech recognition (ASR) was proposed where ultrasonic doppler signals were used, instead of conventional speech signals. The proposed method has the advantages over the conventional speech/non-speech-based ASR including robustness against acoustic noises and user comfortability associated with usage of the non-contact sensor. In the method proposed herein, 40 kHz ultrasonic signal was radiated toward to the mouth and the reflected ultrasonic signals were then received. Frequency shift caused by the doppler effects was used to implement ASR. The proposed method employed multi-channel ultrasonic signals acquired from the various locations, which is different from the previous method where single channel ultrasonic signal was employed. The PCA(Principal Component Analysis) coefficients were used as the features of ASR in which hidden markov model (HMM) with left-right model was adopted. To verify the feasibility of the proposed ASR, the speech recognition experiment was carried out the 60 Korean isolated words obtained from the six speakers. Moreover, the experiment results showed that the overall word recognition rates were comparable with the conventional speech-based ASR methods and the performance of the proposed method was superior to the conventional signal channel ASR method. Especially, the average recognition rate of 90 % was maintained under the noise environments.

Multirate Multicarrier DS/CDMA with 2-Domain Spreading (2차원 확산을 사용하는 다중전송률 MC-DS/CDMA 시스템)

  • Kim, Nam-Sun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.4
    • /
    • pp.27-35
    • /
    • 2011
  • Multicarrier-Direct Sequence/Code Division Multiple Access(MC-DS/ CDMA) which is a combination of Orthogonal Frequency Division Multiplexing(OFDM) and DS/CDMA has been of significant interest as a means to take such advantages as bandwidth efficiency, high bit rate and robustness against multipath fading. In this paper we study a reduced-complexity multiuser detection aided multirate MC-DS/CDMA with time(T)-domain and frequency(F)-domain spreading. The one- dimensional orthogonal variable spreading factor(1D OVSF) code extracted from 2D OVSF code are used as a spreading code in T/F-domain. The proposed system will use code grouping interference cancellation(CGIC) receiver to reduce Multiuser Interference(MUI). The CGIC receiver uses code grouping by the correlation properties of 1D OVSF code and dose not requires the code information and activity of other user. The multiuser detector with CGIC receiver will be analyzed in Time- and Frequency-domain separately(jointly). The system performance is analytically derived in Additive White Gaussian Noise(AWGN) channel and we also compare the system performance between proposed system and T/F spreaded single(multi) rate multiuser MC-DS/CDMA system. In the computer simulation results, the proposed receiver of demonstrated huge performance improvement over conventional matched filter receiver.