This paper describes an efficient edge detection algorithm that can be used as a plug-in for digital imageprocessingsystems. The proposed algorithm uses a method based on iterative clustering targeting a reduced num...
详细信息
This paper describes an efficient edge detection algorithm that can be used as a plug-in for digital imageprocessingsystems. The proposed algorithm uses a method based on iterative clustering targeting a reduced number of operations. The algorithm splits the image into two parts, background and foreground, and calculates the mean value for each of them. Based on these results, the new threshold value will be obtained and looped until the mean values remain unchanged. The only pixels affected by the change are the pixels with values between the previous two thresholds, so only they have to be redistributed to a new class. As a result, only few operations are needed in order to obtain the desired threshold. All the algorithms and results obtained in this paper are developed and tested using the C# programming language.
Today, Approximate Computing represents one of the most important breakthrough in many scientific research areas. It exploits the inherent tolerance property of algorithms in order to perform approximate computations ...
详细信息
Today, Approximate Computing represents one of the most important breakthrough in many scientific research areas. It exploits the inherent tolerance property of algorithms in order to perform approximate computations that have an acceptable accuracy and, at the same time, better performance than original versions. Previous work in the literature demonstrated the effectiveness of the trade-off between accuracy and performance, such as energy consumption, time and occupied area for integrated circuits, and many approximate computing methodologies were proposed. Unfortunately, introduced approaches fit in specific application domains and a general and systematic methodology to automatically define approximate algorithms is still an open challenge. Taking into account previous considerations, we make a key contribution in this direction by introducing a novel Approximate Computing methodology. Indeed, in this paper, we present an extended version of idea IDEA, a design exploration tool, which makes use of a source-to-source manipulation tool in order to apply code transformations that approximate the computation of a C/C++ algorithm. IDEA searches for configurations of a given algorithm that are characterized by an approximation error which is less than a user-defined threshold. Aiming at show the efficacy of IDEA, we configure it to find approximate variants of an algorithm by applying rounding techniques on numeric operations and we optimize two imageprocessingalgorithms, reducing the hardware overhead of their equivalent implementations.
In this paper, we present a novel algorithm for feature point detecting and matching. Algorithm is robust to image noise and computationally simple, hence it is more suitable for on-board processing robotics applicati...
详细信息
In this paper, we present a novel algorithm for feature point detecting and matching. Algorithm is robust to image noise and computationally simple, hence it is more suitable for on-board processing robotics applications. We introduce two repeatability measurements, that can be used in training phase to optimize parameters of the algorithm. Proposed detection algorithm is free from extracting multiple points around the same feature point. We suggest a technique to overcome the effect of scale variation in detection stage, for a compensation of computational simplicity. In matching stage, we directly utilize resulting data from detection, which makes the overall process much faster. We procure a technique for matching point error suppression, for a compensation of computational simplicity. Simulation results provided in the paper illustrate the accuracy and efficiency of the proposed algorithm.
A qualified speech communication is quite important in modern communication. Thus, the implementation of security algorithms is also very important to achieve real-time applications. In this paper, we design a robust ...
详细信息
ISBN:
(纸本)9781509006557
A qualified speech communication is quite important in modern communication. Thus, the implementation of security algorithms is also very important to achieve real-time applications. In this paper, we design a robust and full-duplex real-time speech communication system based on Texas Instrument's 32-bit floating point DSP TMS320C6748. We use ITU-T G.723.1 as the audio codec in this system. According to the hardware of the system and also to meet the requirement of high-quality and real-time communication, several methods are introduced in this paper to optimize the algorithm. Through the optimization, time spending in compression and decompression reduce from more than 1000ms to about 10ms which guarantees a real-time communication. Our designed system has been successfully used for the speech communication of railway system.
This paper represents a literature review of research works concerning the reconstruction of forms of buried objects in an homogeneous soil, applied for the reconstruction of forms of underground cavities. First, we w...
详细信息
This paper represents a literature review of research works concerning the reconstruction of forms of buried objects in an homogeneous soil, applied for the reconstruction of forms of underground cavities. First, we will set modeling as integral function, of the nonlinear inverse problem to solve. In general, this problem is solved through a regularization technique, the TSVD technical (Trunced Singular Value Decomposition), which is more efficient than the method of Thikhonov, because of its simplicity and minimal cost calculation. Regularization techniques are employed because the experimental data are still affected by noise. Secondly, we will discuss the influence of the choice of certain parameters, the quality of the reconstructed tomographic images. Third, we will take advantage from the imageprocessing module of the Opencv Library to estimate the shape of the buried cavities, based on the treatment of the resulting images, using Douglas-Peucker algorithm. The case studied here is the one of a dispersive low conductivity half-space, where is embedded the anomaly which is a cavity filled with a dielectric.
Orthogonal Frequency Division Multiplexing (OFDM) which is widely used transmission technique for all 4G communication systems faces a major issue of Peak to average power ratio (PAPR). Partial Transmit Sequence (PTS)...
详细信息
ISBN:
(纸本)9781467391986
Orthogonal Frequency Division Multiplexing (OFDM) which is widely used transmission technique for all 4G communication systems faces a major issue of Peak to average power ratio (PAPR). Partial Transmit Sequence (PTS) is the most preferred technique for the reduction of PAPR. But it involves complex searching algorithms for finding the most optimal combinations of OFDM signals. Increased complexity with any increase in the number of sub-blocks is a major drawback of PTS. In this paper, Iterative-Grouping and image-PTS (IGI-PTS) technique is proposed which mainly focuses on reducing the computational complexity involved in search of optimal phase factors. It is combination of two basic grouping and imaging techniques and further using iterations to simplify the searching process when the numbers of sub-blocks are in significantly high.
A license plate detection task (LPD) is an important stage in the License plate recognition (LPR) implementations for automated transport systems. This paper is focused on a theory behind various interest points (IPs)...
详细信息
ISBN:
(纸本)9781509012893
A license plate detection task (LPD) is an important stage in the License plate recognition (LPR) implementations for automated transport systems. This paper is focused on a theory behind various interest points (IPs) detectors and region descriptors often used in applications of imageprocessing including the LPR apps among others. We have carried out wide analysis on behaviour of several selected detectors and descriptors listed here: Harris, Shi&Tomasi, MSER, FAST, SURF and BRISK. These algorithms have been implemented, tested and compared each other from a point of view of their stability and repeatability. Our experiments were performed on a license plate localization task and carried out over an extensive gallery of real vehicle images.
Parallel Computing has been gaining interest nowadays due to physical constraints preventing frequency scaling. Therefore, in order to achieve high performance on multicore systems, programmers need to focus on parall...
详细信息
Parallel Computing has been gaining interest nowadays due to physical constraints preventing frequency scaling. Therefore, in order to achieve high performance on multicore systems, programmers need to focus on parallelizing their programs. Although there are many available parallelized APIs written by experts that should improve coding, they do not automatically guarantee good performance. This paper focuses on understanding factors that help to achieve better performance. This paper specifically focuses on SIFT based feature matching for various image collections. SIFT works by extracting information from images and then later compares this information for feature matching. Since SIFT performs CPU intensive computations, it requires parallelization in order to be feasible. This paper focuses on exploring a shared memory model based API known as Open multi-processing (OpenMP) to accelerate existing serial SIFT based image matching. In this paper, we were able to achieve a speedup of ~2× by using various OpenMP features. The paper later discusses factors like scalability and speedup and how multi-threading impacts them. We also discovered the importance of different levels of parallelism and their effects on performance.
Many tracking algorithms applied in medical imageprocessing, such as observing the movement of cells, have a great improvement in accuracy and robustness. However, it is difficult to deal with the large area occlusio...
详细信息
ISBN:
(纸本)9781509016129
Many tracking algorithms applied in medical imageprocessing, such as observing the movement of cells, have a great improvement in accuracy and robustness. However, it is difficult to deal with the large area occlusion and complete occlusion. In this paper, we propose a fast scale adaptive tracking algorithm based on correlation filtering. Except tracking the change of the target scale quickly, our method can also deal with the problem of large area occlusion and the complete disappearance of the target. Compared with the outstanding scale adaptive tracking method, the proposed method demonstrates higher performances in terms of the accuracy of tracking the target and the real-time performance.
In this paper, a hardware-in-the loop simulation (HILS) platform is presented for verifying the image-based object tracking method adopted in the small Unmanned Aerial Vehicle (sUAV). The platform is constructed by im...
详细信息
ISBN:
(纸本)9781509025244
In this paper, a hardware-in-the loop simulation (HILS) platform is presented for verifying the image-based object tracking method adopted in the small Unmanned Aerial Vehicle (sUAV). The platform is constructed by imageprocessing module, scene generation module, and flight control module. In the imageprocessing module, the motion of target object is measured by using the speeded-up robust features (SURF) algorithm and the feature matching technique. And then, control command is provided to allow the target object to be tracked by sUAV automatically. The JMAVSIM software developed by PX4 dev-team is used in the proposed platform to simulate the flight of sUAV and provide virtual scene and flight data. Pixhawk based on PX4 firmware which is a popular flight control computer is used as flight control module in the proposed platform. Experimental results show that the object tracking method based on sUAV is effectively tested and evaluated in the proposed HILS platform.
暂无评论