Article
Mathematics
Andrea Corli, Luisa Malaguti, Elisa Sovrano
Summary: In this study, wavefront solutions of a nonlinear reaction-convection equation with a degenerate diffusion and a monostable reaction term were examined. It was found that these wavefront solutions exist for every speed in a closed half-line, with estimates of the threshold speed provided. The wavefront profiles were shown to be strictly monotone and their slopes were uniformly bounded by the critical values of the diffusion.
JOURNAL OF DIFFERENTIAL EQUATIONS
(2022)
Article
Mathematics, Applied
Qing Zou
Summary: A fourth-order PDE model based on the mixture of Perona-Malik equation and Cahn-Hilliard equation is proposed for image inpainting in this paper. By using the idea of energy splitting, a numerical scheme is introduced for solving the proposed PDE model. Numerical experiments demonstrate that the proposed model outperforms classical PDE based inpainting models in terms of inpainting performance and computational time efficiency.
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
(2021)
Article
Computer Science, Interdisciplinary Applications
Yiheng Wang, Bo Xiao, Ahmed Bouferguene, Mohamed Al-Hussein, Heng Li
Summary: This research introduces a content-based image retrieval method that utilizes object detection and convolutional neural networks to extract visual features of construction images, achieving accurate retrieval of target images.
JOURNAL OF COMPUTING IN CIVIL ENGINEERING
(2023)
Article
Mathematics, Interdisciplinary Applications
Anouar Ben-Loghfyry, Abderrahim Charkaoui
Summary: This study addresses a novel partial differential equation based on a time-fractional order derivative for image denoising and restoration. The authors improve the classical Perona-Malik model by considering Caputo time-fractional order derivative with regularized diffusion. The existence and uniqueness of the proposed model's weak solution are investigated and validated through theoretical analysis and numerical experiments.
CHAOS SOLITONS & FRACTALS
(2023)
Article
Engineering, Electrical & Electronic
Farah Sniba, Fahd Karami, Driss Meskine
Summary: In this paper, a new approach is proposed for solving the variational model derived from the Perona-Malik equation, which can be used to control the scattering pattern in the restored image and demonstrates favorable performance in numerical tests.
SIGNAL IMAGE AND VIDEO PROCESSING
(2023)
Article
Computer Science, Information Systems
Sudipta Kumar Ghosal, Agneet Chatterjee, Ram Sarkar
Summary: A novel steganographic scheme based on Kirsch edge detector is proposed in this paper, aiming to maximize payload by embedding more secret bits into edge pixels. The proposed scheme, with three major phases, achieves higher payload and better image quality compared to conventional steganographic schemes. Furthermore, the Kirsch edge detector outperforms traditional edge detectors in producing more edge pixels, contributing to the scheme's superior performance in terms of payload.
MULTIMEDIA SYSTEMS
(2021)
Article
Computer Science, Artificial Intelligence
Lei Zhang, Zhenwei He, Yi Yang, Liang Wang, X-B Gao
Summary: The traditional object retrieval task requires precise cropping of the objects and learning discriminative feature representations. However, in real-world scenarios, accurate detection or annotation of objects is often not available, leading to the need for image-level search with joint detection and retrieval. This paper proposes an Integrated Net and an improved version, DC-I-Net, for tackling this challenge.
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
(2022)
Article
Environmental Sciences
Mingming Lu, Qi Li, Li Chen, Haifeng Li
Summary: Patch-Noobj is an adversarial attack method that generates universal adversarial patches based on the size of attacked aircraft in remote sensing images. The experiment shows that these patches effectively reduce the Average Precision of the YOLOv3 detector on various datasets, demonstrating their attack transferability.
Article
Computer Science, Artificial Intelligence
Chengyang Li, Heng Zhou, Yang Liu, Caidong Yang, Yongqiang Xie, Zhongbo Li, Liping Zhu
Summary: This article introduces a joint architecture BAD-Net that connects the dehazing module and detection module to improve the performance of deep learning-based object detection models. By designing a two-branch structure with an attention fusion module, hazy and dehazing features are fully combined, reducing the impact of poor performance in the dehazing module on the detection module. A self-supervised haze robust loss is introduced to enable the detection module to handle different degrees of haze. Additionally, an interval iterative data refinement training strategy is proposed to guide the learning process of the dehazing module. BAD-Net enhances detection performance through detection-friendly dehazing and achieves higher accuracy compared to state-of-the-art methods on RTTS and VOChaze datasets.
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
(2023)
Article
Engineering, Aerospace
Yongsong Li, Zhengzhou Li, Yu Shen, Zhiwei Guo
Summary: A target detection method based on local image block analysis and center-surround gray difference measure (CGDM) is proposed in this article to address the challenges of detecting dim small targets under complex background clutters and noise. Experimental results show that the proposed method outperforms existing algorithms in small target detection and is robust to various target shapes, sizes, and noise types.
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS
(2023)
Article
Multidisciplinary Sciences
Nikolai Ufer, Max Simon, Sabine Lang, Bjoern Ommer
Summary: This article introduces a visual search algorithm and user interface to assist art historians in finding objects and motifs in extensive datasets. The algorithm addresses challenges in computer vision models trained on photographs, by introducing multi-style feature aggregation to produce more accurate and style-invariant search results. The retrieval system enables finding and localizing motifs within an extensive image collection in seconds, significantly improving accuracy and search time on various datasets.
Article
Computer Science, Artificial Intelligence
Guangtao Nie, Hua Huang
Summary: This article proposes a method to solve the discontinuity problem in multi-oriented object detection by encoding the object with double horizontal rectangles (DHRec). By arranging the coordinates of the four vertices in left-right and top-down order, the uniqueness of the encoding is ensured. The method uses area ratios to guide the decoding of the object. Experimental results show that the proposed method can accurately detect objects of arbitrary orientation and outperforms existing methods.
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
(2023)
Article
Computer Science, Software Engineering
Anchal Kumawat, Sucheta Panda
Summary: The research proposes a feature-based image registration method combined with fuzzy logic improved Canny operator for accurate edge detection. The method is improved in three steps: image enhancement, image registration, and edge detection, achieving good results.
Article
Computer Science, Artificial Intelligence
Zhaojian Yao, Luping Wang
Summary: In this paper, a method for saliency detection using transformer and object localization edge refinement network (OLER) is proposed. The network consists of two stages and utilizes an information multiple selection module and an edge generation module. Experimental results show that the method has advantages in terms of detection accuracy and efficiency.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Computer Science, Artificial Intelligence
Sukjoo Hong, Taeha Yi, Joosun Yum, Ji-Hyun Lee
Summary: Recent museum exhibitions are designed to meet visitor demands, with artwork analyzed based on visitor behavior to create a visitor-centric approach. The study uses object detection techniques and network analysis to understand the relationship between museum visitors and artwork, identifying significant artworks and comparing them to the museum layout. This method allows for quantitative data collection and can serve as a basis for analyzing artwork in a visitor-centered approach.
ADVANCED ENGINEERING INFORMATICS
(2021)
Review
Computer Science, Information Systems
Baraka Maiseli, Yanfeng Gu, Huijun Gao
JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION
(2017)
Article
Computer Science, Software Engineering
Baraka Jacob Maiseli, LiFei Bai, Xianqiang Yang, Yanfeng Gu, Huijun Gao
Article
Computer Science, Information Systems
Baraka Maiseli, Hubert Msuya, Suzan Kessy, Michael Kisangiri
INFORMATION PROCESSING LETTERS
(2018)
Article
Engineering, Electrical & Electronic
Baraka Jacob Maiseli
EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING
(2019)
Article
Computer Science, Artificial Intelligence
Venance Kilian, Nassor Ally, Josiah Nombo, Abdi T. Abdalla, Baraka Maiseli
Article
Engineering, Electrical & Electronic
Baraka Jacob Maiseli
SIGNAL IMAGE AND VIDEO PROCESSING
(2020)
Article
Computer Science, Information Systems
Nassor Ally, Josiah Nombo, Kwame Ibwe, Abdi T. Abdalla, Baraka Jacob Maiseli
Summary: Noise removal in images is a challenging problem that has attracted attention from many scholars. Recent methods focus on restoring semantic features while preserving textures remains an open research question. An image denoising method based on anisotropic diffusion processes has been proposed to effectively preserve edges, contours, and textures.
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY
(2021)
Article
Engineering, Electrical & Electronic
Candida Mwisomba, Abdi T. Abdalla, Idrissa Amour, Florian Mkemwa, Baraka Maiseli
Summary: Compressed sensing has revolutionized through-the-wall radar imaging by allowing image signal recovery using a portion of data, however, nonlinear methods have increased computational costs, limiting practical applications. This study introduces the use of LBFGS algorithm to lower image reconstruction time, achieving an 87% reduction in computational time relative to classical methods, even under scenarios with increased targets or data volume. The proposed method remains robust in noisy environments, demonstrating its potential in practical applications.
INTERNATIONAL JOURNAL OF MICROWAVE AND WIRELESS TECHNOLOGIES
(2022)
Article
Engineering, Electrical & Electronic
Mugundu Rambika, Abdi T. Abdalla, Baraka Maiseli, Idrissa Amour, Alfred Mwambela
Summary: This paper proposes a ghost suppression method for extended targets based on the AD feature, which can effectively improve the multipath ghost problem in through-the-wall radar imaging.
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING
(2022)
Article
Multidisciplinary Sciences
Lilian Mkonyi, Denis Rubanga, Mgaya Richard, Never Zekeya, Shimada Sawahiko, Baraka Maiseli, Dina Machuve
SCIENTIFIC AFRICAN
(2020)
Article
Engineering, Multidisciplinary
Rehema Mwawado, Baraka Maiseli, Mussa Dida
ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH
(2020)
Proceedings Paper
Computer Science, Interdisciplinary Applications
Elizabeth D. Matemba, Guoxin Li, Baraka J. Maiseli, Portia M. Tladi
PROCEEDINGS OF 2018 2ND INTERNATIONAL CONFERENCE ON SOFTWARE AND E-BUSINESS (ICSEB 2018)
(2018)
Article
Computer Science, Information Systems
Elizabeth D. Matemba, Guoxin Li, Baraka J. Maiseli
JOURNAL OF DATABASE MANAGEMENT
(2018)
Proceedings Paper
Engineering, Industrial
Chunwei Song, Baraka Maiseli, Wangmeng Zuo, Huijun Gao
IECON 2017 - 43RD ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY
(2017)
Review
Engineering, Multidisciplinary
Angelina Misso, Mussa Kissaka, Baraka Maiseli
COGENT ENGINEERING
(2020)
Article
Computer Science, Information Systems
Andre Nies, Frank Stephan
Summary: We investigate word automaticity for nilpotent groups of class 2 with prime exponent p. It is proven that the infinitely generated free group in this category is not word automatic. However, the infinite extra-special p-group Ep and an intermediate group Hp with an infinite center are both word automatic. Additionally, a method for demonstrating automaticity of central extensions of abelian groups via co-cycles is introduced.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Chik How Tan, Theo Fanuela Prabowo
Summary: This paper presents a new key recovery attack on a Hamming-metric code-based signature scheme proposed by SHMWW. The attack extends the statistical part of the attack proposed by ABDKPS. In addition to classifying the columns of the secret matrix, the attack also determines the entries of the identity columns of this matrix via statistical method. The attack has better time complexity and can recover the secret key in under 45 minutes with no more than 1500 signatures.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Julio Araujo, Victor Campos, Darlan Girao, Joao Nogueira, Antonio Salgueiro, Ana Silva
Summary: This paper studies the parameter hull number in a graph convexity called Cycle Convexity, which is motivated by related notions in Knot Theory. The authors define the interval function and investigate the properties and computational methods of the minimum convex set for a graph G.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
Summary: The investigation on the approximation ratio of the longest processing time (LPT) scheduling algorithm has been conducted in various studies. While the ratio is known for identical processors, it remains unknown for processors with different speeds. This study provides a tight approximation ratio for three, four, and five processors, showing that the ratios are no larger than the lower bound provided by Gonzalez et al. (1977) [14]. The ratios are approximately 1.38, 1.43, and 1.46 for three, four, and five processors, respectively.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Nidia Obscura Acosta, Alexandru I. Tomescu
Summary: This paper presents a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. The characterization is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of G. Additionally, the paper proposes a method to compute all maximal safe walks appearing in all Eulerian circuits in linear time.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo
Summary: The research states that the single-machine makespan minimization problem can be solved as an assignment problem in O(n3) time. Subsequent research shows that if the job-dependent learning effects are correlated with the level of sophistication of the jobs and have a lower bound, the scheduling problem can be solved in O(nlogn) time by sequencing the jobs according to the shortest processing time rule. The SPT job sequence remains optimal when the job-dependent learning effects are inversely correlated with the level of sophistication and have an upper bound. The main results of the paper are correct, but there are errors in Corollary 1 and incomplete proofs for Proposition 1 and Corollary 1. This note provides a counter example for the latter case and a modified corollary. A lemma is presented to complete the proofs for Proposition 1 and Corollary 1. Finally, a simple algorithm is developed to solve the latter case in O(n2) time.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Maximilien Mackie
Summary: This research investigates encodings for modular arithmetic in the lambda-calculus. Two approaches are considered: adapting existing numeral systems and creating a new one. The focus of this paper is to provide original techniques for encoding modular arithmetic directly. A modular arithmetic numeral system is presented, complete with multiplication and an implementation of the Chinese remainder theorem, all without recursion i.e., without using fixed-point operators.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
Summary: We demonstrate that polynomial-size constant-rank linear decision trees (LDTs) can be transformed into polynomial-size depth-2 threshold circuits LTF o LTF. An intermediate structure is polynomial-size decision lists that refer to a conjunction of a fixed number of linear threshold functions (LTFs); we prove that these are equivalent to polynomial-size exact linear decision lists (ELDLs), which query precise threshold functions (ELTFs).
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur
Summary: Count sketch is a popular sketching algorithm used for frequency estimation in data streams and pairwise inner product for real-valued vectors. This paper extends count sketch and introduces a higher-order count sketch algorithm, which compresses input tensors to approximate the queried features. It is shown that the higher-order count sketch can also closely approximate the pairwise inner product and provides a concentration analysis of the estimate.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Jean Lienardy, Frederic Lafitte
Summary: OCB3 is an authenticated encryption mode of operation that allows for associated data (AEAD), and it is known for its maturity and provable security. However, this note highlights a small flaw in the security proof of OCB3 that can result in a loss of security when using short nonces. This flaw has implications worse than nonce-repetition, as it compromises confidentiality and authenticity until the key is changed. Various approaches to fix this flaw in OCB3 are presented.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Majid Mirzanezhad
Summary: This paper proposes the first data structure for curves under the (continuous) Frechet distance in higher dimensions, which can efficiently report all curves with distances less than a given value to a query curve. For a given k value in the preprocessing stage, we propose a deterministic data structure that can answer (1 + epsilon)delta-ANNS queries in O (kd) query time, where D is the diameter of P.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Je Hong Park, Woo-Hwan Kim
Summary: This paper revisits Zhu et al.'s attack on a certificate-based proxy signature scheme proposed by Verma et al., and shows that the fundamental problem of Verma et al.'s scheme lies in its use of a weak ordinary signature scheme. Furthermore, the paper demonstrates that the attack against Verma et al.'s scheme can be similarly applied to the revised scheme, as they share many components using the weak signature.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Lluis Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Summary: This study focuses on two variants of the Maximum Linear Arrangement problem, namely the planar variant for free trees and the projective variant for rooted trees. Linear time and space complexity algorithms are presented to solve these two problems. Additionally, properties of maximum projective and planar arrangements are proven, and it is shown that caterpillar trees maximize planar MaxLA among all trees of a fixed size, thereby generalizing a previous extremal result on trees.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Mislav Blazevic, Stefan Canzar, Khaled Elbassioni, Domagoj Matijevic
Summary: This paper studies the Tai mapping and anti Tai mapping problems between rooted labeled trees. For unordered trees, finding the maximum-weight Tai mapping is proven to be NP-complete. The paper provides an efficient algorithm for finding the maximum-weight anti Tai mapping and presents a polynomial computable lower bound for the optimal anti Tai mapping based on special conditions.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Xiaowei Li, Xiwen Lu
Summary: The facility location problem with maximum distance constraint is investigated and a (3,1)-approximation algorithm is proposed. The algorithm is compared with the previous one and is found to have lower memory requirements and is suitable for large-scale problems.
INFORMATION PROCESSING LETTERS
(2024)