Статті в журналах: "Processing algorithm"

1

Kusnadi, Adhi, Leondy ., Lianna Nathania, Ivransa Zuhdi Pane, Marlinda Vasty Overbeek, and Syarief Gerald Prasetya. "Image Processing for Improvement of Facial Keypoints Detector." Webology 19, no. 1 (January 20, 2022): 676–91. http://dx.doi.org/10.14704/web/v19i1/web19048.

Повний текст джерела

Анотація:

This paper discusses the improvement of facial detection algorithms using the DCT algorithm and image processing. Face key point is very needed in the face recognition system. Some important factors that have effects to detect its result are noise and illuminations. These two factors can be overcome by eliminating some DCT coefficients, both high and low. However, after handling the problem, most likely the image quality will become decrease, which will adversely influence the performance of the feature detector algorithm. Therefore, it is very important to test the performance of the feature detector algorithm on images that are implemented noise and illumination handling and how to improve the quality again. This research implemented Discrete Cosine Transform (DCT), by eliminating the high and low coefficient because there is noise and illumination. However, it is not known at what coefficient level is the most effective, so testing in this study was carried out. Four deblurring algorithms are tested in this research, Blind Deconvolution, Wiener Filter Deconvolution, Lucy-Richardson Deconvolution, and Regularization Deconvolution. And tested the CLAHE algorithm to overcome the effect of removing low coefficient DCT. The best coefficient value to be removed at the DCT frequency is 0.75 with the best SURF algorithm, without the use of other algorithms. Also, the highest F-score is produced by the SURF detector at removing DCT low frequency in combination with the CLAHE algorithm. With the most ideal coefficient of 0.25.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Odinets, G. S. "Rheosignal processing algorithm." Biomedical Engineering 22, no. 2 (1988): 50–52. http://dx.doi.org/10.1007/bf00556153.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Alsiya, S., C. Jeya Lekshmi, B. P. Jishna Priya, and R. C. Mehta. "Image Processing Algorithm for Fringe Analysis in Photoelasticity." Scholars Journal of Engineering and Technology 4, no. 7 (July 2016): 325–28. http://dx.doi.org/10.21276/sjet.2016.4.7.5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Лун, Сюй, Xu Long, Йан Йихуа, Yan Yihua, Чэн Цзюнь, and Cheng Jun. "Guided filtering for solar image/video processing." Solar-Terrestrial Physics 3, no. 2 (August 9, 2017): 9–15. http://dx.doi.org/10.12737/stp-3220172.

Повний текст джерела

Анотація:

A new image enhancement algorithm employing guided filtering is proposed in this work for enhancement of solar images and videos, so that users can easily figure out important fine structures imbedded in the recorded images/movies for solar observation. The proposed algorithm can efficiently remove image noises, including Gaussian and impulse noises. Meanwhile, it can further highlight fibrous structures on/beyond the solar disk. These fibrous structures can clearly demonstrate the progress of solar flare, prominence coronal mass emission, magnetic field, and so on. The experimental results prove that the proposed algorithm gives significant enhancement of visual quality of solar images beyond original input and several classical image en-hancement algorithms, thus facilitating easier determi-nation of interesting solar burst activities from recorded images/movies.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Li, Feng, and Hai Ying Wang. "Study on Distributed Database Query Optimization." Applied Mechanics and Materials 536-537 (April 2014): 540–44. http://dx.doi.org/10.4028/www.scientific.net/amm.536-537.540.

Повний текст джерела

Анотація:

This paper presents a heterogeneous sensor networks to improve query processing mechanism. Analysis of the advantages and disadvantages of centralized query processing algorithm is proposed based on the spatial distance distributed query processing algorithm based on semantic similarity and distributed query processing algorithms for query execution processes described. Use simulation to choose better coverage and semantic similarity by half, and centralized query processing algorithm, based on the spatial distance distributed algorithms, distributed algorithms and performance-based semantic distributed hybrid algorithm were compared.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Lin, Zhen Xian. "Improved Wavelet Algorithm on Image Denoising Processing." Applied Mechanics and Materials 128-129 (October 2011): 160–63. http://dx.doi.org/10.4028/www.scientific.net/amm.128-129.160.

Повний текст джерела

Анотація:

Wavelet image de-noising has been well acknowledged as an important method of de-noising in Image Processing. Lifting scheme is not only a fast algorithm of existing wavelet transforms, but also a tool to produce new wavelet transforms. In this paper, the principle of several wavelet de-noising algorithms are described, and we compares with these algorithm, gives three kinds of improved algorithm. The simulation experiment shows that it is practicable and effective.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Golomolzina, Diana Rashidovna, Maxim Alexandrovich Gorodnichev, Evgeny Andreevich Levin, Alexander Nikolaevich Savostyanov, Ekaterina Pavlovna Yablokova, Arthur C. Tsai, Mikhail Sergeevich Zaleshin, et al. "Advanced Electroencephalogram Processing." International Journal of E-Health and Medical Communications 5, no. 2 (April 2014): 49–69. http://dx.doi.org/10.4018/ijehmc.2014040103.

Повний текст джерела

Анотація:

The study of electroencephalography (EEG) data can involve independent component analysis and further clustering of the components according to relation of the components to certain processes in a brain or to external sources of electricity such as muscular motion impulses, electrical fields inducted by power mains, electrostatic discharges, etc. At present, known methods for clustering of components are costly because require additional measurements with magnetic-resonance imaging (MRI), for example, or have accuracy restrictions if only EEG data is analyzed. A new method and algorithm for automatic clustering of physiologically similar but statistically independent EEG components is described in this paper. Developed clustering algorithm has been compared with algorithms implemented in the EEGLab toolbox. The paper contains results of algorithms testing on real EEG data obtained under two experimental tasks: voluntary movement control under conditions of stop-signal paradigm and syntactical error recognition in written sentences. The experimental evaluation demonstrated more than 90% correspondence between the results of automatic clustering and clustering made by an expert physiologist.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Zhu, Ying, Jian Cun Zhao, Sen Song, and Zhao Shan Liu. "Study on Image Processing Algorithm for Condom Sorting." Applied Mechanics and Materials 536-537 (April 2014): 153–56. http://dx.doi.org/10.4028/www.scientific.net/amm.536-537.153.

Повний текст джерела

Анотація:

In a condom sorting process, we need to shoot the state image of condom through the camera and do the ellipse detection to determine the front position of condom on the conveyor belt, so developing the image processing algorithms which can detect the condom ring is necessary. The algorithm based on the Hough circle detection can obtain better detection effect for the most forms of the condom ring position, but it can not correctly detect the circle when the image shows linear shape; the algorithm based on the contrast of the ring detection get better effect on the ring in the image showing linear, while it has a low recognition rate in more folded case. We combined the two algorithms to use, proposed a combined algorithm which overcame the respective shortcomings of the two algorithms. Verified by experiment, the results of detection, recognition rate and the average processing time show the combined algorithms get the best comprehensive effect.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Lv, Zhihan, Dongliang Chen, and Amit Kumar Singh. "Big Data Processing on Volunteer Computing." ACM Transactions on Internet Technology 21, no. 4 (July 22, 2021): 1–20. http://dx.doi.org/10.1145/3409801.

Повний текст джерела

Анотація:

In order to calculate the node big data contained in complex networks and realize the efficient calculation of complex networks, based on voluntary computing, taking ICE middleware as the communication medium, the loose coupling distributed framework DCBV based on voluntary computing is proposed. Then, the Master, Worker, and MiddleWare layers in the framework, and the development structure of a DCBV framework are designed. The task allocation and recovery strategy, message passing and communication mode, and fault tolerance processing are discussed. Finally, to calculate and verify parameters such as the average shortest path of the framework and shorten calculation time, an improved accurate shortest path algorithm, the N-SPFA algorithm, is proposed. Under different datasets, the node calculation and performance of the N-SPFA algorithm are explored. The algorithm is compared with four approximate shortest-path algorithms: Combined Link and Attribute (CLA), Lexicographic Breadth First Search (LBFS), Approximate algorithm of shortest path length based on center distance of area division (CDZ), and Hub Vertex of area and Core Expressway (HEA-CE). The results show that when the number of CPU threads is 4, the computation time of the DCBV framework is the shortest (514.63 ms). As the number of CPU cores increases, the overall computation time of the framework decreases gradually. For every 2 additional CPU cores, the number of tasks increases by 1. When the number of Worker nodes is 8 and the number of nodes is 1, the computation time of the framework is the shortest (210,979 ms), and the IO statistics data increase with the increase of Worker nodes. When the datasets are Undirected01 and Undirected02, the computation time of the N-SPFA algorithm is the shortest, which is 4520 ms and 7324 ms, respectively. However, the calculation time in the ca-condmat_undirected dataset is 175,292 ms, and the performance is slightly worse. Overall, however, the performance of the N-SPFA and SPFA algorithms is good. Therefore, the two algorithms are combined. For networks with less complexity, the computational scale coefficient of the SPFA algorithm can be set to 0.06, and for general networks, 0.2. When compared with other algorithms in different datasets, the pretreatment time, average query time, and overall query time of N-SPFA algorithm are the shortest, being 49.67 ms, 5.12 ms, and 94,720 ms, respectively. The accuracy (1.0087) and error rate (0.024) are also the best. In conclusion, voluntary computing can be applied to the processing of big data, which has a good reference significance for the distributed analysis of large-scale complex networks.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Gao, Yanwu, Bin Zhang, Lili Gan, and Bingchen Zhao. "The Hardware Solution of a New Image Processing Algorithm." International Journal of Advanced Pervasive and Ubiquitous Computing 4, no. 2 (April 2012): 41–47. http://dx.doi.org/10.4018/japuc.2012040104.

Повний текст джерела

Анотація:

This paper presents a new image-based parking space detection algorithm, the algorithm is based on a joint decision on multi-feature image processing algorithms, according to the data threshold of variance, correlation and edge-point density joint adjudicate the seize of paring space, it has a high recognition rate. And then the authors transplanted this algorithm into the FPGA platform, the hardware solution are implemented. And according to the algorithm characteristics the authors improved and optimized it. And the final, a compared test between hardware and software algorithms was executed, which results show that, the hardware algorithm for the solution is not only maintain a high recognition rate, but also more efficient.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Belim, S. V., E. V. Khiryanov, P. A. Kvashnina, and L. I. Ostrinskaya. "Image processing for automatic road inventory." Journal of Physics: Conference Series 2182, no. 1 (March 1, 2022): 012015. http://dx.doi.org/10.1088/1742-6596/2182/1/012015.

Повний текст джерела

Анотація:

Abstract Road image analysis is an important task for automatic road inventory. The determination geometric dimensions for the road and the identification road objects are subprocess of constructing a road digital image. In this article, two algorithms for solving different subtasks of automatic road image inventory are proposed. The first algorithm identifies road signs. A convolutional artificial neural network is used in this algorithm. The training set for the neural network is prepared. A computer experiment to determine the recognition effectiveness of road signs has been conducted. The second algorithm defines the edges of the pavement. The algorithm consists five stages. The edges of the road are modeled as straight lines. The result allows you to automatically determine the width of the road.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Dimauro, G., S. Impedovo, G. Pirlo, and A. Salzo. "A Multi-Expert Signature Verification System for Bankcheck Processing." International Journal of Pattern Recognition and Artificial Intelligence 11, no. 05 (August 1997): 827–44. http://dx.doi.org/10.1142/s0218001497000378.

Повний текст джерела

Анотація:

In this paper a multi-expert signature verification system is presented. The system has been specifically designed for applications in the field of bankcheck processing. For this purpose, it combines three different algorithms for signature verification. A wholistic approach is used in the first algorithm, a component-oriented approach is used in the second and third algorithms. The second algorithm is based on a structure-based procedure, the third algorithm uses a highly-adaptive neural network. The three algorithms are combined in the multi-expert system by a voting strategy.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

T, Suman. "Smart Farming Using Artificial Immune System Algorithm and Image Processing." International Journal of Psychosocial Rehabilitation 24, no. 5 (May 25, 2020): 6812–16. http://dx.doi.org/10.37200/ijpr/v24i5/pr2020673.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Pedram, Ali. "A Method for Scheduling Multi Processing Systems with Genetic Algorithm." International Journal of Engineering and Technology 1, no. 2 (2009): 179–83. http://dx.doi.org/10.7763/ijet.2009.v1.33.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Guo, Dong Liang, and Zhong Hua Li. "A Fast Direction Finding Algorithm Based on Correlation Processing." Applied Mechanics and Materials 373-375 (August 2013): 880–83. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.880.

Повний текст джерела

Анотація:

To reduce the computational complexity of direction finding algorithms based on correlation processing, a fast algorithm is presented in this paper. Unlike the conventional direction finding algorithms which calculates the correlation coefficients in the whole azimuth range, the improved algorithm measure the direction of arrival (DOA) roughly first, then, measure the DOA only in finite angle interval and searches the maximal correlation coefficient, thus shorten the execution time greatly. In addition, the algorithm has no influence on the accuracy of direction finding. The best proportion between samples for rough measurement and samples for fine measurement is analyzed. Computer simulation results confirm that the proposed method can shorten the computation time greatly, and the proposed algorithm has practical application value in the instantaneous direction finding.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Kusunoki, Fusako, Arata Miyauchi, and Shinji Ozawa. "Algorithm–oriented information-processing education." Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 75, no. 11 (1992): 57–66. http://dx.doi.org/10.1002/ecjc.4430751106.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Ann Wen, Kuei, and Jau Yien Lee. "Parallel processing for Viterbi algorithm." Electronics Letters 24, no. 17 (1988): 1098. http://dx.doi.org/10.1049/el:19880745.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Hu, Ya Hui, Le Jiang Guo, Xiao Lei, and Cheng Min. "The Development of Image Processing Board Based on Target Tracking." Applied Mechanics and Materials 411-414 (September 2013): 1322–25. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.1322.

Повний текст джерела

Анотація:

This paper selects the target tracking algorithm suitable for specific target environment: using Mean Shift algorithm based on space edge direction histogram at initialization, selecting tracking algorithm based on block when there is a shelter. On the basis of algorithm analysis and software experiment and studying of TI Company's TMS320DM642 DSP chip internal structure and development process, these two algorithms researched in this paper were transplanted to DSP platform and a series of optimization were been made to the algorithms codes after transplanted ,implementing target tracking and identified via DSP development board instead of PC.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

He, Defu, and Si Xiong. "Image Processing Design and Algorithm Research Based on Cloud Computing." Journal of Sensors 2021 (October 5, 2021): 1–10. http://dx.doi.org/10.1155/2021/9198884.

Повний текст джерела

Анотація:

Image processing technology is a popular practical technology in the computer field and has important research value for signal information processing. This article is aimed at studying the design and algorithm of image processing under cloud computing technology. This paper proposes cloud computing technology and image processing algorithms for image data processing. Among them, the material structure and performance of the system can choose a verification algorithm to achieve the final operation. Moreover, let us start with the image editing features. This article isolates software and hardware that function rationally. On this basis, the structure of a real-time image processing system based on SOPC technology is built and the corresponding functional receiving unit is designed for real-time image storage, editing, and viewing. Studies have shown that the design of an image processing system based on cloud computing has increased the speed of image data processing by 14%. Compared with other algorithms, this image processing algorithm has great advantages in image compression and image restoration.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

He, Defu, and Si Xiong. "Image Processing Design and Algorithm Research Based on Cloud Computing." Journal of Sensors 2021 (October 5, 2021): 1–10. http://dx.doi.org/10.1155/2021/9198884.

Повний текст джерела

Анотація:

Image processing technology is a popular practical technology in the computer field and has important research value for signal information processing. This article is aimed at studying the design and algorithm of image processing under cloud computing technology. This paper proposes cloud computing technology and image processing algorithms for image data processing. Among them, the material structure and performance of the system can choose a verification algorithm to achieve the final operation. Moreover, let us start with the image editing features. This article isolates software and hardware that function rationally. On this basis, the structure of a real-time image processing system based on SOPC technology is built and the corresponding functional receiving unit is designed for real-time image storage, editing, and viewing. Studies have shown that the design of an image processing system based on cloud computing has increased the speed of image data processing by 14%. Compared with other algorithms, this image processing algorithm has great advantages in image compression and image restoration.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Wang, Zhe. "Audio Signal Acquisition and Processing System Based on Model DSP Rapid Design." Security and Communication Networks 2022 (May 19, 2022): 1–9. http://dx.doi.org/10.1155/2022/4593339.

Повний текст джерела

Анотація:

When using DSP technology, technicians can easily and conveniently replace DSP audio processors, make second-party equipment, improve processor performance, reduce application costs, and receive and make music to meet the needs of different signals. Introduces knowledge of speech comprehension, which includes theoretical and cognitive processes, such as pre-speech characterization, final discovery, behavior, structure, and knowledge. By analyzing and comparing various common features, Mel frequency cepstrum coefficient is used to determine the physical features, and the results of traditional algorithms are studied, compared, and evaluated. Research, compare, and evaluate numbers in traditional algorithms. The simulation is based on the algorithms of all the connections used in the system and checks that the algorithm is correct. Design an experimental model, compare the advantages and disadvantages of algorithms and algorithms, consider the process requirements and changes of the whole algorithm, and select the algorithm accordingly algorithm. The experimental results show that the speed recognition of the TW algorithm is not much different from that of the HMM algorithm, and the efficiency of the DTW algorithm in the training models is lower than that of the HMM algorithm. Given the limited resources of the DSP platform in this system, we have chosen the DTW algorithm as the self-reporting system for this system. Finally, the performance of the system is checked and the test results are released. Observations of the experimental instrument showed that the system was effective in being able to recognize small words and discrepancies in speech.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Raheem, Syed, and Dr Subhashish Bose. "Subband Adaptive Filter in Signal Processing Application." Revista Gestão Inovação e Tecnologias 11, no. 4 (August 4, 2021): 4096–109. http://dx.doi.org/10.47059/revistageintec.v11i4.2434.

Повний текст джерела

Анотація:

Owing to the powerful digital signal processors and the improvement of advanced edge adaptive algorithms there are an extraordinary number of various applications in which adaptive filters are utilized. Subband adaptive filtering algorithms can build the assembly pace of framework ID undertakings when the info signal is hued. The adaptive filter can filter the dubious noise signal, track the difference in the signal, and consistently change the boundaries to accomplish the ideal filtering impact. Another standardized subband adaptive filtering algorithm has been proposed, whose primary benefit is the lower computational intricacy when contrasted with best in class subband approaches, while keeping up comparable union execution. A connection between the adaptive subband coefficients and the ideal full band move work is determined, and the algorithm is demonstrated to create an asymptotically unprejudiced arrangement. The proficiency of the adaptive filters basically relies upon the plan procedure utilized and the algorithm of variation. The adaptive filters can be analogical plans, digital or blended which show their benefits and inconveniences, for instance, the analogical filters are low power consuming and fast response, however they address balance issues, which influence the activity of the variation algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Zhertunova, T. V., and E. S. Yanakova. "ADAPTIVE ALGORITHM BASED ON NONLOCAL MEANS IN IMAGE PROCESSING." Issues of radio electronics, no. 8 (August 20, 2018): 79–86. http://dx.doi.org/10.21778/2218-5453-2018-8-79-86.

Повний текст джерела

Анотація:

This article describes the existing problem situation associated with the absence of resource-lights denoising algorithms, capable to produce good-quality output images in the different intensity noise conditions without blurring the boundaries, contours and basic structure. The adaptive algorithm proposed in the article allows to solve this problem due to the developed algorithms of splitting the search region into two sets of similar and points different from the pixel and adapting of the kernel type to the image region, depending on the presence or detection of structural and smooth pixels. The results of the proposed algorithm and the standard method of nonlocal means are compared with the metrics of the peak signal-to-noise ratio and structural similarity. It is found out that the developed adaptive algorithm is surpass by far than the standard method both on numerical results and on the quality of the image processing.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Kawamoto, Kazuhiko. "Special Issue on Advances on Intelligent Multimedia Processing." Journal of Advanced Computational Intelligence and Intelligent Informatics 14, no. 2 (March 20, 2010): 121. http://dx.doi.org/10.20965/jaciii.2010.p0121.

Повний текст джерела

Анотація:

As computer and sensor technology advances make increasing amounts of multimedia data available, multimedia processing methodologies are needed for multimodal data fusion, efficient data processing, information extraction, and added-value data generation. This special issue introduces the following latest practical developments in image processing, acoustical signal processing, pattern recognition, data mining, and visualization: S. Kobashi et al. propose a robust algorithm for reconstructing total knee arthroplasty implants from X-ray cone-beam images. Y. Hatakeyama et al. propose an algorithm for classifying ultrasonic abdominal images with the help of reports in text format. T. Miyazaki et al. analyze breathy and rough speech by the elderly. M. Nii et al. present a genetic algorithm for classifying nursing-care text. These papers provide useful insights into medical diagnosis and nursing care in the aging society coming to dominate 21st century. T. Toyota et al. visualize Japanese law networks based on granular computing. K. Sawase et al. present a management system for large databases of tagged images. These graphical user interface techniques will be helpful to those who are not computer experts. H. Kawano et al. propose a classification algorithm for segmenting range data into multiple quadric surfaces. Y. Arai et al. propose a nearest-neighbor method for personal authentication. H. Kawano et al. present an algorithm for extracting the structure of decorative characters based on graph spectral decomposition. These classification and discriminant algorithms provide a basis for multimedia data processing. G. Tanaka et al. propose a color transfer algorithm. H. Orii et al. present an image completion algorithm. G. Tanaka et al. present an image enhancement algorithm to noisy images. M. Mizumachi et al. propose a stochastic algorithm for estimating sound source direction. These image and acoustical processing algorithms improve the quality of digital data and will provide new applications in these areas. We thank the authors and referees whose invaluable work and kind comments have made this special issue possible and improved overall paper quality.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Chen, Jian Xiang, and Hong Jun Sun. "The Digital Signal Processing Algorithm Implemented on ARM Embedded System." Advanced Materials Research 756-759 (September 2013): 3958–61. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.3958.

Повний текст джерела

Анотація:

Digital Signal Processing technology is an important tool for modern signal processing. The speedy development ARM embedded processor has powerful computed capability for digital signal processing algorithms. The paper provides a common hardware platform in recent years. In this paper, used assemble language to realize the algorithms and FIR Filter based on ARM-Linux embedded environment. The results shown that the ARM can quickly and efficiently complete a series of digital signal processing algorithms. Digital signal processing algorithm on ARM embedded system provides an effective way.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Saveetha, V., and S. Sophia. "Optimization of K-Means Clustering on Graphics Processing Unit Using Compute Unified Device Architecture." Journal of Computational and Theoretical Nanoscience 14, no. 1 (January 1, 2017): 789–95. http://dx.doi.org/10.1166/jctn.2017.6274.

Повний текст джерела

Анотація:

Parallel data clustering aims at using algorithms and methods to extract knowledge from fat databases in rational time using high performance architectures. The computational challenge faced by cluster analysis due to increasing capacity of data can be overcome by exploiting the power of these architectures. The recent development in parallel power of Graphics Processing Unit enables low cost high performance solutions for general purpose applications. The Compute Unified Device Architecture programming model provides application programming interface methods to handle data proficiently on Graphics Processing Unit for iterative clustering algorithms like K-Means. The existing Graphics Processing Unit based K-Means algorithms highly focus on improvising the speedup of the algorithms and fall short to handle the high time spent on transfer of data between the Central Processing Unit and Graphics Processing Unit. A competent K-Means algorithm is proposed in this paper to lessen the transfer time by introducing a novel approach to check the convergence of the algorithm and utilize the pinned memory for direct access. This algorithm outperforms the other algorithms by maximizing parallelism and utilizing the memory features. The relative speedups and the validity measure for the proposed algorithm is elevated when compared with K-Means on Graphics Processing Unit and K-Means using Flag on Graphics Processing Unit. Thus the planned approach proves that communication overhead can be reduced in K-Means clustering.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Wang, Yaming, Jiajun Wang, Yuanmei Wang, and Yude Dong. "Enhancement of Eyeround Images Based on an Improved Fuzzy Algorithm." Journal of Advanced Computational Intelligence and Intelligent Informatics 3, no. 6 (December 20, 1999): 441–45. http://dx.doi.org/10.20965/jaciii.1999.p0441.

Повний текст джерела

Анотація:

Eye ground images are complex, with many details and uncertainties. Conventional enhancement algorithms do not enhance these images suitably of inferior processing. S. K. Pal proposed a fuzzy enhancement algorithm with advantages, but these were compromised by slow processing and information loss. We propose a fuzzy enhancement algorithm for eyeground images introducing mapping and implementing the algorithm through table searches, significantly improving image quality and processing speed.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Yugov, Vsevolod, and Itsuo Kumazawa. "Online Boosting Algorithm Based on Two-Phase SVM Training." ISRN Signal Processing 2012 (August 14, 2012): 1–8. http://dx.doi.org/10.5402/2012/740761.

Повний текст джерела

Анотація:

We describe and analyze a simple and effective two-step online boosting algorithm that allows us to utilize highly effective gradient descent-based methods developed for online SVM training without the need to fine-tune the kernel parameters, and we show its efficiency by several experiments. Our method is similar to AdaBoost in that it trains additional classifiers according to the weights provided by previously trained classifiers, but unlike AdaBoost, we utilize hinge-loss rather than exponential loss and modify algorithm for the online setting, allowing for varying number of classifiers. We show that our theoretical convergence bounds are similar to those of earlier algorithms, while allowing for greater flexibility. Our approach may also easily incorporate additional nonlinearity in form of Mercer kernels, although our experiments show that this is not necessary for most situations. The pre-training of the additional classifiers in our algorithms allows for greater accuracy while reducing the times associated with usual kernel-based approaches. We compare our algorithm to other online training algorithms, and we show, that for most cases with unknown kernel parameters, our algorithm outperforms other algorithms both in runtime and convergence speed.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

G. San Jose, Christine Charmaine. "Document Security System Using Improved Hash Algorithm on Pre-processing Operation." Journal of Advanced Research in Dynamical and Control Systems 11, no. 11-SPECIAL ISSUE (November 20, 2019): 972–78. http://dx.doi.org/10.5373/jardcs/v11sp11/20193123.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Kang, En Shun, and Yu Xi Zhao. "The Realization of Rapid Median Filter Algorithm on FPGA." Advanced Engineering Forum 6-7 (September 2012): 659–64. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.659.

Повний текст джерела

Анотація:

Traditional median filter algorithm has the long processing time, which goes against the real-time image processing. According to its shortcomings, this paper puts forward the rapid median filter algorithm, and uses DE2 board of the company called Altera to do the realization on FPGA (CycloneII 2C35). The experimental results show that the image pre-processing system is able to complete a variety of high-level image algorithms in milliseconds, and FPGA's parallel processing capability and pipeline operations can dramatically improve the speed of image processing, so the FPGA-based image processing system has broad prospects for development．

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Zeng, Le-tian, Chun-hui Yang, Mao-sheng Huang, and Yue-long Zhao. "Verification of Imaging Algorithm for Signal Processing Software within Synthetic Aperture Radar (SAR) System." Scientific Programming 2019 (February 21, 2019): 1–12. http://dx.doi.org/10.1155/2019/7105281.

Повний текст джерела

Анотація:

In the signal processing software testing for synthetic aperture radar (SAR), the verification for algorithms is professional and has a very high proportion. However, existing methods can only perform a degree of validation for algorithms, exerting an adverse effect on the effectiveness of the software testing. This paper proposes a procedure-based approach for algorithm validation. Firstly, it describes the processing procedures of polar format algorithm (PFA) under the motion-error circumstance, based on which it analyzes the possible questions that may exist in the actual situation. By data simulation, the SAR echoes are generated flexibly and efficiently. Then, algorithm simulation is utilized to focus on the demonstrations for the approximations adopted in the algorithm. Combined with real data processing, the bugs concealed are excavated further, implementing a comprehensive validation for PFA. Simulated experiments and real data processing validate the correctness and effectiveness of the proposed algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Zhang, Shuang, and Shi Xiong Zhang. "Improved Top-k Query Processing on Uncertain Data." Applied Mechanics and Materials 380-384 (August 2013): 2837–40. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2837.

Повний текст джерела

Анотація:

Bottom-up algorithm, which is one of the two probabilistic Top-k query algorithms, was improved. The core of the bottomup algorithm is the iteration on the three courses of bounding, pruning,and refining towards the objects and instances. The main contribution is to change the iteration on instances of objects one by one into iterating all the instances of objects from the superior to the inferior;and to transform the condition and sequence of pruning in order to make the pruning more effective. Theoretical analysis and experimental results show that the algorithm efficiency could be obviously increased by about 20%.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Abuhamdah, Anmar, and Mohammed Al-Shabi. "HYBRID LOAD BALANCING ALGORITHM FOR FOG COMPUTING ENVIRONMENT." International Journal of Software Engineering and Computer Systems 8, no. 1 (January 24, 2022): 11–21. http://dx.doi.org/10.15282/ijsecs.8.1.2022.2.0092.

Повний текст джерела

Анотація:

Fog computing has become a new trend in the Internet of things domain and cloud computing applications. It is a novel model to achieve the availability, flexibility and better responding time. In spite of that, there is so many challenges facing computing environments such as the misuse of the resources and load-balancing between them, which has a major effect on performance. The requirement of effective and robust load-balancing algorithms is one of the most significant interest in this field. Many researchers suggested various load-balancing algorithms in fog computing, but there is still inefficiency in the system performance and misalignment in load-balancing. This paper will provide a description of numerous concepts such as computing fog, fog nodes, load balancing and then we recommend a load-balancing algorithm to enhance the fog-computing environment performance, which is a hybrid algorithm benefits from the optimizing processing time (OPT) algorithms. In order to explore the proposed algorithm performance, a comparison made with other algorithms. Results indicates that using the proposed optimizing processing time algorithm in load-balancing algorithm has superior response and processing time than the compared algorithms to user requests, and the data total cost centre’s as well.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Лун, Сюй, Xu Long, Йан Йихуа, Yan Yihua, Чэн Цзюнь, and Cheng Jun. "Guided filtering for solar image/video processing." Solnechno-Zemnaya Fizika 3, no. 2 (June 29, 2017): 10–17. http://dx.doi.org/10.12737/22596.

Повний текст джерела

Анотація:

A new image enhancement algorithm employing guided filtering is proposed in this work for enhancement of solar images and videos, so that users can easily figure out important fine structures imbedded in the recorded images/movies for solar observation. The proposed algorithm can efficiently remove image noises, including Gaussian and impulse noises. Meanwhile, it can further highlight fibrous structures on/beyond the solar disk. These fibrous structures can clearly demonstrate the progress of solar flare, prominence coronal mass emission, magnetic field, and so on. The experimental results prove that the proposed algorithm gives significant enhancement of visual quality of solar images beyond original input and several classical image en-hancement algorithms, thus facilitating easier determi-nation of interesting solar burst activities from recorded images/movies.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Jogalekar, Usha A., and Akhil Mangla. "Idea Generation Algorithm Based Systems." Advanced Materials Research 403-408 (November 2011): 3937–45. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.3937.

Повний текст джерела

Анотація:

Parallel algorithms and parallel processing have revolutionized the machine’s performance and output efficiency. Parallel Random Access Machines are being used excessively for complex input processing and effective output data generation. PRAM algorithms are a class of algorithms defined for parallel computation in polynomial time complexity. Thought process is one of the key procedure that distinctly identifies humans rather animals from machines. Machines proposed to be effective computers have failed when it has come in light to learn and produce new ideas. The study here proposes the Idea Generation Algorithm with all necessary details. The algorithm uses parallel set of processors with a systolic array for data processing. The recognition of optimal output based on the associated weights and the feedback provided by to self-organizing neural network. The network provided with an unsupervised learning is proposed to provide the machine with its own set of ideas thus resulting in achievement of “thought process” in Machines. The algorithm stands as a template for any thought process development and identification in machines. Any system with capability and use of idea generation algorithm shall be with inherent learning and intelligence.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

SANCHEZ, ANGEL, JOSE F. VELEZ, ANA BELEN MORENO, and JOSE L. ESTEBAN. "INTRODUCING ALGORITHM DESIGN TECHNIQUES IN UNDERGRADUATE DIGITAL IMAGE PROCESSING COURSES." International Journal of Pattern Recognition and Artificial Intelligence 15, no. 05 (August 2001): 789–803. http://dx.doi.org/10.1142/s0218001401001155.

Повний текст джерела

Анотація:

This paper documents the development and first offering of an undergraduate course in Digital Image Processing at the Rey Juan Carlos University, Madrid (Spain). The paper describes how the appropriate introduction of main Algorithm Design Techniques can successfully assist the students to achieve a comprehensive understanding of image operations and related algorithms. Image processing problems offer a natural way to present real world problems where the students can use their algorithmic knowledge. Furthermore, image processing solutions are needed from a methodological development and require efficient well-designed algorithms. This paper presents an effort in the integration of Algorithm Design Techniques in a Digital Image Processing course with a very practical scope.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Kim, Hyeong-Jin, Hyunjo Lee, Yong-Ki Kim, and Jae-Woo Chang. "Privacy-preserving kNN query processing algorithms via secure two-party computation over encrypted database in cloud computing." Journal of Supercomputing 78, no. 7 (January 17, 2022): 9245–84. http://dx.doi.org/10.1007/s11227-021-04286-2.

Повний текст джерела

Анотація:

AbstractSince studies on privacy-preserving database outsourcing have been spotlighted in a cloud computing, databases need to be encrypted before being outsourced to the cloud. Therefore, a couple of privacy-preserving kNN query processing algorithms have been proposed over the encrypted database. However, the existing algorithms are either insecure or inefficient. Therefore, in this paper we propose a privacy-preserving kNN query processing algorithm via secure two-party computation on the encrypted database. Our algorithm preserves both data privacy and query privacy while hiding data access patterns. For this, we propose efficient and secure protocols based on Yao’s garbled circuit. To achieve a high degree of efficiency in query processing, we also propose a parallel kNN query processing algorithm using encrypted random value pool. Through our performance analysis, we verify that our proposed algorithms outperform the existing ones in terms of a query processing cost.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Man, Mahadi, and Masita Abdul Jalil. "Frequent itemset mining: technique to improve eclat based algorithm." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (December 1, 2019): 5471. http://dx.doi.org/10.11591/ijece.v9i6.pp5471-5478.

Повний текст джерела

Анотація:

<span lang="EN-US">In frequent</span><span lang="EN-US"> itemset mining, the main challenge is to discover relationships between data in a transactional database or relational database. Various algorithms have been introduced to process frequent itemset. Eclat based algorithms are one of the prominent algorithm used for frequent itemset mining. Various researches have been conducted based on Eclat based algorithm such as Tidset, dEclat, Sortdiffset and Postdiffset. The algorithm has been improvised along the time. However, the utilization of physical memory and processing time become the main problem in this process. This paper reviews and presents a comparison of various Eclat based algorithms for frequent itemset mining and propose an enhancement technique of Eclat based algorithm to reduce processing time and memory usage. The experimental result shows some improvement in processing time and memory utilization in frequent itemset mining.</span>

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Kang, Tae-Won, Jin-Gu Kang, and Jin-Woo Jung. "A Bidirectional Interpolation Method for Post-Processing in Sampling-Based Robot Path Planning." Sensors 21, no. 21 (November 8, 2021): 7425. http://dx.doi.org/10.3390/s21217425.

Повний текст джерела

Анотація:

This paper proposes a post-processing method called bidirectional interpolation method for sampling-based path planning algorithms, such as rapidly-exploring random tree (RRT). The proposed algorithm applies interpolation to the path generated by the sampling-based path planning algorithm. In this study, the proposed algorithm is applied to the path created by RRT-connect and six environmental maps were used for the verification. It was visually and quantitatively confirmed that, in all maps, not only path lengths but also the piecewise linear shape were decreased compared to the path generated by RRT-connect. To check the proposed algorithm’s performance, visibility graph, RRT-connect algorithm, Triangular-RRT-connect algorithm and post triangular processing of midpoint interpolation (PTPMI) were compared in various environmental maps through simulation. Based on these experimental results, the proposed algorithm shows similar planning time but shorter path length than previous RRT-like algorithms as well as RRT-like algorithms with PTPMI having a similar number of samples.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Plaksienko, V. S. "Linear-logical decision-making algorithm for signal processing." Vestnik of Don State Technical University 18, no. 4 (January 9, 2019): 385–91. http://dx.doi.org/10.23947/1992-5980-2018-18-4-385-391.

Повний текст джерела

Анотація:

Introduction. Heuristic synthesis is used to improve the efficiency of reception and processing of discrete signals under aprior information pressure. The analysis of the decisionmaking algorithm for the linear-logical processing of discrete signals in case of the incomplete aprior data on their parameters is presented. The work objective is to develop and analyze the efficiency of the linear-logical algorithms.Materials and Methods. New mathematical algorithms for the signal reception and processing, effective under conditions of a priori uncertainty, are proposed. They are based on the consideration of the structure of emissions and process exceedance in the signal processing channels.Research Results. Linear-logical algorithms for processing discrete signals are developed. They are based on the consideration of one, two and more detailed characteristics of emissions or exceedance of random processes.Discussion and Conclusion. The results obtained can be useful in the synthesis of algorithms and devices for the signal reception and processing. Algorithms and devices are implemented both in an analog form and in the form of algorithms for computers. The simulation programs for the signal processing under conditions of the considerable uncertainty of aprior information on the signals and the channels of their distribution are developed.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Li, XiaoLin, and Yu Wang. "Scheduling Batch Processing Machine Using Max–Min Ant System Algorithm Improved by a Local Search Method." Mathematical Problems in Engineering 2018 (2018): 1–10. http://dx.doi.org/10.1155/2018/3124182.

Повний текст джерела

Анотація:

The problem of minimizing the makespan on single batch processing machine is studied in this paper. Both job sizes and processing time are nonidentical and the processing time of each batch is determined by the job with the longest processing time in the batch. Max–Min Ant System (MMAS) algorithm is developed to solve the problem. A local search method MJE (Multiple Jobs Exchange) is proposed to improve the performance of the algorithm by adjusting jobs between batches. Preliminary experiment is conducted to determine the parameters of MMAS. The performance of the proposed MMAS algorithm is compared with CPLEX as well as several other algorithms including ant cycle (AC) algorithm, genetic algorithm (GA), and two heuristics, First Fit Longest Processing Time (FFLPT) and Best Fit Longest Processing Time (BFLPT), through numerical experiment. The experiment results show that MMAS outperformed others especially for large population size.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Pointon, C. T., and R. A. Carrasco. "A Transputer Processing System Interface for The Evaluation of Digital Signal Processing Algorithms." International Journal of Electrical Engineering & Education 31, no. 1 (January 1994): 54–65. http://dx.doi.org/10.1177/002072099403100106.

Повний текст джерела

Анотація:

A transputer processing system interface for the evaluation of digital signal processing algorithms The design and construction of a low-cost transputer processing system input/output (I/O) interface for the acquisition and retrieval of data, and its use in the evaluation of the computational performance characteristics of discrete convolution in the time domain, and fast convolution, using a non-look-up table fast Fourier transform (FFT) algorithm, is presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

FINK, EUGENE, and MICHAEL HEATH. "IMAGE-PROCESSING PROJECTS FOR AN ALGORITHMS COURSE." International Journal of Pattern Recognition and Artificial Intelligence 15, no. 05 (August 2001): 859–68. http://dx.doi.org/10.1142/s0218001401001192.

Повний текст джерела

Анотація:

Courses on algorithm analysis often include little programming, and do not emphasize application of advanced techniques to practical problems. On the other hand, students usually prefer hands-on learning, and may lack motivation to study theory. We augmented an algorithms course with a series of programming tasks, which involved application of the course material to image processing. These tasks motivated the students, and led to better understanding and retention of theoretical material. They also enabled the students to learn the basics of representing and manipulating images, along with the algorithm theory.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Likhoded, Nikolai A. "Generalized blocked Floyd – Warshall algorithm." Journal of the Belarusian State University. Mathematics and Informatics, no. 3 (November 29, 2019): 84–92. http://dx.doi.org/10.33581/10.33581/2520-6508-2019-3-84-92.

Повний текст джерела

Анотація:

One of the most commonly used on practice all-pairs shortest paths algorithms on weighted graphs is Floyd – Warshall algorithm. Blocked version serves as a basis for obtaining effective parallel algorithms to be implemented on multicore central processing units, on computers with distributed memory, on graphics processing units (GPU). Increasing computation granularity in blocked versions of algorithm leads to a more efficient usage of caches and more efficient organization of parallel computations. In this paper we introduce generalization of blocked Floyd – Warshall algorithm. Computing blocks execution order was reorganized in such a way that array elements which participate in communication operations, both reading and writing, are pushed out of fast-access memory less often. This means that in GPU implementation slow global memory is used less often, compared with the original blocked algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Hwang, R. S., D. S. Bae, J. G. Kuhl, and E. J. Haug. "Parallel Processing for Real-Time Dynamic System Simulation." Journal of Mechanical Design 112, no. 4 (December 1, 1990): 520–28. http://dx.doi.org/10.1115/1.2912641.

Повний текст джерела

Анотація:

A parallel processing algorithm based on the recursive dynamics formulation presented in a companion paper [1] is developed for multiprocessor implementation. Lagrange multipliers associated with cut-joint constraints for closed loop systems are eliminated, resulting in a minimal set of equations of motion. Concurrent generation of the system inertia matrix and the generalized force vector using the algorithm of Ref. 1 is shown to yield finer grain parallelism than earlier recursive algorithms. A new computational structure for dynamic analysis is proposed for high speed parallel processing. Real-time simulation of a vehicle is demonstrated on an eight processor parallel computer to illustrate efficiency and effectiveness of the algorithm, even for interactive operator-in-the-loop simulation.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Cariñe, J., R. Guzmán, and F. A. Torres-Ruiz. "Algorithm for dynamic Speckle pattern processing." Optics and Lasers in Engineering 82 (July 2016): 56–61. http://dx.doi.org/10.1016/j.optlaseng.2016.02.001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Hemmati, M., and M. A. Massoumnia. "Processing algorithm for a strapdown gyrocompass." Scientia Iranica 19, no. 3 (June 2012): 774–81. http://dx.doi.org/10.1016/j.scient.2012.01.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Aron, Jacob. "Better maths boosts image processing algorithm." New Scientist 213, no. 2849 (January 2012): 13. http://dx.doi.org/10.1016/s0262-4079(12)60211-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Xu, C., and J. Li. "A Batch Processing Constant Modulus Algorithm." IEEE Communications Letters 8, no. 9 (September 2004): 582–84. http://dx.doi.org/10.1109/lcomm.2004.835330.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Zhenyu Zhu and H. R. Sadjadpour. "An adaptive per-survivor processing algorithm." IEEE Transactions on Communications 50, no. 11 (November 2002): 1716–18. http://dx.doi.org/10.1109/tcomm.2002.805272.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Processing algorithm"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями