J. P. Strong · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1977
The Goddard Space Flight Center is presently developing hardware technology for building ultra high speed computers for processing two dimensional data. This technology employs massive parallelism, doing thousands of operations simultaneously, to obtain this speed. The operations are performed over a binary image or matrix which is the basic data entity. If the image operations are performed at the same speed that a standard computer operates on a single binary digit the image processing speed is potentially increased by a factor equal to the number of elements in the binary image. Computers that operate on binary images have come to be called tse computers. The word "tse" is Chinese for their writing characters which are actually stylized images.
Cited by 0
A. Pushpalatha P. Krishnachaithanya · 2015
Abstract − Mathematical morphology (MM) is a theory and technique for the analysis and processing of geometrical structures, based on set theory, lattice theory, topology, and random functions. MM is most commonly applied to digital images, but it can be employed as well on graphs, surface meshes, solids, and many other spatial structures. If this mathematical morphology is applied to the binary image or itself a gray scale image then that is called the binary morphology. Digital image Processing is one of the basic and important tool in the image processing and computer vision. In this paper we discuss about the extraction of a digital image edge using different digital image processing techniques. Edge detection is the most common technique for detecting discontinuities in intensity values. The input image or actual image may have some noise that may cause the quality of the digital image. Firstly, wavelet transform is used to remove noises from the image collected. Secondly, some edge detection operators such as Differential edge detection, Log edge detection, canny edge detection and Binary morphology are analyzed. And then according to the simulation results, the advantages and disadvantages of these edge detection operators are compared. It is shown that the Binary morphology operator can obtain better edge feature. Finally, in order to gain clear and integral image profile, the method of ordering closed is given. After experimentation, edge detection method proposed in this paper is feasible. Index terms-DigitalImageEdge detection, wavelet de-noising, differential operators, and binary morphology. I.
Cited by 0
Muhammad Farhan Khan, Syed Muhammad G. Monir, Imran Naseem · Mehran University Research Journal of Engineering and Technology · 2019
Zero-watermarking of digital images is a powerful method with respect to transparency in the watermarked image. However, robustness is still a challenging characteristic for researchers. The proposed method of zero-watermarking provides a novel solution for increasing robustness by obtaining resident features of gray scale image that are robust against common signal processing operations. The proposed solution is based on image scanning to produce NDD (Neighboring Distance Difference) profile. This scheme is used to extract image features for generating redundancy binary profile with the help of image scanning and identification of robust image areas for embedding a binary watermark. Redundant areas from binary profile show perceptually insignificant regions of gray scale image according to human visual system. Resident features from robust areas of image are collected to generate the zero watermarking binary key image using reversible XOR operation. The binary key is used for extraction of binary watermark. Experimental results of the proposed method have been compared with the results of various zero-watermarking schemes as well as traditional watermarking methods and found much better at slightly higher computational cost. The comparison analysis for testing robustness has been carried out against image processing attacks like Gaussian filtering, block average filtering, motion blur filtering, image resizing, image rotation, image compression and cropping. For each attack maximum correlated watermark from the set of recovered watermarks is selected to evaluate the performance of proposed zero-watermarking scheme. It has been recorded that perfect matching is observed between original and extracted watermarks for a number of signal processing attacks.
Cited by 6Open access
Kung-Shiuh Huang, B. Keith Jenkins, Alexander A. Sawchuk · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1988
In this paper we present a two-dimensional cellular hypercube architecture for image processing that combines features of the conventional hypercube and cellular logic architectures for 2-D computation cells. A unified theory of parallel binary image processing, binary image algebra (BIA), serves as a software tool for designing parallel image processing algorithms. To match the hardware to the software, we characterize the cellular processors using the same algebraic structure as BIA. The two-dimensional cellular hypercube image processor is a cellular SIMD machine with N2 cells and has a simple overall organization, low cell complexity and fast processing ability. An optical cellular hypercube implementation of BIA is proposed which offers parallel input/output and global interconnection capabilities which are difficult to do in planar VLSI technology.
Cited by 4
Yoshihiro Shima, H. Ohya · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2006
The rotation of an image is one of the fundamental functions in image processing and is applied to document image processing in the office. A method of image rotation based on digital image data has been developed. This paper assumes the binary digital data, and proposes a method which is different from the traditional one based on pixel data. This method can execute a high-speed rotation of binary image based on coordinate data for the start and the end of the run. Using the proposed method, the image rotation at an arbitary angle can be realized by the real number operation on the run data, which is suited to the general-purpose processor. It is a practically useful method since the processing is fast and less memory capacity is required. In this paper, a discussion is made first on the format of the run data, the number of runs and the data complexity for the binary data. Then the newly devised rotation for the binary image is described. The rotation method is used to perform successively the skew coordinate transformations in the vertical and horizontal directions, to determine the rotated images. Finally, a document image is actually rotated on a conputer. The processing time was examined to demonstrate experimentally the usefulness of the proposed method.
Cited by 1
Guoqing Yang, Lihui Jiang, Yong Li · 2006
Based on rough sets and mathematical morphology theory, this paper proposes a method called membership-grade operator for binary image processing. Based on the same structural element, the operator achieves multiform dilations, erosions and edge extractions by proper choice of membership grade obtained by binary image. Applied to noise image, the operator can achieve the above processing and noise reduction, and good effect is obtained by image simulation. Finally, this paper analyzes the characteristics of the membership-grade operator by comparing it with the morphology operator
Cited by 4
Manjot Kaur, Naresh Kumar · 2016
The binary matrix or binary image reconstruction plays vital role in the reconstruction of the binary image matrix from the projection data. The several types of projection data can be taken from the binary matrices. The horizontal and vertical projections are the simplest form of the projections, whereas the diagonal and anti-diagonal projections can also be utilized for the purpose of image reconstruction from the projection data. The variance or covariance based projections also plays the important role in the case of binary image reconstruction. The binary image reconstruction may require a number of computations over the input projection data. The initial solution is essentially required because of the certain requirement for the initial stage matrix for the later stage processing, which has been proposed with the genetic programming and robust dual-stage post-processing module in this case. The results of the proposed model have been collected in the time and accuracy based parameters. The proposed model can be considered the clear winner in comparison with the subsisting model based upon the metallurgy temperature flattening algorithm in the subsisting model.
Cited by 0
Anton Kazlouski, Rauf Sadykhov · 2014
Objects detection in image is a central problem to many tasks in digital image processing and therefore it has a vast range of applications. An algorithm for plain objects detection in image based on a contour tracing algorithm in a binary image is presented in this paper. The detection of plain object in image relates to the decomposition of a binary image contour into contours and closed contours and is based on the developed by the author algorithms for: an applicant for the vertex detection in a binary image, a closed contour detection in a binary image. The algorithm for an applicant for the vertex detection in a binary image allows performing the decomposition of a binary image contour into contours and closed contours. The problem of the determination of the starting point for contour tracing algorithm in a binary image is considered. The experiments show the robustness and the efficiency of the algorithm.
Cited by 11
Haibo Wu · Shenyang Gongye Daxue xuebao · 2007
According to the characteristic of the image processing in seam tracking,the thinning method of binary images was studied.The edge of seam was firstly extracted,and then the seam was scanned along the direction vertical to seam.The center point of two edges was taken as the skeleton of the seam.The results indicate that this algorithm can accurately thin a binary image and meet the request of the image processing in seam tracking.This algorithm has such significant characteristics as small computing quantity and high computing rate,and is suitable for real-time processing and tracking of seam.Withoutany change,this algorithm can be applied for processing either black background/white image or white background/black image.Based on four processing rules deduced in this algorithm,an image can be efficiently thinned through scanning point-to-point and reserving or deleting points.
Cited by 0
2010
This chapter contains sections titled: Statistical Image Description Brightness and Contrast Manipulation Image Enhancement and Restoration Intensity-Based Segmentation (Thresholding) Multidimensional Thresholding Image Calculations Binary Image Processing Biomedical Examples References
Cited by 1
B. Gatos, G. Louloudis, N. Stamatopoulos · 2008
Abstract. The description of a digital image in terms of simple geometrical shapes, such as polygonal shapes, is a well established methodology that often proves useful for several image processing tasks, mainly to speed up image processing operations. The representation of binary images using rectangular blocks as primitives has been applied with great success to several computer vision and image processing tasks, such as fast implementation of morphological operations, fast implementation of the Hough transform, fast run length smoothing algorithm (RLSA) evaluation and fast projection profiles evaluation. Such decomposition can also contribute towards effective and fast shape analysis, image compression, image segmentation and feature identification. In this paper, we present an overview of the implementations of the most important image processing and vision tasks using binary image block representation. We focus on the acceleration achieved in comparison with the classical pixel based approaches. 1
Cited by 0
Tetiana Martyniuk · Information Technology and Computer Engineering · 2019
Correlation processing is used effectively with signal/image processing in the field of computer vision and remote sensing from satellites. Therefore, correlation processing is a promising area of image analysis and recognition, as for huge amounts of video information the automation with high-speed image processing is required. The need for high-speed processing of large amounts of optical information, including video signals, requires a comprehensive approach to the input and output of information in a human-friendly way, and the using of powerful digital methods for the correlation processing of digitized images. Therefore, the purpose of this work is to improve the process of digital correlation image processing in optoelectronic system with the ability to visualize the results of correlation processing. This paper presents a structur of optoelectronic system based on a correlation matrix with a toroidal topology of connections between its computational cells. Features of functioning of optoelectronic system are considered and two examples of correlation processing of binary images are given. The reduction of functional load on the computational cells in the correlation matrix allows to use the digital correlation methods, and the conversion of the input optical image into a digital two-dimensional binary, with subsequent presentation of the result of the correlation processing as the optical two-dimensional signal are realized respectively on the integrated analog-to-digital converter and LED matrix. Orientation to the normalized correlation processing allows, first, to obtain a binary correlation relief with a corresponding decrease in the hardware costs of the computational cells of the correlation matrix, and second, to realize the visualization of the binary correlation relief with the using of an LED matrix.
Cited by 0Open access
Ashish Aggarwal, R. Kunal · 2005
The paper presents a novel approach for pre-processing of binary images, which helps in subsequent application of the genetic algorithm in a parallel manner and reduces the computational time, while at the same time improves the quality of the regenerated image and makes the evolutionary approach more practical to employ for fractal image compression. Pre-processing involves division of image into disconnected regions, identification of the largest solid rectangle and final partitioning about the rectangle. The performance of the proposed partitioned technique is tested on a binary image and the experimental results are reported.
Cited by 3
Hang Zhao, Zhao Xue Chen · Applied Mechanics and Materials · 2013
Filling holes in binary images is often required during medical image processing and analysis. However, traditional hole filling algorithms for medical images expose some disadvantages such as possible edge degradations and relatively low efficiency. To overcome such limits, a hole filling algorithm for binary cell images based on largest connected region extraction is proposed in this paper. Since there are less pixels for foreground areas in usual binary cell images, the holes in the binary images can be simply filled by extracting & filling the largest connected region in correspondent negative images together with a following OR operation between the obtained result image and the original binary image. Such an algorithm based on largest connected region extraction nearly has no effect on edge information of the ROI(region of interested) with high accuracy and efficiency. The final experiments show its validity and advantage over the traditional morphology methods for hole filling in binary cell images. Thus the presented method is of a considerable reference value for binary image processing.
Cited by 6
Samuel P. Kozaitis, Robert Petrilak · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1991
Infrared imagery of 512 X 512 pixels was processed with 128 X 128 arrays by computer simulations of optical correlation. Pyramidal processing using binary phase-only filters was used to process an entire image in parallel at different resolutions. Morphological processing was used to create an image pyramid so that only binary processing was used. The descent policy (processing path to a different level of the pyramid) for optical processing was found to be simpler than that of template matching in digital image processing. Results showed that approximate indications of whether an object is present in a scene can be determined quickly. Further processing generally revealed more precise information. Furthermore, in-class objects present within an image but not exactly matching the filter did not necessarily produce more precise information upon further processing. The termination level of the processing technique is nontrivial and may not be the highest resolution level in some cases.
Cited by 0
Lifeng He, Xiao Zhao, Yun Yang et al. · 2013
Although hexagonal images have attracted many attentions, there is almost no report on connected-component labeling algorithm for binary hexagonal images. This paper studies this problem for the first time and presents a fast connected-component labeling algorithm for binary hexagonal images. We analyze the connectivity of two different type foreground pixels with their processed pixels when an image is processed in the raster scan order, and give corresponding processing masks. For labeling binary hexagonal images, although we can process pixels one by one in the first scan as in most of labeling algorithms, we propose an efficient algorithm by processing pixels two by two. We show that by our proposed algorithm, for labeling a binary hexagonal image, the average number of times for checking the neighbor pixels for processing a foreground pixel will decrease, thus it leads to a more efficiently processing. Experimental results demonstrated that our proposed method is more efficient than the algorithm extended straightly from the fastest labeling algorithm for rectangle binary images.
Cited by 1
V. Shpakovskij · Людина і космос. · 2025
the Landsat-8 satellite image processing technology is presented, which includes preliminary operations; spectral synthesis in natural and artificial colors using thermal and infrared spectral channels; creation of NDWI and MNDWI index images; threshold binarization of the index image; morphological filtering of a binary image; calculation of the difference image for two pictures taken at different times; vectorization of a binary image and calculation of characteristics.
Cited by 0Open access
Salembier Clairon, Philippe Jean, Garrido Ostermann, Luis · RECERCAT (Consorci de Serveis Universitaris de Catalunya)
This paper discusses the interest of binary partition trees as shape-oriented image representations. Binary partition trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. This representation can be used for a large number of processing goals such as filtering, segmentation, information retrieval and visual browsing. Furthermore, the processing of the tree representation leads to very efficient algorithms.
Cited by 0Open access
Takuya Okamoto, Sharifu Ura · Journal of Manufacturing and Materials Processing · 2024
Image processing systems can be used to measure the accuracy of 3D-printed objects. These systems must compare images of the CAD model of the object to be printed with its 3D-printed counterparts to identify any discrepancies. Consequently, the integrity of the accuracy measurement process is heavily dependent on the image processing settings chosen. This study focuses on this issue by developing a customized image processing system. The system generates binary images of a given CAD model and its 3D-printed counterparts and then compares them pixel by pixel to determine the accuracy. Users can experiment with various image processing settings, such as grayscale to binary image conversion threshold, noise reduction parameters, masking parameters, and pixel-fineness adjustment parameters, to see how they affect accuracy. The study concludes that the grayscale to binary image conversion threshold has the most significant impact on accuracy and that the optimal threshold varies depending on the color of the 3D-printed object. The system can also effectively eliminate noise (filament marks) during image processing, ensuring accurate measurements. Additionally, the system can measure the accuracy of highly complex porous structures where the pore size, depth, and distribution are random. The insights gained from this study can be used to develop intelligent systems for the metrology of additive manufacturing.
Cited by 6Open access
Harjinder Singh Dhanjal . · International Journal of Research in Engineering and Technology · 2013
Post processing uses mathematical morphologies to improve the quality of Binary image of a Document. It is observed that when a document is written using a ball point pen or when there is a problem in toner of printer then in scanned copy of such documents there are some minimal stroke gaps which are not easily visible to human eye. But a machine can easily recognise these gaps. These gaps lower the quality of binary image of a document. Post processing very important for improve the accuracy of binarization of degraded documents. In this paper a mathematical technique is discussed to improve the quality of binary image.
Cited by 0Open access