A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

  Subjects -> ELECTRONICS (Total: 207 journals)
The end of the list has been reached or no journals were found for your choice.
Similar Journals
Journal Cover
IEICE - Transactions on Information and Systems
Journal Prestige (SJR): 0.195
Citation Impact (citeScore): 1
Number of Followers: 6  
 
  Full-text available via subscription Subscription journal
ISSN (Print) 0916-8532 - ISSN (Online) 1745-1361
Published by Institute of Electronics, Information and Communications Engineers Homepage  [4 journals]
  • FOREWORD

    • Free pre-print version: Loading...

      Abstract: Ilsun YOU, Vol.E105-D, No.11, pp.1834-1835
      Publication Date: 2022/11/01
       
  • Generic Construction of 1-out-of-n Oblivious Signatures

    • Free pre-print version: Loading...

      Abstract: Yu ZHOU,Shengli LIU,Shuai HAN, Vol.E105-D, No.11, pp.1836-1844
      In a 1-out-of-n oblivious signature scheme, a user provides a set of messages to a signer for signatures but he/she can only obtain a valid signature for a specific message chosen from the message set. There are two security requirements for 1-out-of-n oblivious signature. The first is ambiguity, which requires that the signer is not aware which message among the set is signed. The other one is unforgeability which requires that the user is not able to derive any other valid signature for any messages beyond the one that he/she has chosen. In this paper, we provide a generic construction of 1-out-of-n oblivious signature. Our generic construction consists of two building blocks, a commitment scheme and a standard signature scheme. Our construction is round efficient since it only asks one interaction (i.e., two rounds) between the user and signer. Meanwhile, in our construction, the ambiguity of the 1-out-of-n oblivious signature scheme is based on the hiding property of the underlying commitment, while the unforgeability is based on the binding property of the underlying commitment scheme and the unforgeability of the underlying signature scheme. Moreover, our construction can also enjoy strong unforgeability as long as the underlying building blocks have strong binding property and strong unforgeability respectively. Given the fact that commitment and digital signature are well-studied topics in cryptography and numerous concrete schemes have been proposed in the standard model, our generic construction immediately yields a bunch of instantiations in the standard model based on well-known assumptions, including not only traditional assumptions like Decision Diffie-Hellman (DDH), Decision Composite Residue (DCR), etc., but also some post-quantum assumption like Learning with Errors (LWE). As far as we know, our construction admits the first 1-out-of-n oblivious signature schemes based on the standard model.
      Publication Date: 2022/11/01
       
  • Aggregate Signature Schemes with Traceability of Devices Dynamically
           Generating Invalid Signatures

    • Free pre-print version: Loading...

      Abstract: Ryu ISHII,Kyosuke YAMASHITA,Yusuke SAKAI,Tadanori TERUYA,Takahiro MATSUDA,Goichiro HANAOKA,Kanta MATSUURA,Tsutomu MATSUMOTO, Vol.E105-D, No.11, pp.1845-1856
      Aggregate signature schemes enable us to aggregate multiple signatures into a single short signature. One of its typical applications is sensor networks, where a large number of users and devices measure their environments, create signatures to ensure the integrity of the measurements, and transmit their signed data. However, if an invalid signature is mixed into aggregation, the aggregate signature becomes invalid, thus if an aggregate signature is invalid, it is necessary to identify the invalid signature. Furthermore, we need to deal with a situation where an invalid sensor generates invalid signatures probabilistically. In this paper, we introduce a model of aggregate signature schemes with interactive tracing functionality that captures such a situation, and define its functional and security requirements and propose aggregate signature schemes that can identify all rogue sensors. More concretely, based on the idea of Dynamic Traitor Tracing, we can trace rogue sensors dynamically and incrementally, and eventually identify all rogue sensors of generating invalid signatures even if the rogue sensors adaptively collude. In addition, the efficiency of our proposed method is also sufficiently practical.
      Publication Date: 2022/11/01
       
  • Identity Access Management via ECC Stateless Derived Key Based
           Hierarchical Blockchain for the Industrial Internet of Things

    • Free pre-print version: Loading...

      Abstract: Gyeongjin RA,Su-hyun KIM,Imyeong LEE, Vol.E105-D, No.11, pp.1857-1871
      Recently, the adoption of the industrial Internet of things (IIoT) has optimized many industrial sectors and promoted industry “smartization.” Smart factories and smart industries connect the real and virtual worlds through cyber-physical systems (CPS). However, these linkages will increase the cyber security danger surface to new levels, putting millions of dollars' worth of assets at risk if communications in big network systems like IIoT settings are left unsecured. To solve these problems, the fundamental method is security, such as authentication and confidentiality, and it should require the encryption key. However, it is challenging the security performance with the limited performance of the sensor. Blockchain-based identity management is emerging for lightweight, integrity and persistence. However, the key generation and management issues of blockchain face the same security performance issues. First, through blockchain smart contracts and hierarchical deterministic (HD) wallets, hierarchical key derivation efficiently distributes and manages keys by line and group in the IIoT environment. Second, the pairing verification value based on an elliptic curve single point called Root Signature performs efficient public key certificate registration and verification and improves the key storage space. Third, the identity log recorded through the blockchain is the global transparency of the key lifecycle, providing system reliability from various security attacks. Keyless Signature Infrastructure (KSI) is adopted to perform efficiently via hash-based scheme (hash calendar, hash tree etc.). We analyze our framework compared to hash-based state commitment methods. Accordingly, our method achieves a calculation efficiency of O(nlog N) and a storage space saving of 60% compared to the existing schemes.
      Publication Date: 2022/11/01
       
  • Fully Dynamic Data Management in Cloud Storage Systems with Secure Proof
           of Retrievability

    • Free pre-print version: Loading...

      Abstract: Nam-Su JHO,Daesung MOON,Taek-Young YOUN, Vol.E105-D, No.11, pp.1872-1879
      For reliable storage services, we need a way not only to monitor the state of stored data but also to recover the original data when some data loss is discovered. To solve the problem, a novel technique called HAIL has been proposed. Unfortunately, HAIL cannot support dynamic data which is changed according to users' modification queries. There are many applications where dynamic data are used. So, we need a way to support dynamic data in cloud services to use cloud storage system for various applications. In this paper, we propose a new technique that can support the use of dynamic data in cloud storage systems. For dynamic data update, we design a new data chunk generation strategy which guarantee efficient data insertion, deletion, and modification. Our technique requires O(1) operations for each data update when existing techniques require O(n) operations where n is the size of data.
      Publication Date: 2022/11/01
       
  • Priority Evasion Attack: An Adversarial Example That Considers the
           Priority of Attack on Each Classifier

    • Free pre-print version: Loading...

      Abstract: Hyun KWON,Changhyun CHO,Jun LEE, Vol.E105-D, No.11, pp.1880-1889
      Deep neural networks (DNNs) provide excellent services in machine learning tasks such as image recognition, speech recognition, pattern recognition, and intrusion detection. However, an adversarial example created by adding a little noise to the original data can result in misclassification by the DNN and the human eye cannot tell the difference from the original data. For example, if an attacker creates a modified right-turn traffic sign that is incorrectly categorized by a DNN, an autonomous vehicle with the DNN will incorrectly classify the modified right-turn traffic sign as a U-Turn sign, while a human will correctly classify that changed sign as right turn sign. Such an adversarial example is a serious threat to a DNN. Recently, an adversarial example with multiple targets was introduced that causes misclassification by multiple models within each target class using a single modified image. However, it has the weakness that as the number of target models increases, the overall attack success rate decreases. Therefore, if there are multiple models that the attacker wishes to attack, the attacker must control the attack success rate for each model by considering the attack priority for each model. In this paper, we propose a priority adversarial example that considers the attack priority for each model in cases targeting multiple models. The proposed method controls the attack success rate for each model by adjusting the weight of the attack function in the generation process while maintaining minimal distortion. We used MNIST and CIFAR10 as data sets and Tensorflow as machine learning library. Experimental results show that the proposed method can control the attack success rate for each model by considering each model's attack priority while maintaining minimal distortion (average 3.95 and 2.45 with MNIST for targeted and untargeted attacks, respectively, and average 51.95 and 44.45 with CIFAR10 for targeted and untargeted attacks, respectively).
      Publication Date: 2022/11/01
       
  • Efficient Protection Mechanism for CPU Cache Flush Instruction Based
           Attacks

    • Free pre-print version: Loading...

      Abstract: Shuhei ENOMOTO,Hiroki KUZUNO,Hiroshi YAMADA, Vol.E105-D, No.11, pp.1890-1899
      CPU flush instruction-based cache side-channel attacks (cache instruction attacks) target a wide range of machines. For instance, Meltdown / Spectre combined with FLUSH+RELOAD gain read access to arbitrary data in operating system kernel and user processes, which work on cloud virtual machines, laptops, desktops, and mobile devices. Additionally, fault injection attacks use a CPU cache. For instance, Rowhammer, is a cache instruction attack that attempts to obtain write access to arbitrary data in physical memory, and affects machines that have DDR3. To protect against existing cache instruction attacks, various existing mechanisms have been proposed to modify hardware and software aspects; however, when latest cache instruction attacks are disclosed, these mechanisms cannot prevent these. Moreover, additional countermeasure requires long time for the designing and developing process. This paper proposes a novel mechanism termed FlushBlocker to protect against all types of cache instruction attacks and mitigate against cache instruction attacks employ latest side-channel vulnerability until the releasing of additional countermeasures. FlushBlocker employs an approach that restricts the issuing of cache flush instructions and the attacks that lead to failure by limiting control of the CPU cache. To demonstrate the effectiveness of this study, FlushBlocker was implemented in the latest Linux kernel, and its security and performance were evaluated. Results show that FlushBlocker successfully prevents existing cache instruction attacks (e.g., Meltdown, Spectre, and Rowhammer), the performance overhead was zero, and it was transparent in real-world applications.
      Publication Date: 2022/11/01
       
  • A Strengthened PAKE Protocol with Identity-Based Encryption

    • Free pre-print version: Loading...

      Abstract: SeongHan SHIN, Vol.E105-D, No.11, pp.1900-1910
      In [2], Choi et al. proposed an identity-based password-authenticated key exchange (iPAKE) protocol using the Boneh-Franklin IBE scheme, and its generic construction (UKAM-PiE) that was standardized in ISO/IEC 11770-4/AMD 1. In this paper, we show that the iPAKE and UKAM-PiE protocols are insecure against passive/active attacks by a malicious PKG (Private Key Generator) where the malicious PKG can find out all clients' passwords by just eavesdropping on the communications, and the PKG can share a session key with any client by impersonating the server. Then, we propose a strengthened PAKE (for short, SPAIBE) protocol with IBE, which prevents such a malicious PKG's passive/active attacks. Also, we formally prove the security of the SPAIBE protocol in the random oracle model and compare relevant PAKE protocols in terms of efficiency, number of passes, and security against a malicious PKG.
      Publication Date: 2022/11/01
       
  • Toward Selective Membership Inference Attack against Deep Learning Model

    • Free pre-print version: Loading...

      Abstract: Hyun KWON,Yongchul KIM, Vol.E105-D, No.11, pp.1911-1915
      In this paper, we propose a selective membership inference attack method that determines whether certain data corresponding to a specific class are being used as training data for a machine learning model or not. By using the proposed method, membership or non-membership can be inferred by generating a decision model from the prediction of the inference models and training the confidence values for the data corresponding to the selected class. We used MNIST as an experimental dataset and Tensorflow as a machine learning library. Experimental results show that the proposed method has a 92.4% success rate with 5 inference models for data corresponding to a specific class.
      Publication Date: 2022/11/01
       
  • Multi-Targeted Poisoning Attack in Deep Neural Networks

    • Free pre-print version: Loading...

      Abstract: Hyun KWON,Sunghwan CHO, Vol.E105-D, No.11, pp.1916-1920
      Deep neural networks show good performance in image recognition, speech recognition, and pattern analysis. However, deep neural networks also have weaknesses, one of which is vulnerability to poisoning attacks. A poisoning attack reduces the accuracy of a model by training the model on malicious data. A number of studies have been conducted on such poisoning attacks. The existing type of poisoning attack causes misrecognition by one classifier. In certain situations, however, it is necessary for multiple models to misrecognize certain data as different specific classes. For example, if there are enemy autonomous vehicles A, B, and C, a poisoning attack could mislead A to turn to the left, B to stop, and C to turn to the right simply by using a traffic sign. In this paper, we propose a multi-targeted poisoning attack method that causes each of several models to misrecognize certain data as a different target class. This study used MNIST and CIFAR10 as datasets and Tensorflow as a machine learning library. The experimental results show that the proposed scheme has a 100% average attack success rate on MNIST and CIFAR10 when malicious data accounting for 5% of the training dataset have been used for training.
      Publication Date: 2022/11/01
       
  • Adversarial Example Detection Based on Improved GhostBusters

    • Free pre-print version: Loading...

      Abstract: Hyunghoon KIM,Jiwoo SHIN,Hyo Jin JO, Vol.E105-D, No.11, pp.1921-1922
      In various studies of attacks on autonomous vehicles (AVs), a phantom attack in which advanced driver assistance system (ADAS) misclassifies a fake object created by an adversary as a real object has been proposed. In this paper, we propose F-GhostBusters, which is an improved version of GhostBusters that detects phantom attacks. The proposed model uses a new feature, i.e, frequency of images. Experimental results show that F-GhostBusters not only improves the detection performance of GhostBusters but also can complement the accuracy against adversarial examples.
      Publication Date: 2022/11/01
       
  • SOME/IP Intrusion Detection System Using Machine Learning

    • Free pre-print version: Loading...

      Abstract: Jaewoong HEO,Hyunghoon KIM,Hyo Jin JO, Vol.E105-D, No.11, pp.1923-1924
      With the development of in-vehicle network technologies, Automotive Ethernet is being applied to modern vehicles. Scalable service-Oriented MiddlewarE over IP (SOME/IP) is an automotive middleware solution that is used for communications of the infotainment domain as well as that of other domains in the vehicle. However, since SOME/IP lacks security, it is vulnerable to a variety of network-based attacks. In this paper, we introduce a new type of intrusion detection system (IDS) leveraging on SOME/IP packet's header information and packet reception time to deal with SOME/IP related network attacks.
      Publication Date: 2022/11/01
       
  • Data Covert Channels between the Secure World and the Normal World in the
           ARM TrustZone Architecture

    • Free pre-print version: Loading...

      Abstract: Haehyun CHO, Vol.E105-D, No.11, pp.1925-1927
      The ARM TrustZone architecture, which provides hardware-assisted isolation, is widely adopted in mobile and IoT devices. The security of ARM TrustZone relies on the idea of splitting system-on-chip hardware and software into two worlds, namely normal world and secure world. There are legitimate channels at the hardware level that the normal world and the secure world can use to communicate with each other. To protect these channels from being abused, research efforts were invested on restricting the access to these channels from normal world components. Therefore, only predefined and legitimate normal world components can use cross-world communication channels. In this work, we present a study on data covert channels that can bypass such protection mechanisms and smuggle sensitive information. We first analyze causes of the noise in the covert channel between two worlds. Then, we evaluate the accuracy and bandwidth of covert channels built by our PRIME+COUNT method with one built by PRIME+PROBE method. Our results demonstrate that PRIME+COUNT is an effective technique for enabling cross-world covert channels in the ARM TrustZone.
      Publication Date: 2022/11/01
       
  • Hiding Data in the Padding Area of Android Applications without
           Re-Packaging

    • Free pre-print version: Loading...

      Abstract: Geochang JEON,Jeong Hyun YI,Haehyun CHO, Vol.E105-D, No.11, pp.1928-1929
      Anonymous attackers have been targeting the Android ecosystem for performing severe malicious activities. Despite the complement of various vulnerabilities by security researchers, new vulnerabilities are continuously emerging. In this paper, we introduce a new type of vulnerability that can be exploited to hide data in an application file, bypassing the Android's signing policy. Specifically, we exploit padding areas that can be created by using the alignment option when applications are packaged. We present a proof-of-concept implementation for exploiting the vulnerability. Finally, we demonstrate the effectiveness of VeileDroid by using a synthetic application that hides data in the padding area and updates the data without re-signing and updating the application on an Android device.
      Publication Date: 2022/11/01
       
  • A Multi-Tree Approach to Mutable Order-Preserving Encoding

    • Free pre-print version: Loading...

      Abstract: Seungkwang LEE,Nam-su JHO, Vol.E105-D, No.11, pp.1930-1933
      Order-preserving encryption using the hypergeomatric probability distribution leaks about the half bits of a plaintext and the distance between two arbitrary plaintexts. To solve these problems, Popa et al. proposed a mutable order-preserving encoding. This is a keyless encoding scheme that adopts an order-preserving index locating the corresponding ciphertext via tree-based data structures. Unfortunately, it has the following shortcomings. First, the frequency of the ciphertexts reveals that of the plaintexts. Second, the indices are highly correlated to the corresponding plaintexts. For these reasons, statistical cryptanalysis may identify the encrypted fields using public information. To overcome these limitations, we propose a multi-tree approach to the mutable order-preserving encoding. The cost of interactions increases by the increased number of trees, but the proposed scheme mitigates the distribution leakage of plaintexts and also reduces the problematic correlation to plaintexts.
      Publication Date: 2022/11/01
       
  • Practical Order-Revealing Encryption with Short Ciphertext

    • Free pre-print version: Loading...

      Abstract: Taek Young YOUN,Bo Sun KWAK,Seungkwang LEE,Hyun Sook RHEE, Vol.E105-D, No.11, pp.1934-1937
      To support secure database management, a number of value-added encryption schemes have been studied including order-revealing encryption (ORE) schemes. One of outstanding features of ORE schemes is the efficiency of range queries in an encrypted form. Compared to existing encryption methods, ORE leads to an increase in the length of ciphertexts. To improve the efficiency of ORE schemes in terms of the length of ciphertext, a new ORE scheme with shorter ciphertext has been proposed by Kim. In this paper, we revisit Kim's ORE scheme and show that the length of ciphertexts is not as short as analyzed in their paper. We also introduce a simple modification reducing the memory requirement than existing ORE schemes.
      Publication Date: 2022/11/01
       
  • SDOF-Tracker: Fast and Accurate Multiple Human Tracking by
           Skipped-Detection and Optical-Flow

    • Free pre-print version: Loading...

      Abstract: Hitoshi NISHIMURA,Satoshi KOMORITA,Yasutomo KAWANISHI,Hiroshi MURASE, Vol.E105-D, No.11, pp.1938-1946
      Multiple human tracking is a fundamental problem in understanding the context of a visual scene. Although both accuracy and speed are required in real-world applications, recent tracking methods based on deep learning focus on accuracy and require a substantial amount of running time. We aim to improve tracking running speeds by performing human detections at certain frame intervals because it accounts for most of the running time. The question is how to maintain accuracy while skipping human detection. In this paper, we propose a method that interpolates the detection results by using an optical flow, which is based on the fact that someone's appearance does not change much between adjacent frames. To maintain the tracking accuracy, we introduce robust interest point detection within the human regions and a tracking termination metric defined by the distribution of the interest points. On the MOT17 and MOT20 datasets in the MOTChallenge, the proposed SDOF-Tracker achieved the best performance in terms of total running time while maintaining the MOTA metric. Our code is available at https://github.com/hitottiez/sdof-tracker.
      Publication Date: 2022/11/01
       
  • Intrinsic Representation Mining for Zero-Shot Slot Filling

    • Free pre-print version: Loading...

      Abstract: Sixia LI,Shogo OKADA,Jianwu DANG, Vol.E105-D, No.11, pp.1947-1956
      Zero-shot slot filling is a domain adaptation approach to handle unseen slots in new domains without training instances. Previous studies implemented zero-shot slot filling by predicting both slot entities and slot types. Because of the lack of knowledge about new domains, the existing methods often fail to predict slot entities for new domains as well as cannot effectively predict unseen slot types even when slot entities are correctly identified. Moreover, for some seen slot types, those methods may suffer from the domain shift problem, because the unseen context in new domains may change the explanations of the slots. In this study, we propose intrinsic representations to alleviate the domain shift problems above. Specifically, we propose a multi-relation-based representation to capture both the general and specific characteristics of slot entities, and an ontology-based representation to provide complementary knowledge on the relationships between slots and values across domains, for handling both unseen slot types and unseen contexts. We constructed a two-step pipeline model using the proposed representations to solve the domain shift problem. Experimental results in terms of the F1 score on three large datasets—Snips, SGD, and MultiWOZ 2.3—showed that our model outperformed state-of-the-art baselines by 29.62, 10.38, and 3.89, respectively. The detailed analysis with the average slot F1 score showed that our model improved the prediction by 25.82 for unseen slot types and by 10.51 for seen slot types. The results demonstrated that the proposed intrinsic representations can effectively alleviate the domain shift problem for both unseen slot types and seen slot types with unseen contexts.
      Publication Date: 2022/11/01
       
  • MP-BERT4REC: Recommending Multiple Positive Citations for Academic
           Manuscripts via Content-Dependent BERT and Multi-Positive Triplet

    • Free pre-print version: Loading...

      Abstract: Yang ZHANG,Qiang MA, Vol.E105-D, No.11, pp.1957-1968
      Considering the rapidly increasing number of academic papers, searching for and citing appropriate references has become a nontrivial task during manuscript composition. Recommending a handful of candidate papers to a working draft could ease the burden of the authors. Conventional approaches to citation recommendation generally consider recommending one ground-truth citation from an input manuscript for a query context. However, it is common for a given context to be supported by two or more co-citation pairs. Here, we propose a novel scientific paper modelling for citation recommendations, namely Multi-Positive BERT Model for Citation Recommendation (MP-BERT4REC), complied with a series of Multi-Positive Triplet objectives to recommend multiple positive citations for a query context. The proposed approach has the following advantages: First, the proposed multi-positive objectives are effective in recommending multiple positive candidates. Second, we adopt noise distributions on the basis of historical co-citation frequencies; thus, MP-BERT4REC is not only effective in recommending high-frequency co-citation pairs, but it also significantly improves the performance of retrieving low-frequency ones. Third, the proposed dynamic context sampling strategy captures macroscopic citing intents from a manuscript and empowers the citation embeddings to be content-dependent, which allows the algorithm to further improve performance. Single and multiple positive recommendation experiments confirmed that MP-BERT4REC delivers significant improvements over current methods. It also effectively retrieves the full list of co-citations and historically low-frequency pairs better than prior works.
      Publication Date: 2022/11/01
       
  • Formulation of Mindfulness States as a Network Optimization Problem and an
           Attempt to Identify Key Brain Pathways Using Digital Annealer

    • Free pre-print version: Loading...

      Abstract: Haruka NAKAMURA,Yoshimasa TAWATSUJI,Tatsunori MATSUI,Makoto NAKAMURA,Koichi KIMURA,Hisanori FUJISAWA, Vol.E105-D, No.11, pp.1969-1983
      Although intervention practices like mindfulness meditation have proven effective in treating psychosis, there is no clarity on the mechanism of information propagation in the brain. In this study, we formulated a network optimization problem and searched for the optimal solution using Digital Annealer developed by Fujitsu Ltd. This is inspired by quantum computing and is effective in solving large-scale combinatorial optimization problems to find the information propagation pathway in the brain that contributes to the realization of mindfulness. Specifically, we defined the optimal network state as the state of the brain network that is considered to be associated with the mindfulness state. We formulated the problem into two network optimization problems — the minimum vertex-cover problem and the maximum-flow problem — to search for the information propagation pathway that is important for realizing the state. In the minimum vertex-cover problem, we aimed to identify brain regions that are important for the realization of the mindfulness state, and identified eight regions, including four that were suggested to be consistent with previous studies. We formulated the problem as a maximum-flow problem to identify the information propagation pathways in the brain that contribute to the activation of these four identified regions. As a result, approximately 30% of the connections in the brain network structure of this study were identified, and the pathway with the highest flow rate was considered to characterize the bottom-up emotion regulation during mindfulness. The findings of this study could be useful for more direct interventions in the context of mindfulness, which are being investigated by neurofeedback and other methods. This is because existing studies have not clarified the information propagation pathways that contribute to the realization of the brain network states that characterize mindfulness states. In addition, this approach may be useful as a methodology to identify information propagation pathways in the brain that contribute to the realization of higher-order human cognitive activities, such as mindfulness, within large-scale brain networks.
      Publication Date: 2022/11/01
       
  • Workload-Driven Analysis on the Performance Characteristics of
           GPU-Accelerated DBMSes

    • Free pre-print version: Loading...

      Abstract: Junyoung AN,Young-Kyoon SUH,Byungchul TAK, Vol.E105-D, No.11, pp.1984-1989
      This letter conducts an in-depth empirical analysis of the influence of various query characteristics on the performance of modern GPU DBMSes. Our analysis reveals that, although they can efficiently process concurrent queries, the GPU DBMSes we consider still should address various performance concerns including n-way joins, aggregates, and selective scans.
      Publication Date: 2022/11/01
       
  • Loosening Bolts Detection of Bogie Box in Metro Vehicles Based on Deep
           Learning

    • Free pre-print version: Loading...

      Abstract: Weiwei QI,Shubin ZHENG,Liming LI,Zhenglong YANG, Vol.E105-D, No.11, pp.1990-1993
      Bolts in the bogie box of metro vehicles are fasteners which are significant for bogie box structure. Effective loosening bolts detection in early stage can avoid the bolt loss and accident occurrence. Recently, detection methods based on machine vision are developed for bolt loosening. But traditional image processing and machine learning methods have high missed rate and false rate for bolts detection due to the small size and complex background. To address this problem, a loosening bolts defection method based on deep learning is proposed. The proposed method cascades two stages in a coarse-to-fine manner, including location stage based on the Single Shot Multibox Detector (SSD) and the improved SSD sequentially localizing the bogie box and bolts and a semantic segmentation stage with the U-shaped Network (U-Net) to detect the looseness of the bolts. The accuracy and effectiveness of the proposed method are verified with images captured from the Shanghai Metro Line 9. The results show that the proposed method has a higher accuracy in detecting the bolts loosening, which can guarantee the stable operation of the metro vehicles.
      Publication Date: 2022/11/01
       
  • Orthogonal Deep Feature Decomposition Network for Cross-Resolution Person
           Re-Identification

    • Free pre-print version: Loading...

      Abstract: Rui SUN,Zi YANG,Lei ZHANG,Yiheng YU, Vol.E105-D, No.11, pp.1994-1997
      Person images captured by surveillance cameras in real scenes often have low resolution (LR), which suffers from severe degradation in recognition performance when matched with pre-stocked high-resolution (HR) images. There are existing methods which typically employ super-resolution (SR) techniques to address the resolution discrepancy problem in person re-identification (re-ID). However, SR techniques are intended to enhance the human eye visual fidelity of images without caring about the recovery of pedestrian identity information. To cope with this challenge, we propose an orthogonal depth feature decomposition network. And we decompose pedestrian features into resolution-related features and identity-related features who are orthogonal to each other, from which we design the identity-preserving loss and resolution-invariant loss to ensure the recovery of pedestrian identity information. When compared with the SOTA method, experiments on the MLR-CUHK03 and MLR-VIPeR datasets demonstrate the superiority of our method.
      Publication Date: 2022/11/01
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 3.238.72.180
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-