• Title/Summary/Keyword: ART Algorithm

Search Result 579, Processing Time 0.026 seconds

Retrieval of Non-rigid 3D Models Based on Approximated Topological Structure and Local Volume

  • Hong, Yiyu;Kim, Jongweon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3950-3964
    • /
    • 2017
  • With the increasing popularity of 3D technology such as 3D printing, 3D modeling, etc., there is a growing need to search for similar models on the internet. Matching non-rigid shapes has become an active research field in computer graphics. In this paper, we present an efficient and effective non-rigid model retrieval method based on topological structure and local volume. The integral geodesic distances are first calculated for each vertex on a mesh to construct the topological structure. Next, each node on the topological structure is assigned a local volume that is calculated using the shape diameter function (SDF). Finally, we utilize the Hungarian algorithm to measure similarity between two non-rigid models. Experimental results on the latest benchmark (SHREC' 15 Non-rigid 3D Shape Retrieval) demonstrate that our method works well compared to the state-of-the-art.

Object Tracking Based on Weighted Local Sub-space Reconstruction Error

  • Zeng, Xianyou;Xu, Long;Hu, Shaohai;Zhao, Ruizhen;Feng, Wanli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.871-891
    • /
    • 2019
  • Visual tracking is a challenging task that needs learning an effective model to handle the changes of target appearance caused by factors such as pose variation, illumination change, occlusion and motion blur. In this paper, a novel tracking algorithm based on weighted local sub-space reconstruction error is presented. First, accounting for the appearance changes in the tracking process, a generative weight calculation method based on structural reconstruction error is proposed. Furthermore, a template update scheme of occlusion-aware is introduced, in which we reconstruct a new template instead of simply exploiting the best observation for template update. The effectiveness and feasibility of the proposed algorithm are verified by comparing it with some state-of-the-art algorithms quantitatively and qualitatively.

Temporal and spatial outlier detection in wireless sensor networks

  • Nguyen, Hoc Thai;Thai, Nguyen Huu
    • ETRI Journal
    • /
    • v.41 no.4
    • /
    • pp.437-451
    • /
    • 2019
  • Outlier detection techniques play an important role in enhancing the reliability of data communication in wireless sensor networks (WSNs). Considering the importance of outlier detection in WSNs, many outlier detection techniques have been proposed. Unfortunately, most of these techniques still have some potential limitations, that is, (a) high rate of false positives, (b) high time complexity, and (c) failure to detect outliers online. Moreover, these approaches mainly focus on either temporal outliers or spatial outliers. Therefore, this paper aims to introduce novel algorithms that successfully detect both temporal outliers and spatial outliers. Our contributions are twofold: (i) modifying the Hampel Identifier (HI) algorithm to achieve high accuracy identification rate in temporal outlier detection, (ii) combining the Gaussian process (GP) model and graph-based outlier detection technique to improve the performance of the algorithm in spatial outlier detection. The results demonstrate that our techniques outperform the state-of-the-art methods in terms of accuracy and work well with various data types.

Hierarchical CNN-Based Senary Classification of Steganographic Algorithms (계층적 CNN 기반 스테가노그래피 알고리즘의 6진 분류)

  • Kang, Sanhoon;Park, Hanhoon
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.4
    • /
    • pp.550-557
    • /
    • 2021
  • Image steganalysis is a technique for detecting images with steganographic algorithms applied, called stego images. With state-of-the-art CNN-based steganalysis methods, we can detect stego images with high accuracy, but it is not possible to know which steganographic algorithm is used. Identifying stego images is essential for extracting embedded data. In this paper, as the first step for extracting data from stego images, we propose a hierarchical CNN structure for senary classification of steganographic algorithms. The hierarchical CNN structure consists of multiple CNN networks which are trained to classify each steganographic algorithm and performs binary or ternary classification. Thus, it classifies multiple steganogrphic algorithms hierarchically and stepwise, rather than classifying them at the same time. In experiments of comparing with several conventional methods, including those of classifying multiple steganographic algorithms at the same time, it is verified that using the hierarchical CNN structure can greatly improve the classification accuracy.

Service Oriented Cloud Computing Trusted Evaluation Model

  • Jiao, Hongqiang;Wang, Xinxin;Ding, Wanning
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1281-1292
    • /
    • 2020
  • More and more cloud computing services are being applied in various fields; however, it is difficult for users and cloud computing service platforms to establish trust among each other. The trust value cannot be measured accurately or effectively. To solve this problem, we design a service-oriented cloud trust assessment model using a cloud model. We also design a subjective preference weight allocation (SPWA) algorithm. A flexible weight model is advanced by combining SPWA with the entropy method. Aiming at the fuzziness and subjectivity of trust, the cloud model is used to measure the trust value of various cloud computing services. The SPWA algorithm is used to integrate each evaluation result to obtain the trust evaluation value of the entire cloud service provider.

Harmonization Algorithm to generate Stereoscopic VR Image

  • Khayotov, Mukhammadali;Han, Jong-Ki
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.07a
    • /
    • pp.269-271
    • /
    • 2020
  • In this letter, we propose a novel approach for stitching stereoscopic panoramas. When stitching stereoscopic panoramas, the amount of depth retrieved is the most important factor to pay attention for. Also, it is very crucial to deliver the two left and right panoramas with the right depth information to deliver good 3D perception. However, when stitching the two panoramas independently using the state-of-the-art algorithms and methods, we do still have some inconsistencies with the disparity map retrieved from the panoramas. To overcome this problem, we propose a method that modifies the latest conventional algorithm by making the two panoramas dependent of one another. This brings two panoramas with a much more consistent disparity map that lets users fully immerse into a comfortable stereoscopic vision.

  • PDF

Real-time collision-free landing path planning for drone deliveries in urban environments

  • Hanseob Lee;Sungwook Cho;Hoon Jung
    • ETRI Journal
    • /
    • v.45 no.5
    • /
    • pp.746-757
    • /
    • 2023
  • This study presents a novel safe landing algorithm for urban drone deliveries. The rapid advancement of drone technology has given rise to various delivery services for everyday necessities and emergency relief efforts. However, the reliability of drone delivery technology is still insufficient for application in urban environments. The proposed approach uses the "landing angle control" method to allow the drone to land vertically and a rapidly exploring random tree-based collision avoidance algorithm to generate safe and efficient vertical landing paths for drones while avoiding common urban obstacles like trees, street lights, utility poles, and wires; these methods allow for precise and reliable urban drone delivery. We verified the approach within a Gazebo simulation operated through ROS using a six-degree-of-freedom drone model and sensors with similar specifications to actual models. The performance of the algorithms was tested in various scenarios by comparing it with that of stateof-the-art 3D path planning algorithms.

A Wide Dynamic Range NUC Algorithm for IRCS Systems

  • Cai, Li-Hua;He, Feng-Yun;Chang, Song-Tao;Li, Zhou
    • Journal of the Korean Physical Society
    • /
    • v.73 no.12
    • /
    • pp.1821-1826
    • /
    • 2018
  • Uniformity is a key feature of state-of-the-art infrared focal planed array (IRFPA) and infrared imaging system. Unlike traditional infrared telescope facility, a ground-based infrared radiant characteristics measurement system with an IRFPA not only provides a series of high signal-to-noise ratio (SNR) infrared image but also ensures the validity of radiant measurement data. Normally, a long integration time tends to produce a high SNR infrared image for infrared radiant characteristics radiometry system. In view of the variability of and uncertainty in the measured target's energy, the operation of switching the integration time and attenuators usually guarantees the guality of the infrared radiation measurement data obtainted during the infrared radiant characteristics radiometry process. Non-uniformity correction (NUC) coefficients in a given integration time are often applied to a specified integration time. If the integration time is switched, the SNR for the infrared imaging will degenerate rapidly. Considering the effect of the SNR for the infrared image and the infrared radiant characteristics radiometry above, we propose a-wide-dynamic-range NUC algorithm. In addition, this essasy derives and establishes the mathematical modal of the algorithm in detail. Then, we conduct verification experiments by using a ground-based MWIR(Mid-wave Infared) radiant characteristics radiometry system with an Ø400 mm aperture. The experimental results obtained using the proposed algorithm and the traditional algorithm for different integration time are compared. The statistical data shows that the average non-uniformity for the proposed algorithm decreased from 0.77% to 0.21% at 2.5 ms and from 1.33% to 0.26% at 5.5 ms. The testing results demonstrate that the usage of suggested algorithm can improve infrared imaging quality and radiation measurement accuracy.

Content-based Image Retrieval Using Data Fusion Strategy (데이터 융합을 이용한 내용기반 이미지 검색에 관한 연구)

  • Paik, Woo-Jin;Jung, Sun-Eun;Kim, Gi-Young;Ahn, Eui-Gun;Shin, Moon-Sun
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.2
    • /
    • pp.49-68
    • /
    • 2008
  • In many information retrieval experiments, the data fusion techniques have been used to achieve higher effectiveness in comparison to the single evidence-based retrieval. However, there had not been many image retrieval studies using the data fusion techniques especially in combining retrieval results based on multiple retrieval methods. In this paper, we describe how the image retrieval effectiveness can be improved by combining two sets of the retrieval results using the Sobel operator-based edge detection and the Self Organizing Map(SOM) algorithms. We used the clip art images from a commercial collection to develop a test data set. The main advantage of using this type of the data set was the clear cut relevance judgment, which did not require any human intervention.

FRS-OCC: Face Recognition System for Surveillance Based on Occlusion Invariant Technique

  • Abbas, Qaisar
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.8
    • /
    • pp.288-296
    • /
    • 2021
  • Automated face recognition in a runtime environment is gaining more and more important in the fields of surveillance and urban security. This is a difficult task keeping in mind the constantly volatile image landscape with varying features and attributes. For a system to be beneficial in industrial settings, it is pertinent that its efficiency isn't compromised when running on roads, intersections, and busy streets. However, recognition in such uncontrolled circumstances is a major problem in real-life applications. In this paper, the main problem of face recognition in which full face is not visible (Occlusion). This is a common occurrence as any person can change his features by wearing a scarf, sunglass or by merely growing a mustache or beard. Such types of discrepancies in facial appearance are frequently stumbled upon in an uncontrolled circumstance and possibly will be a reason to the security systems which are based upon face recognition. These types of variations are very common in a real-life environment. It has been analyzed that it has been studied less in literature but now researchers have a major focus on this type of variation. Existing state-of-the-art techniques suffer from several limitations. Most significant amongst them are low level of usability and poor response time in case of any calamity. In this paper, an improved face recognition system is developed to solve the problem of occlusion known as FRS-OCC. To build the FRS-OCC system, the color and texture features are used and then an incremental learning algorithm (Learn++) to select more informative features. Afterward, the trained stack-based autoencoder (SAE) deep learning algorithm is used to recognize a human face. Overall, the FRS-OCC system is used to introduce such algorithms which enhance the response time to guarantee a benchmark quality of service in any situation. To test and evaluate the performance of the proposed FRS-OCC system, the AR face dataset is utilized. On average, the FRS-OCC system is outperformed and achieved SE of 98.82%, SP of 98.49%, AC of 98.76% and AUC of 0.9995 compared to other state-of-the-art methods. The obtained results indicate that the FRS-OCC system can be used in any surveillance application.