Search

Microscope vision analysis is applied in many fields. The traditional way is to use the human eye to observe and manually focus to obtain the image of the observed object. However, with the observation object becoming more and more subtle, the magnification of the microscope is required to be larger and larger. The method of manual focusing cannot guarantee the best focusing position of the microscope in use. Therefore, in this paper, we are studying the existing autofocusing technology and the autofocusing method of microscope based on image processing, which is different from the traditional manual focusing method. The autofocusing method of microscope based on image processing does not need the information such as the target position and the focal length of optical system, to directly focus the collected image. First of all, in order to solve the problem of large computation and difficult real time of traditional wavelet based image sharpness evaluation algorithm, this paper proposes an improved wavelet based image sharpness evaluation algorithm; secondly, in view of the situation that the window selected by traditional focusing window selection method is fixed, this paper adopts an adaptive focusing window selection method to increase the focusing window. Finally, this paper studies the extremum search strategy. In order to avoid the interference of the local extremum in the focusing curve, this paper proposes an improved hill-climbing algorithm to achieve the accuracy of focusing search. The simulation results show that the improved wavelet transform image definition evaluation algorithm can improve the definition evaluation performance, and the improved mountain climbing algorithm can reduce the impact of local extremum and improve the accuracy of the search algorithm. All in all, it can be concluded that the method based on image processing proposed in this paper has a good focusing effect, which can meet the needs of anti-interference and extreme value search of microscope autofocus.

To improve the interpretability or perception of information in images for human viewers is the main goal of image enhancement. Aiming at the problem that image edges are difficult to determine due to artefacts, plaques, and vascular branches in cardiovascular ultrasound, an edge ultrasound imaging detection algorithm based on spatial-frequency-domain image enhancement is proposed to improve the clarity of ultrasound images. Firstly, this paper uses the space-frequency-domain enhancement algorithm to enhance the image. This algorithm overcomes the problem of low contrast of conventional algorithms. The enhanced data matrix is used as the cost matrix, and then, the heuristic image search method is used to search the image of the cost matrix. The results show that the use of spatial-frequency-domain image ultrasound imaging algorithm can improve the contrast and sharpness of ultrasound images of cardiovascular disease, which can make the middle edge of the image clearer, the detection accuracy rate is increased to 92.76%, and the ultrasound of cardiovascular disease is improved. The edge of the image gets accuracy. The paper confirms that the ultrasound imaging algorithm based on spatial-frequency-domain image enhancement is worthy of application in clinical ultrasound image processing. The performance of the proposed technique is 32.54%, 75.30%, 21.19%, 21.26%, and 11.10% better than the existing technique in terms of edge energy, detail energy, sharpness, contrast, and information entropy, respectively.

The increase in computational power in recent years has opened a new door for image processing techniques. Three-dimensional object recognition, identification, pose estimation, and mapping are becoming popular. The need for real-world objects to be mapped into three-dimensional spatial representation is greatly increasing, especially considering the heap jump we obtained in the past decade in virtual reality and augmented reality. This paper discusses an algorithm to convert an array of captured images into estimated 3D coordinates of their external mappings. Elementary methods for generating three-dimensional models are also discussed. This framework will help the community in estimating three-dimensional coordinates of a convex-shaped object from a series of two-dimension images. The built model could be further processed for increasing the resemblance of the input object in terms of its shapes, contour, and texture.

Quantum image processing (QIP) is a research branch of quantum information and quantum computing. It studies how to take advantage of quantum mechanics’ properties to represent images in a quantum computer and then, based on that image format, implement various image operations. Due to the quantum parallel computing derived from quantum state superposition and entanglement, QIP has natural advantages over classical image processing. But some related works misuse the notion of quantum superiority and mislead the research of QIP, which leads to a big controversy. In this paper, after describing this field’s research status, we list and analyze the doubts about QIP and argue “quantum image classification and recognition” would be the most significant opportunity to exhibit the real quantum superiority. We present the reasons for this judgment and dwell on the challenges for this opportunity in the era of NISQ (Noisy Intermediate-Scale Quantum).

As the important data basis of surrounding rock classification, rock mass structural information obtained by traditional image processing and feature extraction algorithms could not be quantitatively analyzed because of the uncertainty and geometric randomness of structural planes. In this paper, based on straight line detection, intelligent scissors, and morphological edge detection algorithms, the multiple interpretation system of rock mass image including linear bunching extraction, magnetic tracking extraction, and multiparameter characterization was researched and developed, and the actual distribution information and the related probability distribution model of structural planes could be obtained directly. On the basis of this, plenty of corresponding random rating-values meeting the probability distribution models of these evaluation indices were gained by Monte Carlo Simulation. The distribution probability affiliated with different rock mass grade was attained by inductive statistics, and the robust evaluation of surrounding rock classification could be carried out. Taking the robust results as learning samples, the response model of surrounding rock grade based on Gaussian process classification was established, making the evaluation of surrounding rock subclassification more rapid and robust.

This paper proposes a new effective model for denoising images with Rician noise. The sparse representations of images have been shown to be efficient approaches for image processing. Inspired by this, we learn a dictionary from the noisy image and then combine the MAP model with it for Rician noise removal. For solving the proposed model, the primal-dual algorithm is applied and its convergence is studied. The computational results show that the proposed method is promising in restoring images with Rician noise.

Forest fires represent one of the main problems threatening forest sustainability. Therefore, an early prevention system of forest fire is urgently needed. To address the problem of forest farm fire monitoring, this paper proposes a forest fire monitoring system based on drones and deep learning. The proposed system aims to solve the shortcomings of traditional forest fire monitoring systems, such as blind spots, poor real-time performance, expensive operational costs, and large resource consumption. The image processing techniques are used to determine whether the frame returned by a drone contains fire. This process is accomplished in real time, and the resultant information is used to decide whether a rescue operation is needed. The proposed method has simple operations, high operating efficiency, and low operating cost. The experimental results indicate that the relative accuracy of the proposed algorithm is 81.97%. In addition, the proposed technique provides a digital ability to monitor forest fires in real time effectively. Thus, it can assist in avoiding fire-related disasters and can significantly reduce the labor and other costs of forest fire disaster prevention and suppression.

Rail fastener status recognition and detection are key steps in the inspection of the rail area status and function of real engineering projects. With the development of and widespread interest in image processing techniques and deep learning theory, detection methods that combine the two have yielded promising results in practical detection applications. In this paper, a semantic-segmentation-based algorithm for the state recognition of rail fasteners is proposed. On the one hand, we propose a functional area location and annotation method based on a salient detection model and construct a novel slab-fastclip-type rail fastener dataset. On the other hand, we propose a semantic-segmentation-framework-based model for rail fastener detection, where we detect and classify rail fastener states by combining the pyramid scene analysis network (PSPNet) and vector geometry measurements. Experimental results prove the validity and superiority of the proposed method, which can be introduced into practical engineering projects.

Heterogeneous systems have gained popularity due to the rapid growth in data and the need for processing this big data to extract useful information. In recent years, many healthcare applications have been developed which use machine learning algorithms to perform tasks such as image classification, object detection, image segmentation, and instance segmentation. The increasing amount of big visual data requires images to be processed efficiently. It is common that we use heterogeneous systems for such type of applications, as processing a huge number of images on a single PC may take months of computation. In heterogeneous systems, data are distributed on different nodes in the system. However, heterogeneous systems do not distribute images based on the computing capabilities of different types of processors in the node; therefore, a slow processor may take much longer to process an image compared to a faster processor. This imbalanced workload distribution observed in heterogeneous systems for image processing applications is the main cause of inefficient execution. In this paper, an efficient workload distribution mechanism for image processing applications is introduced. The proposed approach consists of two phases. In the first phase, image data are divided into an ideal split size and distributed amongst nodes, and in the second phase, image data are further distributed between CPU and GPU according to their computation speeds. Java bindings for OpenCL are used to configure both the CPU and GPU to execute the program. The results have demonstrated that the proposed workload distribution policy efficiently distributes the images in a heterogeneous system for image processing applications and achieves 50% improvements compared to the current state-of-the-art programming frameworks.

Image filtering can change or enhance an image by emphasizing or removing certain features of the image. An image is a system in which some information is known and some information is unknown. Grey system theory is an important method for dealing with this kind of system, and grey correlation analysis and grey prediction modeling are important components of this method. In this paper, a fractional grey prediction model based on a filtering algorithm by combining a grey correlation model and a fractional prediction model is proposed. In this model, first, noise points are identified by comparing the grey correlation and the threshold value of each pixel in the filter window, and then, through the resolution coefficient of the important factor in image processing, a variety of grey correlation methods are compared. Second, the image noise points are used as the original sequence by the filter pane. The grey level of the middle point is predicted by the values of the surrounding pixel points combined with the fractional prediction model, replacing the original noise value to effectively eliminate the noise. Finally, an empirical analysis shows that the PSNR and MSE of the new model are approximately 27 and 140, respectively; these values are better than those of the comparison models and achieve good processing effects.

Potholes are the most common form of distress on cement concrete pavements, which can compromise pavement safety and ridability. Thus, timely and accurate pothole detection is an important task in developing proper maintenance strategies and ensuring driving safety. This paper proposes a method of integrating the processing of grayscale and texture features. This method mainly combines industrial camera to realize rapid and accurate detection of pothole. Image processing techniques including texture filters, image grayscale, morphology, and extraction of the maximum connected domain are used synergistically to extract useful features from digital images. A machine learning model based on the library for support vector machine (LIBSVM) is constructed to distinguish potholes from longitudinal cracks, transverse cracks, and complex cracks. The method is validated using data collected from agricultural and pastoral areas of Inner Mongolia, China. The comprehensive experiments for recognition of potholes show that the recall, precision, and F1-Score achieved are 100%, 97.4%, and 98.7%, respectively. In addition, the overlap rate between the extracted pothole region and the original image is estimated. Images with an overlap rate greater than 90% accounted for 76.8% of the total image, and images with an overlap rate greater than 80% accounted for 94% of the total image. A comparison discloses that the proposed approach is superior to the existing method not only from the perspective of the accuracy of pothole detection but also from the perspective of the segmentation effect and processing efficiency.

The augmented Lagrangian method (ALM) is one of the most successful first-order methods for convex programming with linear equality constraints. To solve the two-block separable convex minimization problem, we always use the parallel splitting ALM method. In this paper, we will show that no matter how small the step size and the penalty parameter are, the convergence of the parallel splitting ALM is not guaranteed. We propose a new convergent parallel splitting ALM (PSALM), which is the regularizing ALM’s minimization subproblem by some simple proximal terms. In application this new PSALM is used to solve video background extraction problems and our numerical results indicate that this new PSALM is efficient.

Skin detection is an interesting problem in image processing and is an important preprocessing step for further techniques like face detection, objectionable image detection, etc. However, its performance has not really been high because of the high overlapped degree between “skin” and “nonskin” pixels. This paper proposes a new approach to improve the skin detection performance using the Bayesian classifier and connected component algorithm. Specifically, the Bayesian classifier is utilized to identify “true skin” pixels using the first posterior probability threshold, which is approximate to 1, and to identify "skin candidate" pixels using the second posterior probability threshold. Subsequently, the connected component algorithm is used to find all the connected components containing the “skin candidate” pixels. According to the fact that a skin pixel often connects with other skin pixels in an image, all pixels in a connected component are classified as “skin” if there is at least one “true skin” pixel in that connected component. It means that the “nonskin” pixels whose color is similar to skin are classified as “nonskin” when they have the posterior probabilities lower than the first posterior probability threshold and do not connect with any “true skin” pixel. This idea can help us to improve the skin classification performance, especially the false positive rate.

Image denoising is an important problem in many fields of image processing. Boosting algorithm attracts extensive attention in recent years, which provides a general framework by strengthening the original noisy image. In such framework, many classical existing denoising algorithms can improve the denoising performance. However, the boosting step is fixed or nonadaptive; i.e., the noise level in iteration steps is set to be a constant. In this work, we propose a noise level estimation algorithm by combining the overestimation and underestimation results. Based on this, we further propose an adaptive boosting algorithm that excludes intricate parameter configuration. Moreover, we prove the convergence of the proposed algorithm. Experimental results that are obtained in this paper demonstrate the effectiveness of the proposed adaptive boosting algorithm. In addition, compared with the classical boosting algorithm, the proposed algorithm can get better performance in terms of visual quality and peak signal-to-noise ratio (PSNR).

The paper proposes a new method that combines the decorrelation and shrinkage techniques to neural network-based approaches for noise removal purposes. The images are represented as sequences of equal sized blocks, each block being distorted by a stationary statistical correlated noise. Some significant amount of the induced noise in the blocks is removed in a preprocessing step, using a decorrelation method combined with a standard shrinkage-based technique. The preprocessing step provides for each initial image a sequence of blocks that are further compressed at a certain rate, each component of the resulting sequence being supplied as inputs to a feed-forward neural architectureFX→FH→FY. The local memories of the neurons of the layersFHandFYare generated through a supervised learning process based on the compressed versions of blocks of the same index value supplied as inputs and the compressed versions of them resulting as the mean of their preprocessed versions. Finally, using the standard decompression technique, the sequence of the decompressed blocks is the cleaned representation of the initial image. The performance of the proposed method is evaluated by a long series of tests, the results being very encouraging as compared to similar developments for noise removal purposes.

Combined with two different types of image dehazing strategies based on image enhancement and atmospheric physical model, respectively, a novel method for gray-scale image dehazing is proposed in this paper. For image-enhancement-based strategy, the characteristics of its simplicity, effectiveness, and no color distortion are preserved, and the common guided image filter is modified to match the application of image enhancement. Through wavelet decomposition, the high frequency boundary of original image is preserved in advance. Moreover, the process of image dehazing can be guided by the image of scene depth proportion directly estimated from the original gray-scale image. Our method has the advantages of brightness consistency and no distortion over the state-of-the-art methods based on atmospheric physical model. Particularly, our method overcomes the essential shortcoming of the abovementioned methods that are mainly working for color image. Meanwhile, an image of scene depth proportion is acquired as a byproduct of image dehazing.

Forest fires represent a real threat to human lives, ecological systems, and infrastructure. Many commercial fire detection sensor systems exist, but all of them are difficult to apply at large open spaces like forests because of their response delay, necessary maintenance needed, high cost, and other problems. In this paper a forest fire detection algorithm is proposed, and it consists of the following stages. Firstly, background subtraction is applied to movement containing region detection. Secondly, converting the segmented moving regions from RGB to YCbCr color space and applying five fire detection rules for separating candidate fire pixels were undertaken. Finally, temporal variation is then employed to differentiate between fire and fire-color objects. The proposed method is tested using data set consisting of 6 videos collected from Internet. The final results show that the proposed method achieves up to 96.63% of true detection rates. These results indicate that the proposed method is accurate and can be used in automatic forest fire-alarm systems.

Vehicle detection is one of the important technologies in intelligent video surveillance systems. Owing to the perspective projection imaging principle of cameras, traditional two-dimensional (2D) images usually distort the size and shape of vehicles. In order to solve these problems, the traffic scene calibration and inverse projection construction methods are used to project the three-dimensional (3D) information onto the 2D images. In addition, a vehicle target can be characterized by several components, and thus vehicle detection can be fulfilled based on the combination of these components. The key characteristics of vehicle targets are distinct during a single day; for example, the headlight brightness is more significant at night, while the vehicle taillight and license plate color are much more prominent in the daytime. In this paper, by using the background subtraction method and Gaussian mixture model, we can realize the accurate detection of target lights at night. In the daytime, however, the detection of the license plate and taillight of a vehicle can be fulfilled by exploiting the background subtraction method and the Markov random field, based on the spatial geometry relation between the corresponding components. Further, by utilizing Kalman filters to follow the vehicle tracks, detection accuracy can be further improved. Finally, experiment results demonstrate the effectiveness of the proposed methods.

This paper addresses the image restoration problem which remains a significant field of image processing. The fields of experts- (FoE-) based image restoration has been discussed and some open issues including noise estimation and parameter selection have been approached. The stochastic method FoE performs fairly well; meanwhile it might also produce unsatisfactory outcome especially when the noise is grave. To improve the final performance, we introduce the integration with deterministic method K-SVD. The FoE-treated image has been used to obtain the dictionary, and with the help of sparse and redundant representation over trained dictionary, the K-SVD algorithm can dramatically solve the problem, even though the pretreated result is of poor quality under severe noise condition. The experimental results via our proposed method are demonstrated and compared in detail. Meanwhile the test results from both qualitative and quantitative aspects are given, which present the better performance over current state-of-art related restoration algorithms.

An approach to automatic hoverfly species discrimination based on detection and extraction of vein junctions in wing venation patterns of insects is presented in the paper. The dataset used in our experiments consists of high resolution microscopic wing images of several hoverfly species collected over a relatively long period of time at different geographic locations. Junctions are detected using the combination of the well known HOG (histograms of oriented gradients) and the robust version of recently proposed CLBP (complete local binary pattern). These features are used to train an SVM classifier to detect junctions in wing images. Once the junctions are identified they are used to extract statistics characterizing the constellations of these points. Such simple features can be used to automatically discriminate four selected hoverfly species with polynomial kernel SVM and achieve high classification accuracy.

In order to obtain correct facial recognition results, one needs to adopt appropriate facial detection techniques. Moreover, the effects of facial detection are usually affected by the environmental conditions such as background, illumination, and complexity of objectives. In this paper, the proposed facial detection scheme, which is based on depth map analysis, aims to improve the effectiveness of facial detection and recognition under different environmental illumination conditions. The proposed procedures consist of scene depth determination, outline analysis, Haar-like classification, and related image processing operations. Since infrared light sources can be used to increase dark visibility, the active infrared visual images captured by a structured light sensory device such as Kinect will be less influenced by environmental lights. It benefits the accuracy of the facial detection. Therefore, the proposed system will detect the objective human and face firstly and obtain the relative position by structured light analysis. Next, the face can be determined by image processing operations. From the experimental results, it demonstrates that the proposed scheme not only improves facial detection under varying light conditions but also benefits facial recognition.

Texture classification is an important research topic in image processing. In 2012, scattering transform computed by iterating over successive wavelet transforms and modulus operators was introduced. This paper presents new approaches for texture features extraction using scattering transform. Scattering statistical features and scattering cooccurrence features are derived from subbands of the scattering decomposition and original images. And these features are used for classification for the four datasets containing 20, 30, 112, and 129 texture images, respectively. Experimental results show that our approaches have the promising results in classification.

For displaying high-dynamic-range images acquired by thermal camera systems, 14-bit raw infrared data should map into 8-bit gray values. This paper presents a new method for detail enhancement of infrared images to display the image with a relatively satisfied contrast and brightness, rich detail information, and no artifacts caused by the image processing. We first adopt a propagated image filter to smooth the input image and separate the image into the base layer and the detail layer. Then, we refine the base layer by using modified histogram projection for compressing. Meanwhile, the adaptive weights derived from the layer decomposition processing are used as the strict gain control for the detail layer. The final display result is obtained by recombining the two modified layers. Experimental results on both cooled and uncooled infrared data verify that the proposed method outperforms the method based on log-power histogram modification and bilateral filter-based detail enhancement in both detail enhancement and visual effect.

The rapid growth of digital images has caused the traditional image retrieval technology to be faced with new challenge. In this paper we introduce a new approach for large-scale scene image retrieval to solve the problems of massive image processing using traditional image retrieval methods. First, we improved traditionalk-Means clustering algorithm, which optimized the selection of the initial cluster centers and iteration procedure. Second, we presented a parallel design and realization method for improvedk-Means algorithm applied it to feature clustering of scene images. Finally, a storage and retrieval scheme for large-scale scene images was put forward using the large storage capacity and powerful parallel computing ability of the Hadoop distributed platform. The experimental results demonstrated that the proposed method achieved good performance. Compared with the traditional algorithms with single node architecture and parallelk-Means algorithm, the proposed method has obvious advantages for use in large-scale scene image data retrieval in terms of retrieval accuracy, retrieval time overhead, and computational performance (speedup and efficiency, sizeup, and scaleup), which is a significant improvement from applying parallel processing to intelligent algorithms with large-scale datasets.

Low visibility is one of the reasons for rear accident at night. In this paper, we propose a method to detect the leading vehicle based on multisensor to decrease rear accidents at night. Then, we use image enhancement algorithm to improve the human vision. First, by millimeter wave radar to get the world coordinate of the preceding vehicles and establish the transformation of the relationship between the world coordinate and image pixels coordinate, we can convert the world coordinates of the radar target to image coordinate in order to form the region of interesting image. And then, by using the image processing method, we can reduce interference from the outside environment. Depending on D-S evidence theory, we can achieve a general value of reliability to test vehicles of interest. The experimental results show that the method can effectively eliminate the influence of illumination condition at night, accurately detect leading vehicles, and determine their location and accurate positioning. In order to improve nighttime driving, the driver shortage vision, reduce rear-end accident. Enhancing nighttime color image by three algorithms, a comparative study and evaluation by three algorithms are presented. The evaluation demonstrates that results after image enhancement satisfy the human visual habits.

Search and rescue operations usually require significant resources, personnel, equipment, and time. In order to optimize the resources and expenses and to increase the efficiency of operations, the use of unmanned aerial vehicles (UAVs) and aerial photography is considered for fast reconnaissance of large and unreachable terrains. The images are then transmitted to control center for automatic processing and pattern recognition. Furthermore, due to the limited transmission capacities and significant battery consumption for recording high resolution images, in this paper we consider the use of smart acquisition strategy with decreased amount of image pixels following the compressive sensing paradigm. The images are completely reconstructed in the control center prior to the application of image processing for suspicious objects detection. The efficiency of this combined approach depends on the amount of acquired data and also on the complexity of the scenery observed. The proposed approach is tested on various high resolution aerial images, while the achieved results are analyzed using different quality metrics and validation tests. Additionally, a user study is performed on the original images to provide the baseline object detection performance.

In complex aeronautical and space engineering systems, conventional sensors used for environment perception fail to determine the orientation because of the influences of the special environments, wherein geomagnetic fields are exceptional and the Global Positioning System is unavailable. This paper presents a fisheye-lens-based visual sun compass that is efficient in determining orientation in such applications. The mathematical model is described, and the absolute orientation is identified by image processing techniques. For robust detection of the sun in the image of the visual sun compass, a modified maximally stable extremal region algorithm and a method named constrained least squares with pruning are proposed. In comparison with conventional sensors, the proposed visual sun compass can provide absolute orientation with a tiny size and light weight in especial environments. Experiments are carried out with a prototype validating the efficiency of the proposed visual sun compass.

This paper covers the use of monocular vision to control autonomous navigation for a robot in a dynamically changing environment. The solution focused on using colour segmentation against a selected floor plane to distinctly separate obstacles from traversable space: this is then supplemented with canny edge detection to separate similarly coloured boundaries to the floor plane. The resulting binary map (where white identifies an obstacle-free area and black identifies an obstacle) could then be processed by fuzzy logic or neural networks to control the robot’s next movements. Findings show that the algorithm performed strongly on solid coloured carpets, wooden, and concrete floors but had difficulty in separating colours in multicoloured floor types such as patterned carpets.

Removing the haze effects on images or videos is a challenging and meaningful task for image processing and computer vision applications. In this paper, we propose a multiscale fusion method to remove the haze from a single image. Based on the existing dark channel prior and optics theory, two atmospheric veils with different scales are first derived from the hazy image. Then, a novel and adaptive local similarity-based wavelet fusion method is proposed for preserving the significant scene depth property and avoiding blocky artifacts. Finally, the clear haze-free image is restored by solving the atmospheric scattering model. Experimental results demonstrate that the proposed method can yield comparative or even better results than several state-of-the-art methods by subjective and objective evaluations.

The color filters that are used to attenuate noise are usually optimized to perform extremely well when dealing with certain noise distributions. Unfortunately it is often the case that the noise corrupting the image is not known. It is thus beneficial to knowa priorithe type of noise corrupting the image in order to select the optimal filter. A method of extracting and characterizing the noise within a digital color image using the generalized Gaussian probability density function (pdf) (B.D. Jeffs and W.H. Pun,IEEE Transactions on Image Processing,4(10), 1451–1456, 1995 andProceedings of the Int. Conference on Image Processing,465–468, 1996), is presented. In this paper simulation results are included to demonstrate the effectiveness of the proposed methodology.

Barcode technology is one of the most important parts of Automatic Identification and Data Capture (AIDC). Quick Response code (QR code) is one of the most popular types of two-dimensional barcodes. How to decode various QR code images efficiently and accurately is a challenge. In this paper, we revise the traditional decoding procedure by proposing a serial of carefully designed preprocessing methods. The decoding procedure consists of image binarization, QR code extraction, perspective transformation and resampling, and error correction. By these steps, we can recognize different types of QR code images. The experiment results show that our method has better accuracy than Google open-source 1D/2D barcode image processing library Zxing-2.1. Moreover, we evaluate the execution time for different-size images. Our method can decode these images in real time.

Discrete Cosine transform (DCT) and inverse DCT (IDCT) have been widely used in many image processing systems and real-time computation of nonlinear time series. In this paper, a novel lineararray of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput as well as decreasing the hardware cost, the input and output data are reordered. The proposed 8-point DCT/IDCT processor with four multipliers, simple adders, and less registers and ROM storing the immediate results and coefficients, respectively, has been implemented on FPGA (field programmable gate array) and SoC (system on chip). The linear-array DCT/IDCT processor with the computation complexityO(5N/8)and hardware complexityO(5N/8)is fully pipelined and scalable for variable-length DCT/IDCT computations.