• Title/Summary/Keyword: ART2 algorithm

Search Result 220, Processing Time 0.025 seconds

Multi-scale Diffusion-based Salient Object Detection with Background and Objectness Seeds

  • Yang, Sai;Liu, Fan;Chen, Juan;Xiao, Dibo;Zhu, Hairong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4976-4994
    • /
    • 2018
  • The diffusion-based salient object detection methods have shown excellent detection results and more efficient computation in recent years. However, the current diffusion-based salient object detection methods still have disadvantage of detecting the object appearing at the image boundaries and different scales. To address the above mentioned issues, this paper proposes a multi-scale diffusion-based salient object detection algorithm with background and objectness seeds. In specific, the image is firstly over-segmented at several scales. Secondly, the background and objectness saliency of each superpixel is then calculated and fused in each scale. Thirdly, manifold ranking method is chosen to propagate the Bayessian fusion of background and objectness saliency to the whole image. Finally, the pixel-level saliency map is constructed by weighted summation of saliency values under different scales. We evaluate our salient object detection algorithm with other 24 state-of-the-art methods on four public benchmark datasets, i.e., ASD, SED1, SED2 and SOD. The results show that the proposed method performs favorably against 24 state-of-the-art salient object detection approaches in term of popular measures of PR curve and F-measure. And the visual comparison results also show that our method highlights the salient objects more effectively.

Emotion Recognition and Expression System of Robot Based on 2D Facial Image (2D 얼굴 영상을 이용한 로봇의 감정인식 및 표현시스템)

  • Lee, Dong-Hoon;Sim, Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.4
    • /
    • pp.371-376
    • /
    • 2007
  • This paper presents an emotion recognition and its expression system of an intelligent robot like a home robot or a service robot. Emotion recognition method in the robot is used by a facial image. We use a motion and a position of many facial features. apply a tracking algorithm to recognize a moving user in the mobile robot and eliminate a skin color of a hand and a background without a facial region by using the facial region detecting algorithm in objecting user image. After normalizer operations are the image enlarge or reduction by distance of the detecting facial region and the image revolution transformation by an angel of a face, the mobile robot can object the facial image of a fixing size. And materialize a multi feature selection algorithm to enable robot to recognize an emotion of user. In this paper, used a multi layer perceptron of Artificial Neural Network(ANN) as a pattern recognition art, and a Back Propagation(BP) algorithm as a learning algorithm. Emotion of user that robot recognized is expressed as a graphic LCD. At this time, change two coordinates as the number of times of emotion expressed in ANN, and change a parameter of facial elements(eyes, eyebrows, mouth) as the change of two coordinates. By materializing the system, expressed the complex emotion of human as the avatar of LCD.

Development of Aerosol Retrieval Algorithm Over Ocean Using FY-1C/1D Data

  • Xiuqing, Hu;Naimeng, Lu;Hong, Qiu
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1255-1257
    • /
    • 2003
  • This study proposes a single-channel satellite remote sensing algorithm for retrieving aerosol optical thickness over global ocean using FY-1C/1D data. An efficient lookup table (LUT)method is adopted in this algorithm to generate apparent reflectance in channel 1 and channel 2 of FY-1C/1D over ocean. The algorithm scale the apparent reflectance in cloud-free conditions to aerosol optical thickness using a state-of-art radiative transfer model 6S with input of the relative spectral response of channel 1 and 2 of FY-1C/1D. Monthly mean composite maps of the aerosol optical thickness have been obtained from FY-1C/1D global area coverage data between 2001 and 2003. Aerosol optical thickness maps can show the major aerosol source which are located off the west coast of northern and southern Africa, Arabian Sea and India Ocean. These result is very similar to other satellite sensors such as AVHRR and MODIS in the location area of heavy aerosol optical thickness over global ocean. The algorithm have been used to FY-1D operational performance and it is the first operational aerosol remote sensing product in China.

  • PDF

A Manufacturing Cell Formantion Algorithm Using Neural Networks (신경망을 이용한 제조셀 형성 알고리듬)

  • 이준한;김양렬
    • Korean Management Science Review
    • /
    • v.16 no.1
    • /
    • pp.157-171
    • /
    • 1999
  • In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

  • PDF

Car Plate Recognition using Morphological Information and Enhanced Neural Network (형태학적 정보와 개선된 신경망을 이용한 차량 번호판 인식)

  • Kim Kwang-Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.3
    • /
    • pp.684-689
    • /
    • 2005
  • In this paper, we propose car license plate recognition using morphological information and an enhanced neural network. Morphological information on horizontal and vertical edges was used to extract the license plate from a car image. We used a contour tracking algorithm combined with the method of histogram and location information to extract individual characters in the extracted plate. The enhanced neural network is proposed for recognizing them, which has the method of combining the ART-1 and the supervised teaming method. The proposed method has applied to real world car images. The experimental results show that the proposed method has better the extraction rates than the methods with information of the thresholding, the RGB and the HSI, respectively. And the proposed neural network has better recognition performance than the conventional neural networks.

Three-Dimensional Shape Recognition and Classification Using Local Features of Model Views and Sparse Representation of Shape Descriptors

  • Kanaan, Hussein;Behrad, Alireza
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.343-359
    • /
    • 2020
  • In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.

SCATOMi : Scheduling Driven Circuit Partitioning Algorithm for Multiple FPGAs using Time-multiplexed, Off-chip, Multicasting Interconnection Architecture

  • Young-Su kwon;Kyung, Chong-Min
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.823-826
    • /
    • 2003
  • FPGA-based logic emulator with lane gate capacity generally comprises a large number of FPGAs connected in mesh or crossbar topology. However, gate utilization of FPGAs and speed of emulation are limited by the number of signal pins among FPGAs and the interconnection architecture of the logic emulator. The time-multiplexing of interconnection wires is required for multi-FPGA system incorporating several state-of-the-art FPGAs. This paper proposes a circuit partitioning algorithm called SCATOMi(SCheduling driven Algorithm for TOMi)for multi-FPGA system incorporating four to eight FPGAs where FPGAs are interconnected through TOMi(Time-multiplexed, Off-chip, Multicasting interconnection). SCATOMi improves the performance of TOMi architecture by limiting the number of inter-FPGA signal transfers on the critical path and considering the scheduling of inter-FPGA signal transfers. The performance of the partitioning result of SCATOMi is 5.5 times faster than traditional partitioning algorithms. Architecture comparison show that the pin count is reduced to 15.2%-81.3% while the critical path delay is reduced to 46.1%-67.6% compared to traditional architectures.

  • PDF

A High Quality Steganographic Method Using Morphing

  • Bagade, Anant M.;Talbar, Sanjay N.
    • Journal of Information Processing Systems
    • /
    • v.10 no.2
    • /
    • pp.256-270
    • /
    • 2014
  • A new morphed steganographic algorithm is proposed in this paper. Image security is a challenging problem these days. Steganography is a method of hiding secret data in cover media. The Least Significant Bit is a standard Steganographic method that has some limitations. The limitations are less capacity to hide data, poor stego image quality, and imperceptibility. The proposed algorithm focuses on these limitations. The morphing concept is being used for image steganography to overcome these limitations. The PSNR and standard deviation are considered as a measure to improve stego image quality and morphed image selection, respectively. The stego keys are generated during the morphed steganographic embedding and extracting process. Stego keys are used to embed and extract the secret image. The experimental results, which are based on hiding capacity and PSNR, are presented in this paper. Our research contributes towards creating an improved steganographic method using image morphing. The experimental result indicates that the proposed algorithm achieves an increase in hiding capacity, stego image quality, and imperceptibility. The experimental results were compared with state of the art steganographic methods.

Ensemble techniques and hybrid intelligence algorithms for shear strength prediction of squat reinforced concrete walls

  • Mohammad Sadegh Barkhordari;Leonardo M. Massone
    • Advances in Computational Design
    • /
    • v.8 no.1
    • /
    • pp.37-59
    • /
    • 2023
  • Squat reinforced concrete (SRC) shear walls are a critical part of the structure for both office/residential buildings and nuclear structures due to their significant role in withstanding seismic loads. Despite this, empirical formulae in current design standards and published studies demonstrate a considerable disparity in predicting SRC wall shear strength. The goal of this research is to develop and evaluate hybrid and ensemble artificial neural network (ANN) models. State-of-the-art population-based algorithms are used in this research for hybrid intelligence algorithms. Six models are developed, including Honey Badger Algorithm (HBA) with ANN (HBA-ANN), Hunger Games Search with ANN (HGS-ANN), fitness-distance balance coyote optimization algorithm (FDB-COA) with ANN (FDB-COA-ANN), Averaging Ensemble (AE) neural network, Snapshot Ensemble (SE) neural network, and Stacked Generalization (SG) ensemble neural network. A total of 434 test results of SRC walls is utilized to train and assess the models. The results reveal that the SG model not only minimizes prediction variance but also produces predictions (with R2= 0.99) that are superior to other models.

Convolutional Neural Network with Particle Filter Approach for Visual Tracking

  • Tyan, Vladimir;Kim, Doohyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.693-709
    • /
    • 2018
  • In this paper, we propose a compact Convolutional Neural Network (CNN)-based tracker in conjunction with a particle filter architecture, in which the CNN model operates as an accurate candidates estimator, while the particle filter predicts the target motion dynamics, lowering the overall number of calculations and refines the resulting target bounding box. Experiments were conducted on the Online Object Tracking Benchmark (OTB) [34] dataset and comparison analysis in respect to other state-of-art has been performed based on accuracy and precision, indicating that the proposed algorithm outperforms all state-of-the-art trackers included in the OTB dataset, specifically, TLD [16], MIL [1], SCM [36] and ASLA [15]. Also, a comprehensive speed performance analysis showed average frames per second (FPS) among the top-10 trackers from the OTB dataset [34].