@@ -28,7 +28,7 @@ and the Siamese Neural Networks.
2828
2929## Why ` pyvisim ` ?
3030
31- ` pyvisim ` is designed to provide a simple and efficient way to compare images.
31+ ` pyvisim ` is designed to provide a simple and efficient way to compare images.
3232
3333### Quick Start
3434
@@ -82,7 +82,7 @@ have any suggestions or questions!
82825 . ** Siamese Network (Coming Soon!)**
8383 - Train a neural network to learn a similarity function directly from pairs/triples of images.
8484 - Possible use cases include face recognition, signature verification, or any image-based identity matching.
85-
85+
8686## Installation
8787
8888To use the library, you can simply install it via pip:
@@ -96,10 +96,10 @@ or clone the repository and install it locally:
9696git clone https://github.com/MechaCritter/Python-Visual-Similarity.git
9797cd Python-Visual-Similarity
9898pip install .
99- ```
99+ ```
100100Note that the * notebooks are only available if you clone the repository.*
101101
102- All experiments in this project was made on the Oxford Flower Dataset <ref >[ 7] </ref >, for which I
102+ All experiments in this project was made on the Oxford Flower Dataset <ref >[ 7] </ref >, for which I
103103have created a custom dataset class. To use this class, import it as follows:
104104
105105``` python
@@ -109,9 +109,9 @@ For more details on the dataset, please refer to the [documentation](pyvisim/dat
109109
110110## Pretrained Models
111111
112- The following pretrained models are provided for clustering and dimensionality reduction. All clustering
113- models were trained with ` k=256 ` . The choice of ` k ` was made arbitrarily
114- based on the paper <sup >[ 5] ( #references ) </sup >, where the authors tested with ` k=32 ` , ` 64 ` , ` 128 ` , ` 256 ` , ` 512 ` , and so on.
112+ The following pretrained models are provided for clustering and dimensionality reduction. All clustering
113+ models were trained with ` k=256 ` . The choice of ` k ` was made arbitrarily
114+ based on the paper <sup >[ 5] ( #references ) </sup >, where the authors tested with ` k=32 ` , ` 64 ` , ` 128 ` , ` 256 ` , ` 512 ` , and so on.
115115Since higher values would take too long, I chose ` k=256 ` as a balance between performance and computational cost.
116116
117117### KMeans Models
@@ -153,7 +153,7 @@ You can access these weights by importing `GMMWeights` from the `pyvisim.encoder
153153
154154## Contributing
155155
156- We love contributions of all kinds—whether it’s suggesting new features, fixing bugs, or writing docs! Here’s how you
156+ We love contributions of all kinds—whether it’s suggesting new features, fixing bugs, or writing docs! Here’s how you
157157can get involved:
158158
1591591 . ** Fork** this repository.
@@ -184,17 +184,16 @@ This project is licensed under the terms of the MIT license.
184184
185185## References
186186
187- [ 1] Weixia Zhang, Jia Yan, Wenxuan Shi, Tianpeng Feng, and Dexiang Deng, "Refining Deep Convolutional Features for
187+ [ 1] Weixia Zhang, Jia Yan, Wenxuan Shi, Tianpeng Feng, and Dexiang Deng, "Refining Deep Convolutional Features for
188188Improving Fine-Grained Image Recognition," EURASIP Journal on Image and Video Processing, 2017. \
189189[ 2] Relja Arandjelović and Andrew Zisserman, 'All About VLAD', Department of Engineering Science, University of Oxford. \
190- [ 3] E. Spyromitros-Xioufis, S. Papadopoulos, I. Kompatsiaris, G. Tsoumakas, and I. Vlahavas, "An Empirical Study on the
191- Combination of SURF Features with VLAD Vectors for Image Search," Informatics and Telematics Institute, Center for Research and
190+ [ 3] E. Spyromitros-Xioufis, S. Papadopoulos, I. Kompatsiaris, G. Tsoumakas, and I. Vlahavas, "An Empirical Study on the
191+ Combination of SURF Features with VLAD Vectors for Image Search," Informatics and Telematics Institute, Center for Research and
192192Technology Hellas, Thessaloniki, Greece; Department of Informatics, Aristotle University of Thessaloniki, Greece. \
193- [ 4] Relja Arandjelović and Andrew Zisserman, "Three things everyone should know to improve object retrieval," Department of
193+ [ 4] Relja Arandjelović and Andrew Zisserman, "Three things everyone should know to improve object retrieval," Department of
194194Engineering Science, University of Oxford. \
195- [ 5] Hervé Jégou, Florent Perronnin, Matthijs Douze, Jorge Sánchez, Patrick Pérez, and Cordelia Schmid, "Aggregating Local
195+ [ 5] Hervé Jégou, Florent Perronnin, Matthijs Douze, Jorge Sánchez, Patrick Pérez, and Cordelia Schmid, "Aggregating Local
196196Image Descriptors into Compact Codes," IEEE. \
197- [ 6] Liangliang Wang and Deepu Rajan, "An Image Similarity Descriptor for Classification Tasks," J. Vis. Commun.
197+ [ 6] Liangliang Wang and Deepu Rajan, "An Image Similarity Descriptor for Classification Tasks," J. Vis. Commun.
198198Image R., vol. 71, pp. 102847, 2020. \
199199[ 7] [ Oxford Flower Dataset] ( https://www.robots.ox.ac.uk/~vgg/data/flowers/102/ ) .
200-
0 commit comments