Myungho Lee, Oh‐Jin Kwon, Yong–Hwan Lee · Research Briefs on Information and Communication Technology Evolution · 2015
Hiding a binary image into color or grey images has been adopted as a useful watermarking methodfor protecting ownership rights. We propose a practical method for this purpose. We generate aparticular binary pseudo-random sequence resembling the sequence used in code division multipleaccess (CDMA) method. We scramble the input binary image normally representing the ownershipby using the modified Hadamard kernel, generate the CDMA binary sequence robust to image processingdistortions, and hide the resulting sequence in the normalized host image. Experimentalresults show that our method guarantees the robustness against common image processing attackssuch as JPEG compression, cropping, scaling, histogram equalization, changing luminance and contrast,etc.
Cited by 0Open access
Przemyslaw Mroszczyk, Piotr Dudek · IEEE Transactions on Circuits and Systems I Regular Papers · 2014
This paper presents the design and the VLSI implementation of an asynchronous cellular logic array for fast binary image processing. The proposed processor array employs trigger-wave propagation and collision detection mechanisms for binary image skeletonization, and Voronoi tessellation. Low power, low area, and high processing speed are achieved using full custom dynamic logic design. The prototype array consisting of 64 × 96 cells is fabricated in a standard 90 nm CMOS technology. The experimental results confirm the fast operation of the array, capable of extracting up to 2.78×10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">6</sup> skeletons per second, consuming less than 1 nJ/skeleton. The asynchronous operation enables circular wave contours, which improves the quality of the extracted skeletons. The proposed asynchronous processing module consists of 24 MOS transistors and occupies 5.5 μm×7.4 μm area. Such array can be used as a co-processing unit aiding global binary image processing in standard pixel-parallel SIMD architectures in vision chips.
Cited by 3
NTUR (臺灣機構典藏) · 1999
Cited by 0
LEE, SUNG GU, PARK, JAE YOON · Open Access System for Information Sharing (Pohang University of Science and Technology) · 2022
Binary neural networks have recently begun to be used as a highly energy- and computation-efficient image processing technique for computer vision tasks.\nThis paper proposes a novel extension of existing binary neural network technology based on the use of a {\\em Hadamard transform} in the input layer of a binary neural network.\nPrevious state-of-the-art binary neural networks require floating-point arithmetic at several parts of the neural network model computation in order to maintain a sufficient level of accuracy.\nThe Hadamard transform is similar to a Discrete Cosine Transform (used in the popular JPEG image compression method) except that it does not include expensive multiplication operations.\nIn this paper, it is shown that the Hadamard transform\ncan be used to replace the most expensive floating-point arithmetic portion of a binary neural network.\nIn order to test the efficacy of this proposed method, three types of experiments were conducted: application of the proposed method to several state-of-the-art neural network models, verification of its effectiveness in a large image dataset (ImageNet), and experiments to verify the effectiveness of the Hadamard transform by comparing the performance of binary neural networks with and without the Hadamard transform.\nThe results show that the Hadamard transform can be used to implement a highly energy-efficient binary neural network with only a miniscule loss of accuracy.
Cited by 0
Jaeyoon Park, Sunggu Lee · Lecture notes in computer science · 2023
Cited by 1
Soo‐Chang Pei, Ching-Min Cheng · IEEE Transactions on Image Processing · 1999
This paper presents a new moment-preserving thresholding technique, called the binary quaternion-moment-preserving (BQMP) thresholding, for color image data. Based on representing color data by the quaternions, the statistical parameters of color data can be expressed through the definition of quaternion moments. Analytical formulas of the BQMP thresholding can thus be determined by using the algebra of the quaternions. The computation time for the BQMP thresholding is of order of the data size. By using the BQMP thresholding, quaternion-moment-based operators are designed for the application of color image processing, such as color image compression, multiclass clustering of color data, and subpixel color edge detection. The experimental results show that the proposed operator for color image compression can have output picture quality acceptable to human eyes. In addition, the proposed edge operator can detect the color edge at the subpixel level. Therefore, the proposed BQMP thresholding can be used as a tool for color image processing.
Cited by 162
Salembier Clairon, Philippe Jean, Foucher, Samuel · RECERCAT (Consorci de Serveis Universitaris de Catalunya)
This paper discusses the interest of hierarchical region-based\nrepresentations of images such as Binary Partition Trees (BPTs) and the usefulness of graph cut to process them. BPTs can be considered as an initial abstraction from the signal in which raw pixels are grouped by similarity to form regions, which are hierarchically structured by inclusion in a tree. They provide multiple resolutions of description and easy access to subsets of regions. Their construction is often based on an iterative region-merging algorithm. Once constructed, BPTs can be used for many applications including filtering, segmentation, classification and object detection. Many processing strategies consist in populating the tree with features of interest for the application and in applying a specific graph cut called pruning. Different graph cut approaches are discussed and analyzed in the context of Polarimetric Synthetic Aperture Radar (PolSAR) images.
Cited by 0Open access
Bin Yu, Xinggang Lin, Youshou Wu · Information Processing Letters · 1991
Cited by 3
Kendall Preston, Joe Carvalko · IEEE Transactions on Computers · 1972
A computer program has been written which is capable of evaluating all possible Golay marking transformations related to a particular pattern recognition task using an exhaustive search technique. Such evaluations are reported for separating two image data sets: one taken from biomedical microscopy; the other, aerial reconnaissance.
Cited by 8
Mir Hamid Rezaei · Research in Medical & Engineering Sciences · 2021
Research in Medical & Engineering Sciences Ultra-Fast Detection of Loosened Bolts Based on Binary Image Processing Mir Hamid Rezaei1* and Javad Ostadieh2 1Department of Electrical Engineering, Technical and Vocational University, Iran 2Department of Communications and Electronics, Urmia University, Iran *Corresponding author: Mir Hamid Rezaei, Department of Electrical Engineering, Faculty of Ghazi Tabatabai, West Azarbaijan Branch, Technical and Vocational University, Urmia, Iran Submission: May 05, 2021Published: July 29, 2021 DOI: 10.31031/RMES.2021.09.000713 ISSN: 2576-8816Volume9 Issue3
Cited by 0Open access
Liren Liu, Xuejun Zhang, Zibei Zhang · Applied Optics · 1994
A parallel architecture for gray-tone image processing is proposed that utilizes the concept of threshold sum-superposition into a cellular two-layer logic binary-image processor. Various processing functions constituted by gray-tone dilation, erosion, fuzzy-logic operations, and arithmetic operations are obtained. The optoelectronic implementation is illustrated.
Cited by 4
Johan Lysaker, Marius Tai, Xue Cheng et al. · 2006
Cited by 0
Aurélien Bourquard, Student Member, Michael Unser · 2013
Abstract—Compressed sensing can substantially reduce the number of samples required for conventional signal acquisition, at the expense of an additional reconstruction procedure. It also provides robust reconstruction when using quantized measurements, including in the one-bit setting. In this paper, our goal is to design a framework for binary compressed sensing that is adapted to images. Accordingly, we propose an acquisition and reconstruction approach that complies with the high dimensionality of image data and that provides reconstructions of satisfactory visual quality. Our forward model describes data acquisition and follows physical principles. It entails a series of random convolutions performed optically followed by sampling and binary thresholding. The binary samples that are obtained can be either measured or ignored according to predefined functions. Based on these measurements, we then express our reconstruction problem as the minimization of a compound convex cost that enforces the consistency of the solution with the available binary data under total-variation regularization. Finally, we derive an efficient reconstruction algorithm relying on convex-optimization principles. We conduct several experiments on standard images and demonstrate the practical interest of our approach. Index Terms—Acquisition devices, bound optimization, compressed sensing, conjugate gradient, convex optimization, inverse problems, iteratively reweighted least squares, Nesterov’s method, point-spread function, preconditioning, quantization. I.
Cited by 0
Sarah J. Becker, Nicole Wayant · Land · 2026
Accurate identification of built-up land from remotely sensed imagery is essential for urban planning, environmental monitoring, and disaster response. However, binary built-up maps derived from single-date classifications often contain semantic noise—misclassified pixels resulting from shadows, bare soil confusion, or seasonal conditions. Common denoising methodologies, such as smoothing or filtering, are designed for continuous imagery and can distort small or fragmented features and fail to correct underlying classification errors. To overcome these limitations, this study evaluated a multi-date summation and thresholding workflow as a denoising alternative. Five Sentinel-2 images per site were classified as built-up maps, summed into a composite “built-up frequency” raster, and thresholded using Otsu, adaptive, and voting methods to produce refined binary maps. The results across nine international study sites show that the Otsu thresholding method outperformed the other methods in most locations when comparing their accuracies using the Matthews Correlation Coefficient (MCC), showing that using multiple images can improve identification of built-up land.
Cited by 0Open access
I.P.W. Sillitoe, Mati Tombak · Real-Time Imaging · 1998
Cited by 3
Y. Jin, Hee Jo, Minjung Kim et al. · 2025
Binary black-and-white sketches are widely used in fields such as clothing design due to their clarity and low storage requirements. Despite these advantages, the inherent inflexibility of raster images makes them inefficient in redesign tasks, as modifying or scaling the sketch requires a conversion to an editable vector format. To address this limitation, we propose a method for converting binary sketches into Scalable Vector Graphics (SVG), as this process serves as a crucial intermediate phase for consumer product customization and design modifications. Our proposed method involves raster preprocessing and vectorization, followed by topology-preserving point minimization and final curve refinement to maintain contour fidelity. The performance was assessed in terms of point reduction ratio and accuracy. Experimental results show the effectiveness of our proposed method on our binary sketch samples. The number of vector points was substantially reduced— from thousands to a few hundred—resulting in an average point-reduction ratio of 89.52%, while maintaining an average structural accuracy of 98.86%.
Cited by 0
Yazmin Rubiela Cote Contreras · Universidad Industrial de Santander · 2024
La topología digital surgió en los años 1970-1975 con los trabajos pioneros de Rosenfeld [Rosenfeld, 1973, Rosenfeld, 1970, Rosenfeld, 1975b, Rosenfeld, 1974, Rosenfeld, 1974, Rosenfeld, 1975a]. Su objetivo era introducir conceptos y herramientas topológicas para el análisis de imágenes digitales, especialmente para fundamentar algoritmos de adelgazamiento. Rosenfeld basó sus ideas en grafos y relaciones de adyacencia entre píxeles, que se tradujeron en ciertas nociones de conexidad. Es por eso que en el año 1990 Khalimsky, Kopperman y Meyer [Khalimsky et al., 1990b, Khalimsky et al., 1990a] introdujeron una topología en Z y en Z2, llamada topología de Khalimsky. La tesis se divide en tres capítulos. El primero estudia la topología de Khalimsky y el plano digital, centrándose en probar una versión del teorema de la curva de Jordan para esta topología probado en [Khalimsky et al., 1990b]. El segundo capítulo se enfoca en el procesamiento de imágenes binarias, definiendo conexiones y algoritmos de reducción. Se caracterizan los puntos simples y se estudia su relación con la matriz de la imagen. En el tercer capítulo explora la relación entre los enfoques de los dos capítulos anteriores, introduciendo una función Γ introducida por [Khalimsky et al., 1990a] y presentamos su extensión Γ∗ aporte de nuestro trabajo.
Cited by 0Open access
Ramesh Kumar, Bal Chand Nagar · Journal of Circuits Systems and Computers · 2025
In this paper, the authors proposed a new power-efficient binary-to-ternary converter (BTC) circuit using a hybrid memristor-MOS-Logic architecture. The proposed BTC features three binary inputs and two ternary outputs, facilitating the effective execution of multi-valued logic operations. The proposed design uses the memristor-ratio-logic (MRL) technique, which is suitable for designing hybrid memristor-MOS-based circuits. The proposed design was simulated using SPICE and the 45 nm CMOS predictive technology model (PTM) technology parameters with [Formula: see text] supply. Moreover, the proposed BTC provides an improved PDP compared to the state-of-the-art design available in the literature. The authors also demonstrate that the proposed design is applied to MATLAB data processing and image reconstruction, laying the foundation for potential image processing applications. Simulation results confirm the design’s accuracy, low power consumption and robustness, making it a promising candidate for digital design and high-performance computing applications.
Cited by 0
Bingxue Shi, Nenghai Yu · Journal of Electronics (China) · 1992
Cited by 0
Piotr Bogacki, Michał Długosz, Zofia Długosz et al. · Journal of Computational and Applied Mathematics · 2025
In this paper, we introduce a novel Binary Directional Shape (BDS) descriptor for efficient object shape classification. The BDS descriptor is designed to operate in real-time environments, balancing computational efficiency with high classification accuracy. The descriptor works by resizing input images, thresholding them into binary representations, and analyzing them along multiple predefined directions. Configurable parameters such as image size, number of directions, and step size allow for customization based on application needs. Through extensive experiments, we explore the effects of image resolution on shape classification, demonstrating how aliasing and resolution loss can impact performance. Our results show that while higher resolutions improve accuracy, challenges such as rotation variance and aliasing persist. The BDS descriptor outperforms traditional feature-based methods, providing superior classification results even in the presence of these challenges. This work demonstrates the value of directional information in shape recognition and sets the stage for future optimizations and applications.
Cited by 0Open access