Relevant bibliographies by topics / Processing algorithm

Academic literature on the topic 'Processing algorithm'

Author: Grafiati
Published: 30 May 2022
Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Processing algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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.

Full text
Abstract:
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, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
More sources

Dissertations / Theses on the topic "Processing algorithm"

1

Berry, Thomas. "Algorithm engineering : string processing." Thesis, Liverpool John Moores University, 2002. http://researchonline.ljmu.ac.uk/4973/.

Full text
Abstract:
The string matching problem has attracted a lot of interest throughout the history of computer science, and is crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms. To date, most of this work has been based on the asymptotic analysis of the algorithms. This analysis rarely tell us how the algorithm will perform in practice and considerable experimentation and fine-tuning is typically required to get the most out of a theoretical idea. In this thesis, promising string matching algorithms discovered by the theoretical community are implemented, tested and refined to the point where they can be usefully applied in practice. In the course of this work we have presented the following new algorithms. We prove that the time complexity of the new algorithms, for the average case is linear. We also compared the new algorithms with the existing algorithms by experimentation. " We implemented the existing one dimensional string matching algorithms for English texts. From the findings of the experimental results we identified the best two algorithms. We combined these two algorithms and introduce a new algorithm. " We developed a new two dimensional string matching algorithm. This algorithm uses the structure of the pattern to reduce the number of comparisons required to search for the pattern. " We described a method for efficiently storing text. Although this reduces the size of the storage space, it is not a compression method as in the literature. Our aim is to improve both space and time taken by a string matching algorithm. Our new algorithm searches for patterns in the efficiently stored text without decompressing the text. " We illustrated that by pre-processing the text we can improve the speed of the string matching algorithm when we search for a large number of patterns in a given text. " We proposed a hardware solution for searching in an efficiently stored DNA text.
APA, Harvard, Vancouver, ISO, and other styles
2

D'Souza, Sammy Raymond. "Parallelizing a nondeterministic optimization algorithm." CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3084.

Full text
Abstract:
This research explores the idea that for certain optimization problems there is a way to parallelize the algorithm such that the parallel efficiency can exceed one hundred percent. Specifically, a parallel compiler, PC, is used to apply shortcutting techniquest to a metaheuristic Ant Colony Optimization (ACO), to solve the well-known Traveling Salesman Problem (TSP) on a cluster running Message Passing Interface (MPI). The results of both serial and parallel execution are compared using test datasets from the TSPLIB.
APA, Harvard, Vancouver, ISO, and other styles
3

Samara, Rafat. "TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE." Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH. Forskningsmiljö Informationsteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-20108.

Full text
Abstract:
Top-k and Skyline queries are a long study topic in database and information retrieval communities and they are two popular operations for preference retrieval. Top-k query returns a subset of the most relevant answers instead of all answers. Efficient top-k processing retrieves the k objects that have the highest overall score. In this paper, some algorithms that are used as a technique for efficient top-k processing for different scenarios have been represented. A framework based on existing algorithms with considering based cost optimization that works for these scenarios has been presented. This framework will be used when the user can determine the user ranking function. A real life scenario has been applied on this framework step by step. Skyline query returns a set of points that are not dominated (a record x dominates another record y if x is as good as y in all attributes and strictly better in at least one attribute) by other points in the given datasets. In this paper, some algorithms that are used for evaluating the skyline query have been introduced. One of the problems in the skyline query which is called curse of dimensionality has been presented. A new strategy that based on the skyline existing algorithms, skyline frequency and the binary tree strategy which gives a good solution for this problem has been presented. This new strategy will be used when the user cannot determine the user ranking function. A real life scenario is presented which apply this strategy step by step. Finally, the advantages of the top-k query have been applied on the skyline query in order to have a quickly and efficient retrieving results.
APA, Harvard, Vancouver, ISO, and other styles
4

Nosa, Ogbewi. "Signal Processing and patternrecognition algorithm for monitoringParkinson’s disease." Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-2376.

Full text
Abstract:
This masters thesis describes the development of signal processing and patternrecognition in monitoring Parkison’s disease. It involves the development of a signalprocess algorithm and passing it into a pattern recogniton algorithm also. Thesealgorithms are used to determine , predict and make a conclusion on the study ofparkison’s disease. We get to understand the nature of how the parkinson’s disease isin humans.
APA, Harvard, Vancouver, ISO, and other styles
5

Brown, Derek William. "Systolic algorithm design for control and signal processing." Thesis, Queen's University Belfast, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337644.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Harp, J. G. "Algorithms and architectures for image processing." Thesis, University of Surrey, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Keränen, V. (Vesa). "Cryptographic algorithm benchmarking in mobile devices." Master's thesis, University of Oulu, 2014. http://urn.fi/URN:NBN:fi:oulu-201401141005.

Full text
Abstract:
The aim of this thesis was to determine the execution times of different cryptographic algorithms in one of the hardware used in Asha families and compare the execution times between HW accelerated, OpenSSL and a company proprietary cryptographic library. Moreover, the motivation was to find out if the HW accelerated cryptographic function should be used when available due to execution time. Furthermore the aim was to find out if the transition to use OpenSSL is to be preferred in terms of the execution times over the company proprietary cryptographic library. In order to give wider perspective of the cryptography the thesis introduces a brief history of the cryptography. The following cryptographic functions are discussed in the thesis: hash functions, message authentication, symmetric and asymmetric cryptographic algorithms. The cryptographic algorithms are also examined from the embedded systems point of view. In addition of that the security of the embedded systems is discussed briefly in order to introduce the context where cryptographic functions are used. The other aim and the author’s personal motivation was to learn and deepen the knowledge of cryptographic algorithms, their usage and the issues to take into consideration when working with embedded devices. The research methods were a literature review and empirical research. The results supports hypothesis that it’s not always beneficial to use HW accelerated algorithms. The results surprised partially because the expectations were that HW accelerated execution would be much faster. Further investigations should be made in order to find the root cause for the results. Most of the algorithms were faster with OpenSSL in comparison to the company proprietary library and some of the HW accelerated algorithms. The performance is better in most of the crypto operations with OpenSSL than with the company proprietary crypto library. The thesis contributes the fact that no one should assume that it is obvious that the HW accelerated crypto operations are always faster. In many cases it is not significant in terms of performance, but in those cases where the performance is the critical issue the execution times should be measured rather than assumed.
APA, Harvard, Vancouver, ISO, and other styles
8

Manfredsson, Johan. "Evaluation Tool for a Road Surface Algorithm." Thesis, Linköpings universitet, Datorseende, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138936.

Full text
Abstract:
Modern cars are often equipped with sensors like radar, infrared cameras and stereo cameras that collect information about its surroundings. By using a stereo camera, it is possible to receive information about the distance to points in front of the car. This information can be used to estimate the height of the predicted path of the car. An application which does this is the stereo based Road surface preview (RSP) algorithm. By using the output from the RSP algorithm it is possible to use active suspension control, which controls the vertical movement of the wheels relative to the chassis. This application primarily makes the driving experience more comfortable, but also extends the durability of the vehicle. The idea behind this Master’s thesis is to create an evaluation tool for the RSP algorithm, which can be used at arbitrary roads.  The thesis describes the proposed evaluation tool, where focus has been to make an accurate comparison of camera data received from the RSP algorithm and laser data used as ground truth in this thesis. Since the tool shall be used at the company proposing this thesis, focus has also been on making the tool user friendly. The report discusses the proposed methods, possible sources to errors and improvements. The evaluation tool considered in this thesis shows good results for the available test data, which made it possible to include an investigation of a possible improvement of the RSP algorithm.
APA, Harvard, Vancouver, ISO, and other styles
9

Hadimli, Kerem. "Processing Turkish Radiology Reports." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613280/index.pdf.

Full text
Abstract:
Radiology departments utilize various visualization techniques of patients&rsquo
bodies, and narrative free text reports describing the findings in these visualizations are written by medical doctors. The information within these narrative reports is required to be extracted for medical information systems. Turkish is an highly agglutinative language and this poses problems in information retrieval and extraction from Turkish free texts. In this thesis one rule-based and one data-driven alternate methods for information retrieval and structured information extraction from Turkish radiology reports are presented. Contrary to previous studies in medical NLP systems, both of these methods do not utilize any medical lexicon or ontology. Information extraction is performed on the level of extracting medically related phrases from the sentence. The aim is to measure baseline performance Turkish language can provide for medical information extraction and retrieval, in isolation of other factors.
APA, Harvard, Vancouver, ISO, and other styles
10

Rullmann, Markus, Rainer Schaffer, Sebastian Siegel, and Renate Merker. "SYMPAD - A Class Library for Processing Parallel Algorithm Specifications." Universitätsbibliothek Chemnitz, 2007. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200700971.

Full text
Abstract:
In this paper we introduce a new class library to model transformations of parallel algorithms. SYMPAD serves as a basis to develop automated tools and methods to generate efficient implementations of such algorithms. The paper gives an overview over the general structure, as well as features of the library. We further describe the fundamental design process that is controlled by our developed methods.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Processing algorithm"

1

Canada. Dept. of Fisheries and Oceans. An algorithm for bottom window echo processing. Halifax, N.S: Fisheries and Oceans, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gogniat, Guy, Dragomir Milojevic, Adam Morawiec, and Ahmet Erdogan, eds. Algorithm-Architecture Matching for Signal and Image Processing. Dordrecht: Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-90-481-9965-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tam, Hon-Wah. A practical shifted Adams algorithm. Urbana, IL (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gunn, R. C. An algorithm for the azimuth of Polaris. Mississauga, Ont: University of Toronto, Erindale Campus, Survey Science, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gunn, R. C. An algorithm for the azimuth of Polaris. Mississauga, Ont: University of Toronto, Erindale Campus, Survey Science, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

A programmer's companion to algorithm analysis. Boca Raton: Chapman & Hall/CRC, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hopkins, S. An algorithm for polygon overlay using cooperative parallel processing. Edinburgh: Regional Research Laboratory for Scotland, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Feder, Meir. Optimal multiple source location via the EM algorithm. Woods Hole, Mass: Woods Hole Oceanographic Institution, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Weinstein, Ehud. Multiple source location estimation using the EM algorithm. Woods Hole, Mass: Woods Hole Oceanographic Institution, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Feder, Meir. Multipath time-delay estimation via the EM algorithm. Woods Hole, Mass: Woods Hole Oceanographic Institution, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Processing algorithm"

1

Chang, Jyh-Yeong, Chien-Wen Cho, Su-Hwang Hsieh, and Shi-Tsung Chen. "Genetic Algorithm Based Fuzzy ID3 Algorithm." In Neural Information Processing, 989–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30499-9_153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tolimieri, Richard, Myoung An, and Chao Lu. "Field Algorithm." In Signal Processing and Digital Filtering, 125–40. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1948-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tolimieri, Richard, Myoung An, and Chao Lu. "Field Algorithm." In Signal Processing and Digital Filtering, 159–77. New York, NY: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4684-0205-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gao, Fang, Gang Cui, and Hongwei Liu. "Integration of Genetic Algorithm and Cultural Algorithms for Constrained Optimization." In Neural Information Processing, 817–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11893295_90.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fabian Garcia Nocetti, D., and Peter J. Fleming. "Parallel Algorithm Strategies." In Parallel Processing in Digital Control, 30–50. London: Springer London, 1992. http://dx.doi.org/10.1007/978-1-4471-1945-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhou, Huazheng, Xiaohu Ma, and Lina Bian. "Object Tracking Based on Mean Shift Algorithm and Kernelized Correlation Filter Algorithm." In Neural Information Processing, 54–64. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70090-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alexander, S. Thomas. "The Least Squares Lattice Algorithm." In Adaptive Signal Processing, 142–53. New York, NY: Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4612-4978-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Alexander, S. Thomas. "Applications of the LMS Algorithm." In Adaptive Signal Processing, 87–98. New York, NY: Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4612-4978-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mansouri, Deloula, and Xiaohui Yuan. "One-Bit DNA Compression Algorithm." In Neural Information Processing, 378–86. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04239-4_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Saethang, Thammakorn, Santitham Prom-on, Asawin Meechai, and Jonathan Hoyin Chan. "Sample Filtering Relief Algorithm: Robust Algorithm for Feature Selection." In Advances in Neuro-Information Processing, 260–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03040-6_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Processing algorithm"

1

van der Veen, A. J. "Weighted ACMA [array processing algorithm]." In 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258). IEEE, 1999. http://dx.doi.org/10.1109/icassp.1999.761374.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

XianMin Wei. "Clustering processing ant colony algorithm." In 2010 Second Pacific-Asia Conference on Circuits,Communications and System (PACCS). IEEE, 2010. http://dx.doi.org/10.1109/paccs.2010.5626990.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ngan, Peter, Sean Burke, Roger Cresci, Joseph N. Wilson, Paul Gader, and Dominic K. C. Ho. "Region processing algorithm for HSTAMIDS." In Defense and Security Symposium, edited by J. Thomas Broach, Russell S. Harmon, and John H. Holloway, Jr. SPIE, 2006. http://dx.doi.org/10.1117/12.666658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, In K., and Rae-Hong Park. "Block matching algorithm using a genetic algorithm." In Visual Communications and Image Processing '95, edited by Lance T. Wu. SPIE, 1995. http://dx.doi.org/10.1117/12.206690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vaidya, S., P. Waingankar, and S. S. Dubal. "Low bit rate video processing algorithm." In the International Conference & Workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1980022.1980044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shkvyrya, Y. "Algorithm of data processing in GPR." In 2010 International Kharkov Symposium on Physics and Engineering of Microwaves, Millimeter and Submillimeter Waves (MSMW). IEEE, 2010. http://dx.doi.org/10.1109/msmw.2010.5546064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bedzhev, Borislav, Zhaneta Tasheva, Borislav Stoyanov, and Rosen Bogdanov. "An Algorithm for Lossless Signal Processing." In 2005 IEEE Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IEEE, 2005. http://dx.doi.org/10.1109/idaacs.2005.283033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tivarekar, Rahulkumar P., and Hassanali G. Virani. "Species recognition using audio processing algorithm." In 2017 International Conference on Trends in Electronics and Informatics (ICOEI). IEEE, 2017. http://dx.doi.org/10.1109/icoei.2017.8300715.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Crawford, Bard S. "Algorithm animation with symbol processing robots." In the 1998 annual ACM SIGAda international conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/289524.289623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Klionskiy, Dmitry M., Dmitry I. Kaplun, Alexander M. Golubkov, and Vyacheslav V. Gulvanskiy. "Adaptive algorithm for hydroacoustic signal processing." In 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus). IEEE, 2017. http://dx.doi.org/10.1109/eiconrus.2017.7910649.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Processing algorithm"

1

Kang, G. S., and L. J. Fransen. High-Quality 800-b/s Voice Processing Algorithm. Fort Belvoir, VA: Defense Technical Information Center, February 1991. http://dx.doi.org/10.21236/ada232352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Toole, B., and S. T. Gough. DWPFASTXL: Defense Waste Processing Facility Algorithm for Source Terms for Excel. Office of Scientific and Technical Information (OSTI), November 1994. http://dx.doi.org/10.2172/565185.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Doerry, Armin Walter. Basics of Polar-Format algorithm for processing Synthetic Aperture Radar images. Office of Scientific and Technical Information (OSTI), May 2012. http://dx.doi.org/10.2172/1044949.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fedkiw, Ron. Algorithm Design for Computational Fluid Dynamics, Scientific Visualization, and Image Processing. Fort Belvoir, VA: Defense Technical Information Center, January 2007. http://dx.doi.org/10.21236/ada461529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ly, Canh. Radar Array Processing of Experimental Data Via the Scan-MUSIC Algorithm. Fort Belvoir, VA: Defense Technical Information Center, June 2004. http://dx.doi.org/10.21236/ada425842.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Peeta, Srinivas, Amit Kumar, and Sushant Sharma. Post-Processing Techniques to Enhance Reliability of Assignment Algorithm Based Performance Measures. Purdue University, 2011. http://dx.doi.org/10.5703/1288284314643.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sun, Xiaobai, and Nikos P. Pitsianis. FANTOM: Algorithm-Architecture Codesign for High-Performance Embedded Signal and Image Processing Systems. Fort Belvoir, VA: Defense Technical Information Center, May 2013. http://dx.doi.org/10.21236/ada581464.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Riseman. Intermediate Level Computer Vision Processing Algorithm Development for the Content Addressable Array Parallel Processor. Fort Belvoir, VA: Defense Technical Information Center, November 1986. http://dx.doi.org/10.21236/ada179515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Riseman, Edward. Intermediate Level Computer Vision Processing Algorithm Development for the content Addressable Array Parallel Processor. Fort Belvoir, VA: Defense Technical Information Center, November 1987. http://dx.doi.org/10.21236/ada192086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pavlicheva, E. N., V. P. Meshalkin, and N. S. CHikunov. Algorithm for processing text data for an automatic classification problem using the word2vec method. OFERNIO, February 2021. http://dx.doi.org/10.12731/ofernio.2021.24759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Processing algorithm' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography