Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An Algorithm for comparison of MPEG7 descriptor structures
Download
114865.pdf
Date
2001
Author
Özdamar, Derya Arda
Metadata
Show full item record
Item Usage Stats
67
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/12159
Collections
Graduate School of Informatics, Thesis
Suggestions
OpenMETU
Core
An algorithm for multiscale license plate detection and rule-based character segmentation
Karalı, Ali Onur; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2011)
License plate recognition (LPR) technology has great importance for the development of Intelligent Transportation Systems by automatically identifying the vehicles using image processing and pattern recognition techniques. Conventional LPR systems consist of license plate detection (LPD), character segmentation (CS) and character recognition (CR) steps. Successful detection of license plate and character locations have vital role for proper LPR. Most LPD and CS techniques in the literature assume fixed dist...
An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions
TEZCANER ÖZTÜRK, DİCLEHAN; Köksalan, Mustafa Murat (Wiley, 2019-07-29)
We develop interactive algorithms to find a strict total order for a set of discrete alternatives for two different value functions: linear and quasiconcave. The algorithms first construct a preference matrix and then find a strict total order. Based on the ordering, they select a meaningful pair of alternatives to present the decision maker (DM) for comparison. We employ methods to find all implied preferences of the DM, after he or she makes a preference. Considering all the preferences of the DM, the pre...
An Evolutionary Algorithm for Finding Efficient Solutions in Multi-Attribute Auctions
Koksalan, Murat; Karakaya, Gülşah (2014-05-01)
There is a growing interest in electronic auctions. Many researchers consider a single-attribute, although auctions are multi-attribute in nature in practice. Addressing multiple attributes increases the difficulty of the problem substantially. We develop an evolutionary algorithm (EA) for multi-attribute multi-item reverse auctions. We try to generate the whole Pareto front using the EA. We also develop heuristic procedures to find several good initial solutions and insert those in the initial population o...
An Algorithm For Plotting Computerized Hidden-Line Perspectives
Canbulat, İbrahim; Pultar, Mustafa (Middle East Technical University, Faculty of Architecture, 1976)
Within the general classes of communication media, there are those specific ones that will match well defined communication need. The architect must be assured that the alternate costs and flow times are favorable in terms of the total communication value of the medium. Architect's disciplinary communication media are established on graphical symbols such as plans, sections, elevations, perspectives etc. The communication media of computers are entirely different from those of the architects. This communica...
An Evolutionary Genetic Algorithm for Optimization of Distributed Database Queries
Sevinc, Ender; Coşar, Ahmet (2011-05-01)
High-performance low-cost PC hardware and high-speed LAN/WAN technologies make distributed database (DDB) systems an attractive research area where query optimization and DDB design are the two important and related problems. Since dynamic programming is not feasible for optimizing queries in a DDB, we propose a new genetic algorithm (GA)-based query optimizer (new genetic algorithm (NGA)) and compare its performance with random and optimal (exhaustive) algorithms. We perform experiments on a synthetic data...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
D. A. Özdamar, “An Algorithm for comparison of MPEG7 descriptor structures,” Middle East Technical University, 2001.